Title :
A rough association rule is applicable for knowledge discovery
Author :
Liao, Shu-Hsien ; Chen, Yin-Ju
Author_Institution :
Dept. of Manage. Sci., Tamkang Univ., Taipei, Taiwan
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.
Keywords :
data mining; rough set theory; uncertainty handling; association rule mining; information loss reduction; knowledge discovery; rough association rule; rough set theory; uncertainty handling; Association rules; Data mining; Decision making; Electronic commerce; Inference algorithms; Knowledge management; Measurement standards; Partitioning algorithms; Transaction databases; Uncertainty; Association rule; Data mining; Electronic commerce; Rough set;
Conference_Titel :
Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-4754-1
Electronic_ISBN :
978-1-4244-4738-1
DOI :
10.1109/ICICISYS.2009.5357782