A Rough Set Model with Ontological Information for Discovering Maximal Association Rules in Document Collections

Yaxin Bi, T. Anderson, S. McClean

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

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.
LanguageEnglish
Title of host publicationResearch and Development in Intelligent Systems XIX
Pages19-32
Publication statusPublished - 2003

Fingerprint

Association rules
Taxonomies
Ontology
Internet

Cite this

Bi, Y., Anderson, T., & McClean, S. (2003). A Rough Set Model with Ontological Information for Discovering Maximal Association Rules in Document Collections. In Research and Development in Intelligent Systems XIX (pp. 19-32)
Bi, Yaxin ; Anderson, T. ; McClean, S. / A Rough Set Model with Ontological Information for Discovering Maximal Association Rules in Document Collections. Research and Development in Intelligent Systems XIX. 2003. pp. 19-32
@inbook{0224ce6583c741dfbd68990448e21b0a,
title = "A Rough Set Model with Ontological Information for Discovering Maximal Association Rules in Document Collections",
abstract = "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.",
author = "Yaxin Bi and T. Anderson and S. McClean",
year = "2003",
language = "English",
isbn = "978-1-85233-674-5",
pages = "19--32",
booktitle = "Research and Development in Intelligent Systems XIX",

}

Bi, Y, Anderson, T & McClean, S 2003, A Rough Set Model with Ontological Information for Discovering Maximal Association Rules in Document Collections. in Research and Development in Intelligent Systems XIX. pp. 19-32.

A Rough Set Model with Ontological Information for Discovering Maximal Association Rules in Document Collections. / Bi, Yaxin; Anderson, T.; McClean, S.

Research and Development in Intelligent Systems XIX. 2003. p. 19-32.

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - A Rough Set Model with Ontological Information for Discovering Maximal Association Rules in Document Collections

AU - Bi, Yaxin

AU - Anderson, T.

AU - McClean, S.

PY - 2003

Y1 - 2003

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

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

M3 - Chapter

SN - 978-1-85233-674-5

SP - 19

EP - 32

BT - Research and Development in Intelligent Systems XIX

ER -

Bi Y, Anderson T, McClean S. A Rough Set Model with Ontological Information for Discovering Maximal Association Rules in Document Collections. In Research and Development in Intelligent Systems XIX. 2003. p. 19-32