The decision rule forŷ i to belong to the class 1 can then be represented as: 2.2 Modifications to the LP algorithm The graph structure used in LP does not differentiate between labeled and unlabeled neighbours.
in some cases it might be beneficial to give them different impacts.