@ARTICLE { Rsds3672,
author = {Lingras, Pawan J.}, 
title = {Unsupervised Rough Set Classification Using GAs}, 
journal = {Journal of Intelligent Information Systems}, 
number = 	{(no. 3)}, 
volume = 16, 
pages = {215 - 228}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
month = {August}, 
year = 2001, 
issn = {0925-9902}, 
abstract = {The rough set is a useful notion for the classification of objects when the available information is not adequate to represent classes using precise sets. Rough sets have been successfully used in information systems for learning rules from an expert. This paper describes how genetic algorithms can be used to develop rough sets. The proposed rough set theoretic genetic encoding will be especially useful in unsupervised learning. A rough set genome consists of upper and lower bounds for sets in a partition. The partition may be as simple as the conventional expert class and its complement or a more general classification scheme. The paper provides a complete description of design and implementation of rough set genomes. The proposed design and implementation is used to provide an unsupervised rough set classification of highway sections.}, 
keywords = {genetic algorithms, rough sets, unsupervised learning, classification, }, 
}