{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:29:59Z","timestamp":1758274199608,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":60,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662627976"},{"type":"electronic","value":"9783662627983"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-662-62798-3_5","type":"book-chapter","created":{"date-parts":[[2020,12,16]],"date-time":"2020-12-16T20:09:07Z","timestamp":1608149347000},"page":"252-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Similarity-based Rough Sets and Its Applications in Data Mining"],"prefix":"10.1007","author":[{"given":"D\u00e1vid","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,17]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Aigner, M.: Enumeration via ballot numbers. Discrete Math. 308(12), 2544\u20132563 (2008). https:\/\/doi.org\/10.1016\/j.disc.2007.06.012, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0012365X07004542","DOI":"10.1016\/j.disc.2007.06.012"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Altman, A., Tennenholtz, M.: Ranking systems: the PageRank axioms. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 1\u20138. ACM (2005)","DOI":"10.1145\/1064009.1064010"},{"key":"5_CR3","unstructured":"Aszal\u00f3s, L., Bak\u00f3, M.: Advanced search methods (in Hungarian) (2012). http:\/\/morse.inf.unideb.hu\/~aszalos\/diak\/fka"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.indag.2015.09.004","volume":"27","author":"L Aszal\u00f3s","year":"2016","unstructured":"Aszal\u00f3s, L., Hajdu, L., Peth\u0151, A.: On a correlational clustering of integers. Indagationes Mathematicae 27(1), 173\u2013191 (2016)","journal-title":"Indagationes Mathematicae"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Aszal\u00f3s, L., Nagy, D.: Visualization of tolerance relations. In: G\u00e1bor, Kusper; Roland, K. (ed.) Proceedings of the 10th International Conference on Applied Informatics, pp. 15\u201322 (2018)","DOI":"10.14794\/ICAI.10.2017.15"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-030-22815-6_7","volume-title":"Rough Sets","author":"L Aszal\u00f3s","year":"2019","unstructured":"Aszal\u00f3s, L., Nagy, D.: Iterative set approximations based on tolerance relation. In: Mih\u00e1lyde\u00e1k, T., et al. (eds.) Rough Sets, pp. 78\u201390. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22815-6_7"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Aszal\u00f3s, L., Nagy, D.: Selecting representatives. In: Ganzha, M., Maciaszek, L., Paprzycki, M. (eds.) Communication Papers of the 2019 Federated Conference on Computer Science and Information Systems. Annals of Computer Science and Information Systems, vol. 20, pp. 13\u201319. PTI (2019). https:\/\/doi.org\/10.15439\/2019F95","DOI":"10.15439\/2019F95"},{"issue":"1\u20133","key":"5_CR8","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1\u20133), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"5_CR9","unstructured":"Becker, H.: A survey of correlation clustering. Advanced Topics in Computational Learning Theory, pp. 1\u201310 (2005)"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Bello, R., Falcon, R.: Rough Sets in Machine Learning: A Review, pp. 87\u2013118. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-54966-8_5","DOI":"10.1007\/978-3-319-54966-8_5"},{"key":"5_CR11","unstructured":"Brownlee, J.: Clever Algorithms: Nature-Inspired Programming Recipes. 1st edn. Lulu.com (2011)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-0-387-34749-3_3","volume-title":"Professional Practice in Artificial Intelligence","author":"Y Caballero","year":"2006","unstructured":"Caballero, Y., Bello, R., Alvarez, D., Gareia, M.M., Pizano, Y.: Improving the K-NN method: rough set in edit training set. In: Debenham, J. (ed.) Professional Practice in Artificial Intelligence, pp. 21\u201330. Springer, Boston (2006)"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Ciucci, D., Mih\u00e1lyde\u00e1k, T., Csajb\u00f3k, Z.E.: On Definability and Approximations in Partial Approximation Spaces, pp. 15\u201326. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11740-9_2","DOI":"10.1007\/978-3-319-11740-9_2"},{"key":"5_CR14","unstructured":"Csajb\u00f3k, Z., Mih\u00e1lyde\u00e1k, T.: From vagueness to rough sets in partial approximation spaces. In: JRS2014 (submitted, 2014)"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Csajb\u00f3k, Z., Mih\u00e1lyde\u00e1k, T.: A general set theoretic approximation framework. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R. (eds.) Advances on Computational Intelligence, Communications in Computer and Information Science, vol. 297, pp. 604\u2013612. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31709-5_61","DOI":"10.1007\/978-3-642-31709-5_61"},{"key":"5_CR16","unstructured":"Csajb\u00f3k, Z., Mih\u00e1lyde\u00e1k, T.: Partial approximative set theory: a generalization of the rough set theory. Int. J. Comput. Inf. Syst. Ind. Manag. Appl. 4, 437\u2013444 (2012)"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-7908-1773-7_28","volume-title":"Soft Methods in Probability, Statistics and Data Analysis","author":"D Delic","year":"2002","unstructured":"Delic, D., Lenz, H.J., Neiling, M.: Improving the quality of association rule mining by means of rough sets. In: Grzegorzewski, P., Hryniewicz, O., Gil, M.\u00c1. (eds.) Soft Methods in Probability, Statistics and Data Analysis, pp. 281\u2013288. Physica-Verlag HD, Heidelberg (2002)"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Dubois, D., Prade, H.: Twofold fuzzy sets and rough sets\u2013some issues in knowledge representation. Fuzzy Sets Syst. 23(1), 3\u201318 (1987). https:\/\/doi.org\/10.1016\/0165-0114(87)90096-0, http:\/\/www.sciencedirect.com\/science\/article\/pii\/0165011487900960. fuzzy Information Processing in Artificial Intelligence and Operations Research","DOI":"10.1016\/0165-0114(87)90096-0"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Dubois, D., Prade, H.: Rough fuzzy sets and fuzzy rough sets*. Int. J. Gener. Syst. 17(2\u20133), 191\u2013209 (1990). https:\/\/doi.org\/10.1080\/03081079008935107","DOI":"10.1080\/03081079008935107"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"D\u00fcntsch, I., Gediga, G.: Approximation Operators in Qualitative Data Analysis, pp. 214\u2013230. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24615-2_10","DOI":"10.1007\/978-3-540-24615-2_10"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"D\u00e1vid, N., L\u00e1szl\u00f3 Aszal\u00f3s, T.M.: Finding the representative in a cluster using correlation clustering. Pollack Periodica 14(1), 15\u201324 (2019). https:\/\/doi.org\/10.1556\/606.2019.14.1.2","DOI":"10.1556\/606.2019.14.1.2"},{"key":"5_CR22","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On random graphs I. Publ. Math. Debrecen 6, 290 (1959)","journal-title":"Publ. Math. Debrecen"},{"key":"5_CR23","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. In: Publication of the Mathematical Institute of the Hungarian Academy of Sciences, pp. 17\u201361 (1960)"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Filiberto, Y., Caballero, Y., Larrua, R., Bello, R.: A method to build similarity relations into extended rough set theory. In: 2010 10th International Conference on Intelligent Systems Design and Applications, pp. 1314\u20131319, November 2010. https:\/\/doi.org\/10.1109\/ISDA.2010.5687091","DOI":"10.1109\/ISDA.2010.5687091"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Gogoi, P., Bhattacharyya, D.K., Kalita, J.K.: A rough set-based effective rule generation method for classification with an application in intrusion detection. Int. J. Secur. Netw. 8(2), 61\u201371 (2013). https:\/\/doi.org\/10.1504\/IJSN.2013.055939","DOI":"10.1504\/IJSN.2013.055939"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Greco, S., Matarazzo, B., S\u0142owi\u0144ski, R.: Parameterized rough set model using rough membership and bayesian confirmation measures. Int. J. Approx. Reason. 49(2), 285\u2013300 (2008). https:\/\/doi.org\/10.1016\/j.ijar.2007.05.018, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X0700151X. special Section on Probabilistic Rough Sets and Special Section on PGM\u201906","DOI":"10.1016\/j.ijar.2007.05.018"},{"key":"5_CR27","doi-asserted-by":"publisher","unstructured":"Grzymala-Busse, J.W.: LERS-A System for Learning from Examples Based on Rough Sets, pp. 3\u201318. Springer, Dordrecht (1992). https:\/\/doi.org\/10.1007\/978-94-015-7975-9_1","DOI":"10.1007\/978-94-015-7975-9_1"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Guan, J.W., Bell, D.A., Liu, D.Y.: The rough set approach to association rule mining. In: Third IEEE International Conference on Data Mining, pp. 529\u2013532, November 2003. https:\/\/doi.org\/10.1109\/ICDM.2003.1250969","DOI":"10.1109\/ICDM.2003.1250969"},{"key":"5_CR29","doi-asserted-by":"publisher","unstructured":"Hu, Q., Yu, D., Liu, J., Wu, C.: Neighborhood rough set based heterogeneous feature subset selection. Inf. Sci. 178(18), 3577\u20133594 (2008). https:\/\/doi.org\/10.1016\/j.ins.2008.05.024, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025508001643","DOI":"10.1016\/j.ins.2008.05.024"},{"key":"5_CR30","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-54756-0_7","volume":"17","author":"A Janusz","year":"2014","unstructured":"Janusz, A.: Algorithms for similarity relation learning from high dimensional data. Trans. Rough Sets 17, 174\u2013292 (2014)","journal-title":"Trans. Rough Sets"},{"key":"5_CR31","doi-asserted-by":"publisher","unstructured":"Lenarcik, A., Piasta, Z.: Discretization of Condition Attributes Space, pp. 373\u2013389. Springer, Dordrecht (1992). https:\/\/doi.org\/10.1007\/978-94-015-7975-9_23","DOI":"10.1007\/978-94-015-7975-9_23"},{"issue":"6","key":"5_CR32","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/j.ins.2010.11.016","volume":"181","author":"A Mani","year":"2011","unstructured":"Mani, A.: Choice inclusive general rough semantics. Inf. Sci. 181(6), 1097\u20131115 (2011)","journal-title":"Inf. Sci."},{"key":"5_CR33","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-319-99368-3_21","volume-title":"Rough Sets","author":"T Mih\u00e1lyde\u00e1k","year":"2018","unstructured":"Mih\u00e1lyde\u00e1k, T.: Logic on similarity based rough sets. In: Nguyen, H.S., Ha, Q.T., Li, T., Przyby\u0142a-Kasperek, M. (eds.) Rough Sets, pp. 270\u2013283. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99368-3_21"},{"key":"5_CR34","doi-asserted-by":"publisher","unstructured":"Mises, R.V., Pollaczek-Geiringer, H.: Praktische verfahren der gleichungsaufl\u00f6sung. ZAMM - Journal of Applied Mathematics and Mechanics \/ Zeitschrift f\u00fcr Angewandte Mathematik und Mechanik 9(2), 152\u2013164 (1929). https:\/\/doi.org\/10.1002\/zamm.19290090206, https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/zamm.19290090206","DOI":"10.1002\/zamm.19290090206"},{"key":"5_CR35","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-31900-6_48","volume-title":"Rough Sets","author":"D Nagy","year":"2019","unstructured":"Nagy, D., Aszal\u00f3s, L.: Approximation based on representatives. In: Mih\u00e1lyde\u00e1k, T., et al. (eds.) Rough Sets, pp. 91\u2013101. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-642-31900-6_48"},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Nagy, D., Mih\u00e1lyde\u00e1k, T., Aszal\u00f3s, L.: Similarity Based Rough Sets, pp. 94\u2013107. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60840-2_7","DOI":"10.1007\/978-3-319-60840-2_7"},{"key":"5_CR37","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-99368-3_7","volume-title":"Rough Sets","author":"D Nagy","year":"2018","unstructured":"Nagy, D., Mih\u00e1lyde\u00e1k, T., Aszal\u00f3s, L.: Similarity based rough sets with annotation. In: Nguyen, H.S., Ha, Q.T., Li, T., Przyby\u0142a-Kasperek, M. (eds.) Rough Sets, pp. 88\u2013100. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99368-3_7"},{"key":"5_CR38","doi-asserted-by":"publisher","unstructured":"Nagy, D., Mihalydeak, T., Aszalos, L.: Different types of search algorithms for rough sets. Acta Cybern. 24(1), 105\u2013120 (2019). https:\/\/doi.org\/10.14232\/actacyb.24.1.2019.8, http:\/\/cyber.bibl.u-szeged.hu\/index.php\/actcybern\/article\/view\/3999","DOI":"10.14232\/actacyb.24.1.2019.8"},{"key":"5_CR39","doi-asserted-by":"publisher","unstructured":"N\u00e9da, Z., Sumi, R., Ercsey-Ravasz, M., Varga, M., Moln\u00e1r, B., Cseh, G.: Correlation clustering on networks. J. Phys. A: Math. Theor. 42(34), 345003 (2009). https:\/\/doi.org\/10.1088\/1751-8113\/42\/34\/345003, http:\/\/www.journalogy.net\/Publication\/18892707\/correlation-clustering-on-networks","DOI":"10.1088\/1751-8113\/42\/34\/345003"},{"issue":"34","key":"5_CR40","doi-asserted-by":"publisher","first-page":"345003","DOI":"10.1088\/1751-8113\/42\/34\/345003","volume":"42","author":"Z N\u00e9da","year":"2009","unstructured":"N\u00e9da, Z., Sumi, R., Ercsey-Ravasz, M., Varga, M., Moln\u00e1r, B., Cseh, G.: Correlation clustering on networks. J. Phys. A: Math. Theor. 42(34), 345003 (2009)","journal-title":"J. Phys. A: Math. Theor."},{"key":"5_CR41","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/3-540-69115-4_75","volume-title":"Rough Sets Curr. Trends Comput.","author":"HS Nguyen","year":"1998","unstructured":"Nguyen, H.S.: Discretization problem for rough sets methods. In: Polkowski, L., Skowron, A. (eds.) Rough Sets Curr. Trends Comput., pp. 545\u2013552. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-69115-4_75"},{"issue":"5","key":"5_CR42","first-page":"341","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. Parallel Prog. 11(5), 341\u2013356 (1982)","journal-title":"Int. J. Parallel Prog."},{"issue":"1","key":"5_CR43","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","volume":"177","author":"Z Pawlak","year":"2007","unstructured":"Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177(1), 3\u201327 (2007)","journal-title":"Inf. Sci."},{"key":"5_CR44","doi-asserted-by":"publisher","unstructured":"Pawlak, Z., Wong, S., Ziarko, W.: Rough sets: probabilistic versus deterministic approach. Int. J. Man-Mach. Stud. 29(1), 81\u201395 (1988). https:\/\/doi.org\/10.1016\/S0020-7373(88)80032-4","DOI":"10.1016\/S0020-7373(88)80032-4"},{"key":"5_CR45","unstructured":"Pawlak, Z., et al.: Rough sets: theoretical aspects of reasoning about data. In: System Theory, Knowledge Engineering and Problem Solving, Kluwer Academic Publishers, Dordrecht, 1991, September 1991"},{"key":"5_CR46","doi-asserted-by":"publisher","unstructured":"Pawlak, Z., Skowron, A.: Rough sets: some extensions. Inf. Sci. 177(1), 28\u201340 (2007). https:\/\/doi.org\/10.1016\/j.ins.2006.06.006, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025506001496, zdzis\u0142aw Pawlak life and work (1926\u20132006)","DOI":"10.1016\/j.ins.2006.06.006"},{"key":"5_CR47","unstructured":"Polkowski, L., Skowron, A., Zytkow, J.: Rough foundations for rough sets soft computing: rough sets, fuzzy logic, neural networks, uncertainty management, knowledge discovery, pp. 55\u201358, May 2020"},{"key":"5_CR48","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/3-540-45813-1_30","volume-title":"Rough Sets and Current Trends in Computing","author":"HA do Prado","year":"2002","unstructured":"do Prado, H.A., Engel, P.M., Filho, H.C.: Rough clustering: an alternative to find meaningful clusters by using the reducts from a dataset. In: Alpigini, J.J., Peters, J.F., Skowron, A., Zhong, N. (eds.) RSCTC 2002. LNCS (LNAI), vol. 2475, pp. 234\u2013238. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45813-1_30"},{"issue":"2","key":"5_CR49","doi-asserted-by":"publisher","first-page":"245","DOI":"10.3233\/FI-1996-272311","volume":"27","author":"A Skowron","year":"1996","unstructured":"Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27(2), 245\u2013253 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"5_CR50","doi-asserted-by":"publisher","unstructured":"\u015al\u0119zak, D., Ziarko, W.: The investigation of the bayesian rough set model. Int. J. Approx. Reason. 40(1), 81\u201391 (2005). https:\/\/doi.org\/10.1016\/j.ijar.2004.11.004, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0888613X04001410. data Mining and Granular Computing","DOI":"10.1016\/j.ijar.2004.11.004"},{"issue":"2","key":"5_CR51","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1109\/69.842271","volume":"12","author":"R S\u0142owi\u0144ski","year":"2000","unstructured":"S\u0142owi\u0144ski, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. Knowl. Data Eng. 12(2), 331\u2013336 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"5_CR52","first-page":"17","volume":"4","author":"R S\u0142owi\u0144ski","year":"1997","unstructured":"S\u0142owi\u0144ski, R., Vanderpooten, D.: Similarity relation as a basis for rough approximations. Adv. Mach. Intell. Soft-Comput. 4, 17\u201333 (1997)","journal-title":"Adv. Mach. Intell. Soft-Comput."},{"key":"5_CR53","doi-asserted-by":"publisher","unstructured":"Swiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recogn. Lett. 24(6), 833\u2013849 (2003). https:\/\/doi.org\/10.1016\/S0167-8655(02)00196-4, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167865502001964","DOI":"10.1016\/S0167-8655(02)00196-4"},{"key":"5_CR54","doi-asserted-by":"publisher","unstructured":"Yang, Y., Chen, D., Dong, Z.: Novel algorithms of attribute reduction with variable precision rough set model. Neurocomputing 139, 336\u2013344 (2014). https:\/\/doi.org\/10.1016\/j.neucom.2014.02.023","DOI":"10.1016\/j.neucom.2014.02.023"},{"key":"5_CR55","doi-asserted-by":"publisher","unstructured":"Yao, Y.Y.: Combination of Rough and Fuzzy Sets Based on $$\\alpha $$-Level Sets, pp. 301\u2013321. Springer, Boston (1997). https:\/\/doi.org\/10.1007\/978-1-4613-1461-5_15","DOI":"10.1007\/978-1-4613-1461-5_15"},{"key":"5_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72458-2_1","volume-title":"Rough Sets and Knowledge Technology","author":"Y Yao","year":"2007","unstructured":"Yao, Y.: Decision-theoretic rough set models. In: Yao, J., Lingras, P., Wu, W.Z., Szczuka, M., Cercone, N.J., \u015al\u0119zak, D. (eds.) Rough Sets and Knowledge Technology, pp. 1\u201312. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72458-2_1"},{"key":"5_CR57","doi-asserted-by":"publisher","unstructured":"Yao, Y., Greco, S., S\u0142owi\u0144ski, R.: Probabilistic Rough Sets, pp. 387\u2013411. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-43505-2_24","DOI":"10.1007\/978-3-662-43505-2_24"},{"key":"5_CR58","doi-asserted-by":"publisher","unstructured":"Yao, Y., Yao, B.: Covering based rough set approximations. Information Sciences 200, 91\u2013107 (2012). https:\/\/doi.org\/10.1016\/j.ins.2012.02.065, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025512001934","DOI":"10.1016\/j.ins.2012.02.065"},{"issue":"3","key":"5_CR59","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1515\/dema-1983-0319","volume":"16","author":"W Zakowski","year":"1983","unstructured":"Zakowski, W.: Approximations in the space (u,$$\\pi $$). Demonstratio Math. 16(3), 761\u2013770 (1983). https:\/\/doi.org\/10.1515\/dema-1983-0319","journal-title":"Demonstratio Math."},{"issue":"1","key":"5_CR60","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/1656274.1656286","volume":"11","author":"A Zimek","year":"2009","unstructured":"Zimek, A.: Correlation clustering. ACM SIGKDD Explor. Newslett. 11(1), 53\u201354 (2009)","journal-title":"ACM SIGKDD Explor. Newslett."}],"container-title":["Lecture Notes in Computer Science","Transactions on Rough Sets XXII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-62798-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T16:07:32Z","timestamp":1670256452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-62798-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783662627976","9783662627983"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-62798-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"17 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}