{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:26:25Z","timestamp":1760171185381,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030501457"},{"type":"electronic","value":"9783030501464"}],"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-030-50146-4_35","type":"book-chapter","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T17:04:54Z","timestamp":1591376694000},"page":"471-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Feature Reduction in Superset Learning Using Rough Sets and Evidence Theory"],"prefix":"10.1007","author":[{"given":"Andrea","family":"Campagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8083-7809","authenticated-orcid":false,"given":"Davide","family":"Ciucci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,5]]},"reference":[{"key":"35_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9780511804090"},{"key":"35_CR2","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-54966-8_5","volume-title":"Thriving Rough Sets","author":"R Bello","year":"2017","unstructured":"Bello, R., Falcon, R.: Rough sets in machine learning: a review. In: Wang, G., Skowron, A., Yao, Y., \u015al\u0119zak, D., Polkowski, L. (eds.) Thriving Rough Sets. SCI, vol. 708, pp. 87\u2013118. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-54966-8_5"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.knosys.2019.05.018","volume":"180","author":"A Campagner","year":"2019","unstructured":"Campagner, A., Ciucci, D.: Orthopartitions and soft clustering: soft mutual information measures for clustering validation. Knowl.-Based Syst. 180, 51\u201361 (2019)","journal-title":"Knowl.-Based Syst."},{"key":"35_CR4","doi-asserted-by":"crossref","unstructured":"Chang, J.C., Amershi, S., Kamar, E.: Revolt: collaborative crowdsourcing for labeling machine learning datasets. In: Proceedings of CHI 2017, pp. 2334\u20132346 (2017)","DOI":"10.1145\/3025453.3026044"},{"key":"35_CR5","doi-asserted-by":"publisher","unstructured":"Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. In: Yager, R.R., Liu, L. (eds.) Classic Works of the Dempster-Shafer Theory of Belief Functions, vol. 219, pp. 57\u201372. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-44792-4_3","DOI":"10.1007\/978-3-540-44792-4_3"},{"key":"35_CR6","unstructured":"Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3(Mar), 1157\u20131182 (2003)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Harmanec, D., Klir, G.J.: Measuring total uncertainty in Dempster-Shafer theory: a novel approach. Int. J. Gen. Syst. 22(4), 405\u2013419 (1994)","DOI":"10.1080\/03081079408935225"},{"issue":"7","key":"35_CR8","doi-asserted-by":"publisher","first-page":"1519","DOI":"10.1016\/j.ijar.2013.09.003","volume":"55","author":"E H\u00fcllermeier","year":"2014","unstructured":"H\u00fcllermeier, E.: Learning from imprecise and fuzzy observations: data disambiguation through generalized loss minimization. Int. J. Approximate Reason. 55(7), 1519\u20131534 (2014)","journal-title":"Int. J. Approximate Reason."},{"issue":"5","key":"35_CR9","doi-asserted-by":"publisher","first-page":"419","DOI":"10.3233\/IDA-2006-10503","volume":"10","author":"E H\u00fcllermeier","year":"2006","unstructured":"H\u00fcllermeier, E., Beringer, J.: Learning from ambiguously labeled examples. Intell. Data Anal. 10(5), 419\u2013439 (2006)","journal-title":"Intell. Data Anal."},{"key":"35_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-319-23525-7_16","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"E H\u00fcllermeier","year":"2015","unstructured":"H\u00fcllermeier, E., Cheng, W.: Superset learning based on generalized loss minimization. In: Appice, A., Rodrigues, P.P., Santos Costa, V., Gama, J., Jorge, A., Soares, C. (eds.) ECML PKDD 2015. LNCS (LNAI), vol. 9285, pp. 260\u2013275. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23525-7_16"},{"key":"35_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-030-35514-2_20","volume-title":"Scalable Uncertainty Management","author":"E H\u00fcllermeier","year":"2019","unstructured":"H\u00fcllermeier, E., Destercke, S., Couso, I.: Learning from imprecise data: adjustments of optimistic and pessimistic variants. In: Ben Amor, N., Quost, B., Theobald, M. (eds.) SUM 2019. LNCS (LNAI), vol. 11940, pp. 266\u2013279. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-35514-2_20"},{"key":"35_CR12","unstructured":"Johnson, D., Levesque, S., Zhang, T.: Interactive machine learning system for automated annotation of information in text, 3 February 2005. US Patent App. 10\/630,854"},{"key":"35_CR13","unstructured":"Jousselme, A.-L., Liu, C., Grenier, D., Boss\u00e9, \u00c9.: Measuring ambiguity in the evidence theory. IEEE Trans. Syst. Man Cybern.-Part A: Syst. Hum. 36(5), 890\u2013903 (2006)"},{"key":"35_CR14","doi-asserted-by":"publisher","unstructured":"Li, M., Vit\u00e1nyi, P., et al.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-0-387-49820-1","DOI":"10.1007\/978-0-387-49820-1"},{"key":"35_CR15","unstructured":"Liu, L., Dietterich, T.: Learnability of the superset label learning problem. In: Proceedings of ICML 2014, pp. 1629\u20131637 (2014)"},{"key":"35_CR16","unstructured":"Liu, L., Dietterich, T.G.: A conditional multinomial mixture model for superset label learning. In: Advances in Neural Information Processing Systems, pp. 548\u2013556 (2012)"},{"key":"35_CR17","volume-title":"Organizations","author":"JG March","year":"1958","unstructured":"March, J.G., Simon, H.A.: Organizations. Wiley, New York (1958)"},{"key":"35_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen, N., Caruana, R.: Classification with partial labels. In: Proceedings of the 14th ACM SIGKDD, pp. 551\u2013559 (2008)","DOI":"10.1145\/1401890.1401958"},{"issue":"5","key":"35_CR19","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. Comput. Inf. Sci. 11(5), 341\u2013356 (1982)","journal-title":"Int. J. Comput. Inf. Sci."},{"issue":"5\u20136","key":"35_CR20","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/0888-613X(90)90013-R","volume":"4","author":"J Pearl","year":"1990","unstructured":"Pearl, J.: Reasoning with belief functions: an analysis of compatibility. Int. J. Approximate Reason. 4(5\u20136), 363\u2013389 (1990)","journal-title":"Int. J. Approximate Reason."},{"key":"35_CR21","unstructured":"Shafer, G.: A Mathematical Theory of Evidence. Princeton University Press, Princeton (1976)"},{"key":"35_CR22","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379\u2013423 (1948)"},{"key":"35_CR23","doi-asserted-by":"publisher","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: S\u0142owi\u0144ski, R. (ed.) Intelligent Decision Support, vol. 11, pp. 331\u2013362. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/978-94-015-7975-9_21","DOI":"10.1007\/978-94-015-7975-9_21"},{"issue":"3\u20134","key":"35_CR24","first-page":"365","volume":"53","author":"D Slezak","year":"2002","unstructured":"Slezak, D.: Approximate entropy reducts. Fundam. Inform. 53(3\u20134), 365\u2013390 (2002)","journal-title":"Fundam. Inform."},{"key":"35_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-319-99368-3_49","volume-title":"Rough Sets","author":"D \u015al\u0119zak","year":"2018","unstructured":"\u015al\u0119zak, D., Dutta, S.: Dynamic and discernibility characteristics of different attribute reduction criteria. In: Nguyen, H.S., Ha, Q.-T., Li, T., Przyby\u0142a-Kasperek, M. (eds.) IJCRS 2018. LNCS (LNAI), vol. 11103, pp. 628\u2013643. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99368-3_49"},{"issue":"2","key":"35_CR26","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0004-3702(94)90026-4","volume":"66","author":"P Smets","year":"1994","unstructured":"Smets, P., Kennes, R.: The transferable belief model. Artif. Intell. 66(2), 191\u2013234 (1994)","journal-title":"Artif. Intell."},{"issue":"1","key":"35_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.asoc.2008.05.006","volume":"9","author":"K Thangavel","year":"2009","unstructured":"Thangavel, K., Pethalakshmi, A.: Dimensionality reduction based on rough set theory: a review. Appl. Soft Comput. 9(1), 1\u201312 (2009)","journal-title":"Appl. Soft Comput."},{"key":"35_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/3-540-48523-6_65","volume-title":"Automata, Languages and Programming","author":"C Umans","year":"1999","unstructured":"Umans, C.: On the complexity and inapproximability of shortest implicant problems. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 687\u2013696. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48523-6_65"},{"issue":"1\u20132","key":"35_CR29","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/S0020-0255(97)00076-5","volume":"104","author":"YY Yao","year":"1998","unstructured":"Yao, Y.Y., Lingras, P.J.: Interpretations of belief functions in the theory of rough sets. Inf. Sci. 104(1\u20132), 81\u2013106 (1998)","journal-title":"Inf. Sci."},{"issue":"1","key":"35_CR30","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1093\/nsr\/nwx106","volume":"5","author":"Z-H Zhou","year":"2018","unstructured":"Zhou, Z.-H.: A brief introduction to weakly supervised learning. Natl. Sci. Rev. 5(1), 44\u201353 (2018)","journal-title":"Natl. Sci. Rev."}],"container-title":["Communications in Computer and Information Science","Information Processing and Management of Uncertainty in Knowledge-Based Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50146-4_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T18:07:15Z","timestamp":1591380435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50146-4_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030501457","9783030501464"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50146-4_35","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"5 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPMU","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipmu2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipmu2020.inesc-id.pt\/","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":"213","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":"146","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":"27","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":"69% - 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,2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The IPMU 2020 was held virtually due to the coronavirus pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}