Publications-Periodical Articles

Article View/Open

Publication Export

Google ScholarTM

NCCU Library

Citation Infomation

Related Publications in TAIR

題名 Multidimensional Data Mining for Discover Association Rule in Various Granularities
作者 Chiang, Johannes K. ; Yang, Rui-Han
貢獻者 資管系
關鍵詞 Apriori Algorithm;Association Rule;Concept Taxonomy;Granular Computing;Multidimensional Data Mining
日期 2013.03
上傳時間 13-Jun-2014 14:26:42 (UTC+8)
摘要 Data Mining is one of the most significant tools for discovering association patterns that are useful for many knowledge domains. Yet, there are some drawbacks in existing mining techniques. The three main weaknesses of current data-mining techniques are: 1) re-scanning of the entire database must be done whenever new attributes are added because current methods are based on flat-mining using pre-defined schemata. 2) An association rule may be true on a certain granularity but fail on a smaller ones and vise verse. This may result in loss of important association rules. 3) Current methods can only be used to find either frequent rules or infrequent rules, but not both at the same time. This research proposes a novel data schema and an algorithm that solves the above weaknesses while improving on the efficiency and effectiveness of data mining strategies. Crucial mechanisms in each step will be clarified in this paper. This paper also presents a benchmark which is used to compare the level of efficiency and effectiveness of the proposed algorithm against other known methods. Finally, this paper presents experimental results regarding efficiency, scalability, information loss, etc. of the proposed approach to prove its advantages.
關聯 Journal of Data Processing, 3(1), 1-12
資料類型 article
DOI http://dx.doi.org/10.1109/ICCAT.2013.6522021
dc.contributor 資管系en_US
dc.creator (作者) Chiang, Johannes K. ; Yang, Rui-Hanen_US
dc.date (日期) 2013.03en_US
dc.date.accessioned 13-Jun-2014 14:26:42 (UTC+8)-
dc.date.available 13-Jun-2014 14:26:42 (UTC+8)-
dc.date.issued (上傳時間) 13-Jun-2014 14:26:42 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/66695-
dc.description.abstract (摘要) Data Mining is one of the most significant tools for discovering association patterns that are useful for many knowledge domains. Yet, there are some drawbacks in existing mining techniques. The three main weaknesses of current data-mining techniques are: 1) re-scanning of the entire database must be done whenever new attributes are added because current methods are based on flat-mining using pre-defined schemata. 2) An association rule may be true on a certain granularity but fail on a smaller ones and vise verse. This may result in loss of important association rules. 3) Current methods can only be used to find either frequent rules or infrequent rules, but not both at the same time. This research proposes a novel data schema and an algorithm that solves the above weaknesses while improving on the efficiency and effectiveness of data mining strategies. Crucial mechanisms in each step will be clarified in this paper. This paper also presents a benchmark which is used to compare the level of efficiency and effectiveness of the proposed algorithm against other known methods. Finally, this paper presents experimental results regarding efficiency, scalability, information loss, etc. of the proposed approach to prove its advantages.en_US
dc.format.extent 130 bytes-
dc.format.mimetype text/html-
dc.language.iso en_US-
dc.relation (關聯) Journal of Data Processing, 3(1), 1-12en_US
dc.subject (關鍵詞) Apriori Algorithm;Association Rule;Concept Taxonomy;Granular Computing;Multidimensional Data Miningen_US
dc.title (題名) Multidimensional Data Mining for Discover Association Rule in Various Granularitiesen_US
dc.type (資料類型) articleen
dc.identifier.doi (DOI) 10.1109/ICCAT.2013.6522021en_US
dc.doi.uri (DOI) http://dx.doi.org/10.1109/ICCAT.2013.6522021en_US