Abstract
Probabilistic rough sets (PRS), a generalization of Pawlak rough sets, have become increasingly successful in dealing with inconsistent information systems. Over the last few decades, rough sets with a probabilistic approach have been applied extensively for data pre-processing, analysis, and decision rule generation in the areas such as data mining and knowledge discovery, pattern recognition, and machine learning. Finding the approximations, both lower and upper are the fundamental steps in PRS or in any generalization derived from rough set theory. With the massive and rapid increase in data generation, computing approximations effectively using the existing traditional probabilistic approaches is turning out to be a challenging task. Recent advances in parallel processing techniques and tools like MapReduce, Apache Hadoop, and Apache Spark have ushered in the development of computationally efficient methods for the analysis of massively large datasets. This paper presents an algorithm by name parallel algorithm for computing probabilistic rough set approximations (PACPRSA), for computing regions and approximations using PRS in parallel. The results of extensive experimentation suggest that the proposed parallel algorithm evidently performs well in standard scalability metrics and therefore is well suited for application on contemporary large datasets.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11(5):341–356. https://doi.org/10.1007/BF01001956
Thangavel K, Pethalakshmi A (2009) Dimensionality reduction based on rough set theory: a review. Appl Soft Comput J. https://doi.org/10.1016/j.asoc.2008.05.006
Chebrolu S, Sanjeevi SG (2015) Attribute reduction on continuous data in rough set theory using ant colony optimization metaheuristic. https://doi.org/10.1145/2791405.2791438
Jia X, Shang L, Zhou B, Yao Y (2016) Generalized attribute reduct in rough set theory. Knowl Based Syst. https://doi.org/10.1016/j.knosys.2015.05.017
Greco S, Matarazzo B, Slowinski R (2001) Rough sets theory for multicriteria decision analysis. Eur J Oper Res 129(1):1–47. https://doi.org/10.1016/S0377-2217(00)00167-3
Grzymala-Busse JW (1992) LERS—a system for learning from examples based on rough sets. Intell Decis Support 3–18. https://doi.org/10.1007/978-94-015-7975-9_1
Yao YY, Wong SKM, Lingras P (1990) A decision-theoretic rough set model. Methodol Intell Syst 5:17–27
Ziarko W (1993) Variable precision rough set model. J Comput Syst Sci 46(1):39–59. https://doi.org/10.1016/0022-0000(93)90048-2
Ślęzak D, Ziarko W (2002) Bayesian rough set model. In: Proceedings of the international workshop on foundation of data mining (FDM’2002), 9 Dec 2002, Maebashi, Japan, pp 131–135
Greco S, Matarazzo B, Słowiński R (2005) Rough membership and Bayesian confirmation measures for parameterized rough sets. In: RSFDGrC 2005: Rough sets, fuzzy sets, data mining, and granular computing. LNCS, vol 3641, pp 314–324. https://doi.org/10.1007/11548669_33
Yao Y, Zhou B (2010) Naive Bayesian rough sets. In: RSKT 2010: Rough set and knowledge technology, Oct 2010. LNCS, vol 6401, pp 719–726. https://doi.org/10.1007/978-3-642-16248-0_97
Ślȩzak D, Ziarko W (2005) The investigation of the Bayesian rough set model. Int J Approximate Reasoning 40(1–2):81–91. https://doi.org/10.1016/j.ijar.2004.11.004
Zhang H, Zhou J, Miao D, Gao C (2012) Bayesian rough set model: a further investigation. Int J Approximate Reasoning 53(4):541–557. https://doi.org/10.1016/j.ijar.2011.12.006
Greco S, Matarazzo B, Słowiński R (2008) Parameterized rough set model using rough membership and Bayesian confirmation measures. Int J Approximate Reasoning 49(2):285–300. https://doi.org/10.1016/j.ijar.2007.05.018
Deng X, Yao Y (2012) An information-theoretic interpretation of thresholds in probabilistic rough sets. In: RSKT 2012: Rough sets and knowledge technology. LNCS, vol 7414, pp 369–378. https://doi.org/10.1007/978-3-642-31900-6_46
Pawlak Z, Wong SKM, Ziarko W (1988) Rough sets: probabilistic versus deterministic approach. Int J Man Mach Stud 29(1):81–95. https://doi.org/10.1016/S0020-7373(88)80032-4
Yao YY, Wong SKM (1992) A decision theoretic framework for approximating concepts. Int J Man Mach Stud 37(6):793–809. https://doi.org/10.1016/0020-7373(92)90069-W
Grzymala-Busse JW, Clark PG, Kuehnhausen M (2014) Generalized probabilistic approximations of incomplete data. Int J Approximate Reasoning 55(1), Part 2, 180–196. https://doi.org/10.1016/j.ijar.2013.04.007
Ma J, Zou C, Pan X (2017) Structured probabilistic rough set approximations. Int J Approximate Reasoning 90:319–332. https://doi.org/10.1016/J.IJAR.2017.08.004
Dean J, Ghemawat S (2010) Map reduce: a flexible data processing tool. Commun ACM. https://doi.org/10.1145/1629175.1629198
Yang Y, Chen Z, Liang Z, Wang G (2010) Attribute reduction for massive data based on rough set theory and MapReduce. In: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and Lecture notes in bioinformatics). LNAI, Oct 2010, vol 6401, pp 672–678. https://doi.org/10.1007/978-3-642-16248-0_91
Qian J, Miao D, Zhang Z, Yue X (2014) Parallel attribute reduction algorithms using MapReduce. Inf Sci (NY). https://doi.org/10.1016/j.ins.2014.04.019
Zhang J, Li T, Pan Y (2014) PLAR: parallel large-scale attribute reduction on cloud systems. https://doi.org/10.1109/PDCAT.2013.36
White T (2012) Hadoop: the definitive guide, 4th edn. Online. citeulike-article-id:4882841
Zhang J, Wong JS, Pan Y, Li T (2015) A parallel matrix-based method for computing approximations in incomplete information systems. IEEE Trans Knowl Data Eng 27(2):326–339. https://doi.org/10.1109/TKDE.2014.2330821
Zaharia M et al (2016) Apache spark: a unified engine for big data processing. Commun ACM 59(11):56–65. https://doi.org/10.1145/2934664
Asuncion A, Newman DJ (2007) UCI machine learning repository: data sets. University of California Irvine School of Information. https://archive.ics.uci.edu/ml/index.php
Acknowledgements
Authors acknowledge the sponsorship received from the Science and Engineering Research Board (SERB), the Department of Science and Technology (DST), Government of India, under the scheme of Empowerment and Equity Opportunities for Excellence in Science (Sanction Order No. EEQ/2019/000470).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Turaga, V., Chebrolu, S. (2023). Parallel Computation of Probabilistic Rough Set Approximations. In: Tiwari, R., Pavone, M.F., Ravindranathan Nair, R. (eds) Proceedings of International Conference on Computational Intelligence. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-19-2126-1_34
Download citation
DOI: https://doi.org/10.1007/978-981-19-2126-1_34
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-2125-4
Online ISBN: 978-981-19-2126-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)