Mining frequent correlated graphs with a new measure, journal of expert systems with applications

Md Samiullah, Chowdhury Farhan Ahmed, Anna Fariha, MD Rafiqul Islam, Nicolas Lachiche

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Correlation mining is recognized as one of the most important data mining tasks for its capability to identify underlying dependencies between objects. On the other hand, graph-based data mining techniques are increasingly applied to handle large datasets due to their capability of modeling various non-traditional domains representing real-life complex scenarios such as social/computer networks, map/spatial databases, chemical-informatics domain, bio-informatics, image processing and machine learning. To extract useful knowledge from large amount of spurious patterns, correlation measures are used. Nonetheless, existing graph based correlation mining approaches are unable to capture effective correlations in graph databases. Hence, we have concentrated on graph correlation mining and proposed a new graph correlation measure, gConfidence, to discover more useful graph patterns. Moreover, we have developed an efficient algorithm, CGM (Correlated Graph Mining), to find the correlated graphs in graph databases. The performance of our scheme was extensively analyzed in several real-life and synthetic databases based on runtime and memory consumption, then compared with existing graph correlation mining algorithms, which proved that CGM is scalable with respect to required processing time and memory consumption and outperforms existing approaches by a factor of two in speed of mining correlations.

Original languageEnglish
Pages (from-to)1847-1863
Number of pages17
JournalExpert Systems with Applications
Volume41
Issue number4
DOIs
Publication statusPublished - Mar 2014

Fingerprint Dive into the research topics of 'Mining frequent correlated graphs with a new measure, journal of expert systems with applications'. Together they form a unique fingerprint.

Cite this