Relative association rules based on rough set theory

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Liao, S. H., Chen, Y. J., & Ho, S. H. (2011). Relative association rules based on rough set theory. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7063 LNCS, pp. 185–192). https://doi.org/10.1007/978-3-642-24958-7_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free