Loading…
Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering
Ensemble clustering (EC), utilizing multiple basic partitions (BPs) to yield a robust consensus clustering, has shown promising clustering performance. Nevertheless, most current algorithms suffer from two challenging hurdles: (1) a surge of EC-based methods only focus on pair-wise sample correlatio...
Saved in:
Published in: | ACM transactions on multimedia computing communications and applications 2023-09, Vol.20 (1), p.1-21, Article 21 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | cdi_FETCH-LOGICAL-a239t-7f520bd0f43cd9ea45c4ec7181c260c9e46458940a4f11a5b0b9c14382a261e73 |
container_end_page | 21 |
container_issue | 1 |
container_start_page | 1 |
container_title | ACM transactions on multimedia computing communications and applications |
container_volume | 20 |
creator | Zhao, Xiaojia Xu, Tingting Shen, Qiangqiang Liu, Youfa Chen, Yongyong Su, Jingyong |
description | Ensemble clustering (EC), utilizing multiple basic partitions (BPs) to yield a robust consensus clustering, has shown promising clustering performance. Nevertheless, most current algorithms suffer from two challenging hurdles: (1) a surge of EC-based methods only focus on pair-wise sample correlation while fully ignoring the high-order correlations of diverse views. (2) they deal directly with the co-association (CA) matrices generated from BPs, which are inevitably corrupted by noise and thus degrade the clustering performance. To address these issues, we propose a novel Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering (DC-RMEC) method, which preserves the high-order inter-view correlation and the high-order correlation of original data simultaneously. Specifically, DC-RMEC constructs a hypergraph from BPs to fuse high-level complementary information from different algorithms and incorporates multiple CA-based representations into a low-rank tensor to discover the high-order relevance underlying CA matrices, such that double high-order correlation of multi-view features could be dexterously uncovered. Moreover, a marginalized denoiser is invoked to gain robust view-specific CA matrices. Furthermore, we develop a unified framework to jointly optimize the representation tensor and the result matrix. An effective iterative optimization algorithm is designed to optimize our DC-RMEC model by resorting to the alternating direction method of multipliers. Extensive experiments on seven real-world multi-view datasets have demonstrated the superiority of DC-RMEC compared with several state-of-the-art multi-view ensemble clustering methods. |
doi_str_mv | 10.1145/3612923 |
format | article |
fullrecord | <record><control><sourceid>acm_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1145_3612923</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3612923</sourcerecordid><originalsourceid>FETCH-LOGICAL-a239t-7f520bd0f43cd9ea45c4ec7181c260c9e46458940a4f11a5b0b9c14382a261e73</originalsourceid><addsrcrecordid>eNo9kD1PwzAYhC0EEqUgdiZvTAG__ko8olAoUqsiBKyR47wpRvlAdgLi39OqpdOddM_dcIRcArsBkOpWaOCGiyMyAaUg0ZlWxwev0lNyFuMnY0IrqSdked-PZYN07tcfySpUGGjeh4CNHXzf0eeAEcM3VvSlL8c40OXYDD559_hDZ13EdtvNm02CwXfrc3JS2ybixV6n5O1h9prPk8Xq8Sm_WySWCzMkaa04KytWS-Eqg1YqJ9GlkIHjmjmDUkuVGcmsrAGsKllpHEiRccs1YCqm5Hq360IfY8C6-Aq-teG3AFZsXyj2L2zIqx1pXXuA_sM_0phWmA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering</title><source>Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list)</source><creator>Zhao, Xiaojia ; Xu, Tingting ; Shen, Qiangqiang ; Liu, Youfa ; Chen, Yongyong ; Su, Jingyong</creator><creatorcontrib>Zhao, Xiaojia ; Xu, Tingting ; Shen, Qiangqiang ; Liu, Youfa ; Chen, Yongyong ; Su, Jingyong</creatorcontrib><description>Ensemble clustering (EC), utilizing multiple basic partitions (BPs) to yield a robust consensus clustering, has shown promising clustering performance. Nevertheless, most current algorithms suffer from two challenging hurdles: (1) a surge of EC-based methods only focus on pair-wise sample correlation while fully ignoring the high-order correlations of diverse views. (2) they deal directly with the co-association (CA) matrices generated from BPs, which are inevitably corrupted by noise and thus degrade the clustering performance. To address these issues, we propose a novel Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering (DC-RMEC) method, which preserves the high-order inter-view correlation and the high-order correlation of original data simultaneously. Specifically, DC-RMEC constructs a hypergraph from BPs to fuse high-level complementary information from different algorithms and incorporates multiple CA-based representations into a low-rank tensor to discover the high-order relevance underlying CA matrices, such that double high-order correlation of multi-view features could be dexterously uncovered. Moreover, a marginalized denoiser is invoked to gain robust view-specific CA matrices. Furthermore, we develop a unified framework to jointly optimize the representation tensor and the result matrix. An effective iterative optimization algorithm is designed to optimize our DC-RMEC model by resorting to the alternating direction method of multipliers. Extensive experiments on seven real-world multi-view datasets have demonstrated the superiority of DC-RMEC compared with several state-of-the-art multi-view ensemble clustering methods.</description><identifier>ISSN: 1551-6857</identifier><identifier>EISSN: 1551-6865</identifier><identifier>DOI: 10.1145/3612923</identifier><language>eng</language><publisher>New York, NY: ACM</publisher><subject>Computing methodologies ; Ensemble methods ; Mathematical optimization ; Theory of computation</subject><ispartof>ACM transactions on multimedia computing communications and applications, 2023-09, Vol.20 (1), p.1-21, Article 21</ispartof><rights>Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-a239t-7f520bd0f43cd9ea45c4ec7181c260c9e46458940a4f11a5b0b9c14382a261e73</cites><orcidid>0000-0002-3540-5775 ; 0009-0001-4203-2743 ; 0000-0002-3564-6042 ; 0000-0002-9589-1349 ; 0000-0003-3216-7027 ; 0000-0003-1970-1993</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Zhao, Xiaojia</creatorcontrib><creatorcontrib>Xu, Tingting</creatorcontrib><creatorcontrib>Shen, Qiangqiang</creatorcontrib><creatorcontrib>Liu, Youfa</creatorcontrib><creatorcontrib>Chen, Yongyong</creatorcontrib><creatorcontrib>Su, Jingyong</creatorcontrib><title>Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering</title><title>ACM transactions on multimedia computing communications and applications</title><addtitle>ACM TOMM</addtitle><description>Ensemble clustering (EC), utilizing multiple basic partitions (BPs) to yield a robust consensus clustering, has shown promising clustering performance. Nevertheless, most current algorithms suffer from two challenging hurdles: (1) a surge of EC-based methods only focus on pair-wise sample correlation while fully ignoring the high-order correlations of diverse views. (2) they deal directly with the co-association (CA) matrices generated from BPs, which are inevitably corrupted by noise and thus degrade the clustering performance. To address these issues, we propose a novel Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering (DC-RMEC) method, which preserves the high-order inter-view correlation and the high-order correlation of original data simultaneously. Specifically, DC-RMEC constructs a hypergraph from BPs to fuse high-level complementary information from different algorithms and incorporates multiple CA-based representations into a low-rank tensor to discover the high-order relevance underlying CA matrices, such that double high-order correlation of multi-view features could be dexterously uncovered. Moreover, a marginalized denoiser is invoked to gain robust view-specific CA matrices. Furthermore, we develop a unified framework to jointly optimize the representation tensor and the result matrix. An effective iterative optimization algorithm is designed to optimize our DC-RMEC model by resorting to the alternating direction method of multipliers. Extensive experiments on seven real-world multi-view datasets have demonstrated the superiority of DC-RMEC compared with several state-of-the-art multi-view ensemble clustering methods.</description><subject>Computing methodologies</subject><subject>Ensemble methods</subject><subject>Mathematical optimization</subject><subject>Theory of computation</subject><issn>1551-6857</issn><issn>1551-6865</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNo9kD1PwzAYhC0EEqUgdiZvTAG__ko8olAoUqsiBKyR47wpRvlAdgLi39OqpdOddM_dcIRcArsBkOpWaOCGiyMyAaUg0ZlWxwev0lNyFuMnY0IrqSdked-PZYN07tcfySpUGGjeh4CNHXzf0eeAEcM3VvSlL8c40OXYDD559_hDZ13EdtvNm02CwXfrc3JS2ybixV6n5O1h9prPk8Xq8Sm_WySWCzMkaa04KytWS-Eqg1YqJ9GlkIHjmjmDUkuVGcmsrAGsKllpHEiRccs1YCqm5Hq360IfY8C6-Aq-teG3AFZsXyj2L2zIqx1pXXuA_sM_0phWmA</recordid><startdate>20230918</startdate><enddate>20230918</enddate><creator>Zhao, Xiaojia</creator><creator>Xu, Tingting</creator><creator>Shen, Qiangqiang</creator><creator>Liu, Youfa</creator><creator>Chen, Yongyong</creator><creator>Su, Jingyong</creator><general>ACM</general><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0002-3540-5775</orcidid><orcidid>https://orcid.org/0009-0001-4203-2743</orcidid><orcidid>https://orcid.org/0000-0002-3564-6042</orcidid><orcidid>https://orcid.org/0000-0002-9589-1349</orcidid><orcidid>https://orcid.org/0000-0003-3216-7027</orcidid><orcidid>https://orcid.org/0000-0003-1970-1993</orcidid></search><sort><creationdate>20230918</creationdate><title>Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering</title><author>Zhao, Xiaojia ; Xu, Tingting ; Shen, Qiangqiang ; Liu, Youfa ; Chen, Yongyong ; Su, Jingyong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a239t-7f520bd0f43cd9ea45c4ec7181c260c9e46458940a4f11a5b0b9c14382a261e73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computing methodologies</topic><topic>Ensemble methods</topic><topic>Mathematical optimization</topic><topic>Theory of computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhao, Xiaojia</creatorcontrib><creatorcontrib>Xu, Tingting</creatorcontrib><creatorcontrib>Shen, Qiangqiang</creatorcontrib><creatorcontrib>Liu, Youfa</creatorcontrib><creatorcontrib>Chen, Yongyong</creatorcontrib><creatorcontrib>Su, Jingyong</creatorcontrib><collection>CrossRef</collection><jtitle>ACM transactions on multimedia computing communications and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Zhao, Xiaojia</au><au>Xu, Tingting</au><au>Shen, Qiangqiang</au><au>Liu, Youfa</au><au>Chen, Yongyong</au><au>Su, Jingyong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering</atitle><jtitle>ACM transactions on multimedia computing communications and applications</jtitle><stitle>ACM TOMM</stitle><date>2023-09-18</date><risdate>2023</risdate><volume>20</volume><issue>1</issue><spage>1</spage><epage>21</epage><pages>1-21</pages><artnum>21</artnum><issn>1551-6857</issn><eissn>1551-6865</eissn><abstract>Ensemble clustering (EC), utilizing multiple basic partitions (BPs) to yield a robust consensus clustering, has shown promising clustering performance. Nevertheless, most current algorithms suffer from two challenging hurdles: (1) a surge of EC-based methods only focus on pair-wise sample correlation while fully ignoring the high-order correlations of diverse views. (2) they deal directly with the co-association (CA) matrices generated from BPs, which are inevitably corrupted by noise and thus degrade the clustering performance. To address these issues, we propose a novel Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering (DC-RMEC) method, which preserves the high-order inter-view correlation and the high-order correlation of original data simultaneously. Specifically, DC-RMEC constructs a hypergraph from BPs to fuse high-level complementary information from different algorithms and incorporates multiple CA-based representations into a low-rank tensor to discover the high-order relevance underlying CA matrices, such that double high-order correlation of multi-view features could be dexterously uncovered. Moreover, a marginalized denoiser is invoked to gain robust view-specific CA matrices. Furthermore, we develop a unified framework to jointly optimize the representation tensor and the result matrix. An effective iterative optimization algorithm is designed to optimize our DC-RMEC model by resorting to the alternating direction method of multipliers. Extensive experiments on seven real-world multi-view datasets have demonstrated the superiority of DC-RMEC compared with several state-of-the-art multi-view ensemble clustering methods.</abstract><cop>New York, NY</cop><pub>ACM</pub><doi>10.1145/3612923</doi><tpages>21</tpages><orcidid>https://orcid.org/0000-0002-3540-5775</orcidid><orcidid>https://orcid.org/0009-0001-4203-2743</orcidid><orcidid>https://orcid.org/0000-0002-3564-6042</orcidid><orcidid>https://orcid.org/0000-0002-9589-1349</orcidid><orcidid>https://orcid.org/0000-0003-3216-7027</orcidid><orcidid>https://orcid.org/0000-0003-1970-1993</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1551-6857 |
ispartof | ACM transactions on multimedia computing communications and applications, 2023-09, Vol.20 (1), p.1-21, Article 21 |
issn | 1551-6857 1551-6865 |
language | eng |
recordid | cdi_crossref_primary_10_1145_3612923 |
source | Association for Computing Machinery:Jisc Collections:ACM OPEN Journals 2023-2025 (reading list) |
subjects | Computing methodologies Ensemble methods Mathematical optimization Theory of computation |
title | Double High-Order Correlation Preserved Robust Multi-View Ensemble Clustering |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T10%3A02%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Double%20High-Order%20Correlation%20Preserved%20Robust%20Multi-View%20Ensemble%20Clustering&rft.jtitle=ACM%20transactions%20on%20multimedia%20computing%20communications%20and%20applications&rft.au=Zhao,%20Xiaojia&rft.date=2023-09-18&rft.volume=20&rft.issue=1&rft.spage=1&rft.epage=21&rft.pages=1-21&rft.artnum=21&rft.issn=1551-6857&rft.eissn=1551-6865&rft_id=info:doi/10.1145/3612923&rft_dat=%3Cacm_cross%3E3612923%3C/acm_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a239t-7f520bd0f43cd9ea45c4ec7181c260c9e46458940a4f11a5b0b9c14382a261e73%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |