DeepAI
Log In Sign Up

Estimating Maximally Probable Constrained Relations by Mathematical Programming

08/04/2014
by   Lizhen Qu, et al.
0

Estimating a constrained relation is a fundamental problem in machine learning. Special cases are classification (the problem of estimating a map from a set of to-be-classified elements to a set of labels), clustering (the problem of estimating an equivalence relation on a set) and ranking (the problem of estimating a linear order on a set). We contribute a family of probability measures on the set of all relations between two finite, non-empty sets, which offers a joint abstraction of multi-label classification, correlation clustering and ranking by linear ordering. Estimating (learning) a maximally probable measure, given (a training set of) related and unrelated pairs, is a convex optimization problem. Estimating (inferring) a maximally probable relation, given a measure, is a 01-linear program. It is solved in linear time for maps. It is NP-hard for equivalence relations and linear orders. Practical solutions for all three cases are shown in experiments with real data. Finally, estimating a maximally probable measure and relation jointly is posed as a mixed-integer nonlinear program. This formulation suggests a mathematical programming approach to semi-supervised learning.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/08/2009

On Ranking Senators By Their Votes

The problem of ranking a set of objects given some measure of similarity...
02/20/2018

Using Semi-Supervised Learning for Predicting Metamorphic Relations

Software testing is difficult to automate, especially in programs which ...
12/18/2019

Hardness of Network Satisfaction for Relation Algebras with Normal Representations

We study the computational complexity of the general network satisfactio...
06/12/2019

Joint Reasoning for Temporal and Causal Relations

Understanding temporal and causal relations between events is a fundamen...
01/26/2023

Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings

We consider the posets of equivalence relations on finite sets under the...
04/01/2021

Hereditary rigidity, separation and density In memory of Professor I.G. Rosenberg

We continue the investigation of systems of hereditarily rigid relations...