{"id":"https://openalex.org/W4416640753","doi":"https://doi.org/10.1016/j.procs.2025.10.231","title":"Developing Search Methods for Unstructured Information Using NP- Complete Problem Solving","display_name":"Developing Search Methods for Unstructured Information Using NP- Complete Problem Solving","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4416640753","doi":"https://doi.org/10.1016/j.procs.2025.10.231"},"language":"en","primary_location":{"id":"doi:10.1016/j.procs.2025.10.231","doi":"https://doi.org/10.1016/j.procs.2025.10.231","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.231","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.procs.2025.10.231","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120379621","display_name":"Anel Auyezova","orcid":"https://orcid.org/0000-0001-9860-4491","observed_orcids":["https://orcid.org/0000-0001-9860-4491"]},"institutions":[{"id":"https://openalex.org/I4210143508","display_name":"International Information Technologies University","ror":"https://ror.org/042dtza69","country_code":"KZ","type":"education","lineage":["https://openalex.org/I4210143508"]}],"countries":["KZ"],"is_corresponding":true,"raw_author_name":"Anel Auyezova","raw_affiliation_strings":["International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan","institution_ids":["https://openalex.org/I4210143508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075476248","display_name":"\u0410\u0439\u0433\u0435\u0440\u0438\u043c \u0410\u0439\u0442\u0438\u043c","orcid":"https://orcid.org/0000-0003-2982-214X","observed_orcids":["https://orcid.org/0000-0003-2982-214X"]},"institutions":[{"id":"https://openalex.org/I4210143508","display_name":"International Information Technologies University","ror":"https://ror.org/042dtza69","country_code":"KZ","type":"education","lineage":["https://openalex.org/I4210143508"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Aigerim Aitim","raw_affiliation_strings":["International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan","institution_ids":["https://openalex.org/I4210143508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042227219","display_name":"\u0411.\u041a. \u0421\u0438\u043d\u0447\u0435\u0432","orcid":"https://orcid.org/0000-0001-8557-8458","observed_orcids":["https://orcid.org/0000-0001-8557-8458"]},"institutions":[{"id":"https://openalex.org/I4210143508","display_name":"International Information Technologies University","ror":"https://ror.org/042dtza69","country_code":"KZ","type":"education","lineage":["https://openalex.org/I4210143508"]}],"countries":["KZ"],"is_corresponding":false,"raw_author_name":"Bakhtgerey Sinchev","raw_affiliation_strings":["International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"International Information Technology University, Manas St 34/1, Almaty 050040, Kazakhstan","institution_ids":["https://openalex.org/I4210143508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5120379621"],"corresponding_institution_ids":["https://openalex.org/I4210143508"],"apc_list":null,"apc_paid":null,"fwci":1.8965,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.88001793,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"272","issue":null,"first_page":"457","last_page":"462"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7890999913215637,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.7890999913215637,"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"}},{"id":"https://openalex.org/T10286","display_name":"Information Retrieval and Search Behavior","score":0.18330000340938568,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.0034000000450760126,"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/information-retrieval","display_name":"information retrieval","score":0.7269999980926514},{"id":"https://openalex.org/keywords/unstructured-text","display_name":"unstructured text","score":0.8510000109672546},{"id":"https://openalex.org/keywords/keyword-queries","display_name":"keyword queries","score":0.7850000262260437},{"id":"https://openalex.org/keywords/search-engines","display_name":"search engines","score":0.6069999933242798},{"id":"https://openalex.org/keywords/subset-sum-problem","display_name":"subset sum problem","score":0.8330000042915344},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.996999979019165},{"id":"https://openalex.org/keywords/polynomial-time-algorithms","display_name":"polynomial-time algorithms","score":0.8299999833106995},{"id":"https://openalex.org/keywords/combinatorial-algorithms","display_name":"combinatorial algorithms","score":0.906000018119812},{"id":"https://openalex.org/keywords/contextualized-language-models","display_name":"contextual language models","score":0.7979999780654907},{"id":"https://openalex.org/keywords/legal-text-processing","display_name":"legal text processing","score":0.4650000035762787}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8980000019073486},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.6011999845504761},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5458999872207642},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.49230000376701355},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4869000017642975},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4823000133037567},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.45190000534057617},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4174000024795532},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39079999923706055},{"id":"https://openalex.org/C2781252014","wikidata":"https://www.wikidata.org/wiki/Q1141900","display_name":"Unstructured data","level":3,"score":0.3774000108242035},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.37070000171661377},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.3671000003814697},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.34860000014305115},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3278000056743622},{"id":"https://openalex.org/C148483581","wikidata":"https://www.wikidata.org/wiki/Q446488","display_name":"Feature selection","level":2,"score":0.3197000026702881},{"id":"https://openalex.org/C195324797","wikidata":"https://www.wikidata.org/wiki/Q33742","display_name":"Natural language","level":2,"score":0.311599999666214},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3095000088214874},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.30790001153945923},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.2903999984264374},{"id":"https://openalex.org/C62692426","wikidata":"https://www.wikidata.org/wiki/Q816319","display_name":"Depth-first search","level":3,"score":0.2840999960899353},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C128099668","wikidata":"https://www.wikidata.org/wiki/Q573952","display_name":"Lazy evaluation","level":3,"score":0.2727000117301941},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.26649999618530273}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.procs.2025.10.231","doi":"https://doi.org/10.1016/j.procs.2025.10.231","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.231","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.procs.2025.10.231","doi":"https://doi.org/10.1016/j.procs.2025.10.231","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.procs.2025.10.231","pdf_url":null,"source":{"id":"https://openalex.org/S120348307","display_name":"Procedia Computer Science","issn_l":"1877-0509","issn":["1877-0509"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Procedia Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G5040601522","display_name":null,"funder_award_id":"AP26101119","funder_id":"https://openalex.org/F4320322726","funder_display_name":"Ministry of Education and Science of the Republic of Kazakhstan"}],"funders":[{"id":"https://openalex.org/F4320322726","display_name":"Ministry of Education and Science of the Republic of Kazakhstan","ror":"https://ror.org/03pj6ge82"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W787742013","https://openalex.org/W1984481156","https://openalex.org/W2045492613","https://openalex.org/W2060042885","https://openalex.org/W2065207772","https://openalex.org/W2065311094","https://openalex.org/W2076844787","https://openalex.org/W2949628502","https://openalex.org/W2952204400","https://openalex.org/W3092129462","https://openalex.org/W4233756358","https://openalex.org/W4239017244"],"related_works":["https://openalex.org/W4400339946","https://openalex.org/W7214283205","https://openalex.org/W4220795891","https://openalex.org/W7143489630","https://openalex.org/W7168297709","https://openalex.org/W4415737447","https://openalex.org/W434863569","https://openalex.org/W1495714142","https://openalex.org/W7127079230","https://openalex.org/W1990166205"],"abstract_inverted_index":{"This":[0,93],"paper":[1],"proposes":[2],"a":[3,28,38,51,76],"method":[4,29,150],"designed":[5],"to":[6,61,68,99,126],"address":[7],"the":[8,62,69,107,111,113,120,127,141],"problem":[9],"of":[10,44,53,71,106,158],"information":[11],"retrieval":[12],"from":[13],"unstructured":[14,159],"textual":[15],"data.":[16],"The":[17,148],"search":[18,34,41],"process":[19,100],"is":[20,87],"conducted":[21],"in":[22,32,103,136,161],"natural":[23],"language":[24,55],"using":[25],"keyword-based":[26],"queries,":[27],"commonly":[30],"employed":[31],"modern":[33],"engines.":[35],"We":[36],"propose":[37],"general-purpose":[39],"intelligent":[40],"engine":[42],"capable":[43],"processing":[45,155],"multiple":[46],"key":[47],"terms":[48],"based":[49,89,118],"on":[50,90,119],"combination":[52],"contextual":[54],"models":[56],"and":[57,84,138,145,168],"combinatorial":[58],"algorithms":[59,116,131],"related":[60],"subset":[63,121],"sum":[64,122],"problem,":[65,123],"which":[66,124],"belongs":[67,125],"class":[70],"NP-":[72],"complete":[73],"problems.":[74],"Thus,":[75],"universal":[77],"multi-key":[78],"selection":[79],"machine":[80,95],"with":[81],"improved":[82],"time":[83,137],"space":[85,139],"characteristics":[86],"created":[88],"polynomial":[91,115,144],"algorithms.":[92,147],"proposed":[94,149],"can":[96,151],"be":[97,152],"utilized":[98],"large":[101,156],"datasets":[102],"various":[104,162],"areas":[105],"law.":[108],"To":[109],"achieve":[110],"goal,":[112],"new":[114],"are":[117,132],"NP-complete":[128],"class.":[129],"These":[130],"significantly":[133],"more":[134],"efficient":[135],"than":[140],"existing":[142],"best":[143],"exponential":[146],"adapted":[153],"for":[154],"volumes":[157],"data":[160],"applied":[163],"domains,":[164],"including":[165],"law,":[166],"economics,":[167],"medicine.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-11-25T00:00:00"}