Hierarchical, parameter-free community discovery

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

Volumn 5212 LNAI, Issue PART 2, 2008, Pages 170-187

  Papadimitriou, Spiros ^a   Sun, Jimeng ^a   Faloutsos, Christos ^b   Yu, Philip S ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; INFORMATION THEORY; LEARNING SYSTEMS; ROBOT LEARNING;

BIPARTITE GRAPHS; CLUSTER TREES; COARSE STRUCTURES; COMMUNITY DISCOVERIES; FRINGE BENEFITS; HIERARCHICAL METHODS; LARGE GRAPHS; LOCAL PATTERNS; MULTIPLE LEVELS; SUBGRAPHS; USER INTERVENTIONS;

GRAPH THEORY;

EID: 56049088564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-87481-2_12     Document Type: Conference Paper

References (30)

1. Aggarwal, C.C., Han, J., Wang, J., Yu, P.S.: A framework for projected clustering of high dimensional data streams. In: VLDB (2004)
2. Bekkerman, R., El-Yaniv, R., McCallum, A.: Multi-way distributional clustering via pairwise interactions. In: ICML (2005)
3. Berger, M.J., Oliger, J.: Adaptive mesh refinement for hyperbolic partial differential equations. J. Comp. Phys. 53 (1984)
4. Chakrabarti, D., Papadimitriou, S., Modha, D.S., Faloutsos, C.: Fully automatic cross-assocaiations. In: KDD (2004)
5. Cheng. Y., Church, G.M.: Biclustering of expression data. In: ISMB (2000)
6. Cho, H., Dhillon, I.S., Guan, Y., Sra, S.: Minimum sum squared residue coclustering of gene expression data. In: SDM (2004)
7. Cover, T.M., Thomas. J.A.: Elements of Information Theory. Wiley, Chichester (1991)
8. Dhillon, I.S., Mallela, S., Modha, D.S.: Information-theoretic co-clustering. In: KDD (2003)
9. Faloutsos. M., Faloutsos, P., Faloutsos, C.: On power-law relationships of the Internet topology. In: SIGCOMM, pp. 251-262 (1999)
10. Grünwald, P.: A tutorial introduction to the minimum description length principle. In: Advances in Min. Desc. Length: Theory and Applications. MIT Press, Cambridge (2005)
11. Guha, S., Rastogi, R., Shim, K.: CURE: an efficient clustering algorithm for large databases. In: SIGMOD (1998)
12. Han, J., Kamber, M.: Data Mining. Morgan Kaufmann, San Francisco (2000)
13. Henry, N., Fekete, J.-D.: MatrixExplorer: a dual-representation system to explore social networks. In: InfoVis (2006)
14. Holten. D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. In: InfoVis (2006)
15. Karypis, G., Han, E.-H.S., Kumar, V.: Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer 32(8) (1999)
16. Karypis, G., Kumar, V.: Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing 48(1), 96-129 (1998)
17. Keogh, E., Lonardi, S., Ratanamahatana, C.A.: Towards parameter-free data mining. In: KDD, pp. 206-215. ACM Press, New York (2004)
18. Liu, J., Wang, W., Yang, J.: A framework for ontology-driven subspace clustering. In: KDD (2004)
19. Madeira, S.C., Oliveira, A.L.: Biclustering algorithms for biological data analysis: a survey. IEEE/ACM TCBB 1, 24-45 (2004)
20. Papadimitriou, S., Gionis, A., Tsaparas, P., Väisänen, R.A., Faloutsos, C., Mannila, H.: Parameter-free spatial data mining using MDL. In: ICDM (2005)
21. Pei, J., Jiang, D., Zhang, A.: On mining cross-graph quasi-cliques. In: KDD (2005)
22. Rissanen. J., Langdon Jr.. G.G.: Arithmetic coding. IBM J. Res. 23(2) (1979)
23. Rosvall, M., Bergstrom, C.T.: An information-theoretic framework for resolving community structure in complex networks. PNAS 104(18) (2007)
24. Siebes, A., Vreeken, J., van Leeuwen, M.: Item sets that compress. In: SDM (2006)
25. Sun, J., Papadimitriou, S., Yu, P.S., Faloutsos, C.: Graphscope: Parameter-free mining of large time-evolving graphs. In: KDD (2007)
26. Sun, J., Qu. H., Chakrabarti, D., Faloutsos. C.: Relevance search and anomaly detection in bipartite graphs. SIGKDD Explorations 7 (2005)
27. Sun, J., Tao, D.. Faloutsos, C.: Beyond streams and graphs: Dynamic tensor analysis. In: KDD (2006)
28. Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD (2006)
29. Yang, Q., Lonardi, S., Melkman, A.: A compression-boosting transform for twodimensional data, In: AAIM (2006)
30. Zhang, T., Ramakrishnan, R.. Livny, M.: Birch: An efficient data clustering method for very large databases. In: SIGMOD (1996)