We introduce a principled method for the signed clustering problem, where goal is to partition weighted undirected graph whose edge weights take both positive and negative values, such that edges within same cluster are mostly positive, while spanning across clusters negative. Our relies on graph-based diffuse interface model formulation utilizing Ginzburg-Landau functional, based an adaptation...