{"id":"https://openalex.org/W2069362824","doi":"https://doi.org/10.1145/2507157.2507169","title":"Using maximum coverage to optimize recommendation systems in e-commerce","display_name":"Using maximum coverage to optimize recommendation systems in e-commerce","publication_year":2013,"publication_date":"2013-10-12","ids":{"openalex":"https://openalex.org/W2069362824","doi":"https://doi.org/10.1145/2507157.2507169","mag":"2069362824"},"language":"en","primary_location":{"id":"doi:10.1145/2507157.2507169","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2507157.2507169","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM conference on Recommender systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-12377","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089036996","display_name":"Mikael Hammar","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mikael Hammar","raw_affiliation_strings":["Apptus Technologies, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Apptus Technologies, Lund, Sweden","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022811365","display_name":"Robin Karlsson","orcid":"https://orcid.org/0000-0001-6106-9616"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robin Karlsson","raw_affiliation_strings":["Apptus Technologies, Lund, Sweden"],"affiliations":[{"raw_affiliation_string":"Apptus Technologies, Lund, Sweden","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101713320","display_name":"Bengt J. Nilsson","orcid":"https://orcid.org/0000-0002-1342-8618"},"institutions":[{"id":"https://openalex.org/I183111857","display_name":"Malm\u00f6 University","ror":"https://ror.org/05wp7an13","country_code":"SE","type":"education","lineage":["https://openalex.org/I183111857"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Bengt J. Nilsson","raw_affiliation_strings":["Malm\u00f6 University, Malm\u00f6, Sweden"],"affiliations":[{"raw_affiliation_string":"Malm\u00f6 University, Malm\u00f6, Sweden","institution_ids":["https://openalex.org/I183111857"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089036996"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.131,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.81582641,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"265","last_page":"272"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"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/T11106","display_name":"Data Management and Algorithms","score":0.9972000122070312,"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/cover","display_name":"Cover (algebra)","score":0.7324821352958679},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7085329294204712},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6507439017295837},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6105788350105286},{"id":"https://openalex.org/keywords/recommender-system","display_name":"Recommender system","score":0.6028214693069458},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5992646217346191},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.5716096758842468},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4956866502761841},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42936185002326965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3069298267364502},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22701549530029297},{"id":"https://openalex.org/keywords/information-retrieval","display_name":"Information retrieval","score":0.13351985812187195},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11701580882072449}],"concepts":[{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.7324821352958679},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7085329294204712},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6507439017295837},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6105788350105286},{"id":"https://openalex.org/C557471498","wikidata":"https://www.wikidata.org/wiki/Q554950","display_name":"Recommender system","level":2,"score":0.6028214693069458},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5992646217346191},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.5716096758842468},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4956866502761841},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42936185002326965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3069298267364502},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22701549530029297},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.13351985812187195},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11701580882072449},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2507157.2507169","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2507157.2507169","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th ACM conference on Recommender systems","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.971.7408","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.971.7408","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"https://dspace.mah.se/bitstream/handle/2043/16856/paper-theoneused.pdf%3Bjsessionid%3D5F2816DC762D7352121C6B9FD377B631?sequence%3D2","raw_type":"text"},{"id":"pmh:oai:DiVA.org:mau-12377","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-12377","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:muep.mau.se:2043/16856","is_oa":false,"landing_page_url":"http://hdl.handle.net/2043/16856","pdf_url":null,"source":{"id":"https://openalex.org/S4377196423","display_name":"Malm\u00f6 University Publications (Malm\u00f6 University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183111857","host_organization_name":"Malm\u00f6 University","host_organization_lineage":["https://openalex.org/I183111857"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper, other"}],"best_oa_location":{"id":"pmh:oai:DiVA.org:mau-12377","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:mau:diva-12377","pdf_url":null,"source":{"id":"https://openalex.org/S4306401559","display_name":"KTH Publication Database DiVA (KTH Royal Institute of Technology)","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W112063162","https://openalex.org/W1505823450","https://openalex.org/W1990313671","https://openalex.org/W1992576934","https://openalex.org/W1993320088","https://openalex.org/W2011039300","https://openalex.org/W2021185572","https://openalex.org/W2037098674","https://openalex.org/W2040924621","https://openalex.org/W2052333181","https://openalex.org/W2088188524","https://openalex.org/W2142339200","https://openalex.org/W2143996311","https://openalex.org/W2149547418","https://openalex.org/W2152228468","https://openalex.org/W2157054705","https://openalex.org/W2166224193","https://openalex.org/W2293743194","https://openalex.org/W2401610261","https://openalex.org/W2611804663","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W3149604617","https://openalex.org/W4206478994","https://openalex.org/W4250886557","https://openalex.org/W4285719527","https://openalex.org/W6844382842","https://openalex.org/W7026635939"],"related_works":["https://openalex.org/W1550117727","https://openalex.org/W3095810947","https://openalex.org/W2202486749","https://openalex.org/W2325870907","https://openalex.org/W2147086810","https://openalex.org/W41005574","https://openalex.org/W3204684126","https://openalex.org/W2174864496","https://openalex.org/W1594413663","https://openalex.org/W2019216770"],"abstract_inverted_index":{"We":[0,11],"study":[1],"the":[2,23,32,38,61,79],"problem":[3,28],"of":[4,63],"optimizing":[5],"recommendation":[6],"systems":[7],"for":[8,31,52],"e-commerce":[9],"sites.":[10],"consider":[12],"in":[13],"particular":[14],"a":[15,42],"combinatorial":[16],"solution":[17],"to":[18,59],"this":[19],"optimization":[20],"based":[21,77],"on":[22,78],"well":[24],"known":[25],"Maximum":[26,67],"Coverage":[27,68],"that":[29,36],"asks":[30],"k":[33,54],"sets":[34],"(products)":[35],"cover":[37],"most":[39],"elements":[40],"from":[41],"ground":[43],"set":[44],"(consumers).":[45],"This":[46],"formulation":[47],"provides":[48],"an":[49,72],"abstract":[50],"model":[51],"what":[53],"products":[55],"should":[56],"be":[57],"recommended":[58],"maximize":[60],"probability":[62],"consumer":[64],"purchase.":[65],"Unfortunately,":[66],"is":[69],"NP-complete":[70],"but":[71],"efficient":[73],"approximation":[74],"algorithm":[75],"exists":[76],"Greedy":[80],"methodology.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}