{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T22:40:04Z","timestamp":1744584004765,"version":"3.40.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030748258"},{"type":"electronic","value":"9783030748265"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-74826-5_8","type":"book-chapter","created":{"date-parts":[[2021,4,14]],"date-time":"2021-04-14T08:04:08Z","timestamp":1618387448000},"page":"93-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Similarity-Based Rough Sets with Annotation Using Deep Learning"],"prefix":"10.1007","author":[{"given":"D\u00e1vid","family":"Nagy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Mih\u00e1lyde\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"K\u00e1dek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,15]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Aigner, M.: Enumeration via ballot numbers. Discret. 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":"8_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-642-41218-9_34","volume-title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","author":"L Aszal\u00f3s","year":"2013","unstructured":"Aszal\u00f3s, L., Mih\u00e1lyde\u00e1k, T.: Rough clustering generated by correlation clustering. In: Ciucci, D., Inuiguchi, M., Yao, Y., \u015al\u0119zak, D., Wang, G. (eds.) RSFDGrC 2013. LNCS (LNAI), vol. 8170, pp. 315\u2013324. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41218-9_34"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-319-11740-9_37","volume-title":"Rough Sets and Knowledge Technology","author":"L Aszal\u00f3s","year":"2014","unstructured":"Aszal\u00f3s, L., Mih\u00e1lyde\u00e1k, T.: Rough classification based on correlation clustering. In: Miao, D., Pedrycz, W., \u015al\u0229zak, D., Peters, G., Hu, Q., Wang, R. (eds.) RSKT 2014. LNCS (LNAI), vol. 8818, pp. 399\u2013410. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11740-9_37"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Aszal\u00f3s, L., Mih\u00e1lyde\u00e1k, T.: Correlation clustering by contraction. In: 2015 Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 425\u2013434. IEEE (2015)","DOI":"10.15439\/2015F137"},{"issue":"1\u20133","key":"8_CR5","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":"8_CR6","unstructured":"Becker, H.: A survey of correlation clustering. In: Advanced Topics in Computational Learning Theory, pp. 1\u201310 (2005)"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-319-08644-6_5","volume-title":"Rough Sets and Current Trends in Computing","author":"T K\u00e1dek","year":"2014","unstructured":"K\u00e1dek, T., Mih\u00e1lyde\u00e1k, T.: Some fundamental laws of partial first-order logic based on set approximations. In: Cornelis, C., Kryszkiewicz, M., \u015al\u0119zak, D., Ruiz, E.M., Bello, R., Shang, L. (eds.) RSCTC 2014. LNCS (LNAI), vol. 8536, pp. 47\u201358. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08644-6_5"},{"key":"8_CR8","doi-asserted-by":"publisher","unstructured":"Mih\u00e1lyde\u00e1k, T.: First-order logic based on set approximation: a partial three-valued approach. In: 2014 IEEE 44th International Symposium on Multiple-Valued Logic, pp. 132\u2013137, May 2014. https:\/\/doi.org\/10.1109\/ISMVL.2014.31","DOI":"10.1109\/ISMVL.2014.31"},{"key":"8_CR9","unstructured":"Mih\u00e1lyde\u00e1k, T.: Partial first-order logical semantics based on approximations of sets. Non-classical Modal and Predicate Logics, pp. 85\u201390 (2011)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Mih\u00e1lyde\u00e1k, T.: Partial first-order logic relying on optimistic, pessimistic and average partial membership functions. In: Pasi, G., Montero, J., Ciucci, D. (eds.) Proceedings of the 8th Conference of the European Society for Fuzzy Logic and Technology, pp. 334\u2013339 (2013)","DOI":"10.2991\/eusflat.2013.53"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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.) IJCRS 2018. LNCS (LNAI), vol. 11103, pp. 270\u2013283. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99368-3_21"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-60840-2_7","volume-title":"Rough Sets","author":"D Nagy","year":"2017","unstructured":"Nagy, D., Mih\u00e1lyde\u00e1k, T., Aszal\u00f3s, L.: Similarity based rough sets. In: Polkowski, L., et al. (eds.) IJCRS 2017. LNCS (LNAI), vol. 10314, pp. 94\u2013107. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-60840-2_7"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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.) IJCRS 2018. LNCS (LNAI), vol. 11103, pp. 88\u2013100. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99368-3_7"},{"issue":"5","key":"8_CR14","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":"8_CR15","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":"8_CR16","unstructured":"Pawlak, Z., et al.: Rough sets: theoretical aspects of reasoning about data. In: System Theory, Knowledge Engineering and Problem Solving, vol. 9. Kluwer Academic Publishers, Dordrecht (1991)"},{"issue":"2","key":"8_CR17","first-page":"245","volume":"27","author":"A Skowron","year":"1996","unstructured":"Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fund. Inform. 27(2), 245\u2013253 (1996)","journal-title":"Fund. Inform."},{"issue":"1","key":"8_CR18","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. Newsl. 11(1), 53\u201354 (2009)","journal-title":"ACM SIGKDD Explor. Newsl."}],"container-title":["IFIP Advances in Information and Communication Technology","Intelligence Science III"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-74826-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,13]],"date-time":"2025-04-13T22:02:10Z","timestamp":1744581730000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-74826-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030748258","9783030748265"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-74826-5_8","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligence Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Durgapur","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.intsci.ac.cn\/icis2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 extended abstract is also included in the back matter. Full papers are 10+ pages long.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}