NDLI: Discovery of probabilistic nearest neighbors in traffic-aware spatial networks

Content Provider	Springer Nature Link
Author	Shang, Shuo Zhu, Shunzhi Guo, Danhuai Lu, Minhua
Copyright Year	2016
Abstract	Travel planning and recommendation have received significant attention in recent years. In this light, we study a novel problem of discovering probabilistic nearest neighbors and planning the corresponding travel routes in traffic-aware spatial networks (TANN queries) to avoid potential time delay/traffic congestions. We propose and study four novel probabilistic TANN queries. Thereinto two queries target at minimizing the travel time, including a congestion-probability threshold query, and a time-delay threshold query, while another two travel-time threshold queries target at minimizing the potential time delay/traffic congestion. We believe that TANN queries are useful in many real applications, such as discovering nearby points of interest and planning convenient travel routes for users, and location based services in general. The TANN queries are challenged by two difficulties: (1) how to define probabilistic metrics for nearest neighbor queries in traffic-aware spatial networks, and (2) how to process these TANN queries efficiently under different query settings. To overcome these challenges, we define a series of new probabilistic metrics and develop four efficient algorithms to compute the TANN queries. The performances of TANN queries are verified by extensive experiments on real and synthetic spatial data.
Starting Page	1135
Ending Page	1151
Page Count	17
File Format	PDF
ISSN	1386145X
Journal	World Wide Web
Volume Number	20
Issue Number	5
e-ISSN	15731413
Language	English
Publisher	Springer US
Publisher Date	2016-12-15
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Traffic-aware spatial networks Probabilistic nearest neighbor Efficiency Spatio-temporal databases Information Systems Applications (incl.Internet) Database Management Operating Systems
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Monochromatic and bichromatic ranked reverse boolean spatial keyword nearest neighbors search

Categorical top-k spatial influence query

Probabilistic nearest neighbor query processing on distributed uncertain data

Approximate entity extraction in temporal databases

Multiple k nearest neighbor search

Popularity-aware spatial keyword search on activity trajectories

Efficient general spatial skyline computation

A privacy-aware monitoring algorithm for moving $$k$$ -nearest neighbor queries in road networks

Efficient moving k nearest neighbor queries over line segment objects

Discovery of probabilistic nearest neighbors in traffic-aware spatial networks

Similar Documents

Monochromatic and bichromatic ranked reverse boolean spatial keyword nearest neighbors search

Categorical top-k spatial influence query

Probabilistic nearest neighbor query processing on distributed uncertain data

Approximate entity extraction in temporal databases

Multiple k nearest neighbor search

Popularity-aware spatial keyword search on activity trajectories

Efficient general spatial skyline computation

A privacy-aware monitoring algorithm for moving $$k$$ -nearest neighbor queries in road networks

Efficient moving k nearest neighbor queries over line segment objects

Discovery of probabilistic nearest neighbors in traffic-aware spatial networks