{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:03:20Z","timestamp":1760609000358,"version":"3.37.3"},"reference-count":28,"publisher":"Wiley","license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Hebei Province Natural Science Foundation","award":["E2016202341","C2012003038"],"award-info":[{"award-number":["E2016202341","C2012003038"]}]},{"name":"Hebei Province Foundation for Returned Scholars","award":["E2016202341","C2012003038"],"award-info":[{"award-number":["E2016202341","C2012003038"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Complexity"],"published-print":{"date-parts":[[2017]]},"abstract":"<jats:p>As an important processing step for rough set theory, attribute reduction aims at eliminating data redundancy and drawing useful information. Covering rough set, as a generalization of classical rough set theory, has attracted wide attention on both theory and application. By using the covering rough set, the process of continuous attribute discretization can be avoided. Firstly, this paper focuses on consistent covering rough set and reviews some basic concepts in consistent covering rough set theory. Then, we establish the model of attribute reduction and elaborate the steps of attribute reduction based on consistent covering rough set. Finally, we apply the studied method to actual lagging data. It can be proved that our method is feasible and the reduction results are recognized by Least Squares Support Vector Machine (LS-SVM) and Relevance Vector Machine (RVM). Furthermore, the recognition results are consistent with the actual test results of a gas well, which verifies the effectiveness and efficiency of the presented method.<\/jats:p>","DOI":"10.1155\/2017\/8986917","type":"journal-article","created":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T17:00:56Z","timestamp":1506963656000},"page":"1-9","source":"Crossref","is-referenced-by-count":14,"title":["Attribute Reduction Based on Consistent Covering Rough Set and Its Application"],"prefix":"10.1155","volume":"2017","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8072-2545","authenticated-orcid":true,"given":"Jianchuan","family":"Bai","sequence":"first","affiliation":[{"name":"School of Electronics and Information Engineering, Hebei University of Technology, Tianjin, China"},{"name":"Key Lab of Big Data Computation of Hebei Province, 5340 Xiping Road, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3968-481X","authenticated-orcid":true,"given":"Kewen","family":"Xia","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Hebei University of Technology, Tianjin, China"},{"name":"Key Lab of Big Data Computation of Hebei Province, 5340 Xiping Road, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongliang","family":"Lin","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Hebei University of Technology, Tianjin, China"},{"name":"Key Lab of Big Data Computation of Hebei Province, 5340 Xiping Road, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panpan","family":"Wu","sequence":"additional","affiliation":[{"name":"School of Electronics and Information Engineering, Hebei University of Technology, Tianjin, China"},{"name":"Key Lab of Big Data Computation of Hebei Province, 5340 Xiping Road, Tianjin 300401, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"issue":"4","key":"1","first-page":"677","volume":"22","year":"2013","journal-title":"Chinese Journal of Electronics"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2011.89"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1007\/BF01001956"},{"key":"4","first-page":"73","volume":"8","year":"2001","journal-title":"Computational Intelligence in Theory And Practice"},{"key":"5","first-page":"1","volume":"99","year":"2017","journal-title":"IEEE Transactions on Neural Networks Learning Systems"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.01.009"},{"year":"2008","key":"7"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2009.2035436"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.09.004"},{"issue":"3","key":"11","first-page":"296","volume":"27","year":"2001","journal-title":"Acta Automatica Sinica"},{"issue":"4","key":"12","first-page":"372","volume":"20","year":"2005","journal-title":"Control and Decision"},{"issue":"12","key":"13","first-page":"89","volume":"27","year":"2000","journal-title":"Computer Science"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/69.842271"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.7763\/IJCTE.2009.V1.98"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.06.009"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1080\/18756891.2014.853958"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(97)10046-9"},{"issue":"1","key":"19","first-page":"653","volume":"35","year":"1987","journal-title":"Bulletin of the Polish Academy of Sciences"},{"issue":"3","key":"20","first-page":"193","volume":"36","year":"1988","journal-title":"Bulletin of the Polish Academy of Sciences: Mathematics"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.08.057"},{"issue":"8","key":"23","first-page":"40","volume":"43","year":"2016","journal-title":"Computer Science"},{"issue":"5","key":"24","first-page":"77","volume":"16","year":"2016","journal-title":"International Journal of Computer Science and Network Security"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.12733\/jics20103079"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2007.02.041"},{"year":"2010","key":"27"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.02.065"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.10.023"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1080\/01431160701822115"}],"container-title":["Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2017\/8986917.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2017\/8986917.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/complexity\/2017\/8986917.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,2]],"date-time":"2017-10-02T17:00:59Z","timestamp":1506963659000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/complexity\/2017\/8986917\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":28,"alternative-id":["8986917","8986917"],"URL":"https:\/\/doi.org\/10.1155\/2017\/8986917","relation":{},"ISSN":["1076-2787","1099-0526"],"issn-type":[{"type":"print","value":"1076-2787"},{"type":"electronic","value":"1099-0526"}],"subject":[],"published":{"date-parts":[[2017]]}}}