Unsupervised Clustering on Signed Graphs with Unknown Number of Clusters

We consider the problem of unsupervised clustering on signed graphs, i.e., graphs with positive and negative edge weights. Motivated by signed cut minimization, we propose an optimization problem that minimizes the total variation of the cluster labels subject to constraints on the cluster size, aug...

Full description

Saved in:
Bibliographic Details
Published in2020 28th European Signal Processing Conference (EUSIPCO) pp. 1060 - 1064
Main Authors Dittrich, Thomas, Matz, Gerald
Format Conference Proceeding
LanguageEnglish
Published Eurasip 24.01.2021
Subjects
Clustering algorithms
Partitioning algorithms
Signal processing
Signal processing algorithms
Simulation
Upper bound
Online AccessGet full text

Cover

Abstract We consider the problem of unsupervised clustering on signed graphs, i.e., graphs with positive and negative edge weights. Motivated by signed cut minimization, we propose an optimization problem that minimizes the total variation of the cluster labels subject to constraints on the cluster size, augmented with a regularization that prevents clusters consisting of isolated nodes. We estimate the unknown number of clusters by tracking the change of total variation with successively increasing putative cluster numbers. Simulation results indicate that our method yields excellent results for moderately unbalanced graphs.
AbstractList We consider the problem of unsupervised clustering on signed graphs, i.e., graphs with positive and negative edge weights. Motivated by signed cut minimization, we propose an optimization problem that minimizes the total variation of the cluster labels subject to constraints on the cluster size, augmented with a regularization that prevents clusters consisting of isolated nodes. We estimate the unknown number of clusters by tracking the change of total variation with successively increasing putative cluster numbers. Simulation results indicate that our method yields excellent results for moderately unbalanced graphs.
Author Dittrich, Thomas
Matz, Gerald
Author_xml – sequence: 1
  givenname: Thomas
  surname: Dittrich
  fullname: Dittrich, Thomas
  email: thomas.dittrich@tuwien.ac.at
  organization: TU Wien,Institute of Telecommunications
– sequence: 2
  givenname: Gerald
  surname: Matz
  fullname: Matz, Gerald
  email: gerald.matz@tuwien.ac.at
  organization: TU Wien,Institute of Telecommunications
BookMark eNo1j01Lw0AURUdRsK39BW4G94lv3nxkZimhtkLRhXZdks5LO9hOQqax-O8tWFf3cuAeuGN2E9tIjD0KyFE64Z5mQwrdplWFMzZHQMgd2kKhumJjBxYLV4BW12yEUJhMKKPv2DSlUANasIUAM2KLVUxDR_13SOR5uR_SkfoQt7yN_CNs4xnO-6rbJX4Kxx1fxa_YniJ_Gw419bxt_ifpnt021T7R9JITtnqZfZaLbPk-fy2fl1lAkMes0mi0oqbG2gsjhCcJoGWlLdQCJGgATyhV1ZyL9cZ7ITQIQGelp42SE_bw5w1EtO76cKj6n_XluPwFA9FQyA
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.23919/Eusipco47968.2020.9287424
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9082797054
9789082797053
EISSN 2076-1465
EndPage 1064
ExternalDocumentID 9287424
Genre orig-research
GroupedDBID 6IE
6IL
ALMA_UNASSIGNED_HOLDINGS
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i203t-a52654efb2bd1611de30053a580b1030500de234af00d8d6dd1150102983dec43
IEDL.DBID RIE
IngestDate Wed Aug 27 02:33:46 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-a52654efb2bd1611de30053a580b1030500de234af00d8d6dd1150102983dec43
PageCount 5
ParticipantIDs ieee_primary_9287424
PublicationCentury 2000
PublicationDate 2021-Jan.-24
PublicationDateYYYYMMDD 2021-01-24
PublicationDate_xml – month: 01
  year: 2021
  text: 2021-Jan.-24
  day: 24
PublicationDecade 2020
PublicationTitle 2020 28th European Signal Processing Conference (EUSIPCO)
PublicationTitleAbbrev Eusipco
PublicationYear 2021
Publisher Eurasip
Publisher_xml – name: Eurasip
SSID ssib028087106
ssib025355106
Score 1.7565839
Snippet We consider the problem of unsupervised clustering on signed graphs, i.e., graphs with positive and negative edge weights. Motivated by signed cut...
SourceID ieee
SourceType Publisher
StartPage 1060
SubjectTerms Clustering algorithms
Partitioning algorithms
Signal processing
Signal processing algorithms
Simulation
Upper bound
Title Unsupervised Clustering on Signed Graphs with Unknown Number of Clusters
URI https://ieeexplore.ieee.org/document/9287424
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ3NS8MwFMDDtpMnlU38JgePtkuTNG3PYzqEDUELu40mL5WhtMO2F_9689ptfuDBW2hpCUl4L-_r9wi5ybUSERe5FwEDT4a58eIkEp4CZpJYaSUBXQPzhZql8mEZLnvkdl8LY61tk8-sj8M2lg-ladBVNk4Qzs5ln_Sd4dbVau3ODg-d4vwWMeQxc6YAUx1nlIskSMbTplpvTCmjRGFSF2f-9oc_Oqu0iuXukMx3U-rySV79pta--fhFa_zvnI_I6KuEjz7uldMx6dliSGZpUTUblA6VBTp5a5CS4F7TsqBP6xcncek9Aqwriu5ZmhbocSvoou0aQst890k1Iund9Hky87atFLw1Z6L2MqTgS5trrsHd8QKwiKkXWRgzjY3GQsbAciGz3A1iUAB4UwyQzy7AGilOyKAoC3tKaIRGo4WIGzDSGOnsE4zeiEwnEMc6OyNDXIXVpqNlrLYLcP734wtywDFLhAUel5dkUL839sqp-Vpft_v7CXJApg0
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjZ3LT4MwHMebOQ96UrMZ3_bgUVhpS4Hzsjl1W0wcyW4LfWAWDSwCF_96-4NtPuLBWwOBNIX029_r80PoJpWCBZSlTqCJdrifKieMAuYITVQUCim4BtfAZCpGMX-Y-_MWut3Wwhhj6uQz48KwjuXrXFXgKutFAGenfAftWt33aVOttfl7qG-l81vMkIbEGgNENKRRyiIv6g2qYrlSOQ8iAWldlLjrV_7orVJLy_AATTaTajJKXt2qlK76-MVr_O-sD1H3q4gPP23l6Qi1TNZBozgrqhXsD4XRuP9WASfB3sZ5hp-XL3bPxXeAsC4wOGhxnIHPLcPTum8IztPNI0UXxcPBrD9y1s0UnCUlrHQS4OBzk0oqtT3ledoAqJ4lfkgktBrzCdGGMp6kdhBqoTWcFT0gtDNtFGfHqJ3lmTlBOACz0eiAKq24UtxaKBC_YYmMdBjK5BR1YBUWq4aXsVgvwNnfl6_R3mg2GS_G99PHc7RPIWeEeA7lF6hdvlfm0op-Ka_qb_0JULqpVw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=2020+28th+European+Signal+Processing+Conference+%28EUSIPCO%29&rft.atitle=Unsupervised+Clustering+on+Signed+Graphs+with+Unknown+Number+of+Clusters&rft.au=Dittrich%2C+Thomas&rft.au=Matz%2C+Gerald&rft.date=2021-01-24&rft.pub=Eurasip&rft.eissn=2076-1465&rft.spage=1060&rft.epage=1064&rft_id=info:doi/10.23919%2FEusipco47968.2020.9287424&rft.externalDocID=9287424