Abstract
Rough set is a widespread concept in computer science and is applicable in many fields such as artificial intelligence, expert systems, data mining, pattern recognition and decision support systems. One of key problems of knowledge acquisition in theoretical study of rough sets is attribute reduction. Attribute reduction also called feature selection eliminates superfluous attributes in the information system and improves efficiency of data analysis process. But reducing attributes is a NP-hard problem. Recently, to overcome the technical difficulty, there are a lot of research on new approaches such as maximal tolerance classification (Fang Yang et al. 2010), genetic algorithm (N. Ravi Shankar et al. 2010), topology and measure of significance of attributes (P.G. JansiRani and R. Bhaskaran 2010), soft set (Tutut Herawan et al. 2010), positive approximation (Yuhua Qian et al. 2010), dynamic programming (Walid Moudani et al. 2010). However, there are still some challenging research issues that time consumption is still hard problem in attribute reduction. This paper introduces a new approach with a model presented with definitions, theorems, operations. Set of maximal random prior forms is put forward as an effective way for attribute reduction. The algorithm for seeking maximal random prior set are proposed with linear complexity, contributes to solve absolutely problems in attribute reduction and significantly improve the speed of calculation and data analysis.
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
Yang, F., Guan, Y., Li, S., Du, L.: Attributes reduct and decision rules optimization based on maximal tolerance classification in incomplete information systems with fuzzy decisions. Journal of Systems Engineering and Electronics 21(6), 995–999 (2010)
Ravi Shankar, N., Srikanth, T., Ravi Kumar, B., Ananda Rao, G.: Genetic Algorithm for Object Oriented Reducts Using Rough Set Theory. International Journal of Algebra 4(17), 827–842 (2010)
Sakr, N., Alsulaiman, F.A., Valdés, J.J., Saddik, A.E., Georganas, N.D.: Feature Selection in Haptic-based Handwritten Signatures Using Rough Sets. In: IEEE International Conference on Fuzzy Systems (2010)
JansiRani, P.G., Bhaskaran, R.: Computation of Reducts Using Topology and Measure of Significance of Attributes. Journal of Computing 2(3), 2151–9617 (2010) ISSN 2151-9617
Herawan, T., Ghazali, R., Deris, M.M.: Soft Set Theoretic Approach for Dimensionality Reduction. International Journal of Database Theory and Application 3(2) (June 2010)
Qian, Y., Liang, J., Pedrycz, W., Dang, C.: Positive approximation: An accelerator for attribute reduction in rough set theory. Artificial Intelligence 174(9-10) (June 2010)
Moudani, W., Shahin, A., Chakik, F., Mora-Camino, F.: Optimistic Rough Sets Attribute Reduction using Dynamic Programming. International Journal of Computer Science & Engineering Technology 1(2) (2010)
Chang, F.M.: Data Attribute Reduction using Binary Conversion. WSEAS Transactions On Computers 8(7) (July 2009)
Wu, H.: A New Discernibility Matrix Based on Distribution Reduction. In: Proceedings of the International Symposium on Intelligent Information Systems and Applications (IISA 2009), Qingdao, P. R. China, October 28-30, pp. 390–393 (2009)
Lee, M.-C.: An Enterprise Financial Evaluation Model Based on Rough Set theory with Information Entropy. International Journal of Digital Content Technology and its Applications 3(1) (March 2009)
Parthaláin, N.M., Shen, Q., Jensen, R.: A Distance Measure Approach to Exploring the Rough Set Boundary Region for Attribute Reduction. IEEE Transactions On Knowledge And Data Engineering 22 (2009)
Yao, Y., Zhao, Y.: Discernibility Matrix Simplification for Constructing Attribute Reducts. Information Sciences 179(5), 867–882 (2009)
Liu, H., Abraham, A., Li, Y.: Nature Inspired Population-based Heuristics for Rough Set Reduction. In: Abraham, A., Falcón, R., Bello, R. (eds.) Rough Set Theory. SCI, vol. 174, pp. 261–278. Springer, Heidelberg (2008)
Liu, J., Mi, J.-S.: A Novel Approach to Attribute Reduction in Formal Concept Lattices. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 426–433. Springer, Heidelberg (2008)
Parthaláin, N.M., Shen, Q., Jensen, R.: Finding Fuzzy-Rough Reducts with Fuzzy Entropy. In: IEEE International Conference on Fuzzy Systems (2008)
Sun, X., Tang, X., Zeng, H., Zhou, S.: A Heuristic Algorithm Based on Attribute Importance for Feature Selection. In: Wang, G., Li, T., Grzymala-Busse, J.W., Miao, D., Skowron, A., Yao, Y. (eds.) RSKT 2008. LNCS (LNAI), vol. 5009, pp. 189–196. Springer, Heidelberg (2008)
Yang, M., Chen, S., Yang, X.: A novel approach of rough set-based attribute reduction using fuzzy discernibility matrix. In: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery, vol. 03 (2007)
Hu, Q.-H., Zhao, H., Xie, Z.-X., Yu, D.-R.: Consistency Based Attribute Reduction. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4426, pp. 96–107. Springer, Heidelberg (2007)
Tan, S., Cheng, X., Xu, H.: An Efficient Global Optimization Approach for Rough Set Based Dimensionality Reduction. In: ICIC International, pp. 725–736 (2007)
Pawlak, Z.: Rough Sets. In: The Tarragona University Seminar on Formal Languages and Rough Sets (August 2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, TT., Nguyen, VL.H., Nguyen, PK. (2012). A Bit-Chain Based Algorithm for Problem of Attribute Reduction. In: Pan, JS., Chen, SM., Nguyen, N.T. (eds) Intelligent Information and Database Systems. ACIIDS 2012. Lecture Notes in Computer Science(), vol 7196. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28487-8_44
Download citation
DOI: https://doi.org/10.1007/978-3-642-28487-8_44
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-28486-1
Online ISBN: 978-3-642-28487-8
eBook Packages: Computer ScienceComputer Science (R0)