It is a big challenge to guarantee the quality of association rules in some application areas (e.g., in Web information gathering) since duplications and ambiguities of data values (e.g., terms). This paper presents a novel concept of rough association rules to improve the quality of discovered knowledge in these application areas. The premise of a rough association rule consists of a set of terms (items) and a weight distribution of terms (items). The distinct advantage of rough association rules is that they contain more specific information than normal association rules. It is also feasible to update rough association rules dynamically to produce effective results. The experimental results also verify that the proposed approach is promising. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Li, Y., & Zhong, N. (2006). Mining rough association from text documents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4259 LNAI, pp. 368–377). Springer Verlag. https://doi.org/10.1007/11908029_39
Mendeley helps you to discover research relevant for your work.