The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - Nov. (2012 vol.24)
pp: 2080-2093
Degang Chen , North China Electric Power University, Beijing
Suyun Zhao , Renmin University of China, China
Lei Zhang , The Hong Kong Polytechnic University, Hong Kong
Yongping Yang , North China Electric Power University, Beijing
Xiao Zhang , North China Electric Power University, Beijing
ABSTRACT
Attribute reduction is the strongest and most characteristic result in rough set theory to distinguish itself to other theories. In the framework of rough set, an approach of discernibility matrix and function is the theoretical foundation of finding reducts. In this paper, sample pair selection with rough set is proposed in order to compress the discernibility function of a decision table so that only minimal elements in the discernibility matrix are employed to find reducts. First relative discernibility relation of condition attribute is defined, indispensable and dispensable condition attributes are characterized by their relative discernibility relations and key sample pair set is defined for every condition attribute. With the key sample pair sets, all the sample pair selections can be found. Algorithms of computing one sample pair selection and finding reducts are also developed; comparisons with other methods of finding reducts are performed with several experiments which imply sample pair selection is effective as preprocessing step to find reducts.
INDEX TERMS
sample pair core, Rough set, attribute reduction, sample pair selection
CITATION
Degang Chen, Suyun Zhao, Lei Zhang, Yongping Yang, Xiao Zhang, "Sample Pair Selection for Attribute Reduction with Rough Set", IEEE Transactions on Knowledge & Data Engineering, vol.24, no. 11, pp. 2080-2093, Nov. 2012, doi:10.1109/TKDE.2011.89
REFERENCES
[1] C.L. Chang, "Finding Prototypes for Nearest Neighbor Classifiers," IEEE Trans. Computers, vol. C-23, no. 11, pp. 1179-1184, Nov. 1974.
[2] D.G. Chen, C.Z. Wang, and Q.H. Hu, "A New Approach to Attribute Reduction of Consistent and Inconsistent Covering Decision Systems with Covering Rough Sets," Information Sciences, vol. 177, pp. 3500-3518, 2007.
[3] Y.M. Chen, D.Q. Miao, and R.Z. Wang, "A Rough Set Approach to Feature Selection Based on Power Set Tree," Knowledge-Based Systems, vol. 24, pp. 275-281, Mar. 2011.
[4] B.V. Dasarathy, "Minimal Consistent Set (MCS) Identification for Optimal Nearest Neighbor Decision Systems Design," IEEE Trans. Systems, Man, and Cybernetics, vol. 24, no. 3, pp. 511-517, Mar. 1994.
[5] J. Federico, O. Fuentes, V. Alarcon-Aquino, and L. Garcia-Banuelos, "Instance Selection and Feature Weighting Using Evolutionary Algorithms," Proc. 15th IEEE Int'l Conf. Computing, pp. 73-79, Nov. 2006.
[6] P.E. Hart, "The Condensed Nearest Neighbor Rule," IEEE Trans. Information Theory, vol. IT-14, no. 3, pp. 515-516, May 1968.
[7] M. Inuiguchi, Y. Yoshioka, and Y. Kusunoki, "Variable-Precision Dominance-Based Rough Set Approach and Attribute Reduction," Int'l J. Approximate Reasoning, vol. 50, no. 8, pp. 1199-1214, 2009.
[8] F. Li and Y.Q. Yin, "Approaches to Knowledge Reduction of Covering Decision Systems Based on Information Theory," Information Sciences, vol. 179, no. 11, pp. 1694-1704, 2009.
[9] J.Y. Liang and Z.B. Xu, "The Algorithm on Knowledge Reduction in Incomplete Information Systems," Int'l J. Uncertainty Fuzziness and Knowledge-Based Systems, vol. 12, no. 5, pp. 651-672, 2004.
[10] Z.Q. Meng and Z.Z. Shi, "A Fast Approach to Attribute Reduction in Incomplete Decision Systems with Tolerance Relation-Based Rough Sets," Information Sciences, vol. 179, no. 16, pp. 2774-2793, 2009.
[11] D.Q. Miao, Y. Zhao, Y.Y. Yao, H.X. Li, and F.F. Xu, "Relative Reducts in Consistent and Inconsistent Decision Tables of the Pawlak Rough Set Model," Information Sciences, vol. 179, no. 24, pp. 4140-4150, 2009.
[12] S.H. Nguyen and H.S. Nguyen, "Some Efficient Algorithms for Rough Set Methods," Proc. Int'l Conf. Information Processing and Management of Uncertainty on Knowledge Based Systems, pp. 1451-1456, 1996.
[13] Z. Pawlak, "Rough Sets," Int'l J. Computer and Information Science, vol. 11, no. 5, pp. 341-356, 1982.
[14] Z. Pawlak, Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, 1991.
[15] Y.H. Qian and J.Y. Liang, "Combination Entropy and Combination Granulation in Rough Set Theory," Int'l J. Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 16, no. 2, pp. 179-193, 2008.
[16] Y.H. Qian, J.Y. Liang, D.Y. Li, F. Wang, and N.N. Ma, "Approximation Reduction in Inconsistent Incomplete Decision Tables," Knowledge-Based Systems, vol. 23, no. 5, pp. 427-433, 2010.
[17] Y.H. Qian, J.Y. Liang, W. Pedrycz, and C.Y. Dang, "Positive Approximation: An Accelerator for Attribute Reduction in Rough Set Theory," Artificial Intelligence, vol. 174, pp. 597-618, 2010.
[18] Y.H. Qian, J.Y. Liang, Y.Y. Yao, and C.Y. Dang, "MGRS: A Multi-Granulation Rough Set," Information Sciences, vol. 180, no. 6, pp. 949-970, 2010.
[19] A. Skowron and C. Rauszer, "The Discernibility Matrices and Functions in Information Systems," Intelligent Decision Support-Handbook of Applications and Advances of the Rough Sets Theory, R. Slowinski, ed., pp. 331-362, Kluwer Academic Publishers, 1992.
[20] D. Slezak, "Approximate Entropy Reducts," Fundamenta Informaticae, vol. 53, nos. 3/4, pp. 365-390, 2002.
[21] K. Thangavel and A. Pethalakshmi, "Dimensionality Reduction Based on Rough Set Theory: A Review," Applied Soft Computing, vol. 9, pp. 1-12, 2009.
[22] C. Vicente and J.F. Francesc, "Another Move toward the Minimum Consistent Subset: A Tabu Search Approach to the Condensed Nearest Neighbor Rule," IEEE Trans. Systems, Man, and Cybernetics, vol. 31, no. 3, pp. 408-413, June 2001.
[23] V. Cerverón and A. Fuertes, "Parallel Random Search and Tabu Search for the Minimal Consistent Subset Selection Problem," Proc. Second Int'l Workshop Randomization and Approximation Techniques in Computer Science, pp. 248-259, 1998.
[24] J. Wang and J. Wang, "Reduction Algorithms Based on Discernibility Matrix: The Ordered Attributes Method," J. Computer Science and Technology, vol. 16, pp. 489-504, 2001.
[25] J.Y. Wang and J. Zhou, "Research of Reduct Features in the Variable Precision Rough Set Model," Neurocomputing, vol. 72, nos. 10-12, pp. 2643-2648, 2009.
[26] X.Z. Wang, J.H. Yan, R. Wang, and C.R. Dong, "A Sample Selection Algorithm in Fuzzy Decision Tree Induction and Its Theoretical Analyses," Proc. IEEE Int'l Conf. Systems, Man and Cybernetics, pp. 3621-3626, Oct. 2007.
[27] L. Wei and J.J. Qi, "Relation between Concept Lattice Reduction and Rough Set Reduction," Knowledge-Based Systems, vol. 23, no. 8, pp. 934-938, 2010.
[28] D.R. Wilson and T.R. Martinez, "Reduction Techniques for Instance-Based Learning Algorithms," Machine Learning, vol. 38, pp. 257-286, 2000.
[29] UCI Machine Learning Repository, http://www.ics.uci.edu/~mlearnMLRepository.html , 2005.
[30] Y.Y. Yao and Y. Zhao, "Discernibility Matrix Simplification for Constructing Attribute Reducts," Information Sciences, vol. 179, pp. 867-882, 2009.
[31] Y.F. Yuan and M.J. Shaw, "Introduction of Fuzzy Decision Tree," Fuzzy Sets and Systems, vol. 69, pp. 125-139, 1995.
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool