Fast discovery of connection subgraphs
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Clustering via matrix powering
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph mining: Laws, generators, and algorithms
ACM Computing Surveys (CSUR)
Stochastic local clustering for massive graphs
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
Local clustering of large graphs by approximate fiedler vectors
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Topic mining based on graph local clustering
MICAI'11 Proceedings of the 10th international conference on Artificial Intelligence: advances in Soft Computing - Volume Part II
Computer Science Review
| Hi-index | 0.00 |
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two models of the Web Graph. Information on web clusters can be employed both to validate generation modelsand to study the properties of the graph. Clusters can also be used in semantics-based grouping of websites or pages e.g. for indexing and browsing.