{"id":"https://openalex.org/W2550579917","doi":"https://doi.org/10.1109/isncc.2016.7746065","title":"A formal concept analysis based approach for continuous k-nearest neighbour search in road networks","display_name":"A formal concept analysis based approach for continuous k-nearest neighbour search in road networks","publication_year":2016,"publication_date":"2016-05-01","ids":{"openalex":"https://openalex.org/W2550579917","doi":"https://doi.org/10.1109/isncc.2016.7746065","mag":"2550579917"},"language":"en","primary_location":{"id":"doi:10.1109/isncc.2016.7746065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isncc.2016.7746065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Symposium on Networks, Computers and Communications (ISNCC)","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/A5091230425","display_name":"Hafedh Ferchichi","orcid":null},"institutions":[{"id":"https://openalex.org/I54316950","display_name":"University of Jendouba","ror":"https://ror.org/000g0zm60","country_code":"TN","type":"education","lineage":["https://openalex.org/I54316950"]}],"countries":["TN"],"is_corresponding":true,"raw_author_name":"Hafedh Ferchichi","raw_affiliation_strings":["ISET de Jendouba, Compus universitaire, Jendouba, Tunisia"],"affiliations":[{"raw_affiliation_string":"ISET de Jendouba, Compus universitaire, Jendouba, Tunisia","institution_ids":["https://openalex.org/I54316950"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050082020","display_name":"Jalel Akaichi","orcid":"https://orcid.org/0000-0001-8849-8664"},"institutions":[{"id":"https://openalex.org/I237446400","display_name":"Institut Superieur de Gestion","ror":"https://ror.org/035fsmk47","country_code":"FR","type":"education","lineage":["https://openalex.org/I237446400"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jalel Akaichi","raw_affiliation_strings":["ISG de Tunis, BESTMOD Laboratory, Le Bardo, Tunis"],"affiliations":[{"raw_affiliation_string":"ISG de Tunis, BESTMOD Laboratory, Le Bardo, Tunis","institution_ids":["https://openalex.org/I237446400"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091230425"],"corresponding_institution_ids":["https://openalex.org/I54316950"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12349649,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"53","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9969000220298767,"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9926000237464905,"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/formal-concept-analysis","display_name":"Formal concept analysis","score":0.770844578742981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7070227861404419},{"id":"https://openalex.org/keywords/search-engine-indexing","display_name":"Search engine indexing","score":0.701369047164917},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.6465630531311035},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.5291265249252319},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5076016187667847},{"id":"https://openalex.org/keywords/k-nearest-neighbors-algorithm","display_name":"k-nearest neighbors algorithm","score":0.5013697147369385},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4749298691749573},{"id":"https://openalex.org/keywords/lattice-miner","display_name":"Lattice Miner","score":0.462763249874115},{"id":"https://openalex.org/keywords/nearest-neighbor-search","display_name":"Nearest neighbor search","score":0.4257050156593323},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4124360978603363},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31553882360458374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2501741051673889},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1060846745967865}],"concepts":[{"id":"https://openalex.org/C76363472","wikidata":"https://www.wikidata.org/wiki/Q1437394","display_name":"Formal concept analysis","level":2,"score":0.770844578742981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7070227861404419},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.701369047164917},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.6465630531311035},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.5291265249252319},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5076016187667847},{"id":"https://openalex.org/C113238511","wikidata":"https://www.wikidata.org/wiki/Q1071612","display_name":"k-nearest neighbors algorithm","level":2,"score":0.5013697147369385},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4749298691749573},{"id":"https://openalex.org/C203136989","wikidata":"https://www.wikidata.org/wiki/Q6497099","display_name":"Lattice Miner","level":3,"score":0.462763249874115},{"id":"https://openalex.org/C116738811","wikidata":"https://www.wikidata.org/wiki/Q608751","display_name":"Nearest neighbor search","level":2,"score":0.4257050156593323},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4124360978603363},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31553882360458374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2501741051673889},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1060846745967865},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isncc.2016.7746065","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isncc.2016.7746065","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Symposium on Networks, Computers and Communications (ISNCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.800000011920929,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1506065037","https://openalex.org/W1526692684","https://openalex.org/W1534041700","https://openalex.org/W1555830825","https://openalex.org/W1969498877","https://openalex.org/W2002110561","https://openalex.org/W2046144220","https://openalex.org/W2071515776","https://openalex.org/W2102319056","https://openalex.org/W2104128006","https://openalex.org/W2109424811","https://openalex.org/W2118269922","https://openalex.org/W2396903734","https://openalex.org/W4255318870"],"related_works":["https://openalex.org/W2376429569","https://openalex.org/W2045868466","https://openalex.org/W4296672482","https://openalex.org/W2750356991","https://openalex.org/W1545860673","https://openalex.org/W2495844640","https://openalex.org/W2801539085","https://openalex.org/W3182562120","https://openalex.org/W2306409617","https://openalex.org/W1759745424"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,32,95],"new":[4],"approach":[5,22],"to":[6,82,89,104],"the":[7,16,40,44,48,53,57,73,85,91,106],"continuous":[8],"K":[9],"nearest":[10],"neighbors":[11],"search":[12,86],"(C-KNN)":[13],"problem,":[14],"in":[15],"context":[17],"of":[18,39,108],"road":[19,74],"networks.":[20],"Our":[21],"is":[23,79],"based":[24,42,51],"on":[25,43,52,72],"Formal":[26],"Concepts":[27],"Analysis":[28],"(FCA),":[29],"which":[30],"has":[31],"mathematical":[33],"foundation.":[34],"FCA":[35],"offers":[36],"an":[37,99],"abstraction":[38],"network":[41],"neighborhoods.":[45],"We":[46],"build":[47],"concept":[49],"lattice":[50],"binary":[54],"relations":[55],"between":[56],"target":[58],"points":[59],"as":[60,62],"well":[61],"theirs":[63],"properties.":[64],"The":[65],"latter":[66],"are":[67,102],"collected":[68],"from":[69],"various":[70],"sensors":[71],"network.":[75],"An":[76],"indexing":[77],"phase":[78],"also":[80],"defined":[81],"speed":[83],"up":[84],"process":[87],"and":[88,98],"reduce":[90],"processing":[92],"time.":[93],"Finally,":[94],"case":[96],"study":[97],"experimental":[100],"evaluation":[101],"presented":[103],"show":[105],"effectiveness":[107],"our":[109],"FCA-based":[110],"solution.":[111]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}