The rough set-based algorithm for two steps

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

Abstract

The previous research in mining association rules pays no attention to finding rules from imprecise data, and the traditional data mining cannot solve the multi-policy-making problem. Furthermore, in this research, we incorporate association rules with rough sets and promote a new point of view in applications. The new approach can be applied for finding association rules, which has the ability to handle uncertainty combined with rough set theory. In the research, first, we provide new algorithms modified from Apriori algorithm and then give an illustrative example. Finally, give some suggestion based on knowledge management as a reference for future research. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Liao, S. H., Chen, Y. J., & Ho, S. H. (2011). The rough set-based algorithm for two steps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7063 LNCS, pp. 63–70). https://doi.org/10.1007/978-3-642-24958-7_8

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