NDLI: Exploratory mining and pruning optimizations of constrained associations rules

Content Provider	ACM Digital Library
Author	Lakshmanan, Laks V. S. Pang, Alex Ng, Raymond T. Han, Jiawei
Abstract	From the standpoint of supporting human-centered discovery of knowledge, the present-day model of mining association rules suffers from the following serious shortcomings: (i) lack of user exploration and control, (ii) lack of focus, and (iii) rigid notion of relationships. In effect, this model functions as a black-box, admitting little user interaction in between. We propose, in this paper, an architecture that opens up the black-box, and supports constraint-based, human-centered exploratory mining of associations. The foundation of this architecture is a rich set of constraint constructs, including domain, class, and SQL-style aggregate constraints, which enable users to clearly specify what associations are to be mined. We propose constrained association queries as a means of specifying the constraints to be satisfied by the antecedent and consequent of a mined association.In this paper, we mainly focus on the technical challenges in guaranteeing a level of performance that is commensurate with the selectivities of the constraints in an association query. To this end, we introduce and analyze two properties of constraints that are critical to pruning: anti-monotonicity and succinctness. We then develop characterizations of various constraints into four categories, according to these properties. Finally, we describe a mining algorithm called CAP, which achieves a maximized degree of pruning for all categories of constraints. Experimental results indicate that CAP can run much faster, in some cases as much as 80 times, than several basic algorithms. This demonstrates how important the succinctness and anti-monotonicity properties are, in delivering the performance guarantee.
Starting Page	13
Ending Page	24
Page Count	12
File Format	PDF
ISSN	01635808
DOI	10.1145/276305.276307
Journal	ACM SIGMOD Record (SGMD)
Volume Number	27
Issue Number	2
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1999-06-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Information Systems Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Exploratory mining and pruning optimizations of constrained associations rules

Exploratory mining and pruning optimizations of constrained associations rules (1998)

Exploratory Mining and Pruning Optimizations of Constrained Associations Rules (1998)

Exploratory Mining and Pruning Optimizations of Constrained Associations Rules (1998)

Exploratory mining via constrained frequent set queries

Mining interesting imperfectly sporadic rules

Communication-efficient distributed mining of association rules

Mining fuzzy association rules in databases

Abstract exploratory mining and pruning optimizations of constrained associations rules.

Exploratory mining and pruning optimizations of constrained associations rules

Similar Documents

Exploratory mining and pruning optimizations of constrained associations rules

Exploratory mining and pruning optimizations of constrained associations rules (1998)

Exploratory Mining and Pruning Optimizations of Constrained Associations Rules (1998)

Exploratory Mining and Pruning Optimizations of Constrained Associations Rules (1998)

Exploratory mining via constrained frequent set queries

Mining interesting imperfectly sporadic rules

Communication-efficient distributed mining of association rules

Mining fuzzy association rules in databases

Abstract exploratory mining and pruning optimizations of constrained associations rules.

Exploratory mining and pruning optimizations of constrained associations rules