3 accepted papers
The novel concept of signature graphs extends signed graphs by admitting multiple types of partial similarity/agreement or dissimilarity/disagreement. Extending the concept of balancedness to signature graphs yields an explicit and efficient basis for multi-class clustering and classification. Contr…
Signed graphs have recently been found to offer advantages over unsigned graphs in a variety of tasks. However, the problem of learning graph topologies has only been considered for the unsigned case. In this paper, we propose a conceptually simple and flexible approach to signed graph learning via…
We consider the problem of semi-supervised clustering for multiple (more than two) classes. The proposed clustering algorithm uses the (dis)similarity of given data to learn the unknown cluster labels. We quantify label (dis)similarity in terms of the new concept of signed total variation (TV). The…