{"id":"https://openalex.org/W4214931546","doi":"https://doi.org/10.1109/ieeeconf53345.2021.9723204","title":"Non-Convex Total Variation Minimization for Signed Graph Cut Clustering","display_name":"Non-Convex Total Variation Minimization for Signed Graph Cut Clustering","publication_year":2021,"publication_date":"2021-10-31","ids":{"openalex":"https://openalex.org/W4214931546","doi":"https://doi.org/10.1109/ieeeconf53345.2021.9723204"},"language":"en","primary_location":{"id":"doi:10.1109/ieeeconf53345.2021.9723204","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieeeconf53345.2021.9723204","pdf_url":null,"source":{"id":"https://openalex.org/S4363607877","display_name":"2021 55th Asilomar Conference on Signals, Systems, and Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 55th Asilomar Conference on Signals, Systems, and Computers","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015549283","display_name":"Thomas Dittrich","orcid":null},"institutions":[{"id":"https://openalex.org/I71346753","display_name":"National Institute of Telecommunications","ror":"https://ror.org/0378w3a30","country_code":"BR","type":"facility","lineage":["https://openalex.org/I71346753"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Thomas Dittrich","raw_affiliation_strings":["Institute of Telecommunications,Technische Universit&#x00E4;t Wien"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications,Technische Universit&#x00E4;t Wien","institution_ids":["https://openalex.org/I71346753"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012959491","display_name":"Gerald Matz","orcid":"https://orcid.org/0000-0003-1784-806X"},"institutions":[{"id":"https://openalex.org/I71346753","display_name":"National Institute of Telecommunications","ror":"https://ror.org/0378w3a30","country_code":"BR","type":"facility","lineage":["https://openalex.org/I71346753"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Gerald Matz","raw_affiliation_strings":["Institute of Telecommunications,Technische Universit&#x00E4;t Wien"],"affiliations":[{"raw_affiliation_string":"Institute of Telecommunications,Technische Universit&#x00E4;t Wien","institution_ids":["https://openalex.org/I71346753"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015549283"],"corresponding_institution_ids":["https://openalex.org/I71346753"],"apc_list":null,"apc_paid":null,"fwci":0.681,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.70938628,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11273","display_name":"Advanced Graph Neural Networks","score":0.9864000082015991,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5859854817390442},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.5831936001777649},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5222492814064026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4976098835468292},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4731491804122925},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.46362069249153137},{"id":"https://openalex.org/keywords/stochastic-block-model","display_name":"Stochastic block model","score":0.46348100900650024},{"id":"https://openalex.org/keywords/cut","display_name":"Cut","score":0.46015504002571106},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4505853056907654},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41964471340179443},{"id":"https://openalex.org/keywords/clustering-coefficient","display_name":"Clustering coefficient","score":0.4134535789489746},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3679056763648987},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3106933832168579},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.23434865474700928}],"concepts":[{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5859854817390442},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.5831936001777649},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5222492814064026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4976098835468292},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4731491804122925},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.46362069249153137},{"id":"https://openalex.org/C2779982251","wikidata":"https://www.wikidata.org/wiki/Q25053762","display_name":"Stochastic block model","level":3,"score":0.46348100900650024},{"id":"https://openalex.org/C5134670","wikidata":"https://www.wikidata.org/wiki/Q1626444","display_name":"Cut","level":4,"score":0.46015504002571106},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4505853056907654},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41964471340179443},{"id":"https://openalex.org/C22047676","wikidata":"https://www.wikidata.org/wiki/Q898680","display_name":"Clustering coefficient","level":3,"score":0.4134535789489746},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3679056763648987},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3106933832168579},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23434865474700928},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.0},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ieeeconf53345.2021.9723204","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ieeeconf53345.2021.9723204","pdf_url":null,"source":{"id":"https://openalex.org/S4363607877","display_name":"2021 55th Asilomar Conference on Signals, Systems, and Computers","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 55th Asilomar Conference on Signals, Systems, and Computers","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W108936587","https://openalex.org/W1619721866","https://openalex.org/W1856231595","https://openalex.org/W2066215526","https://openalex.org/W2132914434","https://openalex.org/W2602671714","https://openalex.org/W2900510481","https://openalex.org/W2914959486","https://openalex.org/W2922291765","https://openalex.org/W2938647384","https://openalex.org/W2952362591","https://openalex.org/W2953170569","https://openalex.org/W2962853966","https://openalex.org/W3097804103","https://openalex.org/W3117084933","https://openalex.org/W4250739957","https://openalex.org/W6636424863","https://openalex.org/W6638914580","https://openalex.org/W6730036208","https://openalex.org/W6735855921","https://openalex.org/W6760105608","https://openalex.org/W6762790718"],"related_works":["https://openalex.org/W2080858045","https://openalex.org/W2391091101","https://openalex.org/W2040676043","https://openalex.org/W4256242347","https://openalex.org/W1986279588","https://openalex.org/W2927183251","https://openalex.org/W2765710841","https://openalex.org/W2023364171","https://openalex.org/W3099167349","https://openalex.org/W2358534542"],"abstract_inverted_index":{"We":[0,50],"consider":[1,37],"graph":[2,65],"cut":[3],"minimization":[4,54],"in":[5,28],"signed":[6,17,112],"graphs":[7],"with":[8,102],"three":[9],"clusters.":[10],"To":[11],"this":[12],"end,":[13],"we":[14,36,81],"use":[15,42],"the":[16,38,52,57,64,75,83,105,111],"total":[18],"variation,":[19],"which":[20],"is":[21],"convex":[22],"and":[23,41,60,88,110],"has":[24],"shown":[25],"promising":[26],"results":[27,98],"our":[29,78,90],"previous":[30],"work":[31],"on":[32,63,74],"semi-supervised":[33],"clustering.":[34],"Here,":[35],"unsupervised":[39],"case":[40],"a":[43,93],"non-convex":[44,58],"norm-constraint":[45],"to":[46,92,104],"avoid":[47],"degenerate":[48],"solutions.":[49],"solve":[51],"resulting":[53],"problem":[55],"via":[56],"ADMM":[59],"derive":[61],"conditions":[62,73],"topology":[66],"that":[67],"guarantee":[68],"convergence":[69],"under":[70],"rather":[71],"weak":[72],"graph.":[76],"In":[77],"numerical":[79],"experiments":[80],"study":[82],"labeled":[84],"stochastic":[85],"block":[86],"model":[87],"compare":[89],"method":[91],"state-of-the-art":[94],"clustering":[95],"algorithm.":[96],"The":[97],"are":[99],"convincing":[100],"both":[101],"regard":[103],"fraction":[106],"of":[107],"mislabeled":[108],"nodes":[109],"cut.":[113]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
