Author： Desrosiers Christian
Publisher： Springer Publishing Company
ISSN： 1384-5810
Source： Data Mining and Knowledge Discovery, Vol.23, Iss.1, 2011-07, pp. : 63-90
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this paper, we present a general framework to mine patterns with antimonotone constraints. This framework uses a technique that structures the pattern space in a way that facilitates the integration of constraints within the mining process. Furthermore, we also introduce a powerful strategy that uses background information on the data to speed-up the mining process. We illustrate our approach on a popular structured data mining problem, the frequent subgraph mining problem, and show, through experiments on synthetic and real-life data, that this general approach has advantages over state-of-the-art pattern mining algorithms.
Related content
Access to resources
Recommend
PAL: A Pattern-Based First-Order Inductive System
By Morales E.F.
Machine Learning, Vol. 26, Iss. 2-3, 1997-02 ,pp. :