Sciweavers

499 search results - page 96 / 100
» One-shot Collaborative Filtering
Sort
View
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
14 years 7 months ago
Structured metric learning for high dimensional problems
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...
Jason V. Davis, Inderjit S. Dhillon
SIGMOD
2002
ACM
132views Database» more  SIGMOD 2002»
14 years 7 months ago
Clustering by pattern similarity in large data sets
Clustering is the process of grouping a set of objects into classes of similar objects. Although definitions of similarity vary from one clustering model to another, in most of th...
Haixun Wang, Wei Wang 0010, Jiong Yang, Philip S. ...
WSDM
2010
ACM
214views Data Mining» more  WSDM 2010»
14 years 4 months ago
Pairwise Interaction Tensor Factorization for Personalized Tag Recommendation
Tagging plays an important role in many recent websites. Recommender systems can help to suggest a user the tags he might want to use for tagging a specific item. Factorization mo...
Steffen Rendle, Lars Schmidt-Thieme
CIKM
2009
Springer
14 years 1 months ago
A social recommendation framework based on multi-scale continuous conditional random fields
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
Xin Xin, Irwin King, Hongbo Deng, Michael R. Lyu
SENSYS
2006
ACM
14 years 1 months ago
Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms
We explore fundamental performance limits of tracking a target in a two-dimensional field of binary proximity sensors, and design algorithms that attain those limits. In particul...
Nisheeth Shrivastava, Raghuraman Mudumbai, Upamany...