Results 1  10
of
306,425
Capacitated Metric Labeling
, 2011
"... We introduce Capacitated Metric Labeling. As in Metric Labeling, we are given a weighted graph G = (V, E), a label set L, a semimetric dL on this label set, and an assignment cost function φ: V × L → ℜ +. The goal in Metric Labeling is to find an assignment f: V → L that minimizes a particular twoc ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce Capacitated Metric Labeling. As in Metric Labeling, we are given a weighted graph G = (V, E), a label set L, a semimetric dL on this label set, and an assignment cost function φ: V × L → ℜ +. The goal in Metric Labeling is to find an assignment f: V → L that minimizes a particular two
The hardness of metric labeling
 IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS’04
, 2004
"... The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels and a weighted graph. Additionally, a metric distance function on the labels is defined, and for each label and each verte ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
The Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems. The input to the problem consists of a set of labels and a weighted graph. Additionally, a metric distance function on the labels is defined, and for each label and each
NonMetric Label Propagation
"... In many applications nonmetric distances are better than metric distances in reflecting the perceptual distances of human beings. Previous studies on nonmetric distances mainly focused on supervised setting and did not consider the usefulness of unlabeled data. In this paper, we present probably t ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
the first study of label propagation on graphs induced from nonmetric distances. The challenge here lies in the fact that the triangular inequality does not hold for nonmetric distances and therefore, a direct application of existing label propagation methods will lead to inconsistency and conflict. We
On Earthmover Distance, Metric Labeling, and 0Extension
, 2006
"... We study the fundamental classification problems 0Extension and Metric Labeling. 0Extension is closely ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
We study the fundamental classification problems 0Extension and Metric Labeling. 0Extension is closely
Approximation Algorithms for Classification Problems with Pairwise Relationships: Metric Labeling and Markov Random Fields
 IN IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE
, 1999
"... 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 pa ..."
Abstract

Cited by 195 (2 self)
 Add to MetaCart
that optimizes a combinatorial function consisting of assignment costs  based on the individual choice of label we make for each object  and separation costs  based on the pair of choices we make for two "related" objects. We formulate a general classification problem of this type, the metric
Automatic labeling of semantic roles
 Computational Linguistics
, 2002
"... We present a system for identifying the semantic relationships, or semantic roles, filled by constituents of a sentence within a semantic frame. Various lexical and syntactic features are derived from parse trees and used to derive statistical classifiers from handannotated training data. 1 ..."
Abstract

Cited by 742 (15 self)
 Add to MetaCart
We present a system for identifying the semantic relationships, or semantic roles, filled by constituents of a sentence within a semantic frame. Various lexical and syntactic features are derived from parse trees and used to derive statistical classifiers from handannotated training data. 1
Quadratic Programming Relaxations for Metric Labeling and Markov
 In ICML
, 2006
"... Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem. An additional convex relaxation of the quadratic approximation is shown to have additive approximation guarantees ..."
Abstract
 Add to MetaCart
Quadratic program relaxations are proposed as an alternative to linear program relaxations and tree reweighted belief propagation for the metric labeling or MAP estimation problem. An additional convex relaxation of the quadratic approximation is shown to have additive approximation
An LP Formulation and Approximation Algorithms for the Metric Labeling Problem
, 2004
"... We consider approximation algorithms for the metric labeling problem. This problem was introduced in a paper by Kleinberg and Tardos [26], and captures many classification problems that arise in computer vision and related fields. They gave an O(log k log log k)approximation for the general case whe ..."
Abstract
 Add to MetaCart
We consider approximation algorithms for the metric labeling problem. This problem was introduced in a paper by Kleinberg and Tardos [26], and captures many classification problems that arise in computer vision and related fields. They gave an O(log k log log k)approximation for the general case
A Theory of Metric Labelled Transition Systems
 Papers on General Topology and Applications: 11th Summer Conference at the University of Southern Maine, volume 806 of Annals of the New York Academy of Sciences
, 1995
"... Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models defined by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition sy ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Labelled transition systems are useful for giving semantics to programming languages. Kok and Rutten have developed some theory to prove semantic models defined by means of labelled transition systems to be equal to other semantic models. Metric labelled transition systems are labelled transition
Distance Metric Learning, With Application To Clustering With SideInformation
 ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 15
, 2003
"... Many algorithms rely critically on being given a good metric over their inputs. For instance, data can often be clustered in many "plausible" ways, and if a clustering algorithm such as Kmeans initially fails to find one that is meaningful to a user, the only recourse may be for the us ..."
Abstract

Cited by 799 (14 self)
 Add to MetaCart
Many algorithms rely critically on being given a good metric over their inputs. For instance, data can often be clustered in many "plausible" ways, and if a clustering algorithm such as Kmeans initially fails to find one that is meaningful to a user, the only recourse may
Results 1  10
of
306,425