43 search results - page 7 / 9 » Condensed Nearest Neighbor Data Domain Description |
KAIS
2007
14 years 9 months ago
2007
Analyzing the quality of data prior to constructing data mining models is emerging as an important issue. Algorithms for identifying noise in a given data set can provide a good me...
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
111
click to vote
KDD
2008
ACM
15 years 9 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
RECSYS
2009
ACM
15 years 3 months ago
2009
ACM
Collaborative Filtering (CF) recommendations are computed by leveraging a historical data set of users’ ratings for items. It assumes that the users’ previously recorded ratin...
173
click to vote
ICDE
2008
IEEE
15 years 10 months ago
2008
IEEE
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...