Cluster ensembles based on vector space embeddings of graphs

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

Volumn 5519 LNCS, Issue , 2009, Pages 211-221

  Riesen, Kaspar ^a   Bunke, Horst ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

BASIC IDEA; CLUSTER ENSEMBLES; CLUSTERING PROCEDURE; CLUSTERINGS; CONSENSUS FUNCTIONS; EMBEDDINGS; GRAPH SET; INPUT GRAPHS; PROTOTYPE SELECTION; REPRESENTATION FORMALISMS; STRUCTURAL PATTERN RECOGNITION; VECTOR SPACES;

CLASSIFIERS; CLUSTERING ALGORITHMS; HYDROGEN BONDS; LEARNING SYSTEMS; PATTERN RECOGNITION; SET THEORY;

GRAPH THEORY;

EID: 70349309675     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02326-2_22     Document Type: Conference Paper

References (28)

1. Kuncheva, L., Vetrov, D.: Evaluation of stability of k-means cluster ensembles with respect to random initialization. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(11), 1798-1808 (2006)
2. Jain, A., Murty, M., Flynn, P.: Data clustering: A review. ACM Computing Surveys 31(3), 264-323 (1999)
3. Dudoit, S.: Fridlyand: Bagging to improve the accuracy of a clustering procedure. Bioinformatics 19(9), 1090-1099 (2003)
4. Fred, A., Jain, A.: Combining multiple clusterings using evidence accumulation. IEEE Trans. on Pattern Analysis and Machine Intelligence 27(6), 835-850 (2005)
5. Ayad, H., Kamel, M.: Finding natural clusters using multiclusterer combiner based on shared nearest neighbors. In: Windeatt, T., Roli, F. (eds.) MCS 2003. LNCS, vol. 2709, pp. 166-175. Springer, Heidelberg (2003)
6. Strehl, A., Gosh, J., Cardie, C.: Cluster ensembles-a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research 3, 583-617 (2002)
7. Englert, R., Glantz, R.: Towards the clustering of graphs. In: Kropatsch,W., Jolion, J. (eds.) Proc. 2nd Int. Workshop on Graph Based Representations in Pattern Recognition, pp. 125-133 (2000)
8. Bunke, H., Dickinson, P., Kraetzl, M., Wallis, W.: A Graph-Theoretic Approach to Enterprise Network Dynamics. In: Progress in Computer Science and Applied Logic (PCS), vol. 24. Birkhäuser, Basel (2007)
9. Mahé, P., Ueda, N., Akutsu, T.: Graph kernels for molecular structures - activity relationship analysis with support vector machines. Journal of Chemical Information and Modeling 45(4), 939-951 (2005)
10. Schenker, A., Bunke, H., Last, M., Kandel, A.: Graph-Theoretic Techniques for Web Content Mining. World Scientific, Singapore (2005)
11. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. Journal of Pattern Recognition and Artificial Intelligence 18(3), 265-298 (2004)
12. Schölkopf, B., Smola, A.: Learning with Kernels. MIT Press, Cambridge (2002)
13. 13. Gärtner, T.: Kernels for Structured Data. World Scientific, Singapore (2008)
14. Pekalska, E., Duin, R.: The Dissimilarity Representation for Pattern Recognition: Foundations and Applications. World Scientific, Singapore (2005)
15. Spillmann, B., Neuhaus, M., Bunke, H., Pekalska, E., Duin, R.: Transforming strings to vector spaces using prototype selection. In: Yeung, D.Y., Kwok, J., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR 2006 and SPR 2006. LNCS, vol. 4109, pp. 287-296. Springer, Heidelberg (2006)
16. Riesen, K., Bunke, H.: Graph classification based on vector space embedding. Int. Journal of Pattern Recognition and Artificial Intelligence (2008) (accepted for publication)
17. Riesen, K., Bunke, H.: Classifier ensembles for vector space embedding of graphs. In: Haindl, M., Kittler, J., Roli, F. (eds.) MCS 2007. LNCS, vol. 4472, pp. 220-230. Springer, Heidelberg (2007)
18. Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1, 245-253 (1983)
19. Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. In: Image and Vision Computing (2008) (accepted for publication)
20. Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria, L., et al. (eds.) Structural, Syntactic, and Statistical Pattern Recognition. LNCS, vol. 5342, pp. 287-297. Springer, Heidelberg (2008)
21. Nene, S., Nayar, S., Murase, H.: Columbia Object Image Library: COIL-100. Technical report, Department of Computer Science, Columbia University, New York (1996)
22. Watson, C., Wilson, C.: NIST Special Database 4, Fingerprint Database. National Institute of Standards and Technology (1992)
23. Berman, H.,Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.,Weissig, H., Shidyalov, I., Bourne, P.: The protein data bank. Nucleic Acids Research 28, 235-242 (2000)
24. Dunn, J.: Well-separated clusters and optimal fuzzy partitions. Journal of Cybernetics 4, 95-104 (1974)
25. Hubert, L., Schultz, J.: Quadratic assignment as a general data analysis strategy. British Journal of Mathematical and Statistical Psychology 29, 190-241 (1976)
26. Rand, W.: Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association 66(336), 846-850 (1971)
27. Riesen, K., Bunke, H.: Kernel k-means clustering applied to vector space embeddings of graphs. In: Prevost, L., Marinai, S., Schwenker, F. (eds.) ANNPR 2008. LNCS (LNAI), vol. 5064, pp. 24-35. Springer, Heidelberg (2008)
28. Kuncheva, L.: Combining Pattern Classifiers: Methods and Algorithms. John Wiley, Chichester (2004)