Parallel and distributed methods for incremental frequent itemset mining

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 34, Issue 6, 2004, Pages 2439-2450

  Otey, Matthew Eric ^a   Parthasarathy, Srinivasan ^a   Wang, Chao ^a   Veloso, Adriano ^b   Meira Jr , Wagner ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b FEDERAL UNIVERSITY OF MINAS GERAIS   (Brazil)

Author keywords

Distributed computing; Grid computing; Incremental data mining; Parallel computing

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DATA STRUCTURES; DATABASE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; THEOREM PROVING; WIDE AREA NETWORKS;

DISTRIBUTED ASYNCHRONOUS ALGORITHM; DISTRIBUTED COMPUTING; DISTRIBUTED DYNAMIC DATASET; GRID COMPUTING; INCREMENTAL FREQUENT ITEMSET MINING;

DATA MINING;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPARATIVE STUDY; COMPUTER ANALYSIS; COMPUTER NETWORK; DATA BASE; EVALUATION; FACTUAL DATABASE; INFORMATION DISSEMINATION; INFORMATION RETRIEVAL; METHODOLOGY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER COMMUNICATION NETWORKS; COMPUTING METHODOLOGIES; DATABASE MANAGEMENT SYSTEMS; DATABASES, FACTUAL; INFORMATION DISSEMINATION; INFORMATION STORAGE AND RETRIEVAL; PATTERN RECOGNITION, AUTOMATED;

EID: 10044287417     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2004.836887     Document Type: Article

References (34)

1. D. Cheung, J. Han, V. Ng, and C. Y. Wong, "Maintenance of discovered association rules in large databases: An incremental updating technique," in Proc. 12th Int. Conf. Data Engineering, Feb. 1996, pp. 106-114.
2. D. Cheung, S. Lee, and B. Kao, "A general incremental technique for maintaining discovered association rules," in Proc. 5th Int. Conf. Database Systems Advanced Applications, Apr. 1997, pp. 1-4.
3. V. Ganti, J. Gehrke, and R. Ramakrishnan, "Demon: Mining and monitoring evolving data," in Proc. 16th Int. Conf. Data Engineering, San Diego, CA, 2000, pp. 439-448.
4. S. Lee and D. Cheung, "Maintenance of discovered association rules: When to update?," in Proc. SIGMOD Workshop Research Issues Data Mining Knowledge Discovery, 1997.
5. S. Thomas, S. Bodagala, K. Alsabti, and S. Ranka, "An efficient algorithm for the incremental updation of association rules," in Proc. 3rd ACM SIGKDD Int. Conf. Knowledge Discovery Data Mining, Aug. 1997, pp. 263-266.
6. A. Veloso, W. M. Jr, M. B. de Carvalho, B. Pôssas, S. Parthasarathy, and M. Zaki, "Mining frequent itemsets in evolving databases," in Proc. 2nd SIAM Int. Conf. Data Mining, Arlington, TX, May 2002, pp. 494-510.
7. M. E. Otey, A. Veloso, C. Wang, S. Parthasarathy, and W. Meira Jr, "Mining frequent itemsets in distributed and dynamic databases," in IEEE Int. Conf. Data Mining, 2003, pp. 617-620.
8. A. Veloso, W. Meira Jr, M. B. de Carvalho, S. Parthasarathy, and M. Zaki, "Parallel, incremental and interactive mining for frequent itemsets in evolving databases," in Proc. Int. Workshop High Performance Data Mining, 2003.
9. A. Veloso, M. E. Otey, S. Parthasarathy, and W. Meira Jr, "Parallel and distributed frequent itemset mining on dynamic datasets," in Proc. Int. Conf. High Performance Computing, 2003, pp. 184-193.
10. B.-H. Park and H. Kargupta, "Distributed data mining: Algorithms, systems, and applications," in Handbook of Data Mining, N. Ye, Ed. Hillsdale, NJ: Lawrence Erlbaum, 2002.
11. M. Zaki, S. Parthasarathy, M. Ogihara, and W. Li, "New parallel algorithms for fast discovery of association rules," Data Min. Knowl. Discov.: Int. J., vol. 4, pp. 343-373, Dec. 1997.
12. E.-H. Han, G. Karypis, and V. Kumar, "Scalable parallel data mining for association rules," in Proc. ACM SIGMOD Conf. Management Data, 1997, pp. 277-288.
13. J. Park, M. Chen, and P. S. Yu, "CACTUS - Clustering categorical data using summaries," in Proc. ACM Int. Conf. Information Knowledge Management, 1995, pp. 73-83.
14. S. Parthasarathy, M. Zaki, M. Ogihara, and W. Li, "Parallel data mining for association rules on shared-memory systems," Knowl. Inform. Syst., vol. 3, no. 1, pp. 1-29, 2001.
15. M. J. Zaki, S. Parthasarathy, and W. Li, "A localized algorithm for parallel association mining," in Proc. Supercomputing, 1997, pp. 321-330.
16. O. R. Zaiane, M. El-Hajj, and P. Lu, "Fast parallel association rule mining without candidacy generation," in Proc. ICDM, 2001, [Online]. Available: citeseer.ist.psu.edu/474621.html, pp. 665-668.
17. M. J. Zaki, "Parallel and distributed association mining: A survey," IEEE Concurr., vol. 7, pp. 14-25, Dec. 1997.
18. R. Agrawal and J. Shafer, "Parallel mining of association rules," IEEE Trans. Knowl. Data Eng., vol. 8, pp. 962-969, Dec. 1996.
19. D. Cheung, J. Han, V. Ng, A. Fu, and Y. Fu, "A fast distributed algorithm for mining association rules," in Proc. 4th Int. Conf. Parallel Distributed Info. Systems, 1996, pp. 31-42.
20. D. Cheung, V. Ng, A. Fu, and Y. Fu, "Efficient mining of association rules in distributed databases," IEEE Trans. Knowledge Data Eng., vol. 8, pp. 911-922, Dec. 1996.
21. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules," in Proc. 20th Int. Conf. Very Large Databases, San Tiago, Chile, June 1994, pp. 487-499.
22. A. Schuster and R. Wolff, "Communication-efficient distributed mining of association rules," in Proc. ACM SIGMOD Int. Conf. Management Data, 2001, pp. 473-484.
23. R. L. Grossman, S. M. Bailey, H. Sivakumar, and A. L. Turinsky, (1999) Papyrus: A system for data mining over local and wide-area clusters and super-chisters. [Online]. Available: citeseer.nj.nec.com/408839.html
24. H. Toivonen, "Sampling large databases for association rules," in Proc. Int. Conf. Very Large Data Bases, T. M. Vijayaraman, A. P. Buchmann, C. Mohan, and N. L. Sarda, Eds., 1996, [Online]. Available: citeseer.nj.nec.com/toivonen96sampling.html, pp. 134-145.
25. S. Parthasarathy, M. J. Zaki, M. Ogihara, and S. Dwarkadas, "Incremental and interactive sequence mining," in Proc. CIKM, 1999, Online. Available: citeseer.nj.nec.com/article/ parthasarathy99incremental.html, pp. 251-258.
26. M. Zaki, "Efficient enumeration of frequent sequences," in Proc. CIKM: ACM CIKM Int. Conf. Information Knowledge Management, 1998, [Online]. Available: citeseer.nj.nec.com/zaki98efficient.html.
27. R. Srikant and R. Agrawal, "Mining sequential patterns: Generalizations and performance improvements," in Proc. 5th Int. Conf. Extending Database Technology, EDBT, vol. 1057, P. M. G. Apers, M. Bouzeghoub, and G. Gardarin, Eds., 25-29, 1996, [Online]. Available: citeseer.nj.nec.com/article/srikant96mining.html, pp. 3-17.
28. M. Zhang, B. Kao, C. Yip, and D. Cheung, "A gsp-based efficient algorithm for mining frequent sequences," in Proc. IC-AI, Las Vegas, NV, June 2001, [Online]. Available: citeseer.nj.nec.com/ zhang02gspbased.html.
29. M. Zhang, B. Kao, D. W.-L. Cheung, and C. L. Yip, "Efficient algorithms for incremental update of frequent sequences," in Proc. Pacific-Asia Conf. Knowledge Discovery Data Mining, 2002, [Online]. Available: citeseer.nj.nec.com/article/zhang02efficient.html, pp. 186-197.
30. S. Parthasarathy and A. Ramakrishnan, "Parallel incremental 2d discretization," in IEEE Proc. Int. Conf. Parallel Distributed Processing, 2002.
31. M. Cierniak, M. Zaki, and W. Li, "Compile-time scheduling algorithms for a heterogeneous network of workstations," Comput. J., vol. 40, pp. 356-372, 1997.
32. A. Savasere, E. Omiecinski, and S. B. Navathe, "An efficient algorithm for mining association rules in large databases," VLDB J., pp. 432-444, 1995.
33. D. Cheung and Y. Xiao, "Effect of data skewness in parallel mining of association rules," in Proc. 4th Pacific-Asia Conf. Knowledge Discovery Data Mining, Aug. 1998, pp. 48-60.
34. A. Veloso, W. M. Jr, M. B. de Carvalho, B. Rocha, S. Parthasarathy, and M. Zaki, "Efficiently mining approximate models of associations in evolving databases," in Proc. 6th Int. Conf. Principles Practices Data Mining Knowledge Discovery Databases, Helsinki, Finland, Aug. 2002, pp. 435-448.