Mining generalised disjunctive association rules
Proceedings of the tenth international conference on Information and knowledge management
Alternative Interest Measures for Mining Associations in Databases
IEEE Transactions on Knowledge and Data Engineering
Mining for Strong Negative Associations in a Large Database of Customer Transactions
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Mining Generalized Association Rules
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Optimized Disjunctive Association Rules via Sampling
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
DBC: a condensed representation of frequent patterns for efficient mining
Information Systems
Mining with rarity: a unifying framework
ACM SIGKDD Explorations Newsletter - Special issue on learning from imbalanced datasets
Efficient mining of both positive and negative association rules
ACM Transactions on Information Systems (TOIS)
Applied Intelligence
Mining positive and negative association rules: an approach for confined rules
PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
ACM Computing Surveys (CSUR)
Interestingness measures for data mining: A survey
ACM Computing Surveys (CSUR)
Generalizing the notion of confidence
Knowledge and Information Systems
Effective elimination of redundant association rules
Data Mining and Knowledge Discovery
A Unified View of Objective Interestingness Measures
MLDM '07 Proceedings of the 5th international conference on Machine Learning and Data Mining in Pattern Recognition
Mining software repositories for software change impact analysis: a case study
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
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
Data & Knowledge Engineering
The GUHA method and its meaning for data mining
Journal of Computer and System Sciences
Using disjunctions in association mining
ICDM'07 Proceedings of the 7th industrial conference on Advances in data mining: theoretical aspects and applications
Efficient mining of dissociation rules
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Essential patterns: a perfect cover of frequent patterns
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
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.00 |
Several efforts were devoted to mining association rules having conjunction of items in premise and conclusion parts. Such rules convey information about the co-occurrence relations between items. However, other links amongst items--like complementary occurrence of items, absence of items, etc.--may occur and offer interesting knowledge to end-users. In this respect, looking for such relationship is a real challenge since not based on the conjunctive patterns. Indeed, catching such links requires obtaining semantically richer association rules, the generalized ones. These latter rules generalize classic ones to also offer disjunction and negation connectors between items, in addition to the conjunctive one. For this purpose, we propose in this paper a complete process for mining generalized association rules starting from an extraction context. Our experimental study stressing on the mining performances as well as the quantitative aspect proves the soundness of our proposal.