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...
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...
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 ...
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. ...
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...