Rough sets-based machine learning using a binary discernibility matrix

Proceedings of the 2nd International Conference on Intelligent Processing and Manufacturing of Materials, IPMM 1999

Volumn 1, Issue , 1999, Pages 299-305

  Felix, Reynaldo ^a   Ushio, Toshimitsu ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BINS; GENETIC ALGORITHMS; LEARNING SYSTEMS; MANUFACTURE;

BINARY DISCERNIBILITY MATRIX; CONDITION ATTRIBUTES; LOGICAL OPERATIONS; SINGLE-BIT;

ROUGH SET THEORY;

EID: 84956636425     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPMM.1999.792493     Document Type: Conference Paper

References (8)

1. Z. Pawlak, 1989. Rough sets, theoretical aspects of reasoning about data. Kluwer Academic Publishers, 1991.
2. J. Wroblewsky, 1998. GA in decomposition and classification problems. In "Rough sets in knowledge discovery, v. 2", L. Polkowski and A. Skowron. Physica-Verlag. 47 1-487.
3. J. W. Guan and D. A. Bell, 1998. Rough computational methods for information systems. Artificial Intelligence 105, 77-103.
4. J. W. Grzymala-Busse, J. Stefanowsky, W. Ziarko, 1996. Rough sets: Facts versus misconceptions. Tnformatica 20, 45 5-464.
5. David E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison-Wesley Publishing Co. Inc.
6. Peter J. B. Hancock, 1995. Selection methods for Evolutionary Algorithms. In "Practical handbook of genetic algorithms, Volume II, New Frontier'. CRC Press. 67-92.
7. M. A. Pawlowsky, 1995. Crossover operators. In "Practical handbook of GA, Volume I, Applications". CRC Press. 101-141.
8. C. C. Chan, J. W. Grzymala-Busse, 1998. On the lower boundaries in learning rules from examples. In "Incomplete information: Rough sets analysis". Physica-Verlag. 58-74.