Ricochet: A family of unconstrained algorithms for graph clustering

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5463, Issue , 2009, Pages 153-167

  Wijaya, Derry Tanti ^a   Bressan, Stephane ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Clustering; Document clustering; Kmeans clustering; Star clustering; Weighted graph clustering

Indexed keywords

APRIORI; CLUSTERING; CONSTRAINED ALGORITHMS; DATA SETS; DOCUMENT CLUSTERING; GRAPH CLUSTERING; K-MEANS; KMEANS CLUSTERING; MARKOV CLUSTERING; NUMBER OF CLUSTERS; WEIGHTED GRAPH; WEIGHTED GRAPH CLUSTERING;

DATABASE SYSTEMS; GRAPH THEORY; INFORMATION RETRIEVAL;

CLUSTERING ALGORITHMS;

EID: 67650159674     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00887-0_13     Document Type: Conference Paper

References (18)

1. Batagelj, V., Mrvar, A.: Pajek datasets, http://vlado.fmf.uni-lj.si/pub/ networks/data/
2. Salton, G.: The Smart Document Retrieval Project. In: 14th Annual International ACM/SIGIR Conference on Research and Development in Information Retrieval, pp. 356-358 (1991)
3. Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 568-579. Springer, Heidelberg (2003)
4. MacQueen, J.B.: Some Methods for Classification and Analysis of Multivariate Observations. In: 5th Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, vol. 1, pp. 281-297. University of California Press (1967)
5. Aslam, J., Pelekhov, K., Rus, D.: The Star Clustering Algorithm. Journal of Graph Algorithms and Applications 8(1), 95-129 (2004)
6. Van Dongen, S.M.: Graph Clustering by Flow Simulation. In: Tekst. Proefschrift Universiteit Utrecht (2000)
7. Kaufman, L., Rousseeuw, P.: Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley and Sons, New York (1990)
8. Croft, W.B.: Clustering Large Files of Documents using the Single-link Method. Journal of the American Society for Information Science, 189-195 (1977)
9. Voorhees, E.: The Cluster Hypothesis Revisited. In: 8th SIGIR, pp. 95-104
10. Lund, C., Yannakakis, M.: On the Hardness of Approximating Minimization Problems. Journal of the ACM 41, 960-981 (1994)
11. Press, W., Flannery, B., Teukolsky, S., Vetterling, W.: Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, Cambridge (1988)
12. Wijaya, D., Bressan, S.: Journey to the centre of the star: Various ways of finding star centers in star clustering. In: Wagner, R., Revell, N., Pernul, G. (eds.) DEXA 2007. LNCS, vol. 4653, pp. 660-670. Springer, Heidelberg (2007)
13. Nieland, H.: Fast Graph Clustering Algorithm by Flow Simulation. Research and Development ERCIM News 42 (2000)
14. Karypis, G., Han, E., Kumar, V.: CHAMELEON: A Hierarchical Clustering Algorithm Using Dynamic Modeling. IEEE Computer 32(8), 68-75 (1999)
15. Zhao, Y., Karypis, G.: Hierarchical Clustering Algorithms for Document Datasets. Data Mining and Knowledge Discovery 10(2), 141-168 (2005) (Pubitemid 41217849)
16. http://www.daviddlewis.com/resources/testcollections/reuters 21578/ (visited on December 2006)
17. http://trec.nist.gov/data.html (visited on December 2006)
18. Google News, http://news.google.com.sg