In algorithms, as in life, negativity can be a drag. Consider the problem of finding the shortest path between two points on a graph — a network of nodes connected by links, or edges. Often, these ...

Here, we focus on the binary situation in which labeled instances come from the positive class, and unlabeled instances come from both classes. In particular, we propose a semi-supervised large-margin ...