Article

Free access

An approach to discovering temporal association rules

Authors:

Juan M. Ale,

Gustavo H. RossiAuthors Info & Claims

SAC '00: Proceedings of the 2000 ACM symposium on Applied computing - Volume 1

Pages 294 - 300

https://doi.org/10.1145/335603.335770

Published: 19 March 2000 Publication History

PDF eReader

References

[1]

Agrawal, R.-lmielinski, T.-Swami, A.: Mining Association Rules Between Sets of Items in Large Databases. Prec. ACM SIGMOD:207b216. 1993.

Digital Library

Google Scholar

[2]

Agrawal, R.-Imielinski, T.-SwamLA.: Database mining: A performance perspective. IEEE TOKDE Vol.5 N~5:914-925. Oct. 1994.

Digital Library

Google Scholar

[3]

Agrawal, R.-Mannila. H.-Srikant? R.- Toivonen, H- Verkano, I.: Fast Discovery of Association Rules. In Advances in KD and DM: 30%328. The MIT Press. 1996.

Digital Library

Google Scholar

[4]

Agrawal, R.-Srikent, R.: Fast Algorithms for Mining Association Rules. IBM Res. Rep. RJ9839, IBM Almaden. June 1994.

Google Scholar

[5]

Agrawal, R.-Srikant, R.: Fast Algorithms for Mining Association Rules. Prec. of the 20a VLDB Conference: 478-499. 1994.

Digital Library

Google Scholar

[6]

Agrawal, R.-Srikant, R.: Mining Sequential Patterns. Proc. IEEE Int'l.Cont~rence on Database Engineering: 3-14. 1995.

Digital Library

Google Scholar

[7]

Bettmi, C-Wang, X.-lajodia. S.: Testing Complex Temporal Relationships Involving Multiple Granularities and Its Application to Data Mining. Proc. of the ACM PODS'96: 68-78. 1996.

Digital Library

Google Scholar

[8]

Bettmi, C-Wang, X.-Jajoclia, S.-Lm, J.: Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences. IEEE TOKDE Vol. 10 N~ 2: 222-237. April 1998.

Digital Library

Google Scholar

[9]

Brin, S.-Motwani, R.-Ullman, l.-Tsur, S.: Dynamic Itemset Counting and Implication Rules for Market Basket Data. Proc. ACM SiGMOD: 255-264. 1997.

Digital Library

Google Scholar

[10]

Cheung, D.-Han, J.-Ng, V.-Wong, C.: Maintenance of Discovered Association Rules in Large Databases: An Incremental Updating Technique. Proc. Of 1996 {nt'l Conf. On Data Engineering. Feb. 1996.

Digital Library

Google Scholar

[11]

Chert, X.-Petrounias, l.-Heathfielci,H.: Discovering Temporal Association Rules in Temporal Databases. Proc. Int'l Workshop IADT'98. July 1998.

Google Scholar

[12]

Kimball, Ralph: The Data Warehouse Toolkit. John Wiley & Sons. 1996.

Google Scholar

[13]

Mannila, H.-Toivonen, H.-Verkamo, I: Discovering Frequent Episodes in Sequences. KDD'95. AAAI: 210-215. August 1995.

Google Scholar

[14]

Ozden, B.-Rama~swamy, S.-Silberschatz, A.: Cyclic Association Rules. ICDE 1998.

Digital Library

Google Scholar

[15]

Park, J.S.-Chen, M,S.-Yu, P.S,: An Effective Hash Based Algorithm for Mining Association Rules. Proc ACM SIGMOD: 175-186, 1995.

Digital Library

Google Scholar

[16]

Ramaswami, S.-Mahajan, S- Silberschatz, A.: On the Discovery of Interesting Patterns in Associations Rules. Proc. 240, VLDB Conf. 1998.

Digital Library

Google Scholar

[17]

Sdkant, R.-Agrawal, R.: Mining Generalized Association Rules. Proc. 21~t VLDB Conference: 407- 419. Zurich. 1995.

Digital Library

Google Scholar

[18]

S rikant, R.-Agrawal, R.: Mining Quantitative Association Rules In Large Relational Databases. Proc. ACM SIGMOD: 1-12. 1996.

Digital Library

Google Scholar

[19]

Srikant, R.-Agrawak R.: Mining Sequential Patterns: Generalization and Pertormance Improvements. In Advances in Database Technology-EDBT'96. I~ctures Notes in CS 1057. Springer. 1996.

Digital Library

Google Scholar

[20]

Tansel, A.-Ayan, N.: Discovery of Association Rules in Temporal Databases. Fourth lnt'l Conference on KDD Workshop on Distributed Data Mining. August 1998.

Google Scholar

[21]

Tansel, A. et al: Temporal Databases: Theory., Design, and Implementation. Benjammg/Cummings. 1993.

Digital Library

Google Scholar

Cited By

View all

Borra SRao R(2024)Incremental mining algorithms for generating and updating frequent patterns for dynamic databases against insert, update, and support changesInternational Journal of Data Science and Analytics10.1007/s41060-024-00619-5Online publication date: 13-Aug-2024
https://doi.org/10.1007/s41060-024-00619-5
Savaré LIeva FCorrao GLora A(2023)Capturing the variety of clinical pathways in patients with schizophrenic disorders through state sequences analysisBMC Medical Research Methodology10.1186/s12874-023-01993-723:1Online publication date: 29-Jul-2023
https://doi.org/10.1186/s12874-023-01993-7
Godoy Ada Silva A(2023)Short-term relation between air pollutants and hospitalizations for respiratory diseases: analysis by temporal association rulesEnvironmental Monitoring and Assessment10.1007/s10661-023-11471-8195:7Online publication date: 16-Jun-2023
https://doi.org/10.1007/s10661-023-11471-8
Show More Cited By

Index Terms

An approach to discovering temporal association rules

Recommendations

Discovering association rules change from large databases
AICI'11: Proceedings of the Third international conference on Artificial intelligence and computational intelligence - Volume Part I

Discovering association rules and association rules change (ARC) from existing large databases is an important problem. This paper presents an approach based on multi-hash chain structures to mine association rules change from large database with ...
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 ...
Maximal Association Rules: A Tool for Mining Associations in Text

We describe a new tool for mining association rules, which is of special value in text mining. The new tool, called maximal associations , is geared toward discovering associations that are frequently lost when using regular association rules. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SAC '00: Proceedings of the 2000 ACM symposium on Applied computing - Volume 1

March 2000

536 pages

ISBN:1581132409

DOI:10.1145/335603

Chairman:
Barrett Bryant
Univ. of Alabama—Birmingham, Birmingham
,
Editors:
Janice Carroll
Rogers State Univ.
,
Ernesto Damiani
Univ. di Milano, Crema, Italy
,
Hisham Haddad
Marshall Univ., Huntington, WV
,
Dave Oppenheim

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 19 March 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SAC00

Sponsor:

SIGAPP

SAC00: 2000 Symposium on Applied Computing

Como, Italy

Acceptance Rates

Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

Upcoming Conference

SAC '25

Sponsor:
sigapp

The 40th ACM/SIGAPP Symposium on Applied Computing

March 31 - April 4, 2025

Catania , Italy

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

135
Total Citations
View Citations
2,576
Total Downloads

Downloads (Last 12 months)199
Downloads (Last 6 weeks)24

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Borra SRao R(2024)Incremental mining algorithms for generating and updating frequent patterns for dynamic databases against insert, update, and support changesInternational Journal of Data Science and Analytics10.1007/s41060-024-00619-5Online publication date: 13-Aug-2024
https://doi.org/10.1007/s41060-024-00619-5
Savaré LIeva FCorrao GLora A(2023)Capturing the variety of clinical pathways in patients with schizophrenic disorders through state sequences analysisBMC Medical Research Methodology10.1186/s12874-023-01993-723:1Online publication date: 29-Jul-2023
https://doi.org/10.1186/s12874-023-01993-7
Godoy Ada Silva A(2023)Short-term relation between air pollutants and hospitalizations for respiratory diseases: analysis by temporal association rulesEnvironmental Monitoring and Assessment10.1007/s10661-023-11471-8195:7Online publication date: 16-Jun-2023
https://doi.org/10.1007/s10661-023-11471-8
Oliboni BDalla Vecchia AMarastoni NQuintarelli E(2023)ICARE: An Intuitive Context-Aware Recommender with ExplanationsAdvances in Smart Healthcare Paradigms and Applications10.1007/978-3-031-37306-0_4(65-86)Online publication date: 17-Aug-2023
https://doi.org/10.1007/978-3-031-37306-0_4
Chaturvedi ATiwari ASpyratos N(2022)System Network Analytics: Evolution and Stable Rules of a State Series2022 IEEE 9th International Conference on Data Science and Advanced Analytics (DSAA)10.1109/DSAA54385.2022.10032382(1-10)Online publication date: 13-Oct-2022
https://doi.org/10.1109/DSAA54385.2022.10032382
Mazarbhuiya FKichu LAlZahrani M(2022)Fuzzy Periodic Patterns from Super-Market DatasetsIntelligent and Fuzzy Systems10.1007/978-3-031-09173-5_27(208-218)Online publication date: 5-Jul-2022
https://doi.org/10.1007/978-3-031-09173-5_27
Majnarić LBabič FO’Sullivan SHolzinger A(2021)AI and Big Data in Healthcare: Towards a More Comprehensive Research Framework for MultimorbidityJournal of Clinical Medicine10.3390/jcm1004076610:4(766)Online publication date: 14-Feb-2021
https://doi.org/10.3390/jcm10040766
Gonçalves SSoares DSilva D(2021)Temporal analysis on pull request patterns: an approach with sliding windowProceedings of the 15th Brazilian Symposium on Software Components, Architectures, and Reuse10.1145/3483899.3483906(90-99)Online publication date: 27-Sep-2021
https://dl.acm.org/doi/10.1145/3483899.3483906
Hong TChang HLi STsai Y(2021)A Unified Temporal Erasable Itemset Mining Approach2021 International Conference on Technologies and Applications of Artificial Intelligence (TAAI)10.1109/TAAI54685.2021.00044(194-198)Online publication date: Nov-2021
https://doi.org/10.1109/TAAI54685.2021.00044
Hong THuang WLan GChiang MLin J(2021)A Bitmap Approach for Mining Erasable ItemsetsIEEE Access10.1109/ACCESS.2021.31005849(106029-106038)Online publication date: 2021
https://doi.org/10.1109/ACCESS.2021.3100584
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Discovering association rules change from large databases

Efficient Mining of Intertransaction Association Rules

Maximal Association Rules: A Tool for Mining Associations in Text