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.
Similar content being viewed by others
References
Allen, J.F. (1983). Maintaining Knowledge about Temporal Intervals, Communication of the ACM, 26, 832-843.
Baeck, T., Fogel, D.B., and Michalewicz, Z. (1997). Handbook of Evolutionary Computation, Oxford: IOP Publishing Ltd.
Buckles, B.P. and Petry, F.E. (1994). Genetic Algorithms, Los Alamitos, California: IEEE Computer Press.
Garber, N.J. and Hoel, L.A. (1988). Traffic and Highway Engineering, New York: West Publishing Co.
Greco, S., Matarazzo, B., and Slowinski, R. (1999). Handling Missing Values in Rough Set Analysis of Multi-Attribute and Multi-Criteria Decision Problems. In Ning Zhong, Andrzej Skowron, and Setsuo Ohsuga (Eds.), New Directions in Rough Sets, Data Mining, and Granular-Soft Computing (pp. 146-157). Lecture notes in Artificial Intelligence No. 1711, Berlin: Springer-Verlag.
Holland, J.H. (1975). Adaptation in Natural and Artificial Systems, Ann Arbor: University of Michigan Press.
Lingras, P. (1995). Classifying Highways: Hierarchical Grouping vs Kohonen Neural Networks, Journal of Transportation Engineering, 121(4), 364-368.
Lingras, P. (1996a). Rough Neural Networks. In Proceedings of Sixth International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Granada, Spain (pp. 1445-1450).
Lingras, P. (1996b). Unsupervised Learning Using Rough Kohonen Neural Network Classifiers. In Proceedings of Symposium on Modelling, Analysis and Simulation, CESA'96 IMACS Multiconference, Lille, France (pp. 753-757).
Lingras, P. (1998a). Comparison of Neofuzzy and Rough Neural Networks, Information Sciences: An International Journal, 110, 207-215.
Lingras, P. (1998b). Applications of Rough Patterns. In Lech Polkowski and Andrzej Skowron (Eds.), Rough Sets in Data Mining and Knowledge Discovery 2 (pp. 369-384). Series Soft Computing, New York: Physica Verlag (Springer).
Lingras, P. (2001). Comparison of Conventional Statistical Grouping and Genetic Algorithms for Highway Classification, Journal of Transportation Engineering, 127(3), 237-243.
Lingras, P. and Davies, C. (2000). Application of Rough Genetic Algorithms, Computational Intelligence, submitted.
Michalewicz, Z. (1996). Genetic Algorithms + Data Structures=Evolutionary Programs, Berlin: Springer-Verlag.
Michalski, R.S. (1998). Learnable evolution: Combining Symbolic and Evolutionary Programs. In Proceedings of the Fourth International Workshop on Multistrategy Learning, Brescia, Italy (pp. 14-20).
Michalski, R.S. (2000). Learning and evolution: An Introduction to Non-Darwinian Evolutionary Computing, In Z.W. Ras and S. Ohsuga (Eds.), Foundations of Intelligent Systems (pp. 21-30). Lecture Notes in Artificial Intelligence, No. 1932, Berlin: Springer-Verlag.
Pawlak, Z. (1982). Rough Sets, International Journal of Information and Computer Sciences, 11, 145-172.
Pawlak Z. (1984). Rough Classification, International Journal of Man-Machine Studies, 20, 469-483.
Pawlak, Z., Wong, S.K.M., and Ziarko, W. (1988). Rough sets: Probabilistic Versus Deterministic Approach. International Journal of Man-Machine Studies, 29, 81-95.
Sharma, S.C. and Allipuram, R.R. (1993). Duration and Frequency of Seasonal Traffic Counts, Journal of Transportation Engineering, 116(3), 344-359.
Sharma, S.C. and Werner, A. (1981). Improved Method of Grouping Provincewide Permanent Traffic Counters.
Transportation Research Record 815, Transportation Research Board, Washington D.C., 13-18.
Skowron, A. and Stepaniuk J. (1999). Information Granules in Distributed Environment. In Ning Zhong, Andrzej Skowron, and Setsuo Ohsuga (Eds.), New Directions in Rough Sets, Data Mining, and Granular-Soft Computing (pp. 357-365). Lecture notes in Artificial Intelligence, No. 1711, Tokyo: Springer-Verlag.
Vinterbo, S. and Øhrn, A. (1997). A Rough Set Approach to Clustering. In Proceedings of Joint Conference of Information Sciences, 3, 383-386.
Wall, M. (1993). Galib, A C++ Library of Genetic Components. http://lancet.mit.edu/ga/.
Yao, Y.Y., Li, X., Lin, T.Y., and Liu, Q. (1994). Representation and Classification of Rough Set Models. In Proceeding of Third International Workshop on Rough Sets and Soft Computing, San Jose, California (pp. 630-637). November 10-12.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Lingras, P. Unsupervised Rough Set Classification Using GAs. Journal of Intelligent Information Systems 16, 215–228 (2001). https://doi.org/10.1023/A:1011219918340
Issue Date:
DOI: https://doi.org/10.1023/A:1011219918340