Approximate reduct computation by rough sets based attribute weighting

2005 IEEE International Conference on Granular Computing

Volumn 2005, Issue , 2005, Pages 383-386

  Al Radaideh, Qasem A ^a,b   Sulaiman, Md Nasir ^a   Selamat, Mohd Hasan ^a   Ibrahim, Hamidah ^a  

^a UNIVERSITY PUTRA MALAYSIA   (Malaysia)

^b YARMOUK UNIVERSITY   (Jordan)

Author keywords

Attribute Weighting; Reduct Computation; Rough Set Theory

Indexed keywords

APPROXIMATION THEORY; COMPUTATION THEORY; DATA STRUCTURES; KNOWLEDGE ENGINEERING; PROBLEM SOLVING;

DATASET; DISCERNIBILITY MATRIX; REDUCT COMPUTATION; SET SIZE;

ROUGH SET THEORY;

EID: 33845343244     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GRC.2005.1547317     Document Type: Conference Paper

References (17)

1. Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht, 1991.
2. A. Skowron and C. Rauszer, "The discernibility matrices and functions in information systems", in Słowiński R.(ed.), Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory. Kluwer, Dortrecht. Pp. 331-362. 1992.
3. T. Y. Lin, and P. Yin, "Heuristically fast finding of the shortest reducts", in: S. Tsumoto et al. (Eds.): RSCTC 2004, LNAI 3066. Springer-Verlag Berlin, pp. 465-170. 2004.
4. T. F. Kuo and Y. Yajima, "Approximate reducts of an information system", in G. Wang et al. (Eds.): RSFDGrC 2003, LNAI 2639. Springer- Verlag Berlin, pp. 291-294. 2003.
5. B. Wang and S. B. Chen, "A complete algorithm for attribute reduction", in T. J. Tarn (Eds.): Robotic Welding, Intelligence and Automation. LNCIS 299. Springer-Verlag Berlin, pp. 345-352. 2004.
6. R. Susmaga, "Experiments in incremental computation of reducts", in L.Polkowski and A.Skowron(eds.) Rough sets in knowledge discovery: methodology and applications. Physica-verlag. pp. 530-553.
7. S. Tsumoto, "Discovery of approximate knowledge in medical databases based on rough set model", in Lin.T.Y, Yao Y.Y., Zadeh L.A. (editors) Data Mining, Rough Sets, and Granular Computing. Springer-Verlag Co. 2002.
8. Wroblewski, J, "Finding minimal reducts using genetic algorithms", Proc. of the Second Annual Join Conference on Information Sciences, pp. 186-189. 1995.
9. D.S. Johnson, "Approximation algorithms for combinatorial problems", Journal of Computer and System Sciences, (9): pp.256-278. 1974.
10. S. H. Nguyen and H. S. Nguyen, "Some efficient algorithms for rough set methods", Proc. Conf. of Information Processing and Management of Uncertainty in Knowledge based system. Spain, pp. 1451-1456. 1996.
11. A. Ohm, ROSETTA technical reference manual. Knowledge System Group, Norwegian University of Science and Technology, Trondheim, Norway. 1998.
12. K. Hu, L. Diao, Y. Lu, and C. Shi, "A heuristic optimal reduct algorithm", in K.S. Leung, L.W. Chan, and H. Meng (Eds.): IDEAL 2000, LNCS. Springer-Verlag Berlin, pp. 139-144.2000.
13. M. Zhang and J. T. Yao, "A rough sets based approach to feature selection". Proc. IEEE Annual Meeting of Fuzzy Information NAFIP '04, pp. 434-439. 2004.
14. J. Zhang, J. Wang, D. Li, H. He, J. and Sun, "A new heuristic reduct algorithm base on rough sets theory", in G. Dong et al. (Eds.): WAIM 2003, LNCS. Springer-Verlag Berlin, pp. 247-253. 2003.
15. J.Z. Dong, N. Zhong and S. Ohsuga, "Using rough sets with heuristics to feature selection", In: New Directions in Rough Sets, Data Mining, Granular-Soft Computing (N. Zhong, A. Skowron, S. Ohsuga, Eds.). Berlin: Springer, pp. 178-187. 1999.
16. K. Hu, Y. Lu, and C. Shi, "Feature ranking in rough sets", Journal of AI Communications. 16(1): pp. 41-50. 2003.
17. C. Blake, E. Keogh, and C. J Merz, UCI repository of machine learning databases. University of California, Irvine, Department of Information and Computer Sciences. 1998.