Authors
Adriano Veloso, Matthew Eric Otey, Srinivasan Parthasarathy, Wagner Meira
Publication date
2003
Conference
High Performance Computing-HiPC 2003: 10th International Conference, Hyderabad, India, December 17-20, 2003. Proceedings 10
Pages
184-193
Publisher
Springer Berlin Heidelberg
Description
Traditional methods for data mining typically make the assumption that data is centralized and static. This assumption is no longer tenable. Such methods waste computational and I/O resources when the data is dynamic, and they impose excessive communication overhead when the data is distributed. As a result, the knowledge discovery process is harmed by slow response times. Efficient implementation of incremental data mining ideas in distributed computing environments is thus becoming crucial for ensuring scalability and facilitating knowledge discovery when data is dynamic and distributed. In this paper we address this issue in the context of frequent itemset mining, an important data mining task. Frequent itemsets are most often used to generate correlations and association rules, but more recently they have been used in such far-reaching domains as bio-informatics and e-commerce applications …
Total citations
200320042005200620072008200920102011201220132014201520162017201820192020202125311232321
Scholar articles
A Veloso, ME Otey, S Parthasarathy, W Meira - High Performance Computing-HiPC 2003: 10th …, 2003