Clustering partially observed graphs via convex optimization
Proceedings of the 28th International Conference on Machine Learning, ICML 2011
Saved in:
Main Authors: | Jalali, A., Chen, Y., Sanghavi, S., Xu, H. |
---|---|
Other Authors: | MECHANICAL ENGINEERING |
Format: | Conference or Workshop Item |
Published: |
2014
|
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/73251 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Clustering sparse graphs
by: Chen, Y., et al.
Published: (2014) -
Bidding graph games with partially-observable budgets
by: AVNI, Guy, et al.
Published: (2023) -
THEORETICAL ANALYSIS OF A CONVEX OPTIMIZATION PROCEDURE (COP) FOR CLUSTERING
by: ZHU CHANGBO
Published: (2021) -
Graph Matching by Simplified Convex-Concave Relaxation Procedure
by: LIU, Zhiyong, et al.
Published: (2014) -
Breaking the small cluster barrier of graph clustering
by: Ailon, N., et al.
Published: (2014)