On Similarity Prediction and Pairwise Clustering - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

On Similarity Prediction and Pairwise Clustering

(1) , (2) , (3) , (1)
1
2
3

Abstract

We consider the problem of clustering a finite set of items from pairwise similarity information. Unlike what is done in the literature on this subject, we do so in a passive learning setting, and with no specific constraints on the cluster shapes other than their size. We investigate the problem in different settings: i. an online setting, where we provide a tight characterization of the prediction complexity in the mistake bound model, and ii. a standard stochastic batch setting, where we give tight upper and lower bounds on the achievable generalization error. Prediction performance is measured both in terms of the ability to recover the similarity function encoding the hidden clustering and in terms of how well we classify each item within the set. The proposed algorithms are time efficient.
Fichier principal
Vignette du fichier
alt18.pdf (398.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01916976 , version 1 (09-11-2018)

Identifiers

  • HAL Id : hal-01916976 , version 1

Cite

Stephen Pasteris, Fabio Vitale, Claudio Gentile, Mark Herbster. On Similarity Prediction and Pairwise Clustering. ALT 2018 - 29th International Conference on Algorithmic Learning Theory, Apr 2018, Lanzarote, Spain. pp.1 - 28. ⟨hal-01916976⟩
63 View
103 Download

Share

Gmail Facebook Twitter LinkedIn More