Thus, content selection can be naturally stated as an optimization problem -we wish to find a label assignment that minimizes the cost of violating the above constraints.
let C + and C − be a set of selected and omitted entities, respectively; ind + (x) and ind − (x) are scores that capture the individual preference of x to be either selected or omitted, and link l (x, y) reflects the degree of dependence between the labels of x and y based on a link of type l. the optimal label assignment for database entries x 1 , .