loading
Papers

Research.Publish.Connect.

Paper

Paper Unlock

Authors: Li-Xuan Lin ; Don-Lin Yang ; Chia-Han Yang and Jungpin Wu

Affiliation: Feng Chia University, Taiwan

ISBN: 978-989-8111-53-1

Keyword(s): Association rules, frequent itemsets, distributed data mining, incremental.

Related Ontology Subjects/Areas/Topics: Business Analytics ; Communication and Software Technologies and Architectures ; Data Engineering ; Data Warehouses and Data Mining ; e-Business ; Enterprise Information Systems

Abstract: Association rule mining has gathered great attention in recent years due to its broad applications. Some influential algorithms have been developed in two categories: (1) candidate-generation-and-test approach such as Apriori, (2) pattern-growth approach such as FP-growth. However, they all suffer from the problems of multiple database scans and setting minimum support threshold to prune infrequent candidates for process efficiency. Reading the database multiple times is a critical problem for distributed data mining. Although more new methods are proposed, like the FSE algorithm that still has the problem of taking too much space. We propose an efficient approach by using a transformation method to perform support count of candidate itemsets. We record all the itemsets which appear at least one time in the transaction database. Thus users do not need to determine the minimum support in advance. Our approach can reach the same goal as the FSE algorithm does with better space utilizati on. The experiments show that our approach is effective and efficient on various datasets. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 35.172.195.49

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Lin L.; Yang D.; Yang C.; Wu J. and (2008). EFFICIENT SUPPORT COUNTING OF CANDIDATE ITEMSETS FOR ASSOCIATION RULE MINING.In Proceedings of the Third International Conference on Software and Data Technologies - Volume 2: ICSOFT, ISBN 978-989-8111-53-1, pages 180-185. DOI: 10.5220/0001888101800185

@conference{icsoft08,
author={Li{-}Xuan Lin and Don{-}Lin Yang and Chia{-}Han Yang and Jungpin Wu},
title={EFFICIENT SUPPORT COUNTING OF CANDIDATE ITEMSETS FOR ASSOCIATION RULE MINING},
booktitle={Proceedings of the Third International Conference on Software and Data Technologies - Volume 2: ICSOFT,},
year={2008},
pages={180-185},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001888101800185},
isbn={978-989-8111-53-1},
}

TY - CONF

JO - Proceedings of the Third International Conference on Software and Data Technologies - Volume 2: ICSOFT,
TI - EFFICIENT SUPPORT COUNTING OF CANDIDATE ITEMSETS FOR ASSOCIATION RULE MINING
SN - 978-989-8111-53-1
AU - Lin, L.
AU - Yang, D.
AU - Yang, C.
AU - Wu, J.
PY - 2008
SP - 180
EP - 185
DO - 10.5220/0001888101800185

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.