Bi, Y, Anderson, TJ and McClean, SI (2003) A rough set model with ontologies for discovering maximal association rules in document collections. Knowl.-Based Syst., 16 (5-6). pp. 243-251. [Journal article]
Full text not available from this repository.
In this paper we investigate the applicability of a Rough Set model and method to discover maximal associations from a collection of text documents, and compare its applicability with that of the maximal association method. Both methods are based on computing co-occurrences of various sets of keywords, but it has been shown that by using the Rough Set method, rules discovered are similar to maximal association rules, and it is much simpler than the maximal association method. In addition, we also present an alternative strategy to taxonomies required in the above methods, instead of building taxonomies based on labelled document collections themselves. This is to effectively utilise ontologies which will increasingly be deployed on the Internet.
|Item Type:||Journal article|
|Faculties and Schools:||Faculty of Computing & Engineering|
Faculty of Computing & Engineering > School of Computing and Mathematics
Faculty of Computing & Engineering > School of Computing and Information Engineering
|Research Institutes and Groups:||Computer Science Research Institute|
Computer Science Research Institute > Artificial Intelligence and Applications
Computer Science Research Institute > Information and Communication Engineering
|Deposited By:||Professor Sally McClean|
|Deposited On:||20 Jan 2010 15:51|
|Last Modified:||20 Jan 2010 15:51|
Repository Staff Only: item control page