A scalable vertical model for mining association rules

Journal of Information and Knowledge Management

Volumn 3, Issue 4, 2004, Pages 317-329

  Rahal, Imad ^a   Ren, Dongmei ^a   Perrizo, William ^a  

^a NORTH DAKOTA STATE UNIVERSITY   (United States)

Author keywords

apriori; Association rule mining; frequent itemset mining; P trees; set enumeration trees

Indexed keywords

EID: 49549091274     PISSN: 02196492     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219649204000912     Document Type: Article

References (26)

1. Agrawal, R, T Imielinski and A Swami (1993). Mining association rules between sets of items in large databases. In Proc. ACM Inter. Conf. Management of Data (SIGMOD), P Buneman and S Jajodia (eds.)), pp. 207-216. ACM Press.
2. Agrawal, R and R Srikant (1994). Fast algorithms for mining association rules. In Proc. 20th Inter. Conf. Very Large Databases (VLDB), JB Bocca, M Jarke and C Zaniolo (eds.)), pp. 487-499. Santiago: Morgan Kaufmann.
3. Batory, DS (1979). On searching transposed files. ACM Transactions on Database Systems (TODS), 4(4), 531-544.
4. Borgelt, C (2003). Efficient implementations of Apriori and Eclat. In Proc. IEEE ICDM 1st Inter. Workshop Frequent Item Set Mining Implementations (FIMI), B Goethals and M Zaki (eds.)), http://sunsite.informatik.rwth-aachen.de/ Publications/CEUR-WS//Vol-90/ [6 June 2004]. CEUR Workshop Proceedings.
5. Copeland, GP and S Khoshafian (1985). A decomposition storage model. In Proc. ACM Inter. Conf. Management of Data (SIGMOD), SB Navathe (ed.)), pp. 268-279. ACM Press.
6. Ding, Q, M Khan, A Roy and W Perrizo (2002). The p-tree algebra. In Proc. 17th ACM Symposium Applied Computing SAC. B. Panda (ed.)), pp. 413-417. ACM 2002.
7. Ding, Q and W Perrizo (2002). Association rule mining on remotely sensed images using P-trees. In Proc. 6th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD), MS Cheng, PS Yu and B Liu (eds.)), pp. 66-79. Springer-Verlag.
8. Frequent Itemset Mining Implementations Repository (2003). http://fimi.cs.helsinki.fi [1 June 2004].
9. Glover, F (1994). Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Applied Mathematics, 49(1-3), 231-255.
10. Goethals, B (2004). Memory issues in frequent itemset mining. In Proc. ACM 19th Symposium on Applied Computing SAC, H Haddad, A Omicini, RL Wainwright and LM Liebrock (eds.)), pp. 530-534. ACM 2004.
11. Goethals, B (2003). http://www.cs.helsinki.fi/u/goethals[2 March 2004].
12. Geurts, K, G Wets, T Brijs and K Vanhoof (2003). Profiling high frequency accident locations using association rules. In Proc 82nd Annual Meeting of the Transportation Research Board. Washington DC.
13. Han, J, J Pei and Y Yin (2000). Mining frequent patterns without candidate generation. In Proc. ACM Inter. Conf. Management of Data (SIGMOD), W Chen,JF Naughton and PA Bernstein (eds.)), pp. 1-12. ACM 2000
14. ACM 2000. IBM Quest synthetic data generator. http://www. almaden.ibm.com/software/quest/resources/datasets/syndata.html [7 April 2004].
15. Kosters, WA and W Pijls (2003). APRIORI, a depth first implementation. In Proc. IEEE ICDM 1st Inter. Workshop Frequent Item Set Mining Implementations (FIMI), B Goethals and M Zaki (eds.)), http://sunsite.informatik.rwth-aachen.de/ Publications/CEUR-WS//Vol-90/ [6 June 2004].CEUR Workshop Proceedings.
16. Law, A and W Kelton (2000). Simulation Modeling and Analysis. Singapore: McGraw-Hill.
17. Morrison, DR (1968). Practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM (JACM), 15(4), 514-534.
18. Perrizo, W (2001). Peano count tree technology lab notes. Technical Report NDSU-CS-TR-01, http://www.cs.ndsu.nodak.edu/?perrizo/classes/785/pct.html [18 January 2003].
19. Pietracaprina, A and D Zandolin (2003). Mining frequent itemsets using patricia tries. In Proc. IEEE ICDM 1st Inter. Workshop Frequent Item Set Mining Implementations (FIMI), B Goethals and M Zaki (eds.)), http://sunsite. informatik.rwthaachen.de/Publications/CEUR-WS//Vol-90/ [6 June 2004]. CEUR Workshop Proceedings.
20. Raymon, R (1993). An SE-tree based characterization of the induction problem. In Proc. 10th Inter. Conf. on Machine Learning (ICML). pp. 268-275. Morgan Kaufmann.
21. Rahal, I and W Perrizo (2004). An optimized approach for KNN text categorization using P-trees. In Proc.ACM 19th Symposium on Applied Computing (SAC), H Haddad, A Omicini, RL Wainwright and LM Liebrock (eds.)), pp. 613-617. ACM 2004.
22. Serazi, M, A Perera, Q Ding, V Malakhov, I Rahal, F Pan, D Ren, W Wu and W Perrizo (2004). DataMIMETM. In Proc. ACM Inter. Conf. Management of Data (SIGMOD), G Weikum, AC Konig and S Deloch (eds.)), pp. 923-924. ACM 2004.
23. Shenoy, P, JR Haristsa, S Sudatsham, G Bhalotia, M Baqa and D Shah (2000). Turbo-charging vertical mining of large databases. In Proc. ACM Inter. Conf. Management of Data (SIGMOD), W Chen, JF Naughton and PA Bernstein (eds.)), pp. 22-29. ACM 2000.
24. Wang, B, F Pan, D Ren, Y Cui, Q Ding and WPerrizo (2003). Efficient OLAP operations for spatial using Peano trees. In Proc. ACM SIGMOD Workshop on Data Mining and Knowledge Discovery (DMKD), MJ Zaki and CC Aggarwal (eds.)), pp. 28-34. ACM 2003.
25. Wong, HKT, HF Liu, F Olken, D Rotem and L Wong (1995). Bit transposed files. In Proc. 11th Very Large Databases Conf. (VLDB), A Pirotte and Y Vassiliou (eds.)), pp. 448-457. Morgan Kaufmann.
26. Zaki, MJ, S Parthasarathy, M Ogihara and W Li (1997). New algorithms for fast discovery of association rules. In Proc. 3rd Inter. Conf. on Knowledge Discovery and Data Mining (SIGKDD), D Heckerman, H Mannila and D Pregibon (eds.)), pp. 283-286. AAAI Press.