A rough association rule is applicable for knowledge

淡江大學機構典藏 > 商管學院 > 管理科學學系暨研究所 > 會議論文 > Item 987654321/92001

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/92001

题名:	A rough association rule is applicable for knowledge
作者:	Liao, S. H.;Chen, Y.
贡献者:	淡江大學管理科學學系
关键词:	Association rule;Data mining;Electronic commerce;Rough set
日期:	2009-11
上传时间:	2013-08-12 15:05:47 (UTC+8)
摘要:	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.
關聯:	Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on, pp.557-561
DOI:	10.1109/ICICISYS.2009.5357782
显示于类别:	[管理科學學系暨研究所] 會議論文

文件中的档案:

档案	描述	大小	格式	浏览次数
A rough association rule is applicable.pdf		131Kb	Adobe PDF	213	检视/开启
index.html		0Kb	HTML	230	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章