The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Mining Associations Rules on a NCR Teradata System
|
|
Author(s): Soon M. Chung (Wright State University, USA)and Murali Mangamuri (Wright State University, USA)
Copyright: 2005
Pages: 6
Source title:
Encyclopedia of Data Warehousing and Mining
Source Author(s)/Editor(s): John Wang (Montclair State University, USA)
DOI: 10.4018/978-1-59140-557-3.ch142
Purchase
|
Abstract
Data mining from relations is becoming increasingly important with the advent of parallel database systems. In this paper, we propose a new algorithm for mining association rules from relations. The new algorithm is an enhanced version of the SETM algorithm (Houtsma & Swami 1995), and it reduces the number of candidate itemsets considerably. We implemented and evaluated the new algorithm on a parallel NCR Teradata database system. The new algorithm is much faster than the SETM algorithm, and its performance is quite scalable.
Related Content
|
Md Sakir Ahmed, Abhijit Bora.
© 2024.
15 pages.
|
|
Lakshmi Haritha Medida, Kumar.
© 2024.
18 pages.
|
|
Gypsy Nandi, Yadika Prasad.
© 2024.
16 pages.
|
|
Saurav Bhattacharjee, Sabiha Raiyesha.
© 2024.
14 pages.
|
|
Naren Kathirvel, Kathirvel Ayyaswamy, B. Santhoshi.
© 2024.
26 pages.
|
|
K. Sudha, C. Balakrishnan, T. P. Anish, T. Nithya, B. Yamini, R. Siva Subramanian, M. Nalini.
© 2024.
25 pages.
|
|
Sabiha Raiyesha, Papul Changmai.
© 2024.
28 pages.
|
|
|