{"id":"https://openalex.org/W2890966870","doi":"https://doi.org/10.1109/access.2018.2868846","title":"Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets","display_name":"Dimension Incremental Feature Selection Approach for Vertex Cover of Hypergraph Using Rough Sets","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2890966870","doi":"https://doi.org/10.1109/access.2018.2868846","mag":"2890966870"},"language":"en","primary_location":{"id":"doi:10.1109/access.2018.2868846","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2868846","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2018.2868846","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112211200","display_name":"Qian Zhou","orcid":"https://orcid.org/0000-0001-7888-2419"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Qian Zhou","raw_affiliation_strings":["Jiangsu Key Laboratory of Internet of Things and Control Technology, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0001-7888-2419","affiliations":[{"raw_affiliation_string":"Jiangsu Key Laboratory of Internet of Things and Control Technology, Nanjing, China","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016008333","display_name":"Xiaolin Qin","orcid":"https://orcid.org/0000-0002-8845-1089"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xiaolin Qin","raw_affiliation_strings":["Jiangsu Key Laboratory of Internet of Things and Control Technology, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0002-8845-1089","affiliations":[{"raw_affiliation_string":"Jiangsu Key Laboratory of Internet of Things and Control Technology, Nanjing, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101674704","display_name":"Xiaojun Xie","orcid":"https://orcid.org/0000-0002-4848-1099"},"institutions":[{"id":"https://openalex.org/I9842412","display_name":"Nanjing University of Aeronautics and Astronautics","ror":"https://ror.org/01scyh794","country_code":"CN","type":"education","lineage":["https://openalex.org/I9842412"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaojun Xie","raw_affiliation_strings":["College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China"],"raw_orcid":"https://orcid.org/0000-0002-4848-1099","affiliations":[{"raw_affiliation_string":"College of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing, China","institution_ids":["https://openalex.org/I9842412"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":0.6181,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.71559195,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"6","issue":null,"first_page":"50142","last_page":"50153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10538","display_name":"Data Mining Algorithms and Applications","score":0.9779000282287598,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.963699996471405,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8554531335830688},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.8521080613136292},{"id":"https://openalex.org/keywords/edge-cover","display_name":"Edge cover","score":0.7223219871520996},{"id":"https://openalex.org/keywords/rough-set","display_name":"Rough set","score":0.6755257248878479},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6603389978408813},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4775220453739166},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4736572206020355},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4671430289745331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43924930691719055},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.4133504331111908},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3978075087070465},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3107450604438782},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.27122417092323303},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.2420460283756256},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.2157185673713684},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09784534573554993}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8554531335830688},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.8521080613136292},{"id":"https://openalex.org/C17762858","wikidata":"https://www.wikidata.org/wiki/Q594001","display_name":"Edge cover","level":3,"score":0.7223219871520996},{"id":"https://openalex.org/C111012933","wikidata":"https://www.wikidata.org/wiki/Q3137210","display_name":"Rough set","level":2,"score":0.6755257248878479},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6603389978408813},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4775220453739166},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4736572206020355},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4671430289745331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43924930691719055},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.4133504331111908},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3978075087070465},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3107450604438782},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.27122417092323303},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2420460283756256},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2157185673713684},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09784534573554993},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2018.2868846","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2868846","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:d6e974b058c14e2692d990670e4e1879","is_oa":true,"landing_page_url":"https://doaj.org/article/d6e974b058c14e2692d990670e4e1879","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 6, Pp 50142-50153 (2018)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2018.2868846","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2018.2868846","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7099999785423279}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W837908851","https://openalex.org/W1509289098","https://openalex.org/W1510610982","https://openalex.org/W1547527335","https://openalex.org/W1553701556","https://openalex.org/W1581694020","https://openalex.org/W1859357731","https://openalex.org/W1934874173","https://openalex.org/W1998696012","https://openalex.org/W2004728080","https://openalex.org/W2006825961","https://openalex.org/W2026771935","https://openalex.org/W2034998024","https://openalex.org/W2036594069","https://openalex.org/W2038777942","https://openalex.org/W2048258463","https://openalex.org/W2056376412","https://openalex.org/W2068828391","https://openalex.org/W2074101794","https://openalex.org/W2076454423","https://openalex.org/W2095553101","https://openalex.org/W2096393821","https://openalex.org/W2122448854","https://openalex.org/W2128406786","https://openalex.org/W2137313157","https://openalex.org/W2162364423","https://openalex.org/W2179466049","https://openalex.org/W2189172100","https://openalex.org/W2240008187","https://openalex.org/W2254043540","https://openalex.org/W2260749394","https://openalex.org/W2342469683","https://openalex.org/W2344321186","https://openalex.org/W2349417923","https://openalex.org/W2365382545","https://openalex.org/W2419049295","https://openalex.org/W2560554126","https://openalex.org/W2617985305","https://openalex.org/W2643413515","https://openalex.org/W2772082296","https://openalex.org/W2781098805","https://openalex.org/W2789747195","https://openalex.org/W2951652158","https://openalex.org/W4255833381","https://openalex.org/W6687160870","https://openalex.org/W6990322636"],"related_works":["https://openalex.org/W2108073487","https://openalex.org/W2112112676","https://openalex.org/W4247100793","https://openalex.org/W1966805076","https://openalex.org/W2063671489","https://openalex.org/W2047424666","https://openalex.org/W2116388786","https://openalex.org/W2551034790","https://openalex.org/W4390589815","https://openalex.org/W2326642484"],"abstract_inverted_index":{"The":[0,158],"minimum":[1,29,53,60,82,125,140],"vertex":[2,30,54,61,83,108,126,141],"cover":[3,31,55,62,84,127,142],"problem":[4,32,63,70,143],"is":[5,64,102,112],"a":[6,15,129,145],"well-known":[7],"optimization":[8],"problem;":[9],"it":[10],"has":[11],"been":[12],"used":[13],"in":[14,128,148],"wide":[16],"variety":[17],"of":[18,33,48,56,81,88,94,106,116,144,150,166],"applications.":[19],"This":[20],"paper":[21],"focuses":[22],"on":[23,72],"rough":[24,135],"set-based":[25],"approach":[26],"for":[27,138],"the":[28,34,42,45,52,59,78,86,103,110,113,124,134,139,151,155,162,167,172],"dynamic":[35,104,114,130],"and":[36,51,58,91,109,132,154,164],"static":[37,146],"hypergraphs.":[38],"First,":[39],"we":[40,76],"demonstrate":[41],"relationship":[43],"between":[44],"attribute":[46,68,89,96],"reduction":[47,69,97],"decision":[49],"table":[50],"hypergraph,":[57],"converted":[65],"to":[66],"an":[67],"based":[71],"this":[73],"relationship.":[74],"Then,":[75],"discuss":[77],"update":[79,123],"mechanism":[80],"from":[85],"perspective":[87],"reduction,":[90],"two":[92],"types":[93],"incremental":[95],"algorithms":[98,120,169],"are":[99],"proposed,":[100],"one":[101],"increase":[105,115],"single":[107],"other":[111],"multiple":[117],"vertices.":[118],"Our":[119],"can":[121],"quickly":[122],"hypergraph":[131,147],"improve":[133],"sets-based":[136],"method":[137],"terms":[149],"computational":[152],"time":[153],"solution":[156],"quality.":[157],"experimental":[159],"results":[160],"show":[161],"advantages":[163],"limitations":[165],"proposed":[168],"compared":[170],"with":[171],"existing":[173],"algorithms.":[174]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}