PPCI algorithm for mining temporal association rules in large databases

Journal of Information and Knowledge Management

Volumn 8, Issue 4, 2009, Pages 345-352

  Pandey, Anjana ^a   Pardasani, K R ^b  

^a University Institute of Technology   (India)

^b MAULANA AZAD NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Counting inference; Exhibition period; Frequent itemset; Temporal association rule

Indexed keywords

EID: 77955278139     PISSN: 02196492     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219649209002440     Document Type: Article

References (19)

1. Ayad, AM, NM Makky and Y Taha (2001). Incremental mining of constrained association rules. Proceedings of the First SLAM Conference on Data Mining.
2. Agrawal, R and R Srikant (1994). Fast algorithms for mining association rules. 20th International Conference on Very Large Databases, Santiago, Chile.
3. Agrawal, R and R Srikant (1995). Mining generalized association rules. Proceedings of the 21st International Conference on Very Large Databases, 407-419.
4. Ale and G Rossi (2000). An approach to discovering temporal association rules. ACM Symposium on Applied Computing.
5. Bastide et al. (2000). Levelwise search of frequent patterns with counting inference. Proceedings of the SIGMOD Conference
6. Cohen, E et al. (2001). Finding interesting associations without support pruning. IEEE Transactions on Knowledge and Data Engineering, 13, 64-78.
7. Chen, X and I Petr (2000). Discovering temporal association rules: Algorithms, language and system. Proceedings of the 200 International Conference on Data Engineering.
8. Hen, J, G Dong and Y Yin (1999). Efficient mining of partial periodic pattern in time series database. Proceedings of the 15th International Conference Data Eng., 106-115.
9. Keogh, E, K Chakrabarti, S Mehrotra and M Pazzani (2001). Locally adaptive dimensionality reduction for indexing large time series databases, Proceedings of the ACM-SIGMOD Conference Management of Data.
10. Lee, C-H and M-S Chen (2003). Progressive partition miner: An efficient algorithm for mining general temporal association rules. IEEE Transactions on Knowledge and Data Engineering, 15, 1004-1017.
11. Lin, JL and MH Dunham (1998). Mining association rules: Anti-skew algorithms. Proceedings of the International Conference Data Eng., 486-493.
12. Lee, CH and CR Lin (2001). Sliding-window filtering: An efficient algorithm for incremental mining. Proceedings of the 10th ACM International Conference on Information and Knowledge Management.
13. Li, Y, P Ning, S Wang and S Jajodia (2001). Discovering calendar-based temporal association rules. Time, 111-118.
14. Pandey, A, N Bhargava and KR Pardasani (2007). Counting inference approach to discover calendarbased temporal association rules. SPIT-IEEE Colloquium, 5, 55.
15. Park, JS and MS Chen (1997). Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering, 5, 813-825.
16. Roddick, JF and M Spiliopoulou (2002). A survey of temporal knowledge discovery paradigms and methods, IEEE Transactions on Knowledge and Data Engineering, 14, 750-767.
17. Savasere, A, E Omiecinski and S Navathe (1995). An efficient algorithm for mining association rules in large databases. Proceedings of the 21st International Conference Very Large Data Bases, 432-444.
18. Tansel, AU and NF Ayan (1998). Discovery of association rules in temporal databases. Proceedings of the AAAI Knowledge Discovery in Database.
19. Villafane R, KA Hua, D Tran and B Maulik (1999). Mining interval time series. Data Warehousing and Knowledge Discovery, 318-330.