{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:40:02Z","timestamp":1750027202121,"version":"3.41.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030770037"},{"type":"electronic","value":"9783030770044"}],"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-77004-4_6","type":"book-chapter","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:06:10Z","timestamp":1623798370000},"page":"57-67","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Comparative Study of Two Algorithms for Computing the Shortest Reducts: MiLIT and MinReduct"],"prefix":"10.1007","author":[{"given":"Vlad\u00edmir","family":"Rodr\u00edguez-Diez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Fco.","family":"Mart\u00ednez-Trinidad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A.","family":"Carrasco-Ochoa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel S.","family":"Lazo-Cort\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Arturo","family":"Olvera-L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"key":"6_CR1","unstructured":"Bache, K., Lichman, M.: UCI machine learning repository (2013)"},{"issue":"66","key":"6_CR2","first-page":"182","volume":"4","author":"IA Cheguis","year":"1955","unstructured":"Cheguis, I.A., Yablonskii, S.V.: About testors for electrical outlines. Uspieji Matematicheskij Nauk (In Russian) 4(66), 182\u2013184 (1955)","journal-title":"Uspieji Matematicheskij Nauk (In Russian)"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Chikalov, I., et al.: Three Approaches to Data Analysis. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-28667-4","DOI":"10.1007\/978-3-642-28667-4"},{"issue":"6","key":"6_CR4","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1007\/s00500-015-1638-0","volume":"20","author":"Yu Jiang","year":"2015","unstructured":"Jiang, Yu., Yu, Y.: Minimal attribute reduction with rough set based on compactness discernibility information tree. Soft. Comput. 20(6), 2233\u20132243 (2015). https:\/\/doi.org\/10.1007\/s00500-015-1638-0","journal-title":"Soft. Comput."},{"issue":"4","key":"6_CR5","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1016\/S0031-3203(00)00028-5","volume":"34","author":"M Lazo-Cort\u00e9s","year":"2001","unstructured":"Lazo-Cort\u00e9s, M., Ruiz-Shulcloper, J., Alba-Cabrera, E.: An overview of the evolution of the concept of testor. Pattern Recogn. 34(4), 753\u2013762 (2001)","journal-title":"Pattern Recogn."},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1016\/j.ins.2014.09.045","volume":"294","author":"M Lazo-Cort\u00e9s","year":"2015","unstructured":"Lazo-Cort\u00e9s, M., Mart\u00ednez-Trinidad, J., Carrasco-Ochoa, J., S\u00e1nchez-D\u00edaz, G.: On the relation between rough set reducts and typical testors. Inf. Sci. 294, 152\u2013163 (2015)","journal-title":"Inf. Sci."},{"issue":"08","key":"6_CR7","doi-asserted-by":"crossref","first-page":"1350022","DOI":"10.1142\/S0218001413500225","volume":"27","author":"A Lias-Rodr\u00edguez","year":"2013","unstructured":"Lias-Rodr\u00edguez, A., S\u00e1nchez-D\u00edaz, G.: An algorithm for computing typical testors based on elimination of gaps and reduction of columns. Int. J. Pattern Recognit Artif Intell. 27(08), 1350022 (2013)","journal-title":"Int. J. Pattern Recognit Artif Intell."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-540-25929-9_55","volume-title":"Rough Sets and Current Trends in Computing","author":"TY Lin","year":"2004","unstructured":"Lin, T.Y., Yin, P.: Heuristically fast finding of the shortest reducts. In: Tsumoto, S., S\u0142owi\u0144ski, R., Komorowski, J., Grzyma\u0142a-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 465\u2013470. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25929-9_55"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-47160-0_49","volume-title":"Rough Sets","author":"SH Nguyen","year":"2016","unstructured":"Nguyen, S.H., Szczuka, M.: Feature selection in decision systems with constraints. In: Flores, V., et al. (eds.) IJCRS 2016. LNCS (LNAI), vol. 9920, pp. 537\u2013547. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-47160-0_49"},{"issue":"6","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1007\/s10796-014-9496-3","volume":"17","author":"HS Own","year":"2014","unstructured":"Own, H.S., Yahyaoui, H.: Rough set based classification of real world Web services. Inf. Syst. Front. 17(6), 1301\u20131311 (2014). https:\/\/doi.org\/10.1007\/s10796-014-9496-3","journal-title":"Inf. Syst. Front."},{"issue":"5","key":"6_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak, Z.: Rough sets. Int. J. Comput. Inform. Sci. 11(5), 1\u201351 (1982)","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data, vol. 9. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/978-94-011-3534-4","DOI":"10.1007\/978-94-011-3534-4"},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"56312","DOI":"10.1109\/ACCESS.2020.2982133","volume":"8","author":"I Piza-D\u00e1vila","year":"2020","unstructured":"Piza-D\u00e1vila, I., S\u00e1nchez-D\u00edaz, G., Lazo-Cort\u00e9s, M.S., Villal\u00f3n-Turrubiates, I.: An algorithm for computing minimum-length irreducible testors. IEEE Access 8, 56312\u201356320 (2020)","journal-title":"IEEE Access"},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.ins.2017.12.027","volume":"435","author":"V Rodr\u00edguez-Diez","year":"2018","unstructured":"Rodr\u00edguez-Diez, V., Mart\u00ednez-Trinidad, J., Carrasco-Ochoa, J., Lazo-Cort\u00e9s, M.: A new algorithm for reduct computation based on gap elimination and attribute contribution. Inf. Sci. 435, 111\u2013123 (2018)","journal-title":"Inf. Sci."},{"key":"6_CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.patrec.2020.07.004","volume":"138","author":"V Rodr\u00edguez-Diez","year":"2020","unstructured":"Rodr\u00edguez-Diez, V., Mart\u00ednez-Trinidad, J.F., Carrasco-Ochoa, J.A., Lazo-Cort\u00e9s, M.S., Olvera-L\u00f3pez, J.A.: MinReduct: a new algorithm for computing the shortest reducts. Pattern Recogn. Lett. 138, 177\u2013184 (2020)","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"6_CR16","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1134\/S1054661808040044","volume":"18","author":"J Ruiz-Shulcloper","year":"2008","unstructured":"Ruiz-Shulcloper, J.: Pattern recognition with mixed and incomplete data. Pattern Recognit Image Anal. 18(4), 563\u2013576 (2008)","journal-title":"Pattern Recognit Image Anal."},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/978-3-540-76725-1_53","volume-title":"Progress in Pattern Recognition, Image Analysis and Applications","author":"G Sanchez-D\u00edaz","year":"2007","unstructured":"Sanchez-D\u00edaz, G., Lazo-Cort\u00e9s, M.: CT-EXT: an algorithm for computing typical testor set. In: Rueda, L., Mery, D., Kittler, J. (eds.) CIARP 2007. LNCS, vol. 4756, pp. 506\u2013514. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-76725-1_53"},{"key":"6_CR18","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). https:\/\/doi.org\/10.1007\/978-94-015-7975-9_21","DOI":"10.1007\/978-94-015-7975-9_21"},{"issue":"2","key":"6_CR19","first-page":"119","volume":"23","author":"R Susmaga","year":"1998","unstructured":"Susmaga, R.: Computation of shortest reducts. Found. Comput. Decis. Sci. 23(2), 119\u2013137 (1998)","journal-title":"Found. Comput. Decis. Sci."},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Torres, M.D., Torres, A., Cuellar, F., Torres, M.D.L.L., Ponce De Le\u00f3n, E., Pinales, F.: Evolutionary computation in the identification of risk factors. Case of TRALI. Expert Syst. Appl. 41(3), 831\u2013840 (2014)","DOI":"10.1016\/j.eswa.2013.08.013"},{"issue":"7","key":"6_CR21","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.ins.2008.11.020","volume":"179","author":"Y Yao","year":"2009","unstructured":"Yao, Y., Zhao, Y.: Discernibility matrix simplification for constructing attribute reducts. Inf. Sci. 179(7), 867\u2013882 (2009)","journal-title":"Inf. Sci."},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-02962-2_19","volume-title":"Rough Sets and Knowledge Technology","author":"J Zhou","year":"2009","unstructured":"Zhou, J., Miao, D., Feng, Q., Sun, L.: Research on complete algorithms for minimal attribute reduction. In: Wen, P., Li, Y., Polkowski, L., Yao, Y., Tsumoto, S., Wang, G. (eds.) RSKT 2009. LNCS (LNAI), vol. 5589, pp. 152\u2013159. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02962-2_19"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77004-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:03:48Z","timestamp":1750025028000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77004-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030770037","9783030770044"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77004-4_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","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":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcpr22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ccc.inaoep.mx\/~mcpr\/index.html","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":"75","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":"35","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":"47% - 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.706","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.308","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 conference was held virtually.","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)"}}]}}