Unsupervised rough set classification using GAs

被引:73
作者
Lingras, P [1 ]
机构
[1] St Marys Univ, Halifax, NS B3H 3C3, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
genetic algorithms; rough sets; unsupervised learning; classification;
D O I
10.1023/A:1011219918340
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:215 / 228
页数:14
相关论文
共 25 条
[1]   MAINTAINING KNOWLEDGE ABOUT TEMPORAL INTERVALS [J].
ALLEN, JF .
COMMUNICATIONS OF THE ACM, 1983, 26 (11) :832-843
[2]  
[Anonymous], P S MOD AN SIM CESA9
[3]  
[Anonymous], P 4 INT WORKSH MULT
[4]  
[Anonymous], INT J INFORM COMPUTE
[5]  
Baeck T., 1997, HDB EVOLUTIONARY COM
[6]  
BUCKLES BP, 1994, GENETIC ALGORITHMS
[7]  
GARBER NJ, 1988, TRAFFIC HIGHWAY ENG
[8]  
Greco S, 1999, LECT NOTES ARTIF INT, V1711, P146
[9]  
HOLLAND JH, 1975, ADAPTATION NATURAL A
[10]   Comparison of neofuzzy and rough neural networks [J].
Lingras, P .
INFORMATION SCIENCES, 1998, 110 (3-4) :207-215