IEEE - Institute of Electrical and Electronics Engineers, Inc. - Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields

40th Annual Symposium on Foundations of Computer Science

Author(s): Kleinberg, J. ; Tardos, E.
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 January 1999
Conference Location: New York City, NY, USA, USA
Conference Date: 17 October 1999
Page(s): 14 - 23
ISBN (Paper): 0-7695-0409-4
ISSN (Paper): 0272-5428
DOI: 10.1109/SFFCS.1999.814572
Regular:

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

Advertisement