政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/66695

English | 正體中文 | 简体中文 | Post-Print筆數 : 27 | Items with full text/Total items : 113656/144643 (79%)
Visitors : 51726982 Online Users : 594

RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.

Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer

政大典藏 > College of Commerce > Department of MIS > Periodical Articles > Item 140.119/66695

Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/66695

Title:	Multidimensional Data Mining for Discover Association Rule in Various Granularities
Authors:	Chiang, Johannes K.;Yang, Rui-Han
Contributors:	資管系
Keywords:	Apriori Algorithm;Association Rule;Concept Taxonomy;Granular Computing;Multidimensional Data Mining
Date:	2013.03
Issue Date:	2014-06-13 14:26:42 (UTC+8)
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.
Relation:	Journal of Data Processing, 3(1), 1-12
Data Type:	article
DOI link:	http://dx.doi.org/10.1109/ICCAT.2013.6522021
DOI:	10.1109/ICCAT.2013.6522021
Appears in Collections:	[Department of MIS] Periodical Articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML2	1104	View/Open

社群 sharing

著作權政策宣告 Copyright Announcement

1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.

Loading...