{"id":"https://openalex.org/W4206508087","doi":"https://doi.org/10.1109/rivf51545.2021.9642118","title":"Streaming Algorithm for Submodular Cover Problem Under Noise","display_name":"Streaming Algorithm for Submodular Cover Problem Under Noise","publication_year":2021,"publication_date":"2021-08-19","ids":{"openalex":"https://openalex.org/W4206508087","doi":"https://doi.org/10.1109/rivf51545.2021.9642118"},"language":"en","primary_location":{"id":"doi:10.1109/rivf51545.2021.9642118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf51545.2021.9642118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 RIVF International Conference on Computing and Communication Technologies (RIVF)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047100737","display_name":"Bich-Ngan T. Nguyen","orcid":"https://orcid.org/0000-0002-5297-6262"},"institutions":[{"id":"https://openalex.org/I4210116271","display_name":"Ho Chi Minh City University of Industry and Trade","ror":"https://ror.org/02b2dfs85","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210116271"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Bich-Ngan T. Nguyen","raw_affiliation_strings":["HCMC University of Food Industry, Ho Chi Minh, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HCMC University of Food Industry, Ho Chi Minh, Vietnam","institution_ids":["https://openalex.org/I4210116271"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088893675","display_name":"Phuong N. H. Ph\u1ea1m","orcid":"https://orcid.org/0000-0002-7041-9531"},"institutions":[{"id":"https://openalex.org/I4210116271","display_name":"Ho Chi Minh City University of Industry and Trade","ror":"https://ror.org/02b2dfs85","country_code":"VN","type":"education","lineage":["https://openalex.org/I4210116271"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Phuong N. H. Pham","raw_affiliation_strings":["HCMC University of Food Industry, Ho Chi Minh, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HCMC University of Food Industry, Ho Chi Minh, Vietnam","institution_ids":["https://openalex.org/I4210116271"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021107068","display_name":"Canh V. Pham","orcid":"https://orcid.org/0000-0002-8118-1768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Canh V. Pham","raw_affiliation_strings":["Faculty of Information Security, People\u2019s Security Academy, Hanoi, Vietnam","Faculty of Information Security, People's Security Academy, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Security, People\u2019s Security Academy, Hanoi, Vietnam","institution_ids":[]},{"raw_affiliation_string":"Faculty of Information Security, People's Security Academy, Hanoi, Vietnam","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089288978","display_name":"Anh N. Su","orcid":"https://orcid.org/0000-0002-9838-0966"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anh N. Su","raw_affiliation_strings":["Faculty of Information Security, People\u2019s Security Academy, Hanoi, Vietnam","Faculty of Information Security, People's Security Academy, Hanoi, Vietnam"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Security, People\u2019s Security Academy, Hanoi, Vietnam","institution_ids":[]},{"raw_affiliation_string":"Faculty of Information Security, People's Security Academy, Hanoi, Vietnam","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5011543714","display_name":"V\u00e1clav Sn\u00e5\u0161el","orcid":"https://orcid.org/0000-0002-9600-8319"},"institutions":[{"id":"https://openalex.org/I142208455","display_name":"VSB - Technical University of Ostrava","ror":"https://ror.org/05x8mcb75","country_code":"CZ","type":"education","lineage":["https://openalex.org/I142208455"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vaclav Snasel","raw_affiliation_strings":["Technical University of Ostrava, Ostrava, Czech Republic"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Ostrava, Ostrava, Czech Republic","institution_ids":["https://openalex.org/I142208455"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3044,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.64734671,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/submodular-set-function","display_name":"Submodular set function","score":0.897162914276123},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.7547508478164673},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6882427334785461},{"id":"https://openalex.org/keywords/noise","display_name":"Noise (video)","score":0.6647974848747253},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6010576486587524},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.517289400100708},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.47744518518447876},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4588225185871124},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37074097990989685},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3488808274269104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2269253134727478},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21556997299194336}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.897162914276123},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7547508478164673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6882427334785461},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.6647974848747253},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6010576486587524},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.517289400100708},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.47744518518447876},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4588225185871124},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37074097990989685},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3488808274269104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2269253134727478},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21556997299194336},{"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/C115961682","wikidata":"https://www.wikidata.org/wiki/Q860623","display_name":"Image (mathematics)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf51545.2021.9642118","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf51545.2021.9642118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 RIVF International Conference on Computing and Communication Technologies (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1984069252","https://openalex.org/W1989453388","https://openalex.org/W2029828838","https://openalex.org/W2061820396","https://openalex.org/W2061958803","https://openalex.org/W2074008775","https://openalex.org/W2108614537","https://openalex.org/W2120173366","https://openalex.org/W2121671791","https://openalex.org/W2138597123","https://openalex.org/W2139430401","https://openalex.org/W2144933361","https://openalex.org/W2155461593","https://openalex.org/W2158557760","https://openalex.org/W2181828419","https://openalex.org/W2549654239","https://openalex.org/W2550348207","https://openalex.org/W2752743454","https://openalex.org/W2894187248","https://openalex.org/W2950301323","https://openalex.org/W2963922672","https://openalex.org/W2966531942","https://openalex.org/W2982337331","https://openalex.org/W3149011426","https://openalex.org/W6668802444","https://openalex.org/W6678314445","https://openalex.org/W6680646936","https://openalex.org/W6681106510","https://openalex.org/W6683180375","https://openalex.org/W6686057722","https://openalex.org/W6690133687","https://openalex.org/W6729344810","https://openalex.org/W6754523108","https://openalex.org/W6762322991"],"related_works":["https://openalex.org/W2402949237","https://openalex.org/W2964314169","https://openalex.org/W2594118609","https://openalex.org/W2950365512","https://openalex.org/W2735578456","https://openalex.org/W1608444752","https://openalex.org/W4389478405","https://openalex.org/W2963059222","https://openalex.org/W2901206941","https://openalex.org/W3204684126"],"abstract_inverted_index":{"Submodular":[0,89],"Cover":[1,90],"problem":[2,29,94],"has":[3],"attracted":[4],"the":[5,36,44,55,63,67,88,120],"attention":[6],"of":[7,10,14,69,123,132,135],"researchers":[8],"because":[9],"its":[11],"wide":[12],"variety":[13],"applications":[15],"in":[16,38,52,77,130],"economics,":[17],"machine":[18],"learning,":[19],"digital":[20],"marketing,":[21],"and":[22,61,79,95,126,137],"computer":[23],"science.":[24],"Previous":[25],"studies":[26],"on":[27,32],"this":[28,84],"have":[30],"focused":[31],"solving":[33],"it":[34],"under":[35,49,91],"assumption":[37],"a":[39,97,104],"non-noise":[40],"environment,":[41],"or":[42,74],"using":[43],"greedy":[45],"algorithm":[46,116,129],"to":[47],"solve":[48],"noise.":[50],"However,":[51],"some":[53],"applications,":[54],"data":[56],"is":[57,72],"often":[58],"large":[59,78],"scale":[60],"brings":[62],"noisy":[64,80],"version,":[65],"so":[66],"effectiveness":[68],"existing":[70],"solutions":[71,118],"low":[73],"not":[75],"applicable":[76],"data.":[81],"Motivated":[82],"by":[83],"phenomenon,":[85],"we":[86],"study":[87],"Noise":[92],"(SCN)":[93],"propose":[96],"single":[98],"pass":[99],"streaming":[100],"algorithm,":[101],"which":[102],"provides":[103,117],"bicriteria":[105],"approximation":[106],"solution":[107],"for":[108],"SCN.":[109],"The":[110],"experiment":[111],"results":[112],"indicate":[113],"that":[114],"our":[115],"with":[119],"high":[121],"value":[122],"objective":[124],"functions":[125],"outperforms":[127],"the-state-of-art":[128],"terms":[131],"both":[133],"number":[134],"queries":[136],"running":[138],"time.":[139]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}