1. NCCU Academic Hub
  2. 學術產出
  3. College of Commerce
  4. Proceedings
  5. Item

學術產出-Proceedings

Article View/Open

Publication Export

Google ScholarTM

政大圖書館

Citation Infomation

題名 Multidimensional Data Mining for Discover Association Rules in Various Granularities
作者 姜國輝
Chiang, Johannes K.
貢獻者 資管系
關鍵詞 Multidimensional Data Mining; Granular Computing; Apriori Algorithm; Concept Taxonomy; Association Rule
日期 2013-01
上傳時間 22-Sep-2021 10:20:28 (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 datamining 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.
關聯 2013 International Conference on Computer Applications Technology (ICCAT), IEEE, pp.1-6
資料類型 conference
DOI https://doi.org/10.1109/ICCAT.2013.6522021
dc.contributor 資管系
dc.creator (作者) 姜國輝
dc.creator (作者) Chiang, Johannes K.
dc.date (日期) 2013-01
dc.date.accessioned 22-Sep-2021 10:20:28 (UTC+8)-
dc.date.available 22-Sep-2021 10:20:28 (UTC+8)-
dc.date.issued (上傳時間) 22-Sep-2021 10:20:28 (UTC+8)-
dc.identifier.uri (URI) http://nccur.lib.nccu.edu.tw/handle/140.119/137212-
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 datamining 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.
dc.format.extent 349728 bytes-
dc.format.mimetype application/pdf-
dc.relation (關聯) 2013 International Conference on Computer Applications Technology (ICCAT), IEEE, pp.1-6
dc.subject (關鍵詞) Multidimensional Data Mining; Granular Computing; Apriori Algorithm; Concept Taxonomy; Association Rule
dc.title (題名) Multidimensional Data Mining for Discover Association Rules in Various Granularities
dc.type (資料類型) conference
dc.identifier.doi (DOI) 10.1109/ICCAT.2013.6522021
dc.doi.uri (DOI) https://doi.org/10.1109/ICCAT.2013.6522021