Published in: مجله هوش مصنوعی و داده کاوی، دوره: 5، شماره: 1
COI code: JR_JADM-5-1_010
Paper Language: English
How to Download This Paper
For Downloading the Fulltext of CIVILICA papers please visit the orginal Persian Section of website.
Authors Non-zero probability of nearest neighbor searchingA. Mesrikhani - Department of Computer Science & Information Technology, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran.
M. Davoodi - Department of Computer Science & Information Technology, Institute for Advanced Studies in Basic Sciences (IASBS), Zanjan, Iran.
Abstract:Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, such as tracking and locating services, GIS and data mining, it is possible both of them are imprecise. So, in this situation, a natural way to handle the issue is to report the data have a nonzero probability —called nonzero nearest neighbor— to be the nearest neighbor of a given query. Formally, let P be a set of n uncertain points modeled by some regions. We first consider the following variation of NN searching problem under uncertainty. If both the query and the data are uncertain points modeled by distinct unit segments parallel to the x-axis, we propose an efficient algorithm that reports nonzero nearest neighbors under Manhattan metric in O(n^2 α(n^2 )) preprocessing and O(logn+k) query time, where α(.) is the extremely slowly growing functional inverse of Ackermann’s function. Finally, for the arbitrarily length segments parallel to the x-axis, we propose an approximation algorithm that reports nonzero nearest neighbor with maximum error L in O(n^2 α(n^2 )) preprocessing and O(logn+k) query time, where L is the length of the query.
Keywords:Nearest neighbor searching, Uncertainty, Imprecision, Nonzero probability
COI code: JR_JADM-5-1_010
how to cite to this paper:If you want to refer to this article in your research, you can easily use the following in the resources and references section:
Mesrikhani, A. & M. Davoodi, 2017, Non-zero probability of nearest neighbor searching, Journal of Artificial Intelligence & Data Mining 5 (1), https://www.civilica.com/Paper-JR_JADM-JR_JADM-5-1_010.htmlInside the text, wherever referred to or an achievement of this article is mentioned, after mentioning the article, inside the parental, the following specifications are written.
First Time: (Mesrikhani, A. & M. Davoodi, 2017)
Second and more: (Mesrikhani & Davoodi, 2017)
For a complete overview of how to citation please review the following CIVILICA Guide (Citation)
The University/Research Center Information:
Type: state university
Paper No.: 331
in University Ranking and Scientometrics the Iranian universities and research centers are evaluated based on scientific papers.
Research Info Management
Export Citation info of this paper to research management softwares
New Related Papers
- Reaction of Tomato (Solanum Lycopersicum) Genotypes to Tomato Leaf Curl Virus (Tlcv) and Their Combining Ability For Resistance against The Virus
- Role of Discipline in the Organizational Maturity: An Analysis of Pakistani Business
- Positron Emission Particle Tracking (PEPT) of Inclusions in Metals
- Synthesis and characterization of Polyaniline– Dodecylbenzenesulfonic /organo clay nanocomposites
- Thermal Behaviors of Polyamide-Layered Silicate Nanocomposites Based on 4,4'-Azodibenzoic Acid by Solution Intercalation Technique
The Above articles are recently indexed in the related subjects
Iran Scientific Advertisment Netword
Share this paper
WHAT IS COI?
COI is a national code dedicated to all Iranian Conference and Journal Papers. the COI of each paper can be verified online.