Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
Fast discovery of association rules
Advances in knowledge discovery and data mining
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
A condensed representation to find frequent patterns
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Mining frequent patterns with counting inference
ACM SIGKDD Explorations Newsletter - Special issue on “Scalable data mining algorithms”
Efficient discovery of error-tolerant frequent itemsets in high dimensions
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Mining generalised disjunctive association rules
Proceedings of the tenth international conference on Information and knowledge management
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries
Data Mining and Knowledge Discovery
Efficient Mining of Intertransaction Association Rules
IEEE Transactions on Knowledge and Data Engineering
Incremental mining of sequential patterns in large databases
Data & Knowledge Engineering
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
DBC: a condensed representation of frequent patterns for efficient mining
Information Systems
Essential classification rule sets
ACM Transactions on Database Systems (TODS)
Generating a Condensed Representation for Association Rules
Journal of Intelligent Information Systems
Mining condensed frequent-pattern bases
Knowledge and Information Systems
Fast and Memory Efficient Mining of Frequent Closed Itemsets
IEEE Transactions on Knowledge and Data Engineering
ACM Computing Surveys (CSUR)
Frequent closed itemset based algorithms: a thorough structural and analytical survey
ACM SIGKDD Explorations Newsletter
BLOSOM: a framework for mining arbitrary boolean expressions
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Towards multidimensional subspace skyline analysis
ACM Transactions on Database Systems (TODS)
\delta-Tolerance Closed Frequent Itemsets
ICDM '06 Proceedings of the Sixth International Conference on Data Mining
Quality Measures in Data Mining (Studies in Computational Intelligence)
Quality Measures in Data Mining (Studies in Computational Intelligence)
The Minimum Description Length Principle (Adaptive Computation and Machine Learning)
The Minimum Description Length Principle (Adaptive Computation and Machine Learning)
On compressing frequent patterns
Data & Knowledge Engineering
Extending the state-of-the-art of constraint-based pattern discovery
Data & Knowledge Engineering
Horn axiomatizations for sequential data
Theoretical Computer Science
Mining itemset utilities from transaction databases
Data & Knowledge Engineering - Special issue: ER 2003
Data Mining and Knowledge Discovery
Modeling and language support for the management of pattern-bases
Data & Knowledge Engineering
Frequent pattern mining: current status and future directions
Data Mining and Knowledge Discovery
Generalizing the notion of confidence
Knowledge and Information Systems
A Data Mining Formalization to Improve Hypergraph Minimal Transversal Computation
Fundamenta Informaticae
An efficient algorithm for mining closed inter-transaction itemsets
Data & Knowledge Engineering
Adequate condensed representations of patterns
Data Mining and Knowledge Discovery
Mining conjunctive sequential patterns
Data Mining and Knowledge Discovery
A new concise representation of frequent itemsets using generators and a positive border
Knowledge and Information Systems
Mining software repositories for software change impact analysis: a case study
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
Using disjunctions in association mining
ICDM'07 Proceedings of the 7th industrial conference on Advances in data mining: theoretical aspects and applications
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Itemset support queries using frequent itemsets and their condensed representations
DS'06 Proceedings of the 9th international conference on Discovery Science
Essential patterns: a perfect cover of frequent patterns
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Paper: Modeling by shortest data description
Automatica (Journal of IFAC)
ACM SIGKDD Explorations Newsletter
Frequent regular itemset mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
DS'10 Proceedings of the 13th international conference on Discovery science
Generalization of association rules through disjunction
Annals of Mathematics and Artificial Intelligence
Mining frequent disjunctive selection queries
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
An improved association rules mining method
Expert Systems with Applications: An International Journal
Mining disjunctive minimal generators with TitanicOR
Expert Systems with Applications: An International Journal
Scalable mining of frequent tri-concepts from folksonomies
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Information Sciences: an International Journal
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
| Hi-index | 0.01 |
Concise (or condensed) representations of frequent patterns follow the minimum description length (MDL) principle, by providing the shortest description of the whole set of frequent patterns. In this work, we introduce a new exact concise representation of frequent itemsets. This representation is based on an exploration of the disjunctive search space. The disjunctive itemsets convey information about the complementary occurrence of items in a dataset. A novel closure operator is then devised to suit the characteristics of the explored search space. The proposed operator aims at mapping many disjunctive itemsets to a unique one, called a disjunctive closed itemset. Hence, it permits to drastically reduce the number of handled itemsets within the targeted re-presentation. Interestingly, the proposed representation offers direct access to the disjunctive and negative supports of frequent itemsets while ensuring the derivation of their exact conjunctive supports. We conclude from the experimental results reported and discussed here that our representation is effective and sound in comparison with different other concise representations.