Graph clustering with network structure indices

ACM International Conference Proceeding Series

Volumn 227, Issue , 2007, Pages 783-790

  Rattigan, Matthew J ^a   Maier, Marc ^a   Jensen, David ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATIONAL COMPLEXITY; INDEXING (OF INFORMATION); UBIQUITOUS COMPUTING;

GIRVAN-NEWMAN METHOD; NETWORK STRUCTURE; RELATIONAL DATA SETS;

GRAPH THEORY;

EID: 34547964013     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1273496.1273595     Document Type: Conference Paper

References (20)

1. Brandes, U., Gaertler, M., & Wagner, D. (2003). Experiments on graph clustering algorithms. Proceedings of the 11th Annual European Symposium on Algorithms (ESA03), 2832, 568-579.
2. Coppersmith, D., & Winograd, S. (1987). Matrix multiplication via arithmetic progressions. Proceedings of the Nineteenth Annual ACM Conference on Theory of Computing, 1-6.
3. Delling, D., Gaertler, M., & Wagner, D. (2006). Generating significant graph clusterings. Proceedings of the European Conference of Complex Systems ECCS '06.
4. Dhillon, I., Guan, Y., &: Kulis, B. (2004). Kernel k-means: spectral clustering and normalized cuts. Proceedings of the 2004 A CM SIGKDD international conference on Knowledge discovery and data mining, 551-556.
5. Flake, G., Tarjan, R., & Tsioutsiouliklis, K. (2004). Graph clustering and minimum cut trees. Internet Mathematics, 1, 385-408.
6. Freeman, L. (1979). Centrality in social networks. Social Networks, 1, 215-239.
7. Girvan, M., & Newman, M. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99, 7821-7826.
8. Handcock, M., Raftery, A., & Tantrum, J. (2005). Model-based clustering for social networks (Technical Report). Working Paper 46, Center for Statistics and the Social Sciences, University of Washington.
9. Hlaoui, A., &: Shengrui, W. (2004). A direct approach to graph clustering. Proceedings of the 2nd IASTED International Conference on Neural Networks and Computational Intelligence, NCI 2004, Grindelwald, Switzerland.
10. Huang, X., & Lai, W. (2006). Clustering graphs for visualization via node similarities. Journal of Visual Languages and Computing, 17, 225-253.
11. Kaufman, L., & Rousseeuw, P. (1990). Finding groups in data, an introduction to cluster analysis. Wiley Series in Probability and Mathematical Statistics. Applied Probability and Statistics, New York: Wiley, 1990.
12. King, A. (2004). Graph Clustering with Restricted Neighbourhood Search. Master's thesis, University of Toronto.
13. MacQueen, J. (1967). Some methods for classification and analysis of multivariate observations. Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1, 281-297.
14. McCallum, A., Nigam, K., Rennie, J., & Seymore, K. (1999). A machine learning approach to building domain-specific search engines. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, 662-667.
15. Newman, M. (2004a). Detecting community structure in networks. The European Physical Journal B-Condensed Matter, 38, 321-330.
16. Newman, M. (2004b). Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69.
17. Ng, A., Jordan, M., & Weiss, Y. On spectral clustering: Analysis and an algorithm.
18. Rand, W. (1971). Objective Criteria for the Evaluation of Clustering Methods. Journal of the American Statistical Association, 66, 846-850.
19. Rattigan, M., Maier, M., & Jensen, D. (2006). Using structure indices for efficient approximation of network properties. Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 357-366.
20. Schenker, A., Last, M., Bunke, H., & Kandel, A. (2003). Graph representations for web document clustering. Proc. 1st Iberian Conf. on Pattern Recognition and Image Analysis.