{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:20:23Z","timestamp":1760170823336},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412981"},{"type":"electronic","value":"9783642412998"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41299-8_9","type":"book-chapter","created":{"date-parts":[[2013,10,7]],"date-time":"2013-10-07T01:42:12Z","timestamp":1381110132000},"page":"87-98","source":"Crossref","is-referenced-by-count":3,"title":["Optimal Approximations with Rough Sets"],"prefix":"10.1007","author":[{"given":"Ryszard","family":"Janicki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Lenar\u010di\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","first-page":"557","volume":"34","author":"Z. Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rought Sets. International Journal of Computer and Information Sciences\u00a034, 557\u2013590 (1982)","journal-title":"International Journal of Computer and Information Sciences"},{"key":"9_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets","author":"Z. Pawlak","year":"1991","unstructured":"Pawlak, Z.: Rough Sets. Kluwer, Dordrecht (1991)"},{"key":"9_CR3","unstructured":"Bretcher, O.: Linear Algebra with Applications. Prentice Hall (1995)"},{"key":"9_CR4","first-page":"547","volume":"37","author":"P. Jaccard","year":"1901","unstructured":"Jaccard, P.: \u00c9tude comparative de la distribution florale dans une portion des Alpes et des Jura. Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturalles\u00a037, 547\u2013549 (1901)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturalles"},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/1932409","volume":"26","author":"L.R. Dice","year":"1945","unstructured":"Dice, L.R.: Measures of the Amount of Ecologic Association Between Species. Ecology\u00a026(3), 297\u2013302 (1945)","journal-title":"Ecology"},{"issue":"4","key":"9_CR6","first-page":"1","volume":"5","author":"T. S\u00f8rensen","year":"1957","unstructured":"S\u00f8rensen, T.: A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application ro analysis of the vegetation on Danish commons. Biologishe Skrifter\u00a05(4), 1\u201334 (1957)","journal-title":"Biologishe Skrifter"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Janicki, R.: Property-Driven Rough Sets Approximations of Relations. In: [9], pp. 333\u2013357","DOI":"10.1007\/978-3-642-30344-9_12"},{"key":"9_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/FI-1996-272311","volume":"27","author":"A. Skowron","year":"1996","unstructured":"Skowron, A., Stepaniuk, J.: Tolarence approximation spaces. Fundamenta Informaticae\u00a027, 245\u2013253 (1996)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR9","series-title":"ISRL","volume-title":"Rough Sets and Intelligent Systems","year":"2013","unstructured":"Skowron, A., Suraj, Z. (eds.): Rough Sets and Intelligent Systems. ISRL, vol.\u00a042. Springer, Heidelberg (2013)"},{"key":"9_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-48061-7_12","volume-title":"New Directions in Rough Sets, Data Mining, and Granular-Soft Computing","author":"Y.Y. Yao","year":"1999","unstructured":"Yao, Y.Y., Wang, T.: On Rough Relations: An Alternative Formulation. In: Zhong, N., Skowron, A., Ohsuga, S. (eds.) RSFDGrC 1999. LNCS (LNAI), vol.\u00a01711, pp. 82\u201391. Springer, Heidelberg (1999)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-18302-7_2","volume-title":"Transactions on Rough Sets XIII","author":"R. Janicki","year":"2011","unstructured":"Janicki, R.: Approximations of Arbitrary Binary Relations by Partial Orders: Classical and Rough Set Models. In: Peters, J.F., Skowron, A., Chan, C.-C., Grzymala-Busse, J.W., Ziarko, W.P. (eds.) Transactions on Rough Sets XIII. LNCS, vol.\u00a06499, pp. 17\u201338. Springer, Heidelberg (2011)"},{"issue":"3","key":"9_CR12","first-page":"655","volume":"11","author":"J. Saquer","year":"2001","unstructured":"Saquer, J., Deogun, J.S.: Concept approximations based on Rough sets and similarity measures. Int. J. Appl. Math. Comput. Sci.\u00a011(3), 655\u2013674 (2001)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"issue":"2","key":"9_CR13","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 Tran. on Knowledge and Data Engineering\u00a012(2), 331\u2013336 (2000)","journal-title":"IEEE Tran. on Knowledge and Data Engineering"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-10646-0_1","volume-title":"Rough Sets, Fuzzy Sets, Data Mining and Granular Computing","author":"I. D\u00fcntsch","year":"2009","unstructured":"D\u00fcntsch, I., Gediga, G., Lenarcic, A.: Affordance Relations. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., \u015al\u0119zak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS, vol.\u00a05908, pp. 1\u201311. Springer, Heidelberg (2009)"},{"issue":"6","key":"9_CR15","doi-asserted-by":"crossref","first-page":"946","DOI":"10.20965\/jaciii.2006.p0946","volume":"10","author":"H. Rezai","year":"2006","unstructured":"Rezai, H., Emoto, M., Mukaidono, M.: New similarity Measure Between Two Fuzzy Sets. Journal of Advanced Computational Intelligence and Intelligent Informatics\u00a010(6), 946\u2013953 (2006)","journal-title":"Journal of Advanced Computational Intelligence and Intelligent Informatics"},{"issue":"4","key":"9_CR16","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1037\/0033-295X.84.4.327","volume":"84","author":"A. Tversky","year":"1977","unstructured":"Tversky, A.: Features of similarity. Psychological Reviews\u00a084(4), 327\u2013352 (1977)","journal-title":"Psychological Reviews"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Halmos, P.: Measure Theory, Van Nostrand (1950)","DOI":"10.1007\/978-1-4684-9440-2"},{"key":"9_CR18","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Weslay (2005)"}],"container-title":["Lecture Notes in Computer Science","Rough Sets and Knowledge Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41299-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,5]],"date-time":"2020-08-05T10:25:01Z","timestamp":1596623101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41299-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412981","9783642412998"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41299-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}