Functional dependencies in relational databases: a lattice point of view
Discrete Applied Mathematics - Special issue on combinatorial problems in databases
Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Horn approximations of empirical data
Artificial Intelligence
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing
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
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
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
Generating non-redundant association rules
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Global partial orders from sequential data
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms for association rule mining — a general survey and comparison
ACM SIGKDD Explorations Newsletter
SPADE: an efficient algorithm for mining frequent sequences
Machine Learning
Formal Concept Analysis: Mathematical Foundations
Formal Concept Analysis: Mathematical Foundations
Discovery of Frequent Episodes in Event Sequences
Data Mining and Knowledge Discovery
Mining Sequential Patterns: Generalizations and Performance Improvements
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
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
Mining Association Rules: Anti-Skew Algorithms
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
PrefixSpan: Mining Sequential Patterns by Prefix-Projected Growth
Proceedings of the 17th International Conference on Data Engineering
Structural Machine Learning with Galois Lattice and Graphs
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
On Horn Envelopes and Hypergraph Transversals
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Selecting the right interestingness measure for association patterns
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Discovering all most specific sentences
ACM Transactions on Database Systems (TODS)
Generating an informative cover for association rules
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
Mining Bases for Association Rules Using Closed Sets
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
TSP: Mining Top-K Closed Sequential Patterns
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
CloseGraph: mining closed frequent graph patterns
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Fast vertical mining using diffsets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Concept Data Analysis: Theory and Applications
Concept Data Analysis: Theory and Applications
BIDE: Efficient Mining of Frequent Closed Sequences
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
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
On horn axiomatizations for sequential data
ICDT'05 Proceedings of the 10th international conference on Database Theory
Mining conjunctive sequential patterns
Data Mining and Knowledge Discovery
Characterizing Implications of Injective Partial Orders
ICCS '07 Proceedings of the 15th international conference on Conceptual Structures: Knowledge Architectures for Smart Applications
Data & Knowledge Engineering
Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams
Mining closed patterns in relational, graph and network data
Annals of Mathematics and Artificial Intelligence
Key roles of closed sets and minimal generators in concise representations of frequent patterns
Intelligent Data Analysis
| Hi-index | 5.23 |
We propose a notion of deterministic association rules for ordered data. We prove that our proposed rules can be formally justified by a purely logical characterization, namely, a natural notion of empirical Horn approximation for ordered data which involves background Horn conditions; these ensure the consistency of the propositional theory obtained with the ordered context. The whole framework resorts to concept lattice models from Formal Concept Analysis, but adapted to ordered contexts. We also discuss a general method to mine these rules that can be easily incorporated into any algorithm for mining closed sequences, of which there are already some in the literature.