Sciweavers

733 search results - page 116 / 147
» Learning Riemannian Metrics
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
WWW
2009
ACM
14 years 8 months ago
Predicting click through rate for job listings
Click Through Rate (CTR) is an important metric for ad systems, job portals, recommendation systems. CTR impacts publisher's revenue, advertiser's bid amounts in "p...
Manish S. Gupta
ALT
2009
Springer
14 years 4 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
ICML
2006
IEEE
14 years 4 months ago
Cover Trees for Nearest Neighbor
We present a tree data structure for fast nearest neighbor operations in general n- point metric spaces (where the data set con- sists of n points). The data structure re- quir...
Alina Beygelzimer, Sham Kakade, John Langford
IAT
2009
IEEE
14 years 2 months ago
Topology and Memory Effect on Convention Emergence
Abstract—Social conventions are useful self-sustaining protocols for groups to coordinate behavior without a centralized entity enforcing coordination. We perform an in-depth stu...
Daniel Villatoro, Sandip Sen, Jordi Sabater-Mir