{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:42:47Z","timestamp":1729611767336,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1109\/isncc.2016.7746065","type":"proceedings-article","created":{"date-parts":[[2016,11,17]],"date-time":"2016-11-17T21:34:47Z","timestamp":1479418487000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A formal concept analysis based approach for continuous k-nearest neighbour search in road networks"],"prefix":"10.1109","author":[{"given":"Hafedh","family":"Ferchichi","sequence":"first","affiliation":[]},{"given":"Jalel","family":"Akaichi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"K-Nearest Neighbor Search for Moving Query Point SSTD","year":"2001","author":"song","key":"ref10"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1504\/IJIIDS.2008.018255","article-title":"Incremental Approach for Continuous k-Nearest Neighbors Queries on Road","author":"khayati","year":"2008","journal-title":"International Journal of Intelligent Information and Database Systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505749"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1995.tb00031.x"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/11528784_9"},{"key":"ref16","first-page":"31","article-title":"W spab: A tool for automatic selection & classification of web services using formal concept analysis","author":"azmeh","year":"0"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/11528784_13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11528784_10"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/130283.130333"},{"key":"ref6","first-page":"17","article-title":"A method for mining functional dependencies in relational database design using FCA","volume":"53","author":"rancz","year":"2008","journal-title":"Studia Universitatis Babes-Bolyai Cluj-Napoca Informatica"},{"key":"ref5","first-page":"133","article-title":"The Formal analysis of concepts at the service of building and enriching a ontologie","author":"bendaoud","year":"2010","journal-title":"Revue of New Information technology"},{"key":"ref8","first-page":"47","article-title":"An efficient and robust access method for dots and rectangles","author":"beckmann","year":"1990","journal-title":"Proc ACMSIGMOD"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655779"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263671"}],"event":{"name":"2016 International Symposium on Networks, Computers and Communications (ISNCC)","start":{"date-parts":[[2016,5,11]]},"location":"Yasmine Hammamet, Tunisia","end":{"date-parts":[[2016,5,13]]}},"container-title":["2016 International Symposium on Networks, Computers and Communications (ISNCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7733757\/7746056\/07746065.pdf?arnumber=7746065","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T03:53:14Z","timestamp":1498362794000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7746065\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/isncc.2016.7746065","relation":{},"subject":[],"published":{"date-parts":[[2016,5]]}}}