The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
Mining Frequent Patterns Via Pattern Decomposition
|
|
Author(s): Qinghua Zou (University of California - Los Angeles, USA)and Wesley Chu (University of California - Los Angeles, USA)
Copyright: 2005
Pages: 5
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.ch150
Purchase
|
Abstract
Pattern decomposition is a data-mining technology that uses known frequent or infrequent patterns to decompose a long itemset into many short ones. It finds frequent patterns in a dataset in a bottom-up fashion and reduces the size of the dataset in each step. The algorithm avoids the process of candidate set generation and decreases the time for counting supports due to the reduced dataset.
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.
|
|
|