Index-adaptive Triangle-Based Graph Local Clustering
Source abstract
Abstract
Motif-based graph local clustering (MGLC) algorithms are generally designed with the two-phase framework, which gets the motif weight for each edge beforehand and then conducts the local clustering algorithm on the weighted g... | Find, read and cite all the research you need on Tech Science Press
Source: openalex_inverted_index · Quality: baseline
Research context
OpenAlex topics: Complex Network Analysis Techniques · Advanced Clustering Algorithms Research · Advanced Graph Neural Networks
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (49)
Show source-provided references
1. Complex networks: Structure and dynamics
2. Community detection in complex networks via clique conductance
3. Community structure in social and biological networks
4. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
5. Local graph partitioning using pagerank vectors
6. Isorankn: Spectral methods for global alignment of multiple protein networks10.1093/bioinformatics/btp203 ↗
7. S. Li, C. Gentile and A. Karatzoglou, “Graph clustering bandits for recommendation,” arXiv preprint, arXiv: 1605.00596, 2016.
8. Comics: A community property-based triangle motif clustering scheme10.7717/peerj-cs.180 ↗
9. Normalized cuts and image segmentation10.1109/34.868688 ↗
10. Modularity and community structure in networks
11. Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance
12. Kobourov · EuroVis (Short Papers) · 2014
13. Defining and evaluating network communities based on ground-truth10.1007/s10115-013-0693-z ↗
14. A lower bound for the smallest eigenvalue of the Laplacian
15. Ratio regions: A technique for image segmentation
16. Higher-order organization of complex networks
17. Local higher-order graph clustering
18. Collective dynamics of ‘small-world’ networks
19. The strength of weak ties revisited: Further evidence of the role of strong ties in the provision of online social support10.1177/20563051211024958 ↗
20. Application of data mining technology in financial fraud identification
21. Spatial clustering analysis of green economy based on knowledge graph
22. Smartfit: Smartphone application for garment fit detection10.3390/electronics10010097 ↗
23. A higher-order motif-based spatiotemporal graph imputation approach for transportation networks
24. Local expansion and optimization for higher-order graph clustering10.1109/JIOT.2019.2923228 ↗
25. Towards efficient motif-based graph partitioning: An adaptive sampling approach
26. A. Chhabra, M. F. Faraj and C. Schulz, “Local motif clustering via (hyper) graph partitioning,” arXiv preprint, arXiv: 2205.06176, 2022.10.1609/socs.v15i1.21779 ↗
27. Response time in man-computer conversational transactions
28. The effects of interactive latency on exploratory visual analysis
29. Snap: A general-purpose network analysis and graph-mining library
30. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments10.1080/15427951.2005.10129104 ↗
31. Cross-disciplinary detection and analysis of network motifs10.4137/BBI.S23619 ↗
32. Motifs in brain networks10.1371/journal.pbio.0020369 ↗
33. Are web users really markovian?
34. Author attribution using network motifs
35. Characterizing ego-networks using motifs10.1017/nws.2013.12 ↗
36. Efficient triangle counting in large graphs via degree-based vertex partitioning10.1080/15427951.2012.625260 ↗
37. J. Tetek, “Approximate triangle counting via sampling and fast matrix multiplication,” arXiv preprint, arXiv: 2104.08501, 2021.
38. Estimating graphlet statistics via lifting
39. Estimating edge-local triangle count heavy hitters in edge-linear time and almost-vertex-linear space
40. Local motif clustering on time-evolving graphs
41. Fennel: Streaming graph partitioning for massive scale graphs
42. The heat kernel as the pagerank of a graph10.1073/pnas.0708838104 ↗
43. Optimizing generalized pagerank methods for seed-expansion community detection
44. Efficient estimation of heat kernel pagerank for local clustering
45. Study on the normalized Laplacian of a penta-graphene with applications10.1002/qua.26154 ↗
46. The kemeny’s constant and spanning trees of hexagonal ring network10.32604/cmc.2022.031958 ↗
47. Spectral analysis of three invariants associated to random walks on rounded networks with 2n-pentagons10.1080/00207160.2021.1919303 ↗
48. Wedge sampling for computing clustering coefficients and triangle counts on large graphs10.1002/sam.11224 ↗
49. Generalized accept-reject sampling schemes