Median Graph Computation by Means of Graph Embedding into Vector Spaces

[1]  Ernest Valveny,et al.  Graph embedding in vector spaces by node attribute statistics , 2012, Pattern Recognit..

[2]  Edwin R. Hancock,et al.  Graph Characterization via Ihara Coefficients , 2011, IEEE Transactions on Neural Networks.

[3]  Salvatore Tabbone,et al.  Graph Embedding Using Constant Shift Embedding , 2010, ICPR Contests.

[4]  Kaspar Riesen,et al.  Graph Classification and Clustering Based on Vector Space Embedding , 2010, Series in Machine Perception and Artificial Intelligence.

[5]  Ernest Valveny,et al.  Generalized median graph computation by means of graph embedding in vector spaces , 2010, Pattern Recognit..

[6]  Ernest Valveny,et al.  Graph-Based k-Means Clustering: A Comparison of the Set Median versus the Generalized Median Graph , 2009, CAIP.

[7]  Kaspar Riesen,et al.  Approximate graph edit distance computation by means of bipartite graph matching , 2009, Image Vis. Comput..

[8]  Kaspar Riesen,et al.  IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning , 2008, SSPR/SPR.

[9]  Kaspar Riesen,et al.  Kernel k-Means Clustering Applied to Vector Space Embeddings of Graphs , 2008, ANNPR.

[10]  Miquel Ferrer Sumsi.  Theory and Algorithms on the Median Graph: application to Graph-Based Classification and Clustering , 2008 .

[11]  Kaspar Riesen,et al.  Graph Embedding in Vector Spaces by Means of Prototype Selection , 2007, GbRPR.

[12]  Edwin R. Hancock,et al.  A Riemannian approach to graph embedding , 2007, Pattern Recognit..

[13]  M. Fatih Demirci,et al.  Object Recognition as Many-to-Many Feature Matching , 2006, International Journal of Computer Vision.

[14]  Richard C. Wilson,et al.  Mixing spectral representations of graphs , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[15]  Kaspar Riesen,et al.  Fast Suboptimal Algorithms for the Computation of Graph Edit Distance , 2006, SSPR/SPR.

[16]  Alfred O. Hero,et al.  A binary linear programming formulation of the graph edit distance , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[17]  Robert P. W. Duin,et al.  Prototype selection for dissimilarity-based classifiers , 2006, Pattern Recognit..

[18]  R. Duin,et al.  The Dissimilarity Representation for Pattern Recognition - Foundations and Applications , 2005, Series in Machine Perception and Artificial Intelligence.

[19]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[20]  Ali Shokoufandeh,et al.  Indexing hierarchical structures using graph spectra , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[21]  Richard C. Wilson,et al.  Pattern vectors from algebraic graph theory , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Alberto Sanfeliu,et al.  Synthesis of Median Spectral Graph , 2005, IbPRIA.

[23]  Abraham Kandel,et al.  Graph-Theoretic Techniques for Web Content Mining , 2005, Series in Machine Perception and Artificial Intelligence.

[24]  Horst Bunke,et al.  An Error-Tolerant Approximate Matching Algorithm for Attributed Planar Graphs and Its Application to Fingerprint Classification , 2004, SSPR/SPR.

[25]  Trevor Darrell,et al.  Fast contour matching using approximate earth mover's distance , 2004, Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2004. CVPR 2004..

[26]  Terry Caelli,et al.  Inexact Graph Matching Using Eigen-Subspace Projection Clustering , 2004, Int. J. Pattern Recognit. Artif. Intell..

[27]  Mario Vento,et al.  Thirty Years Of Graph Matching In Pattern Recognition , 2004, Int. J. Pattern Recognit. Artif. Intell..

[28]  Edwin R. Hancock,et al.  Spectral embedding of graphs , 2003, Pattern Recognit..

[29]  Horst Bunke,et al.  Weighted Mean of a Pair of Graphs , 2001, Computing.

[30]  Piotr Indyk,et al.  Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[31]  Horst Bunke,et al.  On Median Graphs: Properties, Algorithms, and Applications , 2001, IEEE Trans. Pattern Anal. Mach. Intell..

[32]  Luc De Raedt,et al.  Feature Construction with Version Spaces for Biochemical Applications , 2001, ICML.

[33]  Francisco Casacuberta,et al.  Topology of Strings: Median String is NP-Complete , 1999, Theor. Comput. Sci..

[34]  M. Shirosaki.  Another proof of the defect relation for moving targets , 1991 .

[35]  Chandrajit L. Bajaj,et al.  The algebraic degree of geometric optimization problems , 1988, Discret. Comput. Geom..

[36]  Horst Bunke,et al.  Inexact graph matching for structural pattern recognition , 1983, Pattern Recognit. Lett..

[37]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[38]  Francesc d'ASSIS Serratosa Casanelles,et al.  Theory and algorithms on the median graph , 2009 .

[39]  Shengrui Wang,et al.  Median graph computation for graph clustering , 2006, Soft Comput..

[40]  R. Mooney,et al.  Impact of Similarity Measures on Web-page Clustering , 2000 .

[41]  Ludvik Gyrgyek,et al.  Introduction to Pattern Recognition , 1988 .

[42]  J. Dunn.  Well-Separated Clusters and Optimal Fuzzy Partitions , 1974 .

[43]  David G. Stork,et al.  Pattern Classification , 1973 .