{"id":"https://openalex.org/W2963626695","doi":"https://doi.org/10.1609/aaai.v33i01.33014618","title":"Subspace Selection via DR-Submodular Maximization on Lattices","display_name":"Subspace Selection via DR-Submodular Maximization on Lattices","publication_year":2019,"publication_date":"2019-07-17","ids":{"openalex":"https://openalex.org/W2963626695","doi":"https://doi.org/10.1609/aaai.v33i01.33014618","mag":"2963626695"},"language":"en","primary_location":{"id":"doi:10.1609/aaai.v33i01.33014618","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33014618","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4386/4264","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4386/4264","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047148891","display_name":"So Nakashima","orcid":"https://orcid.org/0000-0002-5287-7475"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"So Nakashima","raw_affiliation_strings":["Tokyo University"],"affiliations":[{"raw_affiliation_string":"Tokyo University","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5009867352","display_name":"Takanori Maehara","orcid":"https://orcid.org/0000-0002-2101-1484"},"institutions":[{"id":"https://openalex.org/I4210126580","display_name":"RIKEN Center for Advanced Intelligence Project","ror":"https://ror.org/03ckxwf91","country_code":"JP","type":"facility","lineage":["https://openalex.org/I4210110652","https://openalex.org/I4210126580"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takanori Maehara","raw_affiliation_strings":["RIKEN AIP"],"affiliations":[{"raw_affiliation_string":"RIKEN AIP","institution_ids":["https://openalex.org/I4210126580"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047148891"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1407,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.77832512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"33","issue":"01","first_page":"4618","last_page":"4625"},"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.9925000071525574,"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.9925000071525574,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.9897000193595886,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.9428831338882446},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.6045491695404053},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.567142903804779},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.55323326587677},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.5377902984619141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5371139049530029},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.48756569623947144},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.45344430208206177},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4204901456832886},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.4148099720478058},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.41345125436782837},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4111177921295166},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3787359595298767},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.254114031791687},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20077306032180786}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.9428831338882446},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.6045491695404053},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.567142903804779},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.55323326587677},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.5377902984619141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5371139049530029},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.48756569623947144},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.45344430208206177},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4204901456832886},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.4148099720478058},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.41345125436782837},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4111177921295166},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3787359595298767},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.254114031791687},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20077306032180786},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"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.1609/aaai.v33i01.33014618","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33014618","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4386/4264","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1609/aaai.v33i01.33014618","is_oa":true,"landing_page_url":"https://doi.org/10.1609/aaai.v33i01.33014618","pdf_url":"https://ojs.aaai.org/index.php/AAAI/article/download/4386/4264","source":{"id":"https://openalex.org/S4210191458","display_name":"Proceedings of the AAAI Conference on Artificial Intelligence","issn_l":"2159-5399","issn":["2159-5399","2374-3468"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320058","host_organization_name":"Association for the Advancement of Artificial Intelligence","host_organization_lineage":["https://openalex.org/P4310320058"],"host_organization_lineage_names":["Association for the Advancement of Artificial Intelligence"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the AAAI Conference on Artificial Intelligence","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963626695.pdf","grobid_xml":"https://content.openalex.org/works/W2963626695.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W340244495","https://openalex.org/W1589052184","https://openalex.org/W1680189815","https://openalex.org/W1875482710","https://openalex.org/W1955698431","https://openalex.org/W1981351071","https://openalex.org/W2028781966","https://openalex.org/W2033885045","https://openalex.org/W2076866563","https://openalex.org/W2116148865","https://openalex.org/W2126083195","https://openalex.org/W2132651631","https://openalex.org/W2139105070","https://openalex.org/W2141552007","https://openalex.org/W2153579005","https://openalex.org/W2158557760","https://openalex.org/W2159416808","https://openalex.org/W2161413792","https://openalex.org/W2162704429","https://openalex.org/W2179494254","https://openalex.org/W2181828419","https://openalex.org/W2252158512","https://openalex.org/W2436982461","https://openalex.org/W2560051165","https://openalex.org/W2560380778","https://openalex.org/W2592313125","https://openalex.org/W2593136533","https://openalex.org/W2612493850","https://openalex.org/W3160905013","https://openalex.org/W4205529794","https://openalex.org/W4294170691","https://openalex.org/W4294408192","https://openalex.org/W4297734155","https://openalex.org/W4297904641","https://openalex.org/W6611649999","https://openalex.org/W6678688841","https://openalex.org/W6679201749","https://openalex.org/W6683336336","https://openalex.org/W6683536318","https://openalex.org/W6730603623","https://openalex.org/W6743222942"],"related_works":["https://openalex.org/W2923536170","https://openalex.org/W2963059222","https://openalex.org/W4289237892","https://openalex.org/W2968699064","https://openalex.org/W2901206941","https://openalex.org/W3204684126","https://openalex.org/W4300407000","https://openalex.org/W2964314169","https://openalex.org/W2735578456","https://openalex.org/W4296167846"],"abstract_inverted_index":{"The":[0],"subspace":[1,6],"selection":[2,32,123,158,178],"problem":[3,16,179,193],"seeks":[4],"a":[5,84,98,144],"that":[7,78,116],"maximizes":[8],"an":[9],"objective":[10,64],"function":[11,142,191],"under":[12,185],"some":[13],"constraint.":[14],"This":[15],"includes":[17],"several":[18,186],"important":[19],"machine":[20],"learning":[21],"problems":[22,36,53,89,92,159],"such":[23],"as":[24,90],"the":[25,76,79,88,110,117,136,140,171,175,188],"principal":[26,118,161],"component":[27,119,162],"analysis":[28,163],"and":[29,60,66,125,164,169],"sparse":[30,121,176],"dictionary":[31,122,177],"problem.":[33],"Often,":[34],"these":[35,52,126,151],"can":[37,54,194],"be":[38,55,195],"(exactly":[39],"or":[40],"approximately)":[41],"solved":[42,56,196],"using":[43],"greedy":[44,58],"algorithms.":[45],"Here,":[46],"we":[47,73,96,153],"are":[48,128],"interested":[49],"in":[50,180],"why":[51],"by":[57],"algorithms,":[59],"what":[61],"classes":[62],"of":[63,81,101,112,139,174],"functions":[65,102],"constraints":[67],"admit":[68],"this":[69,71],"property.In":[70],"study,":[72],"focus":[74],"on":[75,93,103],"fact":[77],"set":[80],"subspaces":[82],"forms":[83],"lattice,":[85],"then":[86],"formulate":[87],"optimization":[91],"lattices.":[94],"Then,":[95],"introduce":[97],"new":[99,155],"class":[100],"lattices,":[104],"directional":[105,130,146,189],"DR-submodular":[106],"functions,":[107],"to":[108],"characterize":[109],"approximability":[111],"problems.":[113],"We":[114,133],"prove":[115,135],"analysis,":[120],"problem,":[124],"generalizations":[127],"monotone":[129],"DRsubmodularity":[131],"functions.":[132],"also":[134],"\u201cquantum":[137],"version\u201d":[138],"cut":[141,167],"is":[143],"non-monotone":[145],"DR":[147],"submodular":[148],"function.":[149],"Using":[150],"results,":[152],"propose":[154],"solvable":[156],"feature":[157],"(generalized":[160],"quantum":[165],"maximum":[166],"problem),":[168],"improve":[170],"approximation":[172,200],"ratio":[173],"certain":[181],"instances.We":[182],"show":[183],"that,":[184],"constraints,":[187],"DRsubmodular":[190],"maximization":[192],"efficiently":[197],"with":[198],"provable":[199],"factors.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}