Mining rough association from text documents for web information gathering

  • Authors:
  • Yuefeng Li;Ning Zhong

  • Affiliations:
  • School of Software Engineering and Data Communications, Queensland University of Technology, Brisbane, QLD, Australia;Department of Information Engineering, Maebashi Institute of Technology, Maebashi, Japan

  • Venue:
  • Transactions on rough sets VII
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

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). Rough set based decision tables could be efficient tools for solving this challenge. This paper first illustrates the relationship between decision tables and association mining. It proves that a decision rule is a kind of closed pattern. It also presents an alternative concept of rough association rules to improve the quality of discovered knowledge in this area. 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. This paper also conducts some experiments to compare the proposed method with association rule mining and decision tables; and the experimental results verify that the proposed approach is promising.