Sciweavers

79 search results - page 10 / 16
» Efficiently Learning the Metric with Side-Information
Sort
View
CVPR
2004
IEEE
16 years 1 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
122
Voted
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
14 years 6 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
ICCPOL
2009
Springer
14 years 9 months ago
A Simple and Efficient Model Pruning Method for Conditional Random Fields
Conditional random fields (CRFs) have been quite successful in various machine learning tasks. However, as larger and larger data become acceptable for the current computational ma...
Hai Zhao, Chunyu Kit
SIGIR
2008
ACM
14 years 11 months ago
Learning to reduce the semantic gap in web image retrieval and annotation
We study in this paper the problem of bridging the semantic gap between low-level image features and high-level semantic concepts, which is the key hindrance in content-based imag...
Changhu Wang, Lei Zhang 0001, Hong-Jiang Zhang
109
Voted
ATAL
2006
Springer
15 years 3 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen