Abstract
This paper deals with the relation between rough set reducts and typical testors from the logical combinatorial approach to pattern recognition. The main objective is to clarify once and for all that although in many cases the two concepts coincide, being rigorous they are not the same. Definitions, comments and observations are formally introduced and supported by illustrative examples. Furthermore, some theorems expressing theoretical relations between reducts and typical testors are enunciated and proved.
This work was partly supported by the National Council of Science and Technology of Mexico (CONACyT) through the project grant CB2008-106366.
Chapter PDF
Similar content being viewed by others
References
Bache, K., Lichman, M.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2013), http://archive.ics.uci.edu/ml
Bazan, J.G., Szczuka, M.S.: The Rough Set Exploration System. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III. LNCS, vol. 3400, pp. 37–56. Springer, Heidelberg (2005)
Cheguis, I.A., Yablonskii, S.V.: Logical methods of control of work of electric schemes. Trudy Mat. Inst. Steklov. 51, 270–360 (1958) (in Russian)
Chikalov, I., Lozin, V., Lozina, I., Moshkov, M., Nguyen, H.S., Skowron, A., Zielosko, B.: Three approaches to Data Analysis, Intelligent Systems Reference Library, vol. 41. Springer, Heidelberg (2013)
Dmitriev, A.N., Zhuravlev, Y.I., Krendelev, F.P.: On mathematical principles for objects and phenomena classification. Diskretny Analiz 7, 3–11 (1966) (in Russian)
Lazo-Cortes, M., Ruiz-Shulcloper, J., Alba-Cabrera, E.: An overview of the evolution of the concept of testor. Pattern Recognition 34(4), 753–762 (2001)
Miao, D.Q., Zhao, Y., Yao, Y.Y., Li, H.X., Xu, F.F.: Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model. Information Sciences 179(24), 4140–4150 (2009)
Pawlak, Z.: Rough sets. International Journal of Computer Information and Science 11, 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Dordrecht (1991)
Ruiz-Shulcloper, J.: Some questions about pattern recognition problems with non-disjoint classes. Editorial Academia, Havana (1995) (in Spanish)
Ruiz-Shulcloper, J., Abidi, M.A.: Logical Combinatorial Pattern Recognition: A Review. In: Pandalai, S.G. (ed.) Recent Research Developments in Pattern Recognition, pp. 133–176. Transwold Research Network, Kerala (2002)
Skowron, A., Rauszer, C.: 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, System Theory, Knowledge Engineering and Problem Solving, vol. 11, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)
Yablonskii, S.V., Cheguis, I.A.: On tests for electric circuits. Uspekhi Mat. Nauk 10(4), 182–184 (1955) (in Russian)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Lazo-Cortés, M.S., Martínez-Trinidad, J.F., Carrasco-Ochoa, J.A., Sanchez-Diaz, G. (2014). Are Reducts and Typical Testors the Same?. In: Bayro-Corrochano, E., Hancock, E. (eds) Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. CIARP 2014. Lecture Notes in Computer Science, vol 8827. Springer, Cham. https://doi.org/10.1007/978-3-319-12568-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-319-12568-8_36
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12567-1
Online ISBN: 978-3-319-12568-8
eBook Packages: Computer ScienceComputer Science (R0)