Local Graph Clustering with Network Lasso

dc.contributorAalto-yliopistofi
dc.contributorAalto Universityen
dc.contributor.authorJung, Alexander
dc.contributor.authorSarcheshmehpour, Yasmin
dc.contributor.departmentProfessorship Jung Alexander
dc.contributor.departmentSharif University of Technology
dc.contributor.departmentDepartment of Computer Scienceen
dc.date.accessioned2021-08-04T06:43:54Z
dc.date.available2021-08-04T06:43:54Z
dc.date.issued2021
dc.description.abstractWe study the statistical and computational properties of a network Lasso method for local graph clustering. The clusters delivered by nLasso can be characterized elegantly via network flows between cluster boundaries and seed nodes. While spectral clustering methods are guided by a minimization of the graph Laplacian quadratic form, nLasso minimizes the total variation of cluster indicator signals. As demonstrated theoretically and numerically, nLasso methods can handle very sparse clusters (chain-like) which are difficult for spectral clustering. We also verify that a primal-dual method for non-smooth optimization allows to approximate nLasso solutions with optimal worst-case convergence rate.en
dc.description.versionPeer revieweden
dc.format.extent5
dc.format.extent106-110
dc.format.mimetypeapplication/pdf
dc.identifier.citationJung , A & Sarcheshmehpour , Y 2021 , ' Local Graph Clustering with Network Lasso ' , IEEE Signal Processing Letters , vol. 28 , 9298875 , pp. 106-110 . https://doi.org/10.1109/LSP.2020.3045832en
dc.identifier.doi10.1109/LSP.2020.3045832
dc.identifier.issn1070-9908
dc.identifier.issn1558-2361
dc.identifier.otherPURE UUID: a15c89bc-6a9c-4d2d-818a-758cc2ae4d16
dc.identifier.otherPURE ITEMURL: https://research.aalto.fi/en/publications/a15c89bc-6a9c-4d2d-818a-758cc2ae4d16
dc.identifier.otherPURE LINK: http://www.scopus.com/inward/record.url?scp=85098748083&partnerID=8YFLogxK
dc.identifier.otherPURE FILEURL: https://research.aalto.fi/files/65676585/Local_Graph_Clustering_With_Network_Lasso.pdf
dc.identifier.urihttps://aaltodoc.aalto.fi/handle/123456789/108935
dc.identifier.urnURN:NBN:fi:aalto-202108048179
dc.language.isoenen
dc.publisherIEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
dc.relation.ispartofseriesIEEE Signal Processing Lettersen
dc.relation.ispartofseriesVolume 28en
dc.rightsopenAccessen
dc.subject.keywordClustering methods
dc.subject.keywordConvergence
dc.subject.keywordLaplace equations
dc.subject.keywordMessage passing
dc.subject.keywordMinimization
dc.subject.keywordOptimization
dc.subject.keywordTV
dc.titleLocal Graph Clustering with Network Lassoen
dc.typeA1 Alkuperäisartikkeli tieteellisessä aikakauslehdessäfi
dc.type.versionpublishedVersion
Files