Latent clustering on graphs with multiple edge types

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

Volumn 6732 LNCS, Issue , 2011, Pages 38-49

  Rocklin, Matthew ^a   Pinar, Ali ^b  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING PROBLEMS; CLUSTERINGS; MODELING POWER; PARTIAL INFORMATION; SIMILARITY METRICS; SYNTHETIC DATA; FULL INFORMATIONS;

COBALT COMPOUNDS; GRAPHIC METHODS; MATHEMATICAL MODELS; USER INTERFACES; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CLUSTERING ALGORITHMS; GRAPHIC METHODS;

EID: 79958227880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21286-4_4     Document Type: Conference Paper

References (14)

1. Blei, D.M., Ng, A.Y., Jordan, M.I.: Latent Dirichlet Allocation. Journal of Machine Learning Research 3(4-5), 993-1022 (2003), doi:10.1162/jmlr.2003.3.4- 5.993
2. Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review. E, Statistical, Nonlinear, and Soft Matter Physics 70(6 Pt. 2), 066111 (2004), http://www.ncbi.nlm.nih.gov/pubmed/15697438
3. Dhillon, I.S., Guan, Y., Kulis, B.: Weighted graph cuts without eigenvectors a multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence 29(11), 1944-1957 (2007), http://www.ncbi.nlm.nih.gov/ pubmed/17848776, doi:10.1109/TPAMI.2007.1115
4. Dunlavy, D.M., Kolda, T.G., Philip Kegelmeyer, W.: Multilinear Algebra For Analyzing Data With Multiple Linkages (2006)
5. Fienberg, S.E., Meyer, M.M., Wasserman, S.S.: Statistical Analysis of Multiple Sociometric Relations. Journal of the American Statistical Association 80(389), 51-67 (1985), http://www.jstor.org/stable/2288040
6. Lancichinetti, A., Fortunato, S.: Community detection algorithms: A comparative analysis. Physical Review E 80(5) (November 2009), http://pre.aps.org.proxy.uchicago.edu/abstract/PRE/v80/i5/e056117, doi:10.1103/PhysRevE.80.056117
7. Lange, T., Roth, V., Braun, M.L., Buhmann, J.M.: Stability-based validation of clustering solutions, neural computation. Neural Computation 16, 1299-1323 (2004)
8. Luo, X.: On coreference resolution performance metrics. In: Proc. Human Language Technology Conf. and Conf. Empirical Methods in Natural Language Processing, pp. 25-32. Association for Computational Linguistics, Vancouver (2005)
9. Meila, M.: Comparing Clusterings by the Variation of Information. Technical Report, pp. 173-187 (2003)
10. Mirkin, B.: Mathematical Classification and Clustering. Kluwer Academic Press, Dordrecht (1996)
11. Mucha, P.J., Richardson, T., Macon, K., Porter, M.A., Onnela, J.P.: Community Structure in Time-Dependent, Multiscale, and Multiplex Networks. Science 328(5980), 876-878 (2010), http://www.sciencemag.org/content/328/5980/ 876.full, doi:10.1126/science.1184819
12. Rocklin, M., Pinar, A.: Computing an aggregate edge-weight function for clustering graphs with multiple edge types. In: Kumar, R., Sivakumar, D. (eds.) WAW2010. LNCS, vol. 6516, pp. 25-35. Springer, Heidelberg (2010)
13. Stichting, C., Centrum, M., Dongen, S.V.: Performance criteria for graph clustering and markov cluster experiments. Technical Report INS-R0012, Centre for Mathematics and Computer Science (2000)
14. Strehl, A., Ghosh, J.: Cluster Ensembles A Knowledge Reuse Framework for Combining Multiple Partitions. Journal of Machine Learning Research 3(3), 583-617 (2003), http://www.crossref.org/jmlr-DOI.html, doi:10.1162/ 153244303321897735