A rough set model with ontologies for discovering maximal association rules in document collections

Y Bi, TJ Anderson, SI McClean

Research output: Contribution to journalArticle

LanguageEnglish
Pages243-251
JournalKnowledge-Based Systems
Volume16
Issue number5-6
DOIs
Publication statusPublished - 1 Jul 2003

Keywords

  • rough set
  • ontology
  • maximal association rules

Cite this

@article{986e44df183e442ea7df771e3a5494d2,
title = "A rough set model with ontologies for discovering maximal association rules in document collections",
keywords = "rough set, ontology, maximal association rules",
author = "Y Bi and TJ Anderson and SI McClean",
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.",
year = "2003",
month = "7",
day = "1",
doi = "10.1016/S0950-7051(03)00025-X",
language = "English",
volume = "16",
pages = "243--251",
number = "5-6",

}

A rough set model with ontologies for discovering maximal association rules in document collections. / Bi, Y; Anderson, TJ; McClean, SI.

Vol. 16, No. 5-6, 01.07.2003, p. 243-251.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A rough set model with ontologies for discovering maximal association rules in document collections

AU - Bi, Y

AU - Anderson, TJ

AU - McClean, SI

N1 - 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.

PY - 2003/7/1

Y1 - 2003/7/1

KW - rough set

KW - ontology

KW - maximal association rules

U2 - 10.1016/S0950-7051(03)00025-X

DO - 10.1016/S0950-7051(03)00025-X

M3 - Article

VL - 16

SP - 243

EP - 251

IS - 5-6

ER -