论文信息 - A Highly Modular Architecture for Canned Pattern Selection Problem - 字舞流文

A Highly Modular Architecture for Canned Pattern Selection Problem

Verena Kantere | Maria Krommyda | Marinos Tzanikos | Maria Krommyda | Verena Kantere | Marinos Tzanikos

[1] Alfred O. Hero,et al. Graph based k-means clustering , 2012, Signal Process..

[2] Kaspar Riesen,et al. Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching , 2011, GbRPR.

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

[4] Horst Bunke,et al. A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[5] Harold W. Kuhn,et al. The Hungarian method for the assignment problem , 1955, 50 Years of Integer Programming.

[6] Amy Nicole Langville,et al. A Survey of Eigenvector Methods for Web Information Retrieval , 2005, SIAM Rev..