Sciweavers

649 search results - page 49 / 130
» Some Methods of Replacing the Nearest Neighbor Method
Sort
View
ICPR
2002
IEEE
14 years 8 months 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
RECSYS
2009
ACM
14 years 2 months ago
Context-based splitting of item ratings in collaborative filtering
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...
Linas Baltrunas, Francesco Ricci
CIARP
2007
Springer
14 years 1 months ago
Generalizing Dissimilarity Representations Using Feature Lines
A crucial issue in dissimilarity-based classification is the choice of the representation set. In the small sample case, classifiers capable of a good generalization and the inje...
Mauricio Orozco-Alzate, Robert P. W. Duin, C&eacut...
GFKL
2007
Springer
196views Data Mining» more  GFKL 2007»
14 years 1 months ago
Collaborative Tag Recommendations
Abstract. With the increasing popularity of collaborative tagging systems, services that assist the user in the task of tagging, such as tag recommenders, are more and more require...
Leandro Balby Marinho, Lars Schmidt-Thieme
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 11 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...