| Original language | English |
|---|---|
| Pages (from-to) | 243-251 |
| Journal | Knowledge-Based Systems |
| Volume | 16 |
| Issue number | 5-6 |
| DOIs | |
| Publication status | Published (in print/issue) - 1 Jul 2003 |
Bibliographical note
Other Details------------------------------------
This paper presents a rough set based method for discovering maximal association rules from collections of text documents. This method provides a solution to detect maximal association rules by computing co-occurrences of various sets of keywords with taxonomies. Rules discovered by this method are similar to those discovered by a conventional maximal association method; however, the rough set based method is much simpler to implement than the maximal association method. The significance of this paper is the development of an alternative strategy for taxonomies that effectively utilises ontologies that will be deployed increasingly on the Internet.
Keywords
- rough set
- ontology
- maximal association rules