NDLI: Finding Robust Itemsets under Subsampling

Content Provider	IEEE Xplore Digital Library
Author	Tatti, N. Moerchen, F.
Copyright Year	2011
Abstract	Mining frequent patterns is plagued by the problem of pattern explosion making pattern reduction techniques a key challenge in pattern mining. In this paper we propose a novel theoretical framework for pattern reduction. We do this by measuring the robustness of a property of an item set such as closed ness or non-derivability. The robustness of a property is the probability that this property holds on random subsets of the original data. We study four properties: closed, free, non-derivable and totally shattered item sets, demonstrating how we can compute the robustness analytically without actually sampling the data. Our concept of robustness has many advantages: Unlike statistical approaches for reducing patterns, we do not assume a null hypothesis or any noise model and the patterns reported are simply a subset of all patterns with this property as opposed to approximate patterns for which the property does not really hold. If the underlying property is monotonic, then the measure is also monotonic, allowing us to efficiently mine robust item sets. We further derive a parameter-free technique for ranking item sets that can be used for top-k approaches. Our experiments demonstrate that we can successfully use the robustness measure to reduce the number of patterns and that ranking yields interesting itemsets.
Starting Page	705
Ending Page	714
File Size	281285
Page Count	10
File Format	PDF
ISBN	9781457720758
ISSN	15504786
DOI	10.1109/ICDM.2011.69
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-12-11
Publisher Place	Canada
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Itemsets Robustness Vectors Data mining TV Random variables Polynomials totally shattered itemsets pattern reduction robust itemsets closed itemsets free itemsets non-derivable itemsets
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

Finding Robust Itemsets under Subsampling

H.: Closed non-derivable itemsets (2006)

Itemsets for Real-Valued Datasets

Non-Almost-Derivable Frequent Itemsets Mining

Size of random galois lattices and number of closed frequent itemsets.

Depth-first non-derivable itemset mining (2005)

Abstract Depth-First Non-Derivable Itemset Mining

Mining Non-derivable Hypercliques

Depth-first non-derivable itemset mining (2005)

Finding Robust Itemsets under Subsampling

Similar Documents

Finding Robust Itemsets under Subsampling

H.: Closed non-derivable itemsets (2006)

Itemsets for Real-Valued Datasets

Non-Almost-Derivable Frequent Itemsets Mining

Size of random galois lattices and number of closed frequent itemsets.

Depth-first non-derivable itemset mining (2005)

Abstract Depth-First Non-Derivable Itemset Mining

Mining Non-derivable Hypercliques

Depth-first non-derivable itemset mining (2005)

Finding Robust Itemsets under Subsampling