Efficient Iϵ/I-Approximate Ik/I-Flexible Aggregate Nearest Neighbor Search for Arbitrary Iϵ/I in Road Networks
Recently, complicated spatial search algorithms have emerged as spatial-information-based applications, such as location-based services (LBS), and have become very diverse and frequent. The aggregate nearest neighbor (ANN) search is an extension of the existing nearest neighbor (NN) search; it finds...
Gespeichert in:
Veröffentlicht in: | Electronics (Basel) 2023-08, Vol.12 (17) |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | 17 |
container_start_page | |
container_title | Electronics (Basel) |
container_volume | 12 |
creator | Kwon, Hyuk-Yoon Yoo, Jaejun Loh, Woong-Kee |
description | Recently, complicated spatial search algorithms have emerged as spatial-information-based applications, such as location-based services (LBS), and have become very diverse and frequent. The aggregate nearest neighbor (ANN) search is an extension of the existing nearest neighbor (NN) search; it finds the object p[sup.*] that minimizes G{d(p[sup.*] ,q[sub.i] ),q[sub.i] ∈Q} from a set Q of M (≥1) query objects, where G is an aggregate function and d() is the distance between two objects. The flexible aggregate nearest neighbor (FANN) search is an extension of the ANN search by introducing flexibility factor ϕ (0 |
doi_str_mv | 10.3390/electronics12173622 |
format | Article |
fullrecord | <record><control><sourceid>gale</sourceid><recordid>TN_cdi_gale_infotracacademiconefile_A764265147</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A764265147</galeid><sourcerecordid>A764265147</sourcerecordid><originalsourceid>FETCH-gale_infotracacademiconefile_A7642651473</originalsourceid><addsrcrecordid>eNqVjD1OAzEUhC0EEhHkBDS-wCb-Cbu4XKFEbEMR6JHXeXYeceyVbYlwMM7BlTCCgpZ5xYw-zTxCbjhbSKnYEjyYkmJAk7ngnWyFOCMzwTrVKKHE-Z98SeY5v7IqxeWdZDMyra1FgxAKHT4_lkPTT1OKJzzqAnQ4VLDxcMLRA-2dS-C--SPoBLlUR7cfY6JPFZg9tTX2acSSdHr_-Ucx0G3Uu9otbzEd8jW5sNpnmP_6FVls1s_3D43THl4w2FjXpt4OjmhiAIuV9127Eu0tX3Xy34MvbhJctQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Efficient Iϵ/I-Approximate Ik/I-Flexible Aggregate Nearest Neighbor Search for Arbitrary Iϵ/I in Road Networks</title><source>MDPI - Multidisciplinary Digital Publishing Institute</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Kwon, Hyuk-Yoon ; Yoo, Jaejun ; Loh, Woong-Kee</creator><creatorcontrib>Kwon, Hyuk-Yoon ; Yoo, Jaejun ; Loh, Woong-Kee</creatorcontrib><description>Recently, complicated spatial search algorithms have emerged as spatial-information-based applications, such as location-based services (LBS), and have become very diverse and frequent. The aggregate nearest neighbor (ANN) search is an extension of the existing nearest neighbor (NN) search; it finds the object p[sup.*] that minimizes G{d(p[sup.*] ,q[sub.i] ),q[sub.i] ∈Q} from a set Q of M (≥1) query objects, where G is an aggregate function and d() is the distance between two objects. The flexible aggregate nearest neighbor (FANN) search is an extension of the ANN search by introducing flexibility factor ϕ (0<ϕ≤1); it finds the object p[sup.*] that minimizes G{d(p[sup.*] ,q[sub.i] ),q[sub.i] ∈Q[sub.ϕ] } from Q[sub.ϕ] , a subset of Q with |Q[sub.ϕ] |=ϕ|Q|. This paper proposes an efficient ϵ-approximate k-FANN (k≥1) search algorithm for an arbitrary approximation ratio ϵ (≥1) in road networks. In general, ϵ-approximate algorithms are expected to give an improved search performance at the cost of allowing an error ratio of up to the given ϵ. Since the optimal value of ϵ varies greatly depending on applications and cases, the approximate algorithm for an arbitrary ϵ is essential. We prove that the error ratios of the approximate FANN objects returned by our algorithm do not exceed the given ϵ. To the best of our knowledge, our algorithm is the first ϵ-approximate k-FANN search algorithm in road networks for an arbitrary ϵ. Through a series of experiments using various real-world road network datasets, we demonstrated that our approximate algorithm always outperformed the previous state-of-the-art exact algorithm and that the error ratios of the approximate FANN objects were significantly lower than the given ϵ value.</description><identifier>ISSN: 2079-9292</identifier><identifier>EISSN: 2079-9292</identifier><identifier>DOI: 10.3390/electronics12173622</identifier><language>eng</language><publisher>MDPI AG</publisher><subject>Algorithms ; Location-based systems ; Neural networks ; Roads ; South Korea ; Streets</subject><ispartof>Electronics (Basel), 2023-08, Vol.12 (17)</ispartof><rights>COPYRIGHT 2023 MDPI AG</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Kwon, Hyuk-Yoon</creatorcontrib><creatorcontrib>Yoo, Jaejun</creatorcontrib><creatorcontrib>Loh, Woong-Kee</creatorcontrib><title>Efficient Iϵ/I-Approximate Ik/I-Flexible Aggregate Nearest Neighbor Search for Arbitrary Iϵ/I in Road Networks</title><title>Electronics (Basel)</title><description>Recently, complicated spatial search algorithms have emerged as spatial-information-based applications, such as location-based services (LBS), and have become very diverse and frequent. The aggregate nearest neighbor (ANN) search is an extension of the existing nearest neighbor (NN) search; it finds the object p[sup.*] that minimizes G{d(p[sup.*] ,q[sub.i] ),q[sub.i] ∈Q} from a set Q of M (≥1) query objects, where G is an aggregate function and d() is the distance between two objects. The flexible aggregate nearest neighbor (FANN) search is an extension of the ANN search by introducing flexibility factor ϕ (0<ϕ≤1); it finds the object p[sup.*] that minimizes G{d(p[sup.*] ,q[sub.i] ),q[sub.i] ∈Q[sub.ϕ] } from Q[sub.ϕ] , a subset of Q with |Q[sub.ϕ] |=ϕ|Q|. This paper proposes an efficient ϵ-approximate k-FANN (k≥1) search algorithm for an arbitrary approximation ratio ϵ (≥1) in road networks. In general, ϵ-approximate algorithms are expected to give an improved search performance at the cost of allowing an error ratio of up to the given ϵ. Since the optimal value of ϵ varies greatly depending on applications and cases, the approximate algorithm for an arbitrary ϵ is essential. We prove that the error ratios of the approximate FANN objects returned by our algorithm do not exceed the given ϵ. To the best of our knowledge, our algorithm is the first ϵ-approximate k-FANN search algorithm in road networks for an arbitrary ϵ. Through a series of experiments using various real-world road network datasets, we demonstrated that our approximate algorithm always outperformed the previous state-of-the-art exact algorithm and that the error ratios of the approximate FANN objects were significantly lower than the given ϵ value.</description><subject>Algorithms</subject><subject>Location-based systems</subject><subject>Neural networks</subject><subject>Roads</subject><subject>South Korea</subject><subject>Streets</subject><issn>2079-9292</issn><issn>2079-9292</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid/><recordid>eNqVjD1OAzEUhC0EEhHkBDS-wCb-Cbu4XKFEbEMR6JHXeXYeceyVbYlwMM7BlTCCgpZ5xYw-zTxCbjhbSKnYEjyYkmJAk7ngnWyFOCMzwTrVKKHE-Z98SeY5v7IqxeWdZDMyra1FgxAKHT4_lkPTT1OKJzzqAnQ4VLDxcMLRA-2dS-C--SPoBLlUR7cfY6JPFZg9tTX2acSSdHr_-Ucx0G3Uu9otbzEd8jW5sNpnmP_6FVls1s_3D43THl4w2FjXpt4OjmhiAIuV9127Eu0tX3Xy34MvbhJctQ</recordid><startdate>20230801</startdate><enddate>20230801</enddate><creator>Kwon, Hyuk-Yoon</creator><creator>Yoo, Jaejun</creator><creator>Loh, Woong-Kee</creator><general>MDPI AG</general><scope/></search><sort><creationdate>20230801</creationdate><title>Efficient Iϵ/I-Approximate Ik/I-Flexible Aggregate Nearest Neighbor Search for Arbitrary Iϵ/I in Road Networks</title><author>Kwon, Hyuk-Yoon ; Yoo, Jaejun ; Loh, Woong-Kee</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-gale_infotracacademiconefile_A7642651473</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Location-based systems</topic><topic>Neural networks</topic><topic>Roads</topic><topic>South Korea</topic><topic>Streets</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kwon, Hyuk-Yoon</creatorcontrib><creatorcontrib>Yoo, Jaejun</creatorcontrib><creatorcontrib>Loh, Woong-Kee</creatorcontrib><jtitle>Electronics (Basel)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kwon, Hyuk-Yoon</au><au>Yoo, Jaejun</au><au>Loh, Woong-Kee</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Efficient Iϵ/I-Approximate Ik/I-Flexible Aggregate Nearest Neighbor Search for Arbitrary Iϵ/I in Road Networks</atitle><jtitle>Electronics (Basel)</jtitle><date>2023-08-01</date><risdate>2023</risdate><volume>12</volume><issue>17</issue><issn>2079-9292</issn><eissn>2079-9292</eissn><abstract>Recently, complicated spatial search algorithms have emerged as spatial-information-based applications, such as location-based services (LBS), and have become very diverse and frequent. The aggregate nearest neighbor (ANN) search is an extension of the existing nearest neighbor (NN) search; it finds the object p[sup.*] that minimizes G{d(p[sup.*] ,q[sub.i] ),q[sub.i] ∈Q} from a set Q of M (≥1) query objects, where G is an aggregate function and d() is the distance between two objects. The flexible aggregate nearest neighbor (FANN) search is an extension of the ANN search by introducing flexibility factor ϕ (0<ϕ≤1); it finds the object p[sup.*] that minimizes G{d(p[sup.*] ,q[sub.i] ),q[sub.i] ∈Q[sub.ϕ] } from Q[sub.ϕ] , a subset of Q with |Q[sub.ϕ] |=ϕ|Q|. This paper proposes an efficient ϵ-approximate k-FANN (k≥1) search algorithm for an arbitrary approximation ratio ϵ (≥1) in road networks. In general, ϵ-approximate algorithms are expected to give an improved search performance at the cost of allowing an error ratio of up to the given ϵ. Since the optimal value of ϵ varies greatly depending on applications and cases, the approximate algorithm for an arbitrary ϵ is essential. We prove that the error ratios of the approximate FANN objects returned by our algorithm do not exceed the given ϵ. To the best of our knowledge, our algorithm is the first ϵ-approximate k-FANN search algorithm in road networks for an arbitrary ϵ. Through a series of experiments using various real-world road network datasets, we demonstrated that our approximate algorithm always outperformed the previous state-of-the-art exact algorithm and that the error ratios of the approximate FANN objects were significantly lower than the given ϵ value.</abstract><pub>MDPI AG</pub><doi>10.3390/electronics12173622</doi></addata></record> |
fulltext | fulltext |
identifier | ISSN: 2079-9292 |
ispartof | Electronics (Basel), 2023-08, Vol.12 (17) |
issn | 2079-9292 2079-9292 |
language | eng |
recordid | cdi_gale_infotracacademiconefile_A764265147 |
source | MDPI - Multidisciplinary Digital Publishing Institute; EZB-FREE-00999 freely available EZB journals |
subjects | Algorithms Location-based systems Neural networks Roads South Korea Streets |
title | Efficient Iϵ/I-Approximate Ik/I-Flexible Aggregate Nearest Neighbor Search for Arbitrary Iϵ/I in Road Networks |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-31T20%3A02%3A20IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Efficient%20I%CF%B5/I-Approximate%20Ik/I-Flexible%20Aggregate%20Nearest%20Neighbor%20Search%20for%20Arbitrary%20I%CF%B5/I%20in%20Road%20Networks&rft.jtitle=Electronics%20(Basel)&rft.au=Kwon,%20Hyuk-Yoon&rft.date=2023-08-01&rft.volume=12&rft.issue=17&rft.issn=2079-9292&rft.eissn=2079-9292&rft_id=info:doi/10.3390/electronics12173622&rft_dat=%3Cgale%3EA764265147%3C/gale%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_galeid=A764265147&rfr_iscdi=true |