Relative Association Rules Based on Rough Set Theory

機構典藏 > College of Business and Management > Department of Management Sciences > Journal Article > Item 987654321/91972

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/91972

Title:	Relative Association Rules Based on Rough Set Theory
Authors:	Liao, Shu-hsien
Contributors:	淡江大學管理科學學系
Keywords:	Rough set;Data mining;Relative association rule;Ordinal data
Date:	2011-06
Issue Date:	2013-08-12 13:09:53 (UTC+8)
Abstract:	The traditional association rule that should be fixed in order to avoid the following: only trivial rules are retained and interesting rules are not discarded. In fact, the situations that use the relative comparison to express are more complete than those that use the absolute comparison. Through relative comparison, we proposes a new approach for mining association rule, which has the ability to handle uncertainty in the classing process, so that we can reduce information loss and enhance the result of data mining. In this paper, the new approach can be applied for finding association rules, which have the ability to handle uncertainty in the classing process, is suitable for interval data types, and help the decision to try to find the relative association rules within the ranking data.
Relation:	Lecture notes in Computer Science 7063,　p.185-192
DOI:	10.1007/978-3-642-24958-7_22
Appears in Collections:	[Department of Management Sciences] Journal Article

Files in This Item:

File	Size	Format
index.html	0Kb	HTML	257	View/Open
index.html	0Kb	HTML	19	View/Open
Relative association rules based on rough set theory.pdf	189Kb	Adobe PDF	289	View/Open