Graph classification by means of lipschitz embedding

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 39, Issue 6, 2009, Pages 1472-1483

  Riesen, K ^a   Bunke, H ^a  

^a UNIVERSITY OF BERN   (Switzerland)

Author keywords

Classification algorithms; Complexity theory; Dissimilarity representation; Distance measurement; Graph based object classification; Lipschitz embedding of graphs; Machine learning; Pattern recognition

Indexed keywords

CLASSIFICATION ALGORITHMS; COMPLEXITY THEORY; DISSIMILARITY REPRESENTATION; GRAPH-BASED OBJECT CLASSIFICATION; LIPSCHITZ EMBEDDING OF GRAPHS; MACHINE LEARNING;

COMPUTATIONAL COMPLEXITY; DISTANCE MEASUREMENT; LEARNING ALGORITHMS; OBJECT RECOGNITION; PATTERN RECOGNITION; ROBOT LEARNING;

GRAPH THEORY;

EID: 70349621824     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2009.2019264     Document Type: Article

References (49)

1. R. Duda, P. Hart, and D. Stork, Pattern Classification, 2nd ed. New York: Wiley-Interscience, 2000.
2. J. Shawe-Taylor and N. Cristianini, Kernel Methods for Pattern Analysis. Cambridge, U.K.: Cambridge Univ. Press, 2004.
3. C. Bishop, Pattern Recognition and Machine Learning. Berlin, Germany: Springer-Verlag, 2008.
4. H. Hotelling, "Analysis of a complex of statistical variables into principal components," J. Educ. Psychol., vol. 24, pp. 417-441, 1933. 498-520.
5. R. Fisher, "The statistical utilization of multiple measurements," Ann. Eugen., vol. 8, pp. 376-386, 1938.
6. D. Conte, P. Foggia, C. Sansone, and M. Vento, "Thirty years of graph matching in pattern recognition," Int. J. Pattern Recogn. Artif. Intell., vol. 18, no. 3, pp. 265-298, 2004.
7. K. Borgwardt, "Graph kernels," Ph.D. dissertation, Ludwig-Maximilians-Univ. Munich, Munich, Germany, 2007.
8. H. Bunke and G. Allermann, "Inexact graph matching for structural pattern recognition," Pattern Recognit. Lett., vol. 1, no. 4, pp. 245-253, 1983.
9. A. Sanfeliu and K. Fu, "A distance measure between attributed relational graphs for pattern recognition," IEEE Trans. Syst., Man, Cybern. B, Cybern., vol. SMCB-13, no. 3, pp. 353-363, May/Jun. 1983.
10. M. Neuhaus and H. Bunke, "Automatic learning of cost functions for graph edit distance," Inf. Sci., vol. 177, no. 1, pp. 239-247, Jan. 2007.
11. M. Neuhaus and H. Bunke, Bridging the Gap Between Graph Edit Distance and Kernel Machines. Singapore: World Scientific, 2007.
12. S. Umeyama, "An eigendecomposition approach to weighted graph matching problems," IEEE Trans. Pattern Anal. Mach. Intell., vol. 10, no. 5, pp. 695-703, Sep. 1988.
13. B. Luo, R. Wilson, and E. Hancock, "Spectral embedding of graphs," Pattern Recognit., vol. 36, no. 10, pp. 2213-2223, Oct. 2003.
14. T. Caelli and S. Kosinov, "Inexact graph matching using eigen-subspace projection clustering," Int. J. Pattern Recogn. Artif. Intell., vol. 18, no. 3, pp. 329-355, 2004.
15. R. Wilson and E. Hancock, "Levenshtein distance for graph spectral features," in Proc. 17th Int. Conf. Pattern Recog., J. Kittler, M. Petrou, and M. Nixon, Eds., 2004, vol. 2, pp. 489-492.
16. A. Robles-Kelly and E. Hancock, "Graph edit distance from spectral seriation," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 3, pp. 365-378, Mar. 2005.
17. A. Shokoufandeh, D. Macrini, S. Dickinson, K. Siddiqi, and S. Zucker, "Indexing hierarchical structures using graph spectra," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 7, pp. 1125-1140, Jul. 2005.
18. A. Robles-Kelly and E. Hancock, "A Riemannian approach to graph embedding," Pattern Recognit., vol. 40, no. 3, pp. 1024-1056, Mar. 2007.
19. E. Pekalska and R. Duin, The Dissimilarity Representation for Pattern Recognition: Foundations and Applications. Singapore: World Scientific, 2005.
20. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica, vol. 15, no. 2, pp. 215-245, Jun. 1995.
21. W. Johnson and J. Lindenstrauss, "Extensions of Lipschitz mappings into Hilbert space," Contemp. Math., vol. 26, pp. 189-206, 1984.
22. J. Bourgain, "On Lipschitz embedding of finite metric spaces in Hilbert spaces," Israel J. Math., vol. 52, no. 1/2, pp. 46-52, Mar. 1985.
23. G. Hjaltason and H. Samet, "Properties of embedding methods for similarity searching in metric spaces," IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 5, pp. 530-549, May 2003.
24. B. Spillmann, M. Neuhaus, H. Bunke, E. Pekalska, and R. Duin, "Transforming strings to vector spaces using prototype selection," in Proc. 11th Int. Workshop Structural Syntactic Pattern Recog., D.-Y. Yeung, J. Kwok, A. Fred, F. Roli, and D. de Ridder, Eds. Berlin, Germany: Springer-Verlag, 2006, vol. 4109, pp. 287-296.
25. K. Riesen and H. Bunke, "Graph classification based on vector space embedding," Int. J. Pattern Recogn. Artif. Intell., 2008. to be published.
26. A. Farago, T. Linder, and G. Lugosi, "Fast nearest-neighbor search in dissimilarity spaces," IEEE Trans. Pattern Anal. Mach. Intell., vol. 15, no. 9, pp. 957-962, Sep. 1993.
27. J. Vleugels and R. Veltkamp, "Efficient image retrieval through vantage objects," Pattern Recognit., vol. 35, no. 1, pp. 69-80, Jan. 2002.
28. K. Riesen and H. Bunke, "On Lipschitz embeddings of graphs," in Proc. 12th Int. Conf. Knowl.-Based Intell. Inf. Eng. Syst., Part I, I. Lovrek, R. Howlett, and L. Jain, Eds. Berlin, Germany: Springer-Verlag, 2008, vol. 5177, pp. 131-140.
29. R. Wagner and M. Fischer, "The string-to-string correction problem," J. Assoc. Comput. Mach., vol. 21, no. 1, pp. 168-173, Jan. 1974.
30. A. Torsello and E. Hancock, "Computing approximate tree edit distance using relaxation labeling," Pattern Recognit. Lett., vol. 24, no. 8, pp. 1089-1097, May 2003.
31. P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst. Sci. Cybern. vol. SSC-4, no. 2, pp. 100-107, Jul. 1968.
32. M. Boeres, C. Ribeiro, and I. Bloch, "A randomized heuristic for scene recognition by graph matching," in Proc. 3rd Workshop Efficient Exp. Algorithms, C. Ribeiro and S. Martins, Eds. Berlin, Germany: Springer-Verlag, 2004, vol. 3059, pp. 100-113.
33. D. Justice and A. Hero, "A binary linear programming formulation of the graph edit distance," IEEE Trans. Pattern Anal. Mach. Intell., vol. 28, no. 8, pp. 1200-1214, Aug. 2006.
34. K. Riesen and H. Bunke, "Approximate graph edit distance computation by means of bipartite graph matching," Image Vis. Comput., vol. 27, no. 7, pp. 950-959, 2009.
35. J. Munkres, "Algorithms for the assignment and transportation problems," J. Soc. Ind. Appl. Math., vol. 5, no. 1, pp. 32-38, Mar. 1957.
36. H. Kuhn, "The Hungarian method for the assignment problem," Nav. Res. Logist. Q., vol. 2, no. 1/2, pp. 83-97, 1955.
37. X. Jiang, A. Münger, and H. Bunke, "On median graphs: Properties, algorithms, and applications," IEEE Trans. Pattern Anal. Mach. Intell., vol. 23, no. 10, pp. 1144-1151, Oct. 2001.
38. G. Hristescu and M. Farach-Colton, "Cluster-preserving embedding of proteins," Rutgers Univ., Piscataway, NJ, 1999. Tech. Rep.
39. J. Kruskal and M. Wish, "Multidimensional scaling," Sage Univ., Beverly Hills, CA, 1978. Tech. Rep.
40. L. Kaufman and P. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis. New York: Wiley, 1990.
41. J. MacQueen, "Some methods for classification and analysis of multivariant observations," in Proc. 5th Berkeley Symp. Univ. California Press, 1966, vol. 1, pp. 281-297.
42. K. Riesen and H. Bunke, "IAM graph database repository for graph-based pattern recognition and machine learning," in Structural, Syntactic, and Statistical Pattern Recognition, vol. 5342, N. da Vitoria Lobo, T. Kasparis, F. Roli, J. T. Kwok, M. Georgiopoulos, G. C. Anagnostopoulos, and M. Loog, Eds. Berlin, Germany: Springer-Verlag, 2008, pp. 287-297.
43. P. Dosch and E. Valveny, "Report on the second symbol recognition contest," in Proc. 6th Int. Workshop GREC - Ten Years Review and Future Perspectives, L. Wenyin and J. Lladós, Eds. Berlin, Germany: Springer- Verlag, 2005, vol. 3926, pp. 381-397.
44. C. Watson and C. Wilson, NIST Special Database 4, Fingerprint Database, Mar. 1992, Nat. Inst. Standards Technol.
45. A. Schenker, H. Bunke, M. Last, and A. Kandel, Graph-Theoretic Techniques for Web Content Mining. Singapore: World Scientific, 2005.
46. AIDS Antiviral Screen, 2004. D. T. P. DTP. [Online]. Available: http://dtp.nci.nih.gov/docs/aids/aids_data.html
47. J. Kazius, R. McGuire, and R. Bursi, "Derivation and validation of toxicophores for mutagenicity prediction," J. Med. Chem., vol. 48, no. 1, pp. 312-320, Jan. 2005.
48. V. Vapnik, Statistical Learning Theory. New York: Wiley, 1998.
49. B. Haasdonk, "Feature space interpretation of SVMs with indefinite kernels," IEEE Trans. Pattern Anal. Mach. Intell., vol. 27, no. 4, pp. 482-492, Apr. 2005.