Sciweavers

171 search results - page 21 / 35
» Can We Get A Better Retrieval Function From Machine
Sort
View
ICDM
2002
IEEE
191views Data Mining» more  ICDM 2002»
15 years 8 months ago
Iterative Clustering of High Dimensional Text Data Augmented by Local Search
The k-means algorithm with cosine similarity, also known as the spherical k-means algorithm, is a popular method for clustering document collections. However, spherical k-means ca...
Inderjit S. Dhillon, Yuqiang Guan, J. Kogan
ICML
2010
IEEE
15 years 4 months ago
Gaussian Processes Multiple Instance Learning
This paper proposes a multiple instance learning (MIL) algorithm for Gaussian processes (GP). The GP-MIL model inherits two crucial benefits from GP: (i) a principle manner of lea...
Minyoung Kim, Fernando De la Torre
PAMI
2008
196views more  PAMI 2008»
15 years 3 months ago
Distance Learning for Similarity Estimation
In this paper, we present a general guideline to find a better distance measure for similarity estimation based on statistical analysis of distribution models and distance function...
Jie Yu, Jaume Amores, Nicu Sebe, Petia Radeva, Qi ...
MTA
2007
141views more  MTA 2007»
15 years 3 months ago
Flexible integration of multimedia sub-queries with qualitative preferences
Complex multimedia queries, aiming to retrieve from large databases those objects that best match the query specification, are usually processed by splitting them into a set of m ...
Ilaria Bartolini, Paolo Ciaccia, Vincent Oria, M. ...
AAMAS
2004
Springer
15 years 3 months ago
Multi-Dimensional, MultiStep Negotiation
We present a multi-dimensional, multi-step negotiation mechanism for task allocation among cooperative agents based on distributed search. This mechanism uses marginal utility gai...
Xiaoqin Zhang, Victor R. Lesser, Rodion M. Podoroz...