article

Efficient mining of association rules using closed itemset lattices

Authors:

Nicolas Pasquier,

Yves Bastide,

Rafik Taouil,

Lotfi LakhalAuthors Info & Claims

Information Systems, Volume 24, Issue 1

Pages 25 - 46

https://doi.org/10.1016/S0306-4379(99)00003-4

Published: 01 March 1999 Publication History

Abstract

No abstract available.

Cited By

View all

Bazin AGros NBertaux ANicolle C(2023)Condensed Representations of Association Rules in n-Ary RelationsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.315370935:5(4598-4607)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1109/TKDE.2022.3153709
Seiffarth FHorváth TWrobel S(2023)Maximal closed set and half-space separations in finite closure systemsTheoretical Computer Science10.1016/j.tcs.2023.114105973:COnline publication date: 21-Sep-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.114105
Sokol PAntoni ĽKrídlo OMarková EKováčová KKrajči S(2023)Formal concept analysis approach to understand digital evidence relationshipsInternational Journal of Approximate Reasoning10.1016/j.ijar.2023.108940159:COnline publication date: 26-Jul-2023
https://dl.acm.org/doi/10.1016/j.ijar.2023.108940
Show More Cited By

Index Terms

Efficient mining of association rules using closed itemset lattices
1. Information systems
  1. Information systems applications
2. Theory of computation
  1. Logic
  2. Models of computation

Recommendations

An efficient approach for mining cross-level closed itemsets and minimal association rules using closed itemset lattices

Multilevel knowledge in transactional databases plays a significant role in our real-life market basket analysis. Many researchers have mined the hierarchical association rules and thus proposed various approaches. However, some of the existing ...
Efficient Mining of Intertransaction Association Rules

Most of the previous studies on mining association rules are on mining intratransaction associations, i.e., the associations among items within the same transaction where the notion of the transaction could be the items bought by the same customer, the ...
An efficient graph-based approach to mining association rules for large databases

The task of data mining is to find the useful information within the incredible sets of data. One of important research areas of data mining is mining association rules. If we can find these relations by mining association rules, we can provide better ...

Comments

Information & Contributors

Information

Published In

Information Systems Volume 24, Issue 1

March 1999

65 pages

ISSN:0306-4379

Editors:
Matthias Jarke
RWTH Aachen, Aachen, Germany
,
Dennis Shasha
New York University, New York, NY

Issue’s Table of Contents

Publisher

Elsevier Science Ltd.

United Kingdom

Publication History

Published: 01 March 1999

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

225
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bazin AGros NBertaux ANicolle C(2023)Condensed Representations of Association Rules in n-Ary RelationsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2022.315370935:5(4598-4607)Online publication date: 1-May-2023
https://dl.acm.org/doi/10.1109/TKDE.2022.3153709
Seiffarth FHorváth TWrobel S(2023)Maximal closed set and half-space separations in finite closure systemsTheoretical Computer Science10.1016/j.tcs.2023.114105973:COnline publication date: 21-Sep-2023
https://dl.acm.org/doi/10.1016/j.tcs.2023.114105
Sokol PAntoni ĽKrídlo OMarková EKováčová KKrajči S(2023)Formal concept analysis approach to understand digital evidence relationshipsInternational Journal of Approximate Reasoning10.1016/j.ijar.2023.108940159:COnline publication date: 26-Jul-2023
https://dl.acm.org/doi/10.1016/j.ijar.2023.108940
Martin TValtchev PRoux L(2023)Mining frequent generators and closures in data streams with FGC-StreamKnowledge and Information Systems10.1007/s10115-023-01852-365:8(3295-3335)Online publication date: 3-Apr-2023
https://dl.acm.org/doi/10.1007/s10115-023-01852-3
Ferrandin MCerri R(2023)Multi-label classification via closed frequent labelsets and label taxonomiesSoft Computing - A Fusion of Foundations, Methodologies and Applications10.1007/s00500-023-08048-527:13(8627-8660)Online publication date: 14-Apr-2023
https://dl.acm.org/doi/10.1007/s00500-023-08048-5
Yang TPasquier NPrecioso F(2022)Semi-supervised consensus clustering based on closed patternsKnowledge-Based Systems10.1016/j.knosys.2021.107599235:COnline publication date: 9-Apr-2022
https://dl.acm.org/doi/10.1016/j.knosys.2021.107599
Ghosh MRoy ASil PMondal K(2022)Frequent itemset mining using FP-tree: a CLA-based approach and its extended application in biodiversity dataInnovations in Systems and Software Engineering10.1007/s11334-022-00500-319:3(283-301)Online publication date: 17-Nov-2022
https://dl.acm.org/doi/10.1007/s11334-022-00500-3
Bennai SAmroun KLoudni SOuali A(2022)An efficient heuristic approach combining maximal itemsets and area measure for compressing voluminous table constraintsThe Journal of Supercomputing10.1007/s11227-022-04667-179:1(650-676)Online publication date: 14-Jul-2022
https://dl.acm.org/doi/10.1007/s11227-022-04667-1
Lin JDjenouri YSrivastava GFournier-Viger P(2021)Mining Profitable and Concise Patterns in Large-Scale Internet of Things EnvironmentsWireless Communications & Mobile Computing10.1155/2021/66538162021Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1155/2021/6653816
Alipourchavary EErfani SLeckie CDemartini GZuccon GCulpepper JHuang ZTong H(2021)Scalable Contrast Pattern Mining over Data StreamsProceedings of the 30th ACM International Conference on Information & Knowledge Management10.1145/3459637.3482174(2842-2846)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3459637.3482174
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

Cited By

Index Terms

Recommendations

An efficient approach for mining cross-level closed itemsets and minimal association rules using closed itemset lattices

Efficient Mining of Intertransaction Association Rules

An efficient graph-based approach to mining association rules for large databases

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations