A rough association rule is applicable for knowledge

機構典藏 > College of Business and Management > Department of Management Sciences > Proceeding > Item 987654321/92001

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

Title:	A rough association rule is applicable for knowledge
Authors:	Liao, S. H.;Chen, Y.
Contributors:	淡江大學管理科學學系
Keywords:	Association rule;Data mining;Electronic commerce;Rough set
Date:	2009-11
Issue Date:	2013-08-12 15:05:47 (UTC+8)
Abstract:	The traditional association rule which should be fixed in order to avoid both that only trivial rules are retained and also that interesting rules are not discarded. In fact, the situations which use the relative comparison to express are more complete than to use the absolute comparison. Through relative comparison we proposes a new approach for mining association rule, which has the ability to handle the 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 in find association rules, which has the ability to handle the uncertainty in the classing process and suitable for all data types.
Relation:	Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on, pp.557-561
DOI:	10.1109/ICICISYS.2009.5357782
Appears in Collections:	[Department of Management Sciences] Proceeding

Files in This Item:

File	Description	Size	Format
A rough association rule is applicable.pdf		131Kb	Adobe PDF	214	View/Open
index.html		0Kb	HTML	230	View/Open