Sciweavers

29 search results - page 3 / 6
» Supporting KDD Applications by the k-Nearest Neighbor Join
Sort
View
PVLDB
2010
179views more  PVLDB 2010»
13 years 8 months ago
Nearest Neighbor Search with Strong Location Privacy
The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial...
Stavros Papadopoulos, Spiridon Bakiras, Dimitris P...
VLDB
2004
ACM
125views Database» more  VLDB 2004»
14 years 3 months ago
Reverse kNN Search in Arbitrary Dimensionality
Given a point q, a reverse k nearest neighbor (RkNN) query retrieves all the data points that have q as one of their k nearest neighbors. Existing methods for processing such quer...
Yufei Tao, Dimitris Papadias, Xiang Lian
KDD
2005
ACM
163views Data Mining» more  KDD 2005»
14 years 10 months ago
Data Sparsity Issues in the Collaborative Filtering Framework
Abstract. With the amount of available information on the Web growing rapidly with each day, the need to automatically filter the information in order to ensure greater user effici...
Miha Grcar, Dunja Mladenic, Blaz Fortuna, Marko Gr...
NBIS
2007
Springer
14 years 3 months ago
A Ring Infrastructure for Neighbor-Centric Peer-to-Peer Applications
We propose a peer-to-peer system that supports distributed virtual world applications. For these applications, the connections between directly neighboring peers are of the utmost ...
Oliver Haase, Alfred Toth, Jürgen Wäsch
BMCBI
2008
139views more  BMCBI 2008»
13 years 10 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu