Filters








22,460 Hits in 2.9 sec

Search K Nearest Neighbors on Air [chapter]

Baihua Zheng, Lee Wang-Chien, Dik Lun Lee
2002 Lecture Notes in Computer Science  
In this paper, the problem of organizing location dependent data and answering KNN queries on air are investigated.  ...  While the K-Nearest-Neighbor (KNN) problem is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcast environment.  ...  K-Nearest Neighbor Search K-Nearest Neighbor (KNN) search returns a specified number of data objects, sorted by their distances from a given query point.  ... 
doi:10.1007/3-540-36389-0_13 fatcat:eiyumtjytjgu5l6vlfh2ccnlgm

Fast Inverse Distance Weighting-Based Spatiotemporal Interpolation: A Web-Based Application of Interpolating Daily Fine Particulate Matter PM2.5 in the Contiguous U.S. Using Parallel Programming and k-d Tree

Lixin Li, Travis Losser, Charles Yorke, Reinhard Piltner
2014 International Journal of Environmental Research and Public Health  
These studies have highlighted the public concerns about health effects of particulate air pollution.  ...  Parallel programming techniques and an advanced data structure, named k-d tree, are adapted in this paper to address the computational challenges.  ...  Nearest Neighbor Search Algorithm using k-d Tree to Find One Nearest Neighbor The nearest neighbor search algorithm is used to find the point in the tree that is nearest to the given point.  ... 
doi:10.3390/ijerph110909101 pmid:25192146 pmcid:PMC4199009 fatcat:ccwrfxpivrbzhgvgd4uyb3bzjy

Location-based Spatial Queries with Data Sharing in Wireless Broadcast Environments

Wei-Shinn Ku, Roger Zimmermann, Haixun Wang
2007 2007 IEEE 23rd International Conference on Data Engineering  
Our approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers.  ...  Location-based spatial queries (LBSQs) refer to spatial queries whose answers rely on the location of the inquirer.  ...  In this paper, we concentrate on two common types of spatial searches, namely, k nearest neighbor queries and window queries.  ... 
doi:10.1109/icde.2007.369010 dblp:conf/icde/KuZW07 fatcat:p56nukddy5bfnj7r52kjfkybwe

HVAC system energy optimization using an adaptive hybrid metaheuristic

Ali Ghahramani, Simin Ahmadi Karvigh, Burcin Becerik-Gerber
2017 Energy and Buildings  
The algorithm consists of metaheuristic (k-nearest neighbor stochastic hill climbing), machine learning (regression decision tree), and self-tuning (recursive brute-force search) components.  ...  Kusiak in [15] used an evolutionary algorithm to find optimal control settings (i.e., supply air temperature and supply air static pressure) of an HVAC system based on a data-driven model built for system  ...  ., stochastic hill climbing), (2) k-nearest neighbor metaheuristic (i.e., k-nearest neighbor stochastic hill climbing), (3) hybrid metaheuristic (i.e., k-nearest neighbor stochastic hill climbing with  ... 
doi:10.1016/j.enbuild.2017.07.053 fatcat:dmtcb7lcxrgnxpl5dyqd23bkm4

Querying representative points from a pool based on synthesized queries

Xuelei Hu, Liantao Wang, Bo Yuan
2012 The 2012 International Joint Conference on Neural Networks (IJCNN)  
The basic idea is to select the data point nearest to the synthesized query as the query point. We also provide two simple strategies for synthesizing informative queries.  ...  Moreover, to further speed up querying, we employ clustering techniques on the whole data set to construct a representative unlabeled data pool based on cluster centers.  ...  nearest neighbor search strategies.  ... 
doi:10.1109/ijcnn.2012.6252607 dblp:conf/ijcnn/HuWY12 fatcat:bxgauvqsm5ay3na5r4fdpi2wpq

Anytime k-nearest neighbor search for database applications

Weijia Xu, Daniel Miranker, Rui Mao, Smriti Ramakrishnan
2008 2008 IEEE 24th International Conference on Data Engineering Workshop  
Approximate solutions to k-nearest neighbor search provide much needed speed improvement to hard nearest-neighbor problems.  ...  In support of these applications, we explored a search strategy for knearest neighbor searches with MVP-trees that greedily identifies k answers and then improves the answer set monotonically.  ...  The top curve in the figure corresponds to a completed k nearest neighbor search, and the bottom one corresponds to a k nearest neighbor search terminated after the 1 st smallest distance.  ... 
doi:10.1109/icdew.2008.4498354 dblp:conf/icde/XuMMR08 fatcat:vppvtvfoinghre3nfmx6phqyjq

Anytime K-Nearest Neighbor Search for Database Applications

Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti Ramakrishnan
2008 First International Workshop on Similarity Search and Applications (sisap 2008)  
Approximate solutions to k-nearest neighbor search provide much needed speed improvement to hard nearest-neighbor problems.  ...  In support of these applications, we explored a search strategy for knearest neighbor searches with MVP-trees that greedily identifies k answers and then improves the answer set monotonically.  ...  The top curve in the figure corresponds to a completed k nearest neighbor search, and the bottom one corresponds to a k nearest neighbor search terminated after the 1 st smallest distance.  ... 
doi:10.1109/sisap.2008.11 dblp:conf/sisap/XuMMR08 fatcat:nxr4l7iv7bbupgj5gw6olk6xyu

Continuous k-Nearest Neighbor Queries in Wireless Environments

M. Veeresha, M. Sugumaran
2017 Indian Journal of Science and Technology  
Objectives: Network Coding-based Spatial Air Index (NCSAI) has been proposed for improving query performance of continuous k-nearest neighbor queries in road networks.  ...  Recently, air index adapted for shortest path queries in road networks based on live traffic, but it doesn't address the other queries like range queries and k-nearest neighbor queries and continues k-nearest  ...  Processing of Continuous k-nearest neighbor query using NCSAI Continuous k-nearest neighbor query has been used in many real-time applications 15 .  ... 
doi:10.17485/ijst/2016/v9i48/104045 fatcat:ffcnkto4wjcnpgw74ziwgngmdu

Poster

Logan Moon, Daniel Long, Shreyas Joshi, Vyomkesh Tripathi, Bo Xiao, George Biros
2011 Proceedings of the 2011 companion on High Performance Computing Networking, Storage and Analysis Companion - SC '11 Companion  
range nearest neighbor searches (KNN): Given a query point q ∈ Q, find the k-nearest neighbors or find all points r ∈ R such that d(r, q) < ρ, where ρ is the range.  ...  Clustering and nearest neighbor searches in high dimensions are fundamental components of computational geometry, computational statistics, and pattern recognition.  ...  Computing resources on the XSEDE systems were provided under the grants ASC070050N and MCA04N026.  ... 
doi:10.1145/2148600.2148630 dblp:conf/sc/MoonLJTXB11 fatcat:uuothef5nbfnvclsk3hbrtgy44

An Efficient Network Coding-based Air Index for Queries in Road Networks

M. Veeresha, M. Sugumaran, D. Sandeep, SANTHIRAM ENGINEERING COLLEGE
2020 International Journal of Engineering Research and  
To address these problems, an NPI based air index, called Network Coding-based Spatial Air Index (NCSAI) has been proposed by using Hybrid Broadcast (HB) scheduling and adaptive XOR-based network coding  ...  Keywords-Wireless broadcast, network coding-based spatial air index, hybrid broadcast, adaptive XOR-based network coding, spatial queries, road networks.  ...  k-Nearest Neighbor Query K-Nearest Neighbor Query defined as a mobile client retrieves k-nearest data objects from a query point q.  ... 
doi:10.17577/ijertv9is040005 fatcat:hmopjyeo5jhfzob6duyvf33il4

On Searching Continuous k Nearest Neighbors in Wireless Data Broadcast Systems

Baihua Zheng, Wang-Chien Lee, Dik Lun Lee
2007 IEEE Transactions on Mobile Computing  
In this paper, we develop a generalized search algorithm for continuous k-nearest neighbors based on Hilbert Curve Index in wireless data broadcast systems.  ...  A performance evaluation is conducted to compare the proposed search algorithms with an algorithm based on R-tree Air Index.  ...  k-nearest neighbor objects, the whole line segment is dominated by those k-nearest neighbors.  ... 
doi:10.1109/tmc.2007.1004 fatcat:jzs22kwzdbdpjfvrxlmcy667gm

K-Nearest Neighbor Search for Moving Query Point [chapter]

Zhexuan Song, Nick Roussopoulos
2001 Lecture Notes in Computer Science  
The problem assumes that the query point is not static, as in k-nearest neighbor problem, but varies its position over time.  ...  This paper addresses the problem of finding k nearest neighbors for moving query point (we call it k-NNMP). It is an important issue in both mobile computing research and real-life applications.  ...  Introduction One of the most important operations in a spatial database management system is the k-nearest neighbor search.  ... 
doi:10.1007/3-540-47724-1_5 fatcat:axclpgw4wnehdduvulxs4jouwi

Study on Location-Dependent Queries in Broadcasting Environment

Lien-Fa Lin
2007 The 2007 International Conference on Intelligent Pervasive Computing (IPC 2007)  
In this paper, the issues involved with organizing location dependent data and answering LDQ queries on the air are investigated.  ...  An efficient data organization, called Jump Rdnn-tree, and the corresponding search algorithms are proposed.  ...  : K hotspots selected as the candidates of nearest neighbor are placed in K-Buffer to calculate the distance between q and every point, and then sorted from small to large.  ... 
doi:10.1109/ipc.2007.96 fatcat:m3xqwb72mvdvtlskaok7sypqaa

Study on Location-Dependent Queries in Broadcasting Environment

Lien-Fa Lin
2007 The 2007 International Conference on Intelligent Pervasive Computing (IPC 2007)  
In this paper, the issues involved with organizing location dependent data and answering LDQ queries on the air are investigated.  ...  An efficient data organization, called Jump Rdnn-tree, and the corresponding search algorithms are proposed.  ...  : K hotspots selected as the candidates of nearest neighbor are placed in K-Buffer to calculate the distance between q and every point, and then sorted from small to large.  ... 
doi:10.1109/ipc.2007.39 dblp:conf/ipc/Lin07 fatcat:xlps6zrp3ffobkdwbjprkg35ie

Query Processing with Respect to Location in Wireless Broadcasting

C. Rajeswari, N. Chandrasekaran
2012 International Journal of Future Computer and Communication  
The nearest neighbor candidate can be identified by using the KNN algorithm. After identifying INN candidate, the required data are retrieved using the SBNN algorithm.  ...  Therefore, we propose the Sharing-Based Nearest Neighbor (SBNN) query approach to improve the preceding on-air kNN query algorithm. bound.  ...  At first, by scanning the on-air index, the k-nearest object to the query point is found, and a minimal circle centered at q and containing all those k objects is constructed [3] .  ... 
doi:10.7763/ijfcc.2012.v1.73 fatcat:tobl67zimnbpvps3znpkc2i72i
« Previous Showing results 1 — 15 out of 22,460 results