{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:11:29Z","timestamp":1758273089956,"version":"3.37.3"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/access.2018.2868846","type":"journal-article","created":{"date-parts":[[2018,9,5]],"date-time":"2018-09-05T18:47:20Z","timestamp":1536173240000},"page":"50142-50153","source":"Crossref","is-referenced-by-count":5,"title":["Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7888-2419","authenticated-orcid":false,"given":"Qian","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8845-1089","authenticated-orcid":false,"given":"Xiaolin","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4848-1099","authenticated-orcid":false,"given":"Xiaojun","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.09.008"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.05.007"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2016.04.007"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2012.6233802"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.07.018"},{"key":"ref30","first-page":"759","article-title":"Decision table reduction based on conditional information entropy","volume":"25","author":"wang","year":"2002","journal-title":"Chin J Comput"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2017.2717381"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2015.02.002"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-1840-0"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2017.12.002"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11839088_45"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.01.044"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74565-5_31"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2011.03.003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3907"},{"key":"ref14","first-page":"1107","article-title":"Two weighting local search for minimum vertex cover","author":"cai","year":"2015","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-015-2172-9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.02.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01001956"},{"key":"ref19","first-page":"137","author":"stepaniuk","year":"2000","journal-title":"Knowledge Discovery by Application of Rough Set Model"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72458-2_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9937-z"},{"key":"ref27","first-page":"331","author":"skowron","year":"1992","journal-title":"The Discernibility Matrices and Functions in Information Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2014.04.001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2017.12.023"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TFUZZ.2006.889960"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11277-016-3367-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14165-2_22"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1186"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.10.035"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.54"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2014.03.085"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/019697298125470"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-0114(03)00021-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(02)00041-2"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.01.040"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2016.12.004"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2016.04.003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.07.029"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2013.09.015"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2006.03.014"},{"key":"ref25","first-page":"391","article-title":"A quick attribute reduction algorithm with complexity of max(\n$O(|C||U|),O(|C|^{2}|U\/C|)$\n)","volume":"29","author":"yan","year":"2006","journal-title":"Chin J Comput"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8274985\/08454706.pdf?arnumber=8454706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:15:35Z","timestamp":1642004135000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8454706\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2868846","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2018]]}}}