NDLI: What Sperner Family Concept Class is Easy to Be Enumerated?

Content Provider	IEEE Xplore Digital Library
Author	Nakamura, A. Kudo, M.
Copyright Year	2008
Description	Author affiliation: Grad. Sch. of Inf. Sci. & Technol., Hokkaido Univ., Sapporo (Nakamura, A.; Kudo, M.)
Abstract	We study the problem of enumerating concepts in a Sperner family concept class using subconcept queries, which is a general problem including maximal frequent itemset mining as its instance. Though even the theoretically best known algorithm needs quasi-polynomial time to solve this problem in the worst case, there exist practically fast algorithms for this problem. This is because many instances of this problem in real world have low complexity in some measures. In this paper, we characterize the complexity of Sperner family concept class by the VC dimension of its intersection closure and its characteristic dimension, and analyze the worst case time complexity on the enumeration problem of its concepts in terms of the VC dimension. We also showed that the VC dimension of real data used in data mining is actually small by calculating the VC dimension of some real datasets using a new algorithm closely related to the introduced two measures, which does not only solve the problem but also let us know the VC dimension of the intersection closure of the target concept class.
Starting Page	482
Ending Page	491
File Size	308145
Page Count	10
File Format	PDF
ISBN	9780769535029
ISSN	15504786
DOI	10.1109/ICDM.2008.131
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2008-12-15
Publisher Place	Italy
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Itemsets Virtual colonoscopy Data mining Size measurement Information science Area measurement Tree graphs Frequency Relational databases Boolean functions simple hypergraph Sperner family enumeration maxumal frequent itemset
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

On transversal hypergraph enumeration in mining sequential patterns.

Integrating Frequent Itemsets Mining with Relational Database

Probabilistic frequent itemset mining in uncertain databases

Mining probabilistic frequent closed itemsets in uncertain databases

Mining Periodic-Frequent Itemsets with Approximate Periodicity Using Interval Transaction-Ids List Tree

Frequent Closed Itemset Mining with Privacy Preserving for Distributed Databases

Mining Approximate Closed Frequent Itemsets over Stream

Recent frequent itemsets mining over data streams

Visual interface for online watching of frequent itemset generation in Apriori and Eclat

What Sperner Family Concept Class is Easy to Be Enumerated?

Similar Documents

On transversal hypergraph enumeration in mining sequential patterns.

Integrating Frequent Itemsets Mining with Relational Database

Probabilistic frequent itemset mining in uncertain databases

Mining probabilistic frequent closed itemsets in uncertain databases

Mining Periodic-Frequent Itemsets with Approximate Periodicity Using Interval Transaction-Ids List Tree

Frequent Closed Itemset Mining with Privacy Preserving for Distributed Databases

Mining Approximate Closed Frequent Itemsets over Stream

Recent frequent itemsets mining over data streams

Visual interface for online watching of frequent itemset generation in Apriori and Eclat

What Sperner Family Concept Class is Easy to Be Enumerated?