A new algorithm for mining frequent connected subgraphs based on adjacency matrices

Article type: Research Article

Authors: Gago-Alonso, Andrés^{a; b; *} | Puentes-Luberta, Abel^{a; c} | Carrasco-Ochoa, Jesús A.^b | Medina-Pagola, José E.^a | Martínez-Trinidad, José Fco.^b

Affiliations: [a] Advanced Technologies Application Center, Havana, Cuba | [b] Computer Science Department, National Institute of Astrophysics, Optics and Electronics, Puebla, México | [c] Faculty of Mathematics and Computer Sciences, University of Havana, Havana, Cuba

Correspondence: [*] Corresponding author: Andrés Gago-Alonso, Advanced Technologies Application Center, 7a ♯ 21812, Siboney, Playa, CP: 12200, Havana, Cuba. E-mail: [email protected].

Abstract: Most of the Frequent Connected Subgraph Mining (FCSM) algorithms have been focused on detecting duplicate candidates using canonical form (CF) tests. CF tests have high computational complexity, which affects the efficiency of graph miners. In this paper, we introduce novel properties of the canonical adjacency matrices for reducing the number of CF tests in FCSM. Based on these properties, a new algorithm for frequent connected subgraph mining called grCAM is proposed. The experiments on real world datasets show the impact of the proposed properties in FCSM. Besides, the performance of our algorithm is compared against some other reported algorithms.

Keywords: Data mining, graph mining, frequent subgraphs, labeled graphs, canonical adjacency matrices

DOI: 10.3233/IDA-2010-0427

Journal: Intelligent Data Analysis, vol. 14, no. 3, pp. 385-403, 2010