ACM Home Page
Please provide us with feedback. Feedback
Parallel data mining for association rules on shared-memory multi-processors
Full text PdfPdf (137 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) table of contents
Pittsburgh, Pennsylvania, United States
Article No. 43  
Year of Publication: 1996
ISBN:0-89791-854-1
Authors
Sponsor
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 103,   Citation Count: 18
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/369028.369117
What is a DOI?

ABSTRACT

Data mining is an emerging research area, whose goal is to extract significant patterns or interesting rules from large databases. High-level inference from large volumes of routine business data can provide valuable information to businesses, such as customer buying patterns, shelving criterion in supermarkets and stock trends. Many algorithms have been proposed for data mining of association rules. However, research so far has mainly focused on sequential algorithms. In this paper we present parallel algorithms for data mining of association rules, and study the degree of parallelism, synchronization, and data locality issues on the SGI Power Challenge shared-memory multi-processor. We further present a set of optimizations for the sequential and parallel algorithms.Experiments show that a significant improvement of performance is achieved using our proposed optimizations. We also achieved good speed-up for the parallel algorithm, but we observe a need for parallel I/O techniques for further performance gains.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
R. Agrawal and J. Shafer. Parallel mining of association rules: design, implementation, and experience. Technical Report RJ10004, IBM Almaden Research Center, San Jose, CA 95120, Jan. 1996.
 
5
 
6
 
7
M. Holsheimer, M. Kersten, H. Mannila, and H. Toivonen. A perspective on databases and data mining. In 1st Intl. Conf. Knowledge Discovery and Data Mining, Aug. 1995.
 
8
M. Houtsma and A. Swami. Set-oriented mining of association rules. In RJ 9567. IBM Almaden, Oct. 1993.
 
9
H. Mannila, H. Toivonen, and I. Verkamo. Efficient algorithms for discovering association rules. In AAAI Wkshp. Knowledge Discovery in Databases, July 1994.
10
 
11
J. S. Park, M. Chen, and P. S. Yu. Efficient parallel data mining for association rules. Technical Report RC20156, IBM T. J. Watson Research Center, Aug. 1995.
 
12
G. Piatetsky-Shapiro. Discovery, presentation and analysis of strong rules. In G. P.-S. et al, editor, KDD. AAAI Press, 1991.
 
13
 
14

CITED BY  18

Collaborative Colleagues:
M. J. Zaki: colleagues
M. Ogihara: colleagues
S. Parthasarathy: colleagues
W. Li: colleagues