Đang chuẩn bị liên kết để tải về tài liệu:
Managing and Mining Graph Data part 27

Managing and Mining Graph Data part 27 is a comprehensive survey book in graph data analytics. It contains extensive surveys on important graph topics such as graph languages, indexing, clustering, data generation, pattern mining, classification, keyword search, pattern matching, and privacy. It also studies a number of domain-specific scenarios such as stream mining, web graphs, social networks, chemical and biological data. The chapters are written by leading researchers, and provide a broad perspective of the area. This is the first comprehensive survey book in the emerging topic of graph data processing. . | Exact and Inexact Graph Matching Methodology and Applications 2443 413 J. Lerrosa and G. ValientCi Constraint satisfaction algorithms for graph pattern matching. Mathematical Structures in Computer Science 12 4 403-422 2002. 4 4 Gi Levi. A note on the derivation of maximal common subgraphs of two dtrected ot undirected graphs. Calcolo 9 341-354 1972. 45 I .M. IiLittSi Isomorphism of gcaphc of Oounded valence can be tested in polynomial time. Journal of Computer and Systems Sciences 25 42-65 18282. 46 Bt Luo and E. Hancock. Structural grapt- matching using the EM algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence 23 10 1120 1 136 2001. 47 Bt 1.110. R. Wiliorii and iitl . Hanrook. Spectral embedding of graphs. Pattern Recognition M Q . TJ i-222 i 2003. 48 P. Mahe N. Ueda and T. AkuCsu. Gcaph kernels for molecular structures - activity releitionshlp analysis with support vector machines. Journal of Chemical Information and Modeling 45 4 939-951 2005. 499 l.J. McCucnor. Backtrack search algorithms and the maximal common tuhgraph problem. CoWare Practice and Experience 12 23-34 1982. 50 B.D. McKay. Practical graph isomorphism. Eongressus Numerantium 30 45-87 1981. 51 B.Tt Mcsimcr and Hi Bucket A decision tree approach to graph and subgraph Ssomotphssm detection. Pattern Recognition 32 1979-1998 1008. 552 At. Crlichcti. Ncusal network ilec graphs. al- contextual constructive ap-ltso i. IEEE Transactions on Neural Networks 20 3 498-511 2009. .53 J. MunkreSi Algorithms for the aertgnment and transportation problems. In Journal of the Society for Industrial and Applied Mathematics volume 5. pages 32-518 March 1957. 54 R. Myero l .Ct. Wilsot. and LiR. Hancock. Bayesian graph edit dis-iancc. IEEE Transactions on Pattern Analysis and Machine Intelligence 22 6 628-635 2000. 55 INtl. Neuhaus an H. Bunkc. Scit-organizing maps for learning the edit cocts in graph matching. IEEE Transactions on Systems Man and Cybernetics Part