Computational methods for rough classification and discovery

D. A. Bell and J. W. Guan

Journal of the American Society for Information Science, 1998, vol. 49, issue 5, 403-414

Abstract: Rough set theory is a new mathematical tool to deal with vagueness and uncertainty. To apply the theory, it is important to associate it with efficient and effective computational methods. With a little adjustment, a relation can be used to represent a decision table for use in decision making. By using this kind of table, rough set theory can be applied successfully to rough classification and knowledge discovery. We present computational methods for using rough sets to identify classes in datasets, finding dependencies in relations, and discovering rules which are hidden in databases. The methods are illustrated with a running example from a database of car test results. © 1998 John Wiley & Sons, Inc.

Date: 1998
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/(SICI)1097-4571(19980415)49:53.0.CO;2-8

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:jamest:v:49:y:1998:i:5:p:403-414

Ordering information: This journal article can be ordered from
https://doi.org/10.1002/(ISSN)1097-4571

Access Statistics for this article

More articles in Journal of the American Society for Information Science from Association for Information Science & Technology
Bibliographic data for series maintained by Wiley Content Delivery ().