Sciweavers

1385 search results - page 41 / 277
» Clustering by Random Projections
Sort
View
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
15 years 6 months ago
Recommendation via Query Centered Random Walk on K-Partite Graph
This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
JMLR
2010
211views more  JMLR 2010»
14 years 6 months ago
Minimum Conditional Entropy Clustering: A Discriminative Framework for Clustering
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoreti...
Bo Dai, Baogang Hu
ICCV
2009
IEEE
16 years 4 months ago
Mode-Detection via Median-Shift
Median-shift is a mode seeking algorithm that relies on computing the median of local neighborhoods, instead of the mean. We further combine median-shift with Locality Sensitive...
Lior Shapira, Shai Avidan, Ariel Shamir
SIGIR
2004
ACM
15 years 5 months ago
GaP: a factor model for discrete data
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...
John F. Canny
DAWAK
2000
Springer
15 years 4 months ago
COFE: A Scalable Method for Feature Extraction from Complex Objects
Abstract. Feature Extraction, also known as Multidimensional Scaling, is a basic primitive associated with indexing, clustering, nearest neighbor searching and visualization. We co...
Gabriela Hristescu, Martin Farach-Colton