Sciweavers

104 search results - page 15 / 21
» A Nearest Neighbor Method for Efficient ICP
Sort
View
ICPR
2002
IEEE
16 years 22 days ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
ITNG
2008
IEEE
15 years 6 months ago
An Efficient Technique for Distance Computation in Road Networks
With recent advances in wireless communication and position technologies, it became possible to collect and record trajectories of moving objects. Thus, many services in road netw...
Xu Jianqiu, Victor Teixeira de Almeida, Qin Xiaoli...
PVLDB
2010
121views more  PVLDB 2010»
14 years 6 months ago
Efficient RkNN Retrieval with Arbitrary Non-Metric Similarity Measures
A RkNN query returns all objects whose nearest k neighbors contain the query object. In this paper, we consider RkNN query processing in the case where the distances between attri...
Deepak P, Prasad Deshpande
JMLR
2010
111views more  JMLR 2010»
14 years 6 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...
DMKD
1999
ACM
108views Data Mining» more  DMKD 1999»
15 years 4 months ago
Classification as Mining and Use of Labeled Itemsets
We investigate the relationship between association and classification mining. The main issue in association mining is the discovery of interesting patterns of the data, so called...
Dimitris Meretakis, Beat Wüthrich