Sciweavers

728 search results - page 119 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
SISAP
2011
IEEE
437views Data Mining» more  SISAP 2011»
12 years 10 months ago
Succinct nearest neighbor search
In this paper we present a novel technique for nearest neighbor searching dubbed neighborhood approximation. The central idea is to divide the database into compact regions repres...
Eric Sadit Tellez, Edgar Chávez, Gonzalo Na...
WSDM
2012
ACM
246views Data Mining» more  WSDM 2012»
12 years 3 months ago
Auralist: introducing serendipity into music recommendation
Recommendation systems exist to help users discover content in a large body of items. An ideal recommendation system should mimic the actions of a trusted friend or expert, produc...
Yuan Cao Zhang, Diarmuid Ó Séaghdha,...
KDD
2007
ACM
244views Data Mining» more  KDD 2007»
14 years 8 months ago
A Recommender System Based on Local Random Walks and Spectral Methods
In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, w...
Zeinab Abbassi, Vahab S. Mirrokni
WSDM
2012
ACM
259views Data Mining» more  WSDM 2012»
12 years 3 months ago
Learning recommender systems with adaptive regularization
Many factorization models like matrix or tensor factorization have been proposed for the important application of recommender systems. The success of such factorization models dep...
Steffen Rendle
WSDM
2012
ACM
283views Data Mining» more  WSDM 2012»
12 years 3 months ago
The life and death of online groups: predicting group growth and longevity
We pose a fundamental question in understanding how to identify and design successful communities: What factors predict whether a community will grow and survive in the long term?...
Sanjay Ram Kairam, Dan J. Wang, Jure Leskovec