{"id":"https://openalex.org/W4205801553","doi":"https://doi.org/10.1109/bigdata52589.2021.9671654","title":"Enhancing Learned Index for A Higher Recall Trajectory K-Nearest Neighbor Search","display_name":"Enhancing Learned Index for A Higher Recall Trajectory K-Nearest Neighbor Search","publication_year":2021,"publication_date":"2021-12-15","ids":{"openalex":"https://openalex.org/W4205801553","doi":"https://doi.org/10.1109/bigdata52589.2021.9671654"},"language":"en","primary_location":{"id":"doi:10.1109/bigdata52589.2021.9671654","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata52589.2021.9671654","pdf_url":null,"source":{"id":"https://openalex.org/S4363607718","display_name":"2021 IEEE International Conference on Big Data (Big Data)","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":"2021 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5042281603","display_name":"Hani Ramadhan","orcid":"https://orcid.org/0000-0003-1357-7469"},"institutions":[{"id":"https://openalex.org/I4921948","display_name":"Pusan National University","ror":"https://ror.org/01an57a31","country_code":"KR","type":"education","lineage":["https://openalex.org/I4921948"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hani Ramadhan","raw_affiliation_strings":["Big Data Department, Pusan National University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Big Data Department, Pusan National University, South Korea","institution_ids":["https://openalex.org/I4921948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081543046","display_name":"Joonho Kwon","orcid":"https://orcid.org/0000-0002-8207-9415"},"institutions":[{"id":"https://openalex.org/I4921948","display_name":"Pusan National University","ror":"https://ror.org/01an57a31","country_code":"KR","type":"education","lineage":["https://openalex.org/I4921948"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Joonho Kwon","raw_affiliation_strings":["School of Computer Science and Engineering, Pusan National University, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Pusan National University, South Korea","institution_ids":["https://openalex.org/I4921948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4921948"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"6006","last_page":"6007"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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"}},{"id":"https://openalex.org/T12205","display_name":"Time Series Analysis and Forecasting","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T11512","display_name":"Anomaly Detection Techniques and Applications","score":0.9909999966621399,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/pruning","display_name":"Pruning","score":0.8784952163696289},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7395905256271362},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.7378772497177124},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.723781943321228},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.6526490449905396},{"id":"https://openalex.org/keywords/index","display_name":"Index (typography)","score":0.6169367432594299},{"id":"https://openalex.org/keywords/precision-and-recall","display_name":"Precision and recall","score":0.5416808724403381},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4978961944580078},{"id":"https://openalex.org/keywords/workload","display_name":"Workload","score":0.45267462730407715},{"id":"https://openalex.org/keywords/recall","display_name":"Recall","score":0.45049750804901123},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.43797680735588074},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.38944607973098755},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3361237645149231},{"id":"https://openalex.org/keywords/pattern-recognition","display_name":"Pattern recognition (psychology)","score":0.3224899470806122}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.8784952163696289},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7395905256271362},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.7378772497177124},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.723781943321228},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.6526490449905396},{"id":"https://openalex.org/C2777382242","wikidata":"https://www.wikidata.org/wiki/Q6017816","display_name":"Index (typography)","level":2,"score":0.6169367432594299},{"id":"https://openalex.org/C81669768","wikidata":"https://www.wikidata.org/wiki/Q2359161","display_name":"Precision and recall","level":2,"score":0.5416808724403381},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4978961944580078},{"id":"https://openalex.org/C2778476105","wikidata":"https://www.wikidata.org/wiki/Q628539","display_name":"Workload","level":2,"score":0.45267462730407715},{"id":"https://openalex.org/C100660578","wikidata":"https://www.wikidata.org/wiki/Q18733","display_name":"Recall","level":2,"score":0.45049750804901123},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.43797680735588074},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.38944607973098755},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3361237645149231},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.3224899470806122},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/bigdata52589.2021.9671654","is_oa":false,"landing_page_url":"https://doi.org/10.1109/bigdata52589.2021.9671654","pdf_url":null,"source":{"id":"https://openalex.org/S4363607718","display_name":"2021 IEEE International Conference on Big Data (Big Data)","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":"2021 IEEE International Conference on Big Data (Big Data)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320311687","display_name":"Ministry of Education","ror":"https://ror.org/03m01yf64"},{"id":"https://openalex.org/F4320320671","display_name":"National Research Foundation","ror":"https://ror.org/05s0g1g46"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1596717185","https://openalex.org/W2056132907","https://openalex.org/W3029564598","https://openalex.org/W3106489949","https://openalex.org/W3136488051","https://openalex.org/W3209898743"],"related_works":["https://openalex.org/W2148008870","https://openalex.org/W2381195555","https://openalex.org/W2368606575","https://openalex.org/W4246757943","https://openalex.org/W2085998272","https://openalex.org/W2358294942","https://openalex.org/W2132753198","https://openalex.org/W2369874856","https://openalex.org/W2182477562","https://openalex.org/W2792185758"],"abstract_inverted_index":{"Learned":[0],"indices":[1],"can":[2],"significantly":[3],"shorten":[4],"the":[5,18,59,65,77,87],"query":[6,66,74],"response":[7],"time":[8],"of":[9,13,25],"k-Nearest":[10,22,60],"Neighbor":[11,23],"search":[12,24],"points":[14],"data.":[15],"However,":[16],"extending":[17],"learned":[19,46,55],"index":[20,47,56],"for":[21,44,53],"trajectory":[26,45,96],"data":[27],"may":[28],"return":[29],"incorrect":[30],"results":[31],"(low":[32],"recall)":[33],"and":[34],"require":[35],"longer":[36],"pruning":[37,51,69],"time.":[38],"Thus,":[39],"we":[40],"introduce":[41],"an":[42],"enhancement":[43],"which":[48],"is":[49],"a":[50,54,71,93],"step":[52],"to":[57,89],"retrieve":[58],"Neighbors":[61],"correctly":[62],"by":[63],"learning":[64],"workload.":[67],"The":[68],"utilizes":[70],"predicted":[72],"range":[73],"that":[75,82,83],"covers":[76],"correct":[78],"neighbors.":[79],"We":[80],"show":[81],"our":[84],"approach":[85],"has":[86],"potential":[88],"work":[90],"effectively":[91],"in":[92],"large":[94],"real-world":[95],"dataset.":[97]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
