{"id":"https://openalex.org/W3161006789","doi":"https://doi.org/10.1145/3448734.3450921","title":"Research on the Recommendation Algorithm Based on 0-1 Knapsack Problem","display_name":"Research on the Recommendation Algorithm Based on 0-1 Knapsack Problem","publication_year":2021,"publication_date":"2021-01-28","ids":{"openalex":"https://openalex.org/W3161006789","doi":"https://doi.org/10.1145/3448734.3450921","mag":"3161006789"},"language":"en","primary_location":{"id":"doi:10.1145/3448734.3450921","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448734.3450921","pdf_url":null,"source":{"id":"https://openalex.org/S4306531993","display_name":"The 2nd International Conference on Computing and Data Science","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2nd International Conference on Computing and Data Science","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/A5112228530","display_name":"Wenrong Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I135905480","display_name":"Shanghai Polytechnic University","ror":"https://ror.org/02as5yg64","country_code":"CN","type":"education","lineage":["https://openalex.org/I135905480"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wenrong Jiang","raw_affiliation_strings":["Shanghai Polytechnic University"],"affiliations":[{"raw_affiliation_string":"Shanghai Polytechnic University","institution_ids":["https://openalex.org/I135905480"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5112228530"],"corresponding_institution_ids":["https://openalex.org/I135905480"],"apc_list":null,"apc_paid":null,"fwci":0.4424,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47468031,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.855400025844574,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.855400025844574,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.8148999810218811,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.7577000260353088,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.9910603165626526},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.7808226346969604},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.5994704961776733},{"id":"https://openalex.org/keywords/premise","display_name":"Premise","score":0.5569467544555664},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5366830825805664},{"id":"https://openalex.org/keywords/cutting-stock-problem","display_name":"Cutting stock problem","score":0.5342549085617065},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.528813362121582},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.5251074433326721},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5176820755004883},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.4544312655925751},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44530102610588074},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.4315292239189148},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.42865586280822754},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4265037775039673},{"id":"https://openalex.org/keywords/generalized-assignment-problem","display_name":"Generalized assignment problem","score":0.4123607575893402},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.39273229241371155},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3278195858001709},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.10936999320983887}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9910603165626526},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.7808226346969604},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.5994704961776733},{"id":"https://openalex.org/C2778023277","wikidata":"https://www.wikidata.org/wiki/Q321703","display_name":"Premise","level":2,"score":0.5569467544555664},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5366830825805664},{"id":"https://openalex.org/C37307619","wikidata":"https://www.wikidata.org/wiki/Q1306230","display_name":"Cutting stock problem","level":3,"score":0.5342549085617065},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.528813362121582},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.5251074433326721},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5176820755004883},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.4544312655925751},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44530102610588074},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4315292239189148},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.42865586280822754},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4265037775039673},{"id":"https://openalex.org/C194146004","wikidata":"https://www.wikidata.org/wiki/Q5532462","display_name":"Generalized assignment problem","level":3,"score":0.4123607575893402},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39273229241371155},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3278195858001709},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.10936999320983887},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3448734.3450921","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3448734.3450921","pdf_url":null,"source":{"id":"https://openalex.org/S4306531993","display_name":"The 2nd International Conference on Computing and Data Science","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2nd International Conference on Computing and Data Science","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":2,"referenced_works":["https://openalex.org/W2498696598","https://openalex.org/W2986824672"],"related_works":["https://openalex.org/W2889442766","https://openalex.org/W2412614002","https://openalex.org/W2087209118","https://openalex.org/W2005493932","https://openalex.org/W2993365626","https://openalex.org/W2381035939","https://openalex.org/W2089402478","https://openalex.org/W2168163332","https://openalex.org/W1969981152","https://openalex.org/W2122137596"],"abstract_inverted_index":{"Knapsack":[0],"Problem":[1,6],"is":[2],"a":[3,17,69,92,121],"NP":[4],"complete":[5],"of":[7,19,43,76,107],"combinatorial":[8,53],"optimization.":[9],"The":[10],"problem":[11,64,100],"can":[12,35,65,84,124],"be":[13,66,125],"described":[14,67],"as:":[15],"given":[16],"set":[18],"items,":[20],"each":[21,108],"item":[22],"has":[23],"its":[24],"own":[25],"weight":[26,82],"and":[27,56,59,62,105,110],"value.":[28],"Within":[29],"the":[30,40,44,51,74,80,103,111],"limited":[31],"total":[32,41,81,86],"weight,":[33],"how":[34],"we":[36],"choose":[37],"to":[38,118],"maximize":[39],"value":[42,87],"item?":[45],"Similar":[46],"problems":[47],"often":[48],"occur":[49],"in":[50,127],"business,":[52],"mathematics,":[54,58],"cryptography,":[55],"applied":[57,126],"other":[60],"fields,":[61],"this":[63],"as":[68],"crucial":[70],"question,":[71],"namely":[72],"\"under":[73],"premise":[75],"not":[77],"more":[78],"than":[79],"W,":[83],"achieve":[85],"V?\".":[88],"This":[89],"article":[90],"with":[91],"algorithm":[93,113,123],"design,":[94],"example,":[95],"grouping":[96],"solving":[97],"0-1":[98],"knapsack":[99,116],"algorithm,":[101,109],"analysis":[102],"advantages":[104],"disadvantages":[106],"solution":[112],"based":[114],"on":[115],"problem,":[117],"put":[119],"forward":[120],"recommendation":[122],"song":[128],"recommended,":[129],"advertising,":[130],"news,":[131],"etc.":[132]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}