Abstract
We discuss applications of random probes in a process of computation and assessment of approximate reducts. By random probes we mean artificial attributes, generated independently from a decision vector but having similar value distributions to the attributes in the original data. We introduce a concept of a randomized reduct which is a reduct constructed solely from random probes and we show how to use it for unsupervised evaluation of attribute sets. We also propose a modification of the greedy heuristic for a computation of approximate reducts, which reduces a chance of including irrelevant attributes into a reduct. To support our claims we present results of experiments on high dimensional data. Analysis of obtained results confirms usefulness of random probes in a search for informative attribute sets.
Partly supported by Polish National Science Centre (NCN) grants DEC-2011/01/B/ST6/03867 and DEC-2012/05/B/ST6/03215, and by National Centre for Research and Development (NCBiR) grant SP/I/1/77065/10 by the strategic scientific research and experimental development program: “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.
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
Modrzejewski, M.: Feature Selection Using Rough Sets Theory. In: Brazdil, P.B. (ed.) ECML 1993. LNCS, vol. 667, pp. 213–226. Springer, Heidelberg (1993)
Pawlak, Z.: Rough Sets: Present State and the Future. Foundations of Computing and Decision Sciences 18(3-4), 157–166 (1993)
Błaszczyński, J., Słowiński, R., Susmaga, R.: Rule-Based Estimation of Attribute Relevance. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS, vol. 6954, pp. 36–44. Springer, Heidelberg (2011)
Jensen, R., Shen, Q.: New Approaches to Fuzzy-Rough Feature Selection. IEEE Transactions on Fuzzy Systems 17(4), 824–838 (2009)
Janusz, A., Ślęzak, D.: Rough Set Methods for Attribute Clustering and Selection. Applied Artificial Intelligence 28(3), 220–242 (2014)
Świniarski, R.W., Skowron, A.: Rough Set Methods in Feature Selection and Recognition. Pattern Recognition Letters 24(6), 833–849 (2003)
Kohavi, R., John, G.H.: Wrappers for Feature Subset Selection. Artificial Intelligence 97, 273–324 (1997)
Ślęzak, D.: Approximate Reducts in Decision Tables. In: Proceedings of IPMU 1996, vol. 3, pp. 1159–1164 (1996)
Abeel, T., Helleputte, T., de Peer, Y.V., Dupont, P., Saeys, Y.: Robust Biomarker Identification for Cancer Diagnosis with Ensemble Feature Selection Methods. Bioinformatics 26(3), 392–398 (2010)
Guyon, I., Gunn, S., Nikravesh, M., Zadeh, L. (eds.): Feature Extraction, Foundations and Applications. STUDFUZZ, vol. 207. Physica-Verlag, Springer (2006)
Janusz, A., Stawicki, S.: Applications of Approximate Reducts to the Feature Selection Problem. In: Yao, J., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS, vol. 6954, pp. 45–50. Springer, Heidelberg (2011)
Nguyen, H.S.: Approximate Boolean Reasoning: Foundations and Applications in Data Mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V. LNCS, vol. 4100, pp. 334–506. Springer, Heidelberg (2006)
Skowron, A., Rauszer, C.: The Discernibility Matrices and Functions in Information Systems. In: Słowiński, R. (ed.) Intelligent Decision Support. Theory and Decision Library, vol. 11, pp. 331–362. Kluwer (1992)
Bazan, J.G., Skowron, A., Synak, P.: Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS, vol. 869, pp. 346–355. Springer, Heidelberg (1994)
Ślęzak, D., Janusz, A.: Ensembles of Bireducts: Towards Robust Classification and Simple Representation. In: Kim, T.-h., Adeli, H., Slezak, D., Sandnes, F.E., Song, X., Chung, K.-I., Arnett, K.P. (eds.) FGIT 2011. LNCS, vol. 7105, pp. 64–77. Springer, Heidelberg (2011)
Ślęzak, D.: Various Approaches to Reasoning with Frequency-Based Decision Reducts: A Survey. In: Polkowski, L., Lin, T., Tsumoto, S. (eds.) Rough Sets in Soft Computing and Knowledge Discovery: New Developments, pp. 235–285. Physica-Verlag (2000)
Widz, S., Ślęzak, D.: Approximation Degrees in Decision Reduct-Based MRI Segmentation. In: Proceedings of FBIT 2007, pp. 431–436 (2007)
R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2008)
Soman, K.P., Diwakar, S., Ajay, V.: Insight into Data Mining: Theory and Practice. Prentice-Hall (2006)
Janusz, A., Nguyen, H.S., Ślęzak, D., Stawicki, S., Krasuski, A.: JRS’2012 Data Mining Competition: Topical Classification of Biomedical Research Papers. In: Yao, J., Yang, Y., Słowiński, R., Greco, S., Li, H., Mitra, S., Polkowski, L. (eds.) RSCTC 2012. LNCS (LNAI), vol. 7413, pp. 422–431. Springer, Heidelberg (2012)
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
Janusz, A., Ślęzak, D. (2014). Random Probes in Computation and Assessment of Approximate Reducts. In: Kryszkiewicz, M., Cornelis, C., Ciucci, D., Medina-Moreno, J., Motoda, H., Raś, Z.W. (eds) Rough Sets and Intelligent Systems Paradigms. Lecture Notes in Computer Science(), vol 8537. Springer, Cham. https://doi.org/10.1007/978-3-319-08729-0_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-08729-0_5
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08728-3
Online ISBN: 978-3-319-08729-0
eBook Packages: Computer ScienceComputer Science (R0)