{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T11:13:53Z","timestamp":1780398833301,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030228149","type":"print"},{"value":"9783030228156","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-22815-6_9","type":"book-chapter","created":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T23:02:31Z","timestamp":1560121351000},"page":"102-117","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Search for Attribute Reduction"],"prefix":"10.1007","author":[{"given":"Xiaojun","family":"Xie","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ryszard","family":"Janicki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wei","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guangmei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,6,9]]},"reference":[{"issue":"5","key":"9_CR1","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":"6","key":"9_CR2","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/S0167-8655(02)00196-4","volume":"24","author":"RW Swiniarski","year":"2003","unstructured":"Swiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recogn. Lett. 24(6), 833\u2013849 (2003)","journal-title":"Pattern Recogn. Lett."},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1002\/(SICI)1097-4571(19980415)49:5<415::AID-ASI4>3.0.CO;2-Z","volume":"49","author":"PJ Lingras","year":"1998","unstructured":"Lingras, P.J., Yao, Y.Y.: Data mining using extensions of the rough set model. J. Am. Soc. Inf. Sci. 49(5), 415\u2013422 (1998)","journal-title":"J. Am. Soc. Inf. Sci."},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.knosys.2009.12.003","volume":"23","author":"T Herawan","year":"2010","unstructured":"Herawan, T., Deris, M.M., Abawajy, J.H.: A rough set approach for selecting clustering attribute. Knowl. Based Syst. 23(3), 220\u2013231 (2010)","journal-title":"Knowl. Based Syst."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijar.2015.12.014","volume":"71","author":"R Janicki","year":"2016","unstructured":"Janicki, R., Lenar\u010di\u010d, A.: Optimal approximations with rough sets and similarities in measure spaces. Int. J. Approximate Reasoning 71, 1\u201314 (2016)","journal-title":"Int. J. Approximate Reasoning"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ijar.2018.04.012","volume":"98","author":"R Janicki","year":"2018","unstructured":"Janicki, R.: Approximations of arbitrary relations by partial orders. Int. J. Approximate Reasoning 98, 177\u2013195 (2018)","journal-title":"Int. J. Approximate Reasoning"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-319-93040-4_4","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"X Xie","year":"2018","unstructured":"Xie, X., Qin, X.: Dynamic feature selection algorithm based on minimum vertex cover of hypergraph. In: Phung, D., Tseng, V.S., Webb, G.I., Ho, B., Ganji, M., Rashidi, L. (eds.) PAKDD 2018. LNCS (LNAI), vol. 10939, pp. 40\u201351. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93040-4_4"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-94-015-7975-9_21","volume-title":"Intelligent Decision Support","author":"Andrzej Skowron","year":"1992","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: S\u0142owi\u0144ski, R. (ed.) Intelligent Decision Support. Handbook of Applications and Advances of the Rough Sets Theory, Dordrecht, Kluwer (1992)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/11548706_2","volume-title":"Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing","author":"HS Nguyen","year":"2005","unstructured":"Nguyen, H.S.: Approximate boolean reasoning approach to rough sets and data mining. In: \u015al\u0229zak, D., Yao, J.T., Peters, J.F., Ziarko, W., Hu, X. (eds.) RSFDGrC 2005. LNCS (LNAI), vol. 3642, pp. 12\u201322. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11548706_2"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ijar.2015.01.006","volume":"59","author":"A Tan","year":"2015","unstructured":"Tan, A., Li, J., Lin, Y., Lin, G.: Matrix-based set approximations and reductions in covering decision information systems. Int. J. Approximate Reasoning 59, 68\u201380 (2015)","journal-title":"Int. J. Approximate Reasoning"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/s10115-015-0824-9","volume":"46","author":"M Hacibeyoglu","year":"2016","unstructured":"Hacibeyoglu, M., Salman, M.S., Selek, M., Kahramanli, S.: The logic transformations for reducing the complexity of the discernibility function-based attribute reduction problem. Knowl. Inf. Syst. 46(3), 599\u2013628 (2016)","journal-title":"Knowl. Inf. Syst."},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ins.2012.11.005","volume":"228","author":"T Yang","year":"2013","unstructured":"Yang, T., Li, Q., Zhou, B.: Related family: a new method for attribute reduction of covering information systems. Inf. Sci. 228, 175\u2013191 (2013)","journal-title":"Inf. Sci."},{"key":"9_CR13","unstructured":"Xu, Z., Liu, Z., Yang, B.: A quick attribute reduction algorithm with complexity of max($${O}(|{C}||{U}|),{O}(|{C}|^2|{U}\/{C}|)$$). Chin. J. Comput. 29(3), 391\u2013399 (2006)"},{"issue":"1","key":"9_CR14","first-page":"65","volume":"30","author":"F Jiang","year":"2015","unstructured":"Jiang, F., Sha-sha, W., Du, J.W., Yue-Fei, S.: Attribute reduction based on approximation decision entropy. Control Decis. 30(1), 65\u201370 (2015)","journal-title":"Control Decis."},{"issue":"4","key":"9_CR15","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1080\/18756891.2011.9727820","volume":"4","author":"T Deng","year":"2011","unstructured":"Deng, T., Yang, C., Hu, Q.: Feature selection in decision systems based on conditional knowledge granularity. Int. J. Comput. Intell. Syst. 4(4), 655\u2013671 (2011)","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.ijar.2016.11.016","volume":"82","author":"H Ge","year":"2017","unstructured":"Ge, H., Li, L., Xu, Y., Yang, C.: Quick general reduction algorithms for inconsistent decision tables. Int. J. Approximate Reasoning 82, 56\u201380 (2017)","journal-title":"Int. J. Approximate Reasoning"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.ijar.2017.12.002","volume":"93","author":"X Xie","year":"2018","unstructured":"Xie, X., Qin, X.: A novel incremental attribute reduction approach for dynamic incomplete decision systems. Int. J. Approximate Reasoning 93, 443\u2013462 (2018)","journal-title":"Int. J. Approximate Reasoning"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Xu, Z., Gu, D., Yang, B.: Attribute reduction algorithm based on genetic algorithm. In: Proceedings of International Conference on Intelligent Computation Technology and Automation, Zhangjiajie, China, pp. 169\u2013172 (2009)","DOI":"10.1109\/ICICTA.2009.49"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.knosys.2015.02.002","volume":"81","author":"Y Chen","year":"2015","unstructured":"Chen, Y., Zhu, Q., Xu, H.: Finding rough set reducts with fish swarm algorithm. Knowl. Based Syst. 81, 22\u201329 (2015)","journal-title":"Knowl. Based Syst."},{"issue":"8","key":"9_CR20","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s00521-015-1840-0","volume":"26","author":"HH Inbarani","year":"2015","unstructured":"Inbarani, H.H., Bagyamathi, M., Azar, A.T.: A novel hybrid feature selection method based on rough set and improved harmony search. Neural Comput. Appl. 26(8), 1859\u20131880 (2015)","journal-title":"Neural Comput. Appl."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1016\/j.neucom.2015.06.090","volume":"174","author":"XY Luan","year":"2016","unstructured":"Luan, X.Y., Li, Z.P., Liu, T.Z.: A novel attribute reduction algorithm based on rough set and improved artificial fish swarm algorithm. Neurocomputing 174, 522\u2013529 (2016)","journal-title":"Neurocomputing"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Abd El Aziz, M., Hassanien, A.E.: An improved social spider optimization algorithm based on rough sets for solving minimum number attribute reduction problem. Neural Comput. Appl. 30(8), 2441\u20132452 (2018)","DOI":"10.1007\/s00521-016-2804-8"},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.asoc.2017.12.023","volume":"64","author":"X Xie","year":"2018","unstructured":"Xie, X., Qin, X., Yu, C., Xu, X.: Test-cost-sensitive rough set based approach for minimum weight vertex cover problem. Appl. Soft Comput. 64, 423\u2013435 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"9","key":"9_CR24","doi-asserted-by":"publisher","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Cai, S., Hou, W., Lin, J., Li, Y.: Improving local search for minimum weight vertex cover by dynamic strategies. In: Proceedings of International Joint Conferences on Artificial Intelligence, Stockholm, Sweden, pp. 1412\u20131418 (2018)","DOI":"10.24963\/ijcai.2018\/196"},{"key":"9_CR26","unstructured":"UCI machine learning repository. http:\/\/www.ics.uci.edu\/mlearn\/MLRepository.html"}],"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-22815-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:19:24Z","timestamp":1710335964000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22815-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030228149","9783030228156"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22815-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 June 2019","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":"Debrecen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcrs2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijcrs2019.unideb.hu\/","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":"71","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":"41","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":"58% - 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.5","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":"2.54","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)"}}]}}