Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields

In a traditional classification problem, we wish to assign one of k labels (or classes) to each of n objects , in a way that is consistent with some observed data that we have about the problem. An active line of research in this area is concerned with classification when one has information about p...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of the ACM 2002-09, Vol.49 (5), p.616-639
Hauptverfasser:	Kleinberg, Jon, Tardos, Eva
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Approximation Assignment problem Biometrics Classification Cost analysis Fields (mathematics) Labeling Labels Marking Markov analysis Markov processes Mathematical analysis Metric system Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!