Interval graph mining

2Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

Abstract

Frequent subgraph mining is a difficult data mining problem aiming to find the exact set of frequent subgraphs into a database of graphs. Current subgraph mining approaches make use of the canonical encoding which is one of the key operations. It is well known that canonical encodings have an exponential time complexity. Consequently, mining all frequent patterns for large and dense graphs is computationally expensive. In this paper, we propose an interval approach to handle canonicity, leading to two encodings, lower and upper encodings, with a polynomial time complexity, allowing to tightly enclose the exact set of frequent subgraphs. These two encodings lead to an interval graph mining algorithm where two minings are launched in parallel, a lower mining (resp. upper mining) using the lower (resp. upper) encoding. The interval graph mining approach has been implemented within the state of the art Gaston miner. Experiments performed on synthetic and real graph databases coming from stock market and biological datasets show that our interval graph mining is effective on dense graphs.

References Powered by Scopus

An apriori-based algorithm for mining frequent substructures from graph data

734Citations
N/AReaders
Get full text

CloseGraph: Mining closed frequent graph patterns

518Citations
N/AReaders
Get full text

The graph isomorphism disease

360Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Weighted edge sampling for static graphs

1Citations
N/AReaders
Get full text

Mining Top-k summarization patterns for knowledge graphs

1Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Kemmar, A., Lebbah, Y., & Loudni, S. (2018). Interval graph mining. International Journal of Data Mining, Modelling and Management, 10(1), 1–22. https://doi.org/10.1504/IJDMMM.2018.089629

Readers over time

‘18‘19‘20‘21‘2200.751.52.253

Readers' Seniority

Tooltip

Lecturer / Post doc 2

40%

PhD / Post grad / Masters / Doc 2

40%

Professor / Associate Prof. 1

20%

Readers' Discipline

Tooltip

Computer Science 3

75%

Biochemistry, Genetics and Molecular Bi... 1

25%

Save time finding and organizing research with Mendeley

Sign up for free
0