Abstract
Metric technique has recently been applied to solve such data mining problems as classification, clustering, feature selection, decision tree construction. In this paper, we apply metric technique to solve a attribute reduction problem of incomplete decision tables in rough set theory. We generalize Liang entropy in incomplete information systems and investigate its properties. Based on the generalized Liang entropy, we establish a metric between coverings and study its properties for attribute reduction. Consequently, we propose a metric based attribute reduction method in incomplete decision tables and perform experiments on UCI data sets. The experimental results show that metric technique is an effective method for attribute reduction in incomplete decision tables.
The authors are supported by grants 2011/01/B/ST6/03867 from the Polish National Science Centre (NCN), and the grant SP/I/1/77065/10 in frame of the strategic scientific research and experimental development program: “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information” founded by the Polish National Centre for Research and Development (NCBiR).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dai, X.P., Xiong, D.H.: Research on Heuristic Knowledge Reduction Algorithm for Incomplete Decision Table. In: 2010 International Conference on Internet Technology and Applications, pp. 1–3. IEEE (2010)
Deza, M.M., Deza, E.: Encyclopedia of Distances. Springer (2009)
Huang, B., He, X., Zhou, X.Z.: Rough Computational methods based on tolerance matrix. Acta Automatica Sinica 30, 363–370 (2004)
Huang, B., Li, H.X., Zhou, X.Z.: Attribute Reduction Based on Information Quantity under Incomplete Information Systems. Systems Application Theory and Practice 34, 55–60 (2005)
Kryszkiewicz, M.: Rough set approach to incomplete information systems. Information Science 112, 39–49 (1998)
Liang, J.Y., Chin, K.S., Dang, C.Y., Richard, C.M.Y.: New method for measuring uncertainty and fuzziness in rough set theory. International Journal of General Systems 31, 331–342
Liang, J.Y., Qian, Y.H.: Axiomatic approach of knowledge granulation in information system. In: Sattar, A., Kang, B.-H. (eds.) AI 2006. LNCS (LNAI), vol. 4304, pp. 1074–1078. Springer, Heidelberg (2006)
Liang, J.Y., Qian, Y.H.: Information granules and entropy theory in information systems. Information Sciences 51, 1–18 (2008)
Liang, J.Y., Shi, Z.Z., Li, D.Y., Wierman, M.J.: The information entropy, rough entropy and knowledge granulation in incomplete information system. International Journal of General Systems 35(6), 641–654 (2006)
Nguyen, L.G.: Metric Based Attribute Reduction in Decision Tables. In: The 2012 International Workshop on Rough Sets Applications (RSA 2012), FedCSIS Proceedings, pp. 333–338 (2012), http://fedcsis.org/proceedings/fedcsis2012/
Pawlak, Z.: Rough sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers (1991)
Qian, Y.H., Liang, J.Y.: Combination Entropy and Combination Granulation in Incomplete Information System. In: Wang, G.-Y., Peters, J.F., Skowron, A., Yao, Y. (eds.) RSKT 2006. LNCS (LNAI), vol. 4062, pp. 184–190. Springer, Heidelberg (2006)
Qian, Y.H., Liang, J.Y.: New method for measuring uncertainty in incomplete information systems. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (2008)
Qian, Y.H., Liang, J.Y., Dang, C.Y.: Knowledge structure, knowledge granulation and knowledge distance in a knowledge base. International Journal of Approximate Reasoning 50, 174–188 (2009)
Qian, Y.H., Liang, J.Y., Dang, C.Y., Wang, F., Xu, W.: Knowledge distance in information systems. Journal of Systems Science and Systems Engineering 16, 434–449 (2007)
Mantaras, R.L.: A Distance-Based Attribute Selection Measure for Decision Tree Induction. Machine Learning 6(1), 81–92 (1991)
Shifei, D., Hao, D.: Research and Development of Attribute Reduction Algorithm Based on Rough Set. In: IEEE, CCDC 2010, pp. 648–653 (2010)
Simovici, D.A., Jaroszewicz, S.: Generalized conditional entropy and decision trees. In: Proceeding of EGC, Lyon, France, pp. 369–380 (2003)
Simovici, D.A., Jaroszewicz, S.: A new metric splitting criterion for decision trees. International Journal of Parallel Emergent and Distributed Systems 21(4), 239–256 (2006)
The UCI machine learning repository, http://archive.ics.uci.edu/ml/datasets.html
Zhang, Q.G., Zheng, X.F., Xu, Z.Y.: Efficient Attribute Reduction Algorithm Based on Incomplete Decision Table. In: 2009 Second International Conference on Intelligent Computation Technology and Automation, pp. 192–195. IEEE (2009)
Zhou, X.Z., Huang, B.: Rough set-based attribute reduction under incomplete Information Systems. Journal of Nanjing University of Science and Technology 27, 630–636 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, L.G., Nguyen, H.S. (2013). Metric Based Attribute Reduction in Incomplete Decision Tables. In: Ciucci, D., Inuiguchi, M., Yao, Y., Ślęzak, D., Wang, G. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2013. Lecture Notes in Computer Science(), vol 8170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41218-9_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-41218-9_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-41217-2
Online ISBN: 978-3-642-41218-9
eBook Packages: Computer ScienceComputer Science (R0)