NDLI: Finding Rare Patterns with Weak Correlation Constraint

Content Provider	IEEE Xplore Digital Library
Author	Okubo, Y. Haraguchi, M. Nakajima, T.
Copyright Year	2010
Abstract	This paper proposes a notion of indicative concepts in a transaction database, presents a branch-and-bound optimization algorithm to find a top-N indicative concepts in a space of many local minimum solutions. An indicative concept consists of several general items as primitive events, but has a very small degree of correlation in spite of the generality of component items. We regard those indicative concepts as rare patterns. As there exist trivial patterns of general items with no instances, we introduce an objective function for taking into account both the generality of component items and the number of instances as evidences, and solve the problem of finding out indicative concepts under the constraint that the degree of correlation must not exceed a given upper bound. Some experimental results are presented and analyzed from the viewpoint of correlation change discovery.
Starting Page	822
Ending Page	829
File Size	299648
Page Count	8
File Format	PDF
ISBN	9781424492442
DOI	10.1109/ICDMW.2010.78
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2010-12-13
Publisher Place	Australia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Context Correlation Upper bound Itemsets generality rare pattern correlation Lattices indicative pattern Generators
Content Type	Text
Resource Type	Article

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

Mining Interesting Rare Items with Maximum Constraint Model Based on Tree Structure

Mining Association Rules Restricted on Constraint

Efficient Algorithms for Mining Frequent Itemsets with Constraint

On a visual frequent itemset mining

Upper bound on pattern correlation of lossy N-port antennas in terms of modal efficiencies

An Algebraic Approach to Ensemble Clustering

Direct Discovery of High Utility Itemsets without Candidate Generation

Finding Correlated Item Pairs through Efficient Pruning with a Given Threshold

Frequent Pattern Discovery with Memory Constraint ABSTRACT

Finding Rare Patterns with Weak Correlation Constraint

Similar Documents

Mining Interesting Rare Items with Maximum Constraint Model Based on Tree Structure

Mining Association Rules Restricted on Constraint

Efficient Algorithms for Mining Frequent Itemsets with Constraint

On a visual frequent itemset mining

Upper bound on pattern correlation of lossy N-port antennas in terms of modal efficiencies

An Algebraic Approach to Ensemble Clustering

Direct Discovery of High Utility Itemsets without Candidate Generation

Finding Correlated Item Pairs through Efficient Pruning with a Given Threshold

Frequent Pattern Discovery with Memory Constraint ABSTRACT

Finding Rare Patterns with Weak Correlation Constraint