Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
An effective hash-based algorithm for mining association rules
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Dynamic itemset counting and implication rules for market basket data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Beyond market baskets: generalizing association rules to correlations
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficiently mining long patterns from databases
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient mining of association rules using closed itemset lattices
Information Systems
Mining the most interesting rules
KDD '99 Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Data mining: concepts and techniques
Data mining: concepts and techniques
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules
Data Mining and Knowledge Discovery
Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set
EDBT '98 Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Sampling Large Databases for Association Rules
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Mining Bases for Association Rules Using Closed Sets
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
Computing iceberg concept lattices with TITANIC
Data & Knowledge Engineering
Formal Concept Analysis on Its Way from Mathematics to Computer Science
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Mining All Non-derivable Frequent Itemsets
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Using Condensed Representations for Interactive Association Rule Mining
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
On the Equivalence of Top-Down and Bottom-Up Data Mining in Relational Databases
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
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
Intelligent Structuring and Reducing of Association Rules with Formal Concept Analysis
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Constraint-Based Discovery and Inductive Queries: Application to Association Rule Mining
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
Efficient Data Mining Based on Formal Concept Analysis
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Real World Association Rule Mining
BNCOD 19 Proceedings of the 19th British National Conference on Databases: Advances in Databases
Using transposition for pattern discovery from microarray data
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Dataless Transitions Between Concise Representations of Frequent Patterns
Journal of Intelligent Information Systems
Off to new shores: conceptual knowledge discovery and processing
International Journal of Human-Computer Studies
Zigzag: a new algorithm for mining large inclusion dependencies in databases
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Carpenter: finding closed patterns in long biological datasets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
On support thresholds in associative classification
Proceedings of the 2004 ACM symposium on Applied computing
Advances in frequent itemset mining implementations: report on FIMI'03
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Mining Non-Redundant Association Rules
Data Mining and Knowledge Discovery
Essential classification rule sets
ACM Transactions on Database Systems (TODS)
Generating a Condensed Representation for Association Rules
Journal of Intelligent Information Systems
Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure
IEEE Transactions on Knowledge and Data Engineering
TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets
IEEE Transactions on Knowledge and Data Engineering
Computational complexity of itemset frequency satisfiability
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Relative risk and odds ratio: a data mining perspective
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast and Memory Efficient Mining of Frequent Closed Itemsets
IEEE Transactions on Knowledge and Data Engineering
A Thorough Experimental Study of Datasets for Frequent Itemsets
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
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
Matrix apriori: speeding up the search for frequent patterns
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Data Mining and Knowledge Discovery
Constraint-based concept mining and its application to microarray data analysis
Intelligent Data Analysis
Mining statistically important equivalence classes and delta-discriminative emerging patterns
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Optimization of association rule mining queries
Intelligent Data Analysis
A framework for incremental generation of closed itemsets
Discrete Applied Mathematics
Discovering shared conceptualizations in folksonomies
Web Semantics: Science, Services and Agents on the World Wide Web
Itemset frequency satisfiability: Complexity and axiomatization
Theoretical Computer Science
The Journal of Machine Learning Research
RETRACTED: Efficient mining of temporal emerging itemsets from data streams
Expert Systems with Applications: An International Journal
A new concise representation of frequent itemsets using generators and a positive border
Knowledge and Information Systems
Constructing Iceberg Lattices from Frequent Closures Using Generators
DS '08 Proceedings of the 11th International Conference on Discovery Science
Application-Independent Feature Construction from Noisy Samples
PAKDD '09 Proceedings of the 13th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Closures of Downward Closed Representations of Frequent Patterns
HAIS '09 Proceedings of the 4th International Conference on Hybrid Artificial Intelligence Systems
Minimum description length principle: generators are preferable to closed patterns
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Data & Knowledge Engineering
Efficient Vertical Mining of Frequent Closures and Generators
IDA '09 Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII
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
A Condensed Representation of Itemsets for Analyzing Their Evolution over Time
ECML PKDD '09 Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases: Part I
A new classification of datasets for frequent itemsets
Journal of Intelligent Information Systems
About the lossless reduction of the minimal generator family of a context
ICFCA'07 Proceedings of the 5th international conference on Formal concept analysis
iZi: a new toolkit for pattern mining problems
ISMIS'08 Proceedings of the 17th international conference on Foundations of intelligent systems
Feature construction based on closedness properties is not that simple
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Actionability and formal concepts: a data mining perspective
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
Succinct system of minimal generators: a thorough study, limitations and new definitions
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Generic association rule bases: are they so succinct?
CLA'06 Proceedings of the 4th international conference on Concept lattices and their applications
Non-classical logic in an intelligent assessment sub-system
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Frequent regular itemset mining
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Transactions on rough sets XII
Finding minimal rare itemsets and rare association rules
KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
Efficient reduction of the number of associations rules using fuzzy clustering on the data
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part II
Implicit enumeration of patterns
KDID'04 Proceedings of the Third international conference on Knowledge Discovery in Inductive Databases
Feature construction and δ-free sets in 0/1 samples
DS'06 Proceedings of the 9th international conference on Discovery Science
Application of association rules for finding correlations among students preliminary knowledge
CDVE'06 Proceedings of the Third international conference on Cooperative Design, Visualization, and Engineering
Efficient mining of association rules based on formal concept analysis
Formal Concept Analysis
A survey on condensed representations for frequent sets
Proceedings of the 2004 European conference on Constraint-Based Mining and Inductive Databases
Mining RDF metadata for generalized association rules
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Mining disjunctive minimal generators with TitanicOR
Expert Systems with Applications: An International Journal
Efficient mining of frequent itemsets in distorted databases
AI'06 Proceedings of the 19th Australian joint conference on Artificial Intelligence: advances in Artificial Intelligence
Why and how knowledge discovery can be useful for solving problems with CBR
ICCBR'10 Proceedings of the 18th international conference on Case-Based Reasoning Research and Development
Towards generic pattern mining
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
Transaction databases, frequent itemsets, and their condensed representations
KDID'05 Proceedings of the 4th international conference on Knowledge Discovery in Inductive Databases
Revisiting numerical pattern mining with formal concept analysis
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Sampling minimal frequent boolean (DNF) patterns
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Information Sciences: an International Journal
Constrained Cube Lattices for Multidimensional Database Mining
International Journal of Data Warehousing and Mining
Solving inverse frequent itemset mining with infrequency constraints via large-scale linear programs
ACM Transactions on Knowledge Discovery from Data (TKDD)
Mining frequent itemsets in data streams within a time horizon
Data & Knowledge Engineering
A time-efficient breadth-first level-wise lattice-traversal algorithm to discover rare itemsets
Data Mining and Knowledge Discovery
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
| Hi-index | 0.00 |