Mining All Non-derivable Frequent Itemsets
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Inferring Knowledge from Frequent Patterns
Soft-Ware 2002 Proceedings of the First International Conference on Computing in an Imperfect World
The Closed Keys Base of Frequent Itemsets
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Why to Apply Generalized Disjunction-Free Generators Representation of Frequent Patterns?
ISMIS '02 Proceedings of the 13th International Symposium on Foundations of Intelligent Systems
Concise Representation of Frequent Patterns Based on Generalized Disjunction-Free Generators
PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Concise Representations of Association Rules
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Dataless Transitions Between Concise Representations of Frequent Patterns
Journal of Intelligent Information Systems
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Closed set based discovery of maximal covering rules
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems - Intelligent information systems
Reducing borders of k-disjunction free representations of frequent patterns
Proceedings of the 2004 ACM symposium on Applied computing
Essential classification rule sets
ACM Transactions on Database Systems (TODS)
Fast and Memory Efficient Mining of Frequent Closed Itemsets
IEEE Transactions on Knowledge and Data Engineering
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Frequent closed itemset based algorithms: a thorough structural and analytical survey
ACM SIGKDD Explorations Newsletter
Constraining and summarizing association rules in medical data
Knowledge and Information Systems
Comparing association rules and decision trees for disease prediction
HIKM '06 Proceedings of the international workshop on Healthcare information and knowledge management
Data Mining and Knowledge Discovery
Efficient mining of understandable patterns from multivariate interval time series
Data Mining and Knowledge Discovery
Discovering Synonyms Based on Frequent Termsets
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Negative Generator Border for Effective Pattern Maintenance
ADMA '08 Proceedings of the 4th international conference on Advanced Data Mining and Applications
A new concise representation of frequent itemsets using generators and a positive border
Knowledge and Information Systems
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
Closures of Downward Closed Representations of Frequent Patterns
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Non-Derivable Item Set and Non-Derivable Literal Set Representations of Patterns Admitting Negation
DaWaK '09 Proceedings of the 11th International Conference on Data Warehousing and Knowledge Discovery
Frequency-based views to pattern collections
Discrete Applied Mathematics - Special issue: Discrete mathematics & data mining II (DM & DM II)
Discovering association rules in incomplete transactional databases
Transactions on rough sets VI
Compressed disjunction-free pattern representation versus essential pattern representation
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Evaluating association rules and decision trees to predict multiple target attributes
Intelligent Data Analysis
Extracting compact and information lossless sets of fuzzy association rules
Fuzzy Sets and Systems
Theoretical bounds on the size of condensed representations
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
An automata approach to pattern collections
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Implicit enumeration of patterns
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Prince: an algorithm for generating rule bases without closure computations
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Efficient mining of association rules based on formal concept analysis
Formal Concept Analysis
Extraction of frequent few-overlapped monotone DNF formulas with depth-first pruning
PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Transaction databases, frequent itemsets, and their condensed representations
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
| Hi-index | 0.00 |
Many data mining problems require the discover of frequent patterns in order to be solved.Frequent Itemsets are useful in the discover of association rules, episode rules, sequential patterns and clusters. The number of frequent itemsets is usually huge. Therefore, it is important to work out concise representations of frequent itemsets. In the paper, we describe three basic loassless representations of frequent patters in a uniform wayand offer a new lossless representation of frequent patterns based on disjunction-free generators. The new representation is more concisethan two of the basic representations and more efficiently computablethan the third representation. We propose an algorithm for the determining the new representation.