abady, A., kozae, A., rady, E. (2008). ROUGH SETS REDUCTION FOR BINARY DATA. test, 31(2), 219-225. doi: 10.21608/erjm.2008.69536
a. n. abady; a. m. kozae; e. a. rady. "ROUGH SETS REDUCTION FOR BINARY DATA". test, 31, 2, 2008, 219-225. doi: 10.21608/erjm.2008.69536
abady, A., kozae, A., rady, E. (2008). 'ROUGH SETS REDUCTION FOR BINARY DATA', test, 31(2), pp. 219-225. doi: 10.21608/erjm.2008.69536
abady, A., kozae, A., rady, E. ROUGH SETS REDUCTION FOR BINARY DATA. test, 2008; 31(2): 219-225. doi: 10.21608/erjm.2008.69536

ROUGH SETS REDUCTION FOR BINARY DATA

ERJ. Engineering Research Journal
Article 11, Volume 31, Issue 2, April 2008, Pages 219-225    PDF (610.34 K)
Document Type: Original Article
DOI: 10.21608/erjm.2008.69536
Authors
a. n. abady1; a. m. kozae2; e. a. rady3
1Department of Engineering Mathmatics & Basic Science, Facully of Engineering, Minoufva University, Shebin El-Kom, Egypt
2Department of Engineering Mathmatics & Basic Science, Faculty of Engineering, Tanta University, Egypt
3*Institute of Statistical Studies & Research (ISSR), Cairo Universify, Egyp
Abstract
The major aim of this work is to introduce a new method for data reduction in information systems
classified by nonequivalence relations. The suggested approach is useful for many real life data
that can not be classsed into disjoint classes. The new approach is tested with examples and its
ability for decreasing the noisy in data, as well as simpliiing the structure for extracting decision
rules. Based on binary relation, this method is capable of discovering the reduct attributes or
indispensable attributes which are useful for data description andlor prediction, and to remove the
dispensable ones.
Keywords
Reduction; information system; binary relation
Statistics
Article View: 120
PDF Download: 172