On speeding up frequent approximate subgraph mining

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7441 LNCS, Issue , 2012, Pages 316-323

  Acosta Mendoza, Niusvel ^a   Gago Alonso, Andrés ^a   Medina Pagola, José E ^a  

^a ADVANCED TECHNOLOGIES APPLICATION CENTER   (Cuba)

Author keywords

approximate graph matching; Approximate graph mining; frequent approximate subgraphs; labeled graphs

Indexed keywords

APPROXIMATE GRAPH MATCHING; CANONICAL FORM; DUPLICATE DETECTION; GRAPH MINING; LABEL SPACE; LABELED GRAPHS; MINING PROCESS; SEARCH SPACES; SUBGRAPH MINING; SUBGRAPHS;

DATA MINING; IMAGE ANALYSIS;

COMPUTER VISION;

EID: 84865579636     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-33275-3_39     Document Type: Conference Paper

References (11)

1. Acosta-Mendoza, N., Gago-Alonso, A., Medina-Pagola, J.E.: Frequent Approximate Subgraphs as Features for Graph-Based Image Classification. Knowledge-Based Systems 27, 381-392 (2012)
2. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: In Proceedings of the 1994 International Conference on Very Large Data Bases (VLDB 1994), Santiago, Chile, pp. 487-499 (1994)
3. Borgelt, C.: Canonical Forms for Frequent Graph Mining. In: Proceedings of the 30th Annual Conference of the Gesellschaft für Klassifikation e.V., pp. 8-10. Universitat Berlin (2006)
4. Chen, C., Yan, X., Zhu, F., Han, J.: gApprox: Mining Frequent Approximate Patterns from a Massive Network. In: IEEE International Conference on Data Mining, ICDM 2007, pp. 445-450 (2007)
5. Holder, L.B., Cook, D.J., Bunke, H.: Fuzzy substructure discovery. In: Proceedings of the 9th International Workshop on Machine Learning, San Francisco, CA, USA, pp. 218-223 (1992)
6. Jia, Y., Zhang, J., Huan, J.: An Efficient Graph-Mining Method for Complicated and Noisy Data with Real-World Applications. Knowledge Information Systems 28(2), 423-447 (2011)
7. Jiang, C., Coenen, F., Zito, M.: A Survey of Frequent SubgraphMining Algorithms. To appear: Knowledge Engineering Review (2012)
8. Song, Y., Chen, S.: Item Sets Based Graph Mining Algorithm and Application in Genetic Regulatory Networks. In: Proceedings of the IEEE International Conference on Granular Computing, Atlanta, GA, USA, pp. 337-340 (2006)
9. Xiao, Y., Wu, W., Wang, W., He, Z.: Efficient Algorithms for Node Disjoint Subgraph Homeomorphism Determination. In: Haritsa, J.R., Kotagiri, R., Pudi, V. (eds.) DASFAA 2008. LNCS, vol. 4947, pp. 452-460. Springer, Heidelberg (2008)
10. Zhang, S., Yang, J.: RAM: Randomized Approximate Graph Mining. In: Ludäscher, B., Mamoulis, N. (eds.) SSDBM 2008. LNCS, vol. 5069, pp. 187-203. Springer, Heidelberg (2008)
11. Zou, Z., Li, J., Gao, H., Zhang, S.: Mining Frequent Subgraph Patterns from Uncertain Graph Data. IEEE Transactions on Knowledge and Data Engineering 22(9), 1203-1218 (2010)