Please use this identifier to cite or link to this item:
|Title:||Clustering partially observed graphs via convex optimization||Authors:||Jalali, A.
|Issue Date:||2011||Citation:||Jalali, A.,Chen, Y.,Sanghavi, S.,Xu, H. (2011). Clustering partially observed graphs via convex optimization. Proceedings of the 28th International Conference on Machine Learning, ICML 2011 : 1001-1008. ScholarBank@NUS Repository.||Abstract:||This paper considers the problem of clustering a partially observed unweighted graph - i.e. one where for some node pairs we know there is an edge between them, for some others we know there is no edge, and for the remaining we do not know whether or not there is an edge. We want to organize the nodes into disjoint clusters so that there is relatively dense (observed) connectivity within clusters, and sparse across clusters. We take a novel yet natural approach to this problem, by focusing on finding the clustering that minimizes the number of "disagreements" i.e. the sum of the number of (observed) missing edges within clusters, and (observed) present edges across clusters. Our algorithm uses convex optimization; its basis is a reduction of disagreement minimization to the problem of recovering an (unknown) low-rank matrix and an (unknown) sparse matrix from their partially observed sum. We show that our algorithm succeeds under certain natural assumptions on the optimal clustering and its disagreements. Our results significantly strengthen existing matrix splitting results for the special case of our clustering problem. Our results directly enhance solutions to the problem of Correlation Clustering (Bansal et al., 2002) with partial observations. Copyright 2011 by the author(s)/owner(s).||Source Title:||Proceedings of the 28th International Conference on Machine Learning, ICML 2011||URI:||http://scholarbank.nus.edu.sg/handle/10635/73251||ISBN:||9781450306195|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 17, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.