[1]BUNKE H, RIESEN K. Recent advances in graph-based pattern recognition with applications in document analysis [J]. Pattern Recognition, 2011,44(5):1057-1067.
[2]CONTE D, FOGGIA P, SANSONE C, et al.Thirty years of graph matching in pattern recognition [J]. International Journal of Pattern Recognition and artificial Intelligence, 2004,18(3):265-298.
[3]RIESEN K, BUNKE H. Graph classification and clustering based on vector space embedding [M]. Singapore: World Scientific, 2010.
[4]LUO B, WILSON R C, HANCOCK E R. A spectral approach to learning structural variations in graphs [J]. Pattern Recognition, 2006,39(6):1188-1198.
[5]LUO B, HANCOCK E R. Structural graph matching using the EM algorithm and singular value decomposition [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2001,23(10):1120-1136.
[6]TANG J, JIANG B, ZHENG A, et al.Graph matching based on spectral embedding with missing value [J]. Pattern Recognition, 2012,45(10):3768-3779.
[7]WILSON R C, HANCOCK E R, LUO B. Pattern vectors from algebraic graph theory [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005,27 (7):1112-1124.
[8]ZHENG W, ZOU L, LIAN X, et al.SQBC: an efficient subgraph matching method over large and dense graphs [J]. Information Sciences, 2014,261:116-131.
[9]RAVEAUX R, BURIE J C, OGIER J M. A graph matching method and a graph matching distance based on subgraph assignments [J]. Pattern Recognition Letters, 2010,31(5):394-406.
[10]RIESEN K, BUNKE H. Reducing the dimensionality of dissimilarity space embedding graph kernels [J]. Engineering Applications of Artificial Intelligence, 2009,22(1):48-56.
[11]BUNKE H, RIESEN K. Towards the unification of structural and statistical pattern recognition [J]. Pattern Recognition Letters, 2012,33(7):811-825.
[12]BUNKE H, RIESEN K. Improving vector space embedding of graph through feature selection algorithms [J]. Pattern Recognition, 2011,44(9):1928-1940.
[13]ZARE BORZESHI E, PICCARDI M, RIESEN K, et al.Discriminative prototype selection methods for graph embedding [J]. Pattern Recognition, 2013,46(6):1648-1657.
[14]DUIN R P W, PEKALSKA E. The dissimilarity space: bridging structural and statistical pattern recognition [J]. Pattern Recognition Letters, 2012,33(7):826-832.
[15]XIAO B, HANCOCK E R, WILSON R C. Geometric characterization and clustering of graphs using heat kernel embeddings [J]. Image and Vision Computing, 2010,28(6):1003-1021.
[16]XIAO B, HANCOCK E R, WILSON R C. A generative model for graph matching and embedding [J]. Computer Vision and Image Understanding, 2009,113(7):777-789.
[17]van der HOEVEN F, van NES A. Improving the design of urban underground space in metro stations using the space syntax methodology [J]. Tunnelling and Underground Space Technology, 2014,40:64-74.
[18]JEONG S K, BAN Y U. Computational algorithms to evaluate design solutions using space syntax [J]. Computer-Aided Design, 2011,43(6):664-676.
[19]RIESEN K, BUNKE H. IAM graph database repository for graph based pattern recognition and machine learning [M]. Structural, Syntactic, and Statistical Pattern Recognition. Berlin: Springer, 2008:287-297. |