Please use this identifier to cite or link to this item:
https://ah.lib.nccu.edu.tw/handle/140.119/66695
題名: | 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 | 上傳時間: | 13-Jun-2014 | 摘要: | 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 |
Appears in Collections: | 期刊論文 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
index.html | 130 B | HTML2 | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.