{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:11:44Z","timestamp":1760710304043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030527044"},{"type":"electronic","value":"9783030527051"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52705-1_13","type":"book-chapter","created":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T23:19:19Z","timestamp":1594077559000},"page":"183-192","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Attribute Reduction from Closure Operators and Matroids in Rough Set Theory"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1007-353X","authenticated-orcid":false,"given":"Mauricio","family":"Restrepo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7854-6025","authenticated-orcid":false,"given":"Chris","family":"Cornelis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,7]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2015.03.060","volume":"314","author":"X Bian","year":"2015","unstructured":"Bian, X., Wang, P., Yu, Z., Bai, X., Chen, B.: Characterization of coverings for upper approximation operators being closure operators. Inf. Sci. 314, 41\u201354 (2015)","journal-title":"Inf. Sci."},{"key":"13_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/b139095","volume-title":"Lattices and Ordered Algebraic Structures","author":"TS Blyth","year":"2005","unstructured":"Blyth, T.S.: Lattices and Ordered Algebraic Structures. Springer, London (2005). https:\/\/doi.org\/10.1007\/b139095"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00167-3","volume":"129","author":"S Greco","year":"2001","unstructured":"Greco, S., Matarazzo, B., Slowinski, R.: Rough sets theory for multicriteria decision analysis. Eur. J. Oper. Res. 129, 1\u201347 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.ins.2013.11.014","volume":"263","author":"A Huang","year":"2014","unstructured":"Huang, A., Zhao, H., Zhu, W.: Nullity-based matroid of rough sets and its application to attribute reduction. Inf. Sci. 263, 153\u2013165 (2014)","journal-title":"Inf. Sci."},{"key":"13_CR5","volume-title":"Matroid Theory","author":"W Lai","year":"2001","unstructured":"Lai, W.: Matroid Theory. Higher Education Press, Beijing (2001)"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/j.ijar.2011.12.005","volume":"53","author":"X Li","year":"2012","unstructured":"Li, X., Liu, S.: Matroidal approaches to rough sets via closure operators. Int. J. Approx. Reason. 53, 513\u2013527 (2012)","journal-title":"Int. J. Approx. Reason."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2016.01.029","volume":"342","author":"X Li","year":"2016","unstructured":"Li, X., Huangjian, Y., Sanyang, L.: Rough sets and matroids from a lattice-theoretic viewpoint. Inf. Sci. 342, 37\u201352 (2016)","journal-title":"Inf. Sci."},{"issue":"1","key":"13_CR8","first-page":"139","volume":"12","author":"Y Li","year":"2012","unstructured":"Li, Y., Wang, Z.: The relationships between degree rough sets and matroids. Ann. Fuzzy Math. Inf. 12(1), 139\u2013153 (2012)","journal-title":"Ann. Fuzzy Math. Inf."},{"key":"13_CR9","unstructured":"Liu, Y., Zhu, W.: Relation matroid and its relationship with generalized rough set based on relations. CoRR., abs 1209.5456 (2012)"},{"key":"13_CR10","first-page":"2151","volume":"8","author":"Y Liu","year":"2012","unstructured":"Liu, Y., Zhu, W., Zhang, Y.: Relationship between partition matroids and rough sets through $$k$$-rank matroids. J. Inf. Comput. Sci. 8, 2151\u20132163 (2012)","journal-title":"J. Inf. Comput. Sci."},{"key":"13_CR11","volume-title":"Matroid Theory","author":"JG Oxley","year":"1992","unstructured":"Oxley, J.G.: Matroid Theory. Oxford University Press, Oxford (1992)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-030-22815-6_10","volume-title":"Rough Sets","author":"M Restrepo","year":"2019","unstructured":"Restrepo, M., Cornelis, C.: Rough matroids based on dual approximation operators. In: Mih\u00e1lyde\u00e1k, T., Min, F., Wang, G., Banerjee, M., D\u00fcntsch, I., Suraj, Z., Ciucci, D. (eds.) IJCRS 2019. LNCS (LNAI), vol. 11499, pp. 118\u2013129. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22815-6_10"},{"issue":"3","key":"13_CR13","first-page":"583","volume":"11","author":"Q Shen","year":"2001","unstructured":"Shen, Q., Alexios, C.A.: Rough set-based dimensionality reduction for supervised and unsupervised learning. Int. J. Appl. Math. Comput. Sci. 11(3), 583\u2013601 (2001)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2012.10.060","volume":"47","author":"J Tang","year":"2013","unstructured":"Tang, J., She, K., Min, F., Zhu, W.: A matroidal approach to rough set theory. Theoret. Comput. Sci. 47(1), 1\u201311 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Tsang, E., Chen, D., Lee, J., Yeung, D.S.: On the upper approximations of covering generalized rough sets. In: Proceedings of the 3rd International Conference on Machine Learning and Cybernetics, pp. 4200\u20134203 (2004)","DOI":"10.1109\/ICMLC.2004.1384576"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-24425-4_21","volume-title":"Rough Sets and Knowledge Technology","author":"S Wang","year":"2011","unstructured":"Wang, S., Zhu, W., Min, F.: Transversal and function matroidal structures of covering-based rough sets. In: Yao, J.T., Ramanna, S., Wang, G., Suraj, Z. (eds.) RSKT 2011. LNCS (LNAI), vol. 6954, pp. 146\u2013155. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24425-4_21"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.knosys.2012.06.006","volume":"54","author":"S Wang","year":"2012","unstructured":"Wang, S., Zhu, Q., Zhu, W., Min, F.: Matroidal structure of rough sets and its characterization to attribute reduction. Knowl.-Based Syst. 54, 155\u2013161 (2012)","journal-title":"Knowl.-Based Syst."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.ijar.2009.11.001","volume":"51","author":"T Yang","year":"2010","unstructured":"Yang, T., Li, Q.: Reduction about approximation spaces of covering generalized rough sets. Int. J. Approx. Reason. 51, 335\u2013345 (2010)","journal-title":"Int. J. Approx. Reason."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Yang, B., Zhao, H., Zhu, W.: Rough matroids based on covering, vol. 407\u2013411 (2013)","DOI":"10.1155\/2013\/254797"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Wang Z, Feng Q, Wang H: The lattice and matroid representations of definable sets in generalized rough sets based on relations. Inf. Sci. 155 & 485, 505\u2013520 (2019)","DOI":"10.1016\/j.ins.2019.02.034"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Zhu, W., Wang, S.: Rough matroids. In: IEEE International Conference on Granular Computing, pp. 817\u20138221 (2011)","DOI":"10.1109\/GRC.2011.6122704"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ins.2012.12.029","volume":"232","author":"W Zhu","year":"2013","unstructured":"Zhu, W., Wang, S.: Rough matroids based on relation. Inf. Sci. 232, 241\u2013252 (2013)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Rough Sets"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52705-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,9]],"date-time":"2024-08-09T11:04:48Z","timestamp":1723201488000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-52705-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030527044","9783030527051"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52705-1_13","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":"7 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCRS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rough Sets","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Havana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuba","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":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcrs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ijcrs.cujae.edu.cu","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":"50","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":"37","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":"0","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":"74% - 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":"2.84","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":"3","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":"The conference was held virtually due to the COVID-19 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"}]}}