{"id":"https://openalex.org/W4406458548","doi":"https://doi.org/10.1109/bigdata62323.2024.10825264","title":"Fairness in Monotone k-submodular Maximization: Algorithms and Applications","display_name":"Fairness in Monotone k-submodular Maximization: Algorithms and Applications","publication_year":2024,"publication_date":"2024-12-15","ids":{"openalex":"https://openalex.org/W4406458548","doi":"https://doi.org/10.1109/bigdata62323.2024.10825264"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata62323.2024.10825264","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata62323.2024.10825264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Big Data (BigData)","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/A5100572327","display_name":"Yanhui Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yanhui Zhu","raw_affiliation_strings":["Iowa State University,Department of Computer Science,Ames,USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Computer Science,Ames,USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103063258","display_name":"Samik Basu","orcid":"https://orcid.org/0000-0002-3757-2227"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Samik Basu","raw_affiliation_strings":["Iowa State University,Department of Computer Science,Ames,USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Computer Science,Ames,USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112023986","display_name":"A. Pavan","orcid":"https://orcid.org/0000-0003-1665-5266"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Pavan","raw_affiliation_strings":["Iowa State University,Department of Computer Science,Ames,USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University,Department of Computer Science,Ames,USA","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100572327"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.3804,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68609723,"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":"173","last_page":"178"},"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.9994999766349792,"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.9994999766349792,"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.9988999962806702,"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/T11182","display_name":"Auction Theory and Applications","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.931072473526001},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7354567050933838},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6059259176254272},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5822398066520691},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48121121525764465},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39006009697914124},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3545832335948944},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2715272307395935}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.931072473526001},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7354567050933838},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6059259176254272},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5822398066520691},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48121121525764465},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39006009697914124},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3545832335948944},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2715272307395935},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata62323.2024.10825264","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata62323.2024.10825264","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Conference on Big Data (BigData)","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":27,"referenced_works":["https://openalex.org/W1771852678","https://openalex.org/W1908692903","https://openalex.org/W1930126570","https://openalex.org/W2061820396","https://openalex.org/W2139430401","https://openalex.org/W2182880825","https://openalex.org/W2491571354","https://openalex.org/W2741951152","https://openalex.org/W2752672873","https://openalex.org/W2913924657","https://openalex.org/W2950365512","https://openalex.org/W3093356333","https://openalex.org/W3128954550","https://openalex.org/W3171608239","https://openalex.org/W3200286961","https://openalex.org/W4231490457","https://openalex.org/W4289258965","https://openalex.org/W4292070111","https://openalex.org/W4296168139","https://openalex.org/W4298846155","https://openalex.org/W4324393045","https://openalex.org/W4402624906","https://openalex.org/W4406458548","https://openalex.org/W6686400581","https://openalex.org/W6743933341","https://openalex.org/W6747974625","https://openalex.org/W6762219430"],"related_works":["https://openalex.org/W1595919516","https://openalex.org/W2945022594","https://openalex.org/W2194604332","https://openalex.org/W4206383867","https://openalex.org/W2923536170","https://openalex.org/W2896347948","https://openalex.org/W4302557420","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W2037938733"],"abstract_inverted_index":{"Submodular":[0],"optimization":[1],"has":[2,11],"become":[3],"increasingly":[4],"prominent":[5],"in":[6],"machine":[7],"learning,":[8],"and":[9,27,106],"fairness":[10,49,119],"drawn":[12],"much":[13],"attention.":[14],"In":[15,51],"this":[16],"paper,":[17],"we":[18,53,79],"propose":[19],"to":[20],"study":[21,105],"the":[22,43,73,84,108,118,125],"fair":[23],"k-submodular":[24,45,85],"maximization":[25,46],"problem":[26],"develop":[28],"a":[29,34,56,62],"1/3-approximation":[30],"greedy":[31],"algorithm":[32,59],"with":[33,66],"running":[35],"time":[36],"of":[37,72,111,127],"O(knB).":[38],"Our":[39],"theoretical":[40,101],"guarantee":[41],"matches":[42],"best-known":[44],"results":[47,115],"without":[48],"constraints.":[50],"addition,":[52],"have":[54,97],"developed":[55],"faster":[57],"threshold-based":[58],"that":[60,117],"achieves":[61],"(1/3":[63],"\u03f5)":[64],"approximation":[65,81],"${\\mathcal{O}}\\left({\\frac{{kn}}{\\varepsilon":[67],"}\\log":[68],"\\frac{B}{\\varepsilon":[69],"}}\\right)$":[70],"evaluations":[71],"function\u2212f.":[74],"Furthermore,":[75],"for":[76],"both":[77],"algorithms,":[78],"provide":[80],"guarantees":[82],"when":[83],"function":[86],"is":[87],"not":[88,122],"accessible":[89],"but":[90],"only":[91],"can":[92],"be":[93],"approximately":[94],"accessed.":[95],"We":[96],"extensively":[98],"validated":[99],"our":[100],"findings":[102],"through":[103],"empirical":[104],"examined":[107],"practical":[109],"implications":[110],"fairness.":[112],"The":[113],"experimental":[114],"show":[116],"constraints":[120],"do":[121],"significantly":[123],"undermine":[124],"quality":[126],"solutions.":[128]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}