Received: 25-04-2013
Accepted: 20-09-2013
DOI:
Views
Downloads
How to Cite:
An Algorithm to Find the Attibute Reduction by Using Discernibility Matrix
Keywords
Information systems, discernibility matrix, attribute reduction
Abstract
The information systems help users backup and process information. However, some reasons of apdating backup information having redundant attributes make it difficult for exploring knowledge. Thus, the attribute reductions are essential requirements for mining knowledge. There exist several types of attribute reduction and decision rules that have been proposed in data mining. The present paper described a heuristic algorithm to find the reduction on decision table based on the discernibility matrix.
References
Hoa N. S. and N. H. Son (1996). Some efficient algorithms for rough set methods. Proceedings of International Conference on Information processing Management of Uncertainty in Knowledge – based Systems, pp. 1451 – 1456.
Klemettinen M., H. Mannila, P. Ronkainen, H. Toivonen, and A. I. Verkamo (1994). Finding interesting rules from large sets of discovered association rules, Third International Conference on Information and Knowledge Management (CIKM’94), ACM Press, p. 401– 407.
Pawlak Z. (1982). Rough sets, International Journal of computer and information sciences 11(5): 341-356.
Pawlak Z. (1991). Rough sets- Theoretical aspects of reasoning about data, Kluwer academic publishers, Dordrecht – Netherlands.
Pawlak Z. (1998). Rough sets elements, Institute of theoretical and applied informattics, Polish Academy of Sciences.
Qian J. (2009). Applying Indiscernibility Attribute to Attribute Reduction Based on Discernibility Matrix, Environmental Science and Information Application Technology. ESIAT 2009 International Conference on, 2: 397 - 400.
Z. and B. Yang (2009). An Efficient Algorithm for Pawlak Reduction Based on Simplified Discernibility Matrix, : , 54: 610-619.
Zhang L. and S. Gao(2012). Attribute reduction with discernibility matrix approaches, 24th Chinese control and decision conference, p. 2070 - 2072.