AutoPart: Parameter-free graph partitioning and outlier detection

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

Volumn 3202, Issue , 2004, Pages 112-124

  Chakrabarti, Deepayan ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; GROUP THEORY; INFORMATION THEORY; ROUTERS; STATISTICS;

COMPUTING DISTANCES; GRAPH PARTITIONING; GROUP STRUCTURE; K-MEANS CLUSTERING; NUMBER OF CLUSTERS; NUMBER OF PRINCIPAL COMPONENTS; OUTLIER DETECTION; REAL LIFE DATASETS;

PRINCIPAL COMPONENT ANALYSIS;

EID: 34548571606     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30116-5_13     Document Type: Article

References (16)

1. Karypis, G., Kumar, V.: Multilevel algorithms for multi-constraint graph partitioning. In: Proc. SC98. (1998) 1-13
2. Andrew Y. Ñg, Michael I., J̃ordan, Y.W.: On spectral clustering: Analysis and an algorithm. In: Proc. NIPS. (2001) 849-856
3. van Dongen, S.M.: Graph clustering by flow simulation. PhD thesis, Univesity of Utrecht (2000)
4. Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. In: Proc. Natl. Acad. Sci. USA. Volume 99. (2002)
5. Flake, G.W., Lawrence, S., Giles, C.L.: Efficient identification of Web communities. In: KDD. (2000)
6. Zhang, B., Hsu, M., Dayal, U.: K-harmonic means - a spatial clustering algorithm with boosting. In: Proc. 1st TSDM. (2000) 31-45
7. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann (2000)
8. Deerwester, S., Dumais, S.T., Furnas, G.W., Landauer, T.K., Harshman, R.: Indexing by latent semantic analysis. JASI 41 (1990) 391-407
9. Pelleg, D., Moore, A.: X-means: Extending K-means with efficient estimation of the number of clusters. In: Proc. 17th ICML. (2000) 727-734
10. Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoretic co-clustering. In: Proc. 9th KDD. (2003) 89-98
11. Mishra, N., Ron, D., Swaminathan, R.: On finding large conjunctive clusters. In: Proc. 16th COLT. (2003) 448-462
12. Reddy, P.K., Kitsuregawa, M.: An approach to relate the web communities through bipartite graphs. In: Proc. 2nd WISE. (2001) 302-310
13. Rissanen, J.: Modeling by shortest data description. Automatica 14 (1978) 465-471
14. Rissanen, J.: Universal prior for integers and estimation by minimum description length. Annals of Statistics 11 (1983) 416-431
15. Watts, D.J.: Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton Univ. Press (1999)
16. Richardson, M., Domingos, P.: Mining knowledge-sharing sites for viral marketing. In: KDD, Edmonton, Canada (2002) 61-70