ComClus: A Self-Grouping Framework for Multi-Network Clustering

Joint clustering of multiple networks has been shown to be more accurate than performing clustering on individual networks separately. This is because multi-network clustering algorithms typically assume there is a common clustering structure shared by all networks, and different networks can provid...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on knowledge and data engineering 2018-03, Vol.30 (3), p.435-448
Hauptverfasser: Ni, Jingchao, Cheng, Wei, Fan, Wei, Zhang, Xiang
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 448
container_issue 3
container_start_page 435
container_title IEEE transactions on knowledge and data engineering
container_volume 30
creator Ni, Jingchao
Cheng, Wei
Fan, Wei
Zhang, Xiang
description Joint clustering of multiple networks has been shown to be more accurate than performing clustering on individual networks separately. This is because multi-network clustering algorithms typically assume there is a common clustering structure shared by all networks, and different networks can provide compatible and complementary information for uncovering this underlying clustering structure. However, this assumption is too strict to hold in many emerging applications, where multiple networks usually have diverse data distributions. More popularly, the networks in consideration belong to different underlying groups. Only networks in the same underlying group share similar clustering structures. Better clustering performance can be achieved by considering such groups differently. As a result, an ideal method should be able to automatically detect network groups so that networks in the same group share a common clustering structure. To address this problem, we propose a new method, COMCLUS, to simultaneously group and cluster multiple networks. COMCLUS is novel in combining the clustering approach of non-negative matrix factorization (NMF) and the feature subspace learning approach of metric learning. Specifically, it treats node clusters as features of networks and learns proper subspaces from such features to differentiate different network groups. During the learning process, the two procedures of network grouping and clustering are coupled and mutually enhanced. Moreover, COMCLUS can effectively leverage prior knowledge on how to group networks such that network grouping can be conducted in a semi-supervised manner. This will enable users to guide the grouping process using domain knowledge so that network clustering accuracy can be further boosted. Extensive experimental evaluations on a variety of synthetic and real datasets demonstrate the effectiveness and scalability of the proposed method.
doi_str_mv 10.1109/TKDE.2017.2771762
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2174544774</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8103040</ieee_id><sourcerecordid>2174544774</sourcerecordid><originalsourceid>FETCH-LOGICAL-c447t-94df7ed3bc89ea40b1c58210e9dc804b2bcb161131107566fd07411c815c68e53</originalsourceid><addsrcrecordid>eNpdkUtP5DAQhC20iPcPWCGhSFy4ZHDbTuzsYREanuJ1AM5W4nQgbBLP2gmIf4_DzI5YTrZcX1e7VIT8BDoBoNnhw9XJ6YRRkBMmJciUrZANSBIVM8jgR7hTAbHgQq6TTe9fKKVKKlgj6zwIKWd0gxxNbTttBv8rOo7usanic2eHWd09RWcub_HNuj9RZV10MzR9Hd9i__kyTvToArZNVqu88bizOLfI49npw_Qivr47v5weX8dGCNnHmSgriSUvjMowF7QAkygGFLPSKCoKVpgCUgAecskkTauSSgFgFCQmVZjwLfJ77jsbihZLg13v8kbPXN3m7l3bvNb_K139rJ_sq04ZAyFFMDhYGDj7d0Df67b2Bpsm79AOXjPgjGUc6Lhr_xv6YgfXhXiBkiIJiT4NYU4ZZ713WC0_A1SP9eixHj3Woxf1hJm9rymWE__6CMDuHKgRcSkroIGg_AN115KB</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2174544774</pqid></control><display><type>article</type><title>ComClus: A Self-Grouping Framework for Multi-Network Clustering</title><source>IEEE Electronic Library (IEL)</source><creator>Ni, Jingchao ; Cheng, Wei ; Fan, Wei ; Zhang, Xiang</creator><creatorcontrib>Ni, Jingchao ; Cheng, Wei ; Fan, Wei ; Zhang, Xiang</creatorcontrib><description>Joint clustering of multiple networks has been shown to be more accurate than performing clustering on individual networks separately. This is because multi-network clustering algorithms typically assume there is a common clustering structure shared by all networks, and different networks can provide compatible and complementary information for uncovering this underlying clustering structure. However, this assumption is too strict to hold in many emerging applications, where multiple networks usually have diverse data distributions. More popularly, the networks in consideration belong to different underlying groups. Only networks in the same underlying group share similar clustering structures. Better clustering performance can be achieved by considering such groups differently. As a result, an ideal method should be able to automatically detect network groups so that networks in the same group share a common clustering structure. To address this problem, we propose a new method, COMCLUS, to simultaneously group and cluster multiple networks. COMCLUS is novel in combining the clustering approach of non-negative matrix factorization (NMF) and the feature subspace learning approach of metric learning. Specifically, it treats node clusters as features of networks and learns proper subspaces from such features to differentiate different network groups. During the learning process, the two procedures of network grouping and clustering are coupled and mutually enhanced. Moreover, COMCLUS can effectively leverage prior knowledge on how to group networks such that network grouping can be conducted in a semi-supervised manner. This will enable users to guide the grouping process using domain knowledge so that network clustering accuracy can be further boosted. Extensive experimental evaluations on a variety of synthetic and real datasets demonstrate the effectiveness and scalability of the proposed method.</description><identifier>ISSN: 1041-4347</identifier><identifier>EISSN: 1558-2191</identifier><identifier>DOI: 10.1109/TKDE.2017.2771762</identifier><identifier>PMID: 30416320</identifier><identifier>CODEN: ITKEEH</identifier><language>eng</language><publisher>United States: IEEE</publisher><subject>Algorithm design and analysis ; Clustering ; Clustering algorithms ; Clustering methods ; Electronic mail ; Knowledge engineering ; Knowledge management ; Learning ; Multi-network clustering ; network grouping ; Networks ; Nickel ; non-negative matrix factorization ; Subspaces ; Tensile stress</subject><ispartof>IEEE transactions on knowledge and data engineering, 2018-03, Vol.30 (3), p.435-448</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2018</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c447t-94df7ed3bc89ea40b1c58210e9dc804b2bcb161131107566fd07411c815c68e53</citedby><cites>FETCH-LOGICAL-c447t-94df7ed3bc89ea40b1c58210e9dc804b2bcb161131107566fd07411c815c68e53</cites><orcidid>0000-0002-2986-6612 ; 0000-0001-5456-626X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8103040$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>230,315,781,785,797,886,27929,27930,54763</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8103040$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/30416320$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Ni, Jingchao</creatorcontrib><creatorcontrib>Cheng, Wei</creatorcontrib><creatorcontrib>Fan, Wei</creatorcontrib><creatorcontrib>Zhang, Xiang</creatorcontrib><title>ComClus: A Self-Grouping Framework for Multi-Network Clustering</title><title>IEEE transactions on knowledge and data engineering</title><addtitle>TKDE</addtitle><addtitle>IEEE Trans Knowl Data Eng</addtitle><description>Joint clustering of multiple networks has been shown to be more accurate than performing clustering on individual networks separately. This is because multi-network clustering algorithms typically assume there is a common clustering structure shared by all networks, and different networks can provide compatible and complementary information for uncovering this underlying clustering structure. However, this assumption is too strict to hold in many emerging applications, where multiple networks usually have diverse data distributions. More popularly, the networks in consideration belong to different underlying groups. Only networks in the same underlying group share similar clustering structures. Better clustering performance can be achieved by considering such groups differently. As a result, an ideal method should be able to automatically detect network groups so that networks in the same group share a common clustering structure. To address this problem, we propose a new method, COMCLUS, to simultaneously group and cluster multiple networks. COMCLUS is novel in combining the clustering approach of non-negative matrix factorization (NMF) and the feature subspace learning approach of metric learning. Specifically, it treats node clusters as features of networks and learns proper subspaces from such features to differentiate different network groups. During the learning process, the two procedures of network grouping and clustering are coupled and mutually enhanced. Moreover, COMCLUS can effectively leverage prior knowledge on how to group networks such that network grouping can be conducted in a semi-supervised manner. This will enable users to guide the grouping process using domain knowledge so that network clustering accuracy can be further boosted. Extensive experimental evaluations on a variety of synthetic and real datasets demonstrate the effectiveness and scalability of the proposed method.</description><subject>Algorithm design and analysis</subject><subject>Clustering</subject><subject>Clustering algorithms</subject><subject>Clustering methods</subject><subject>Electronic mail</subject><subject>Knowledge engineering</subject><subject>Knowledge management</subject><subject>Learning</subject><subject>Multi-network clustering</subject><subject>network grouping</subject><subject>Networks</subject><subject>Nickel</subject><subject>non-negative matrix factorization</subject><subject>Subspaces</subject><subject>Tensile stress</subject><issn>1041-4347</issn><issn>1558-2191</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2018</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkUtP5DAQhC20iPcPWCGhSFy4ZHDbTuzsYREanuJ1AM5W4nQgbBLP2gmIf4_DzI5YTrZcX1e7VIT8BDoBoNnhw9XJ6YRRkBMmJciUrZANSBIVM8jgR7hTAbHgQq6TTe9fKKVKKlgj6zwIKWd0gxxNbTttBv8rOo7usanic2eHWd09RWcub_HNuj9RZV10MzR9Hd9i__kyTvToArZNVqu88bizOLfI49npw_Qivr47v5weX8dGCNnHmSgriSUvjMowF7QAkygGFLPSKCoKVpgCUgAecskkTauSSgFgFCQmVZjwLfJ77jsbihZLg13v8kbPXN3m7l3bvNb_K139rJ_sq04ZAyFFMDhYGDj7d0Df67b2Bpsm79AOXjPgjGUc6Lhr_xv6YgfXhXiBkiIJiT4NYU4ZZ713WC0_A1SP9eixHj3Woxf1hJm9rymWE__6CMDuHKgRcSkroIGg_AN115KB</recordid><startdate>20180301</startdate><enddate>20180301</enddate><creator>Ni, Jingchao</creator><creator>Cheng, Wei</creator><creator>Fan, Wei</creator><creator>Zhang, Xiang</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>7X8</scope><scope>5PM</scope><orcidid>https://orcid.org/0000-0002-2986-6612</orcidid><orcidid>https://orcid.org/0000-0001-5456-626X</orcidid></search><sort><creationdate>20180301</creationdate><title>ComClus: A Self-Grouping Framework for Multi-Network Clustering</title><author>Ni, Jingchao ; Cheng, Wei ; Fan, Wei ; Zhang, Xiang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c447t-94df7ed3bc89ea40b1c58210e9dc804b2bcb161131107566fd07411c815c68e53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Algorithm design and analysis</topic><topic>Clustering</topic><topic>Clustering algorithms</topic><topic>Clustering methods</topic><topic>Electronic mail</topic><topic>Knowledge engineering</topic><topic>Knowledge management</topic><topic>Learning</topic><topic>Multi-network clustering</topic><topic>network grouping</topic><topic>Networks</topic><topic>Nickel</topic><topic>non-negative matrix factorization</topic><topic>Subspaces</topic><topic>Tensile stress</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ni, Jingchao</creatorcontrib><creatorcontrib>Cheng, Wei</creatorcontrib><creatorcontrib>Fan, Wei</creatorcontrib><creatorcontrib>Zhang, Xiang</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>PubMed</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>MEDLINE - Academic</collection><collection>PubMed Central (Full Participant titles)</collection><jtitle>IEEE transactions on knowledge and data engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ni, Jingchao</au><au>Cheng, Wei</au><au>Fan, Wei</au><au>Zhang, Xiang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>ComClus: A Self-Grouping Framework for Multi-Network Clustering</atitle><jtitle>IEEE transactions on knowledge and data engineering</jtitle><stitle>TKDE</stitle><addtitle>IEEE Trans Knowl Data Eng</addtitle><date>2018-03-01</date><risdate>2018</risdate><volume>30</volume><issue>3</issue><spage>435</spage><epage>448</epage><pages>435-448</pages><issn>1041-4347</issn><eissn>1558-2191</eissn><coden>ITKEEH</coden><abstract>Joint clustering of multiple networks has been shown to be more accurate than performing clustering on individual networks separately. This is because multi-network clustering algorithms typically assume there is a common clustering structure shared by all networks, and different networks can provide compatible and complementary information for uncovering this underlying clustering structure. However, this assumption is too strict to hold in many emerging applications, where multiple networks usually have diverse data distributions. More popularly, the networks in consideration belong to different underlying groups. Only networks in the same underlying group share similar clustering structures. Better clustering performance can be achieved by considering such groups differently. As a result, an ideal method should be able to automatically detect network groups so that networks in the same group share a common clustering structure. To address this problem, we propose a new method, COMCLUS, to simultaneously group and cluster multiple networks. COMCLUS is novel in combining the clustering approach of non-negative matrix factorization (NMF) and the feature subspace learning approach of metric learning. Specifically, it treats node clusters as features of networks and learns proper subspaces from such features to differentiate different network groups. During the learning process, the two procedures of network grouping and clustering are coupled and mutually enhanced. Moreover, COMCLUS can effectively leverage prior knowledge on how to group networks such that network grouping can be conducted in a semi-supervised manner. This will enable users to guide the grouping process using domain knowledge so that network clustering accuracy can be further boosted. Extensive experimental evaluations on a variety of synthetic and real datasets demonstrate the effectiveness and scalability of the proposed method.</abstract><cop>United States</cop><pub>IEEE</pub><pmid>30416320</pmid><doi>10.1109/TKDE.2017.2771762</doi><tpages>14</tpages><orcidid>https://orcid.org/0000-0002-2986-6612</orcidid><orcidid>https://orcid.org/0000-0001-5456-626X</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1041-4347
ispartof IEEE transactions on knowledge and data engineering, 2018-03, Vol.30 (3), p.435-448
issn 1041-4347
1558-2191
language eng
recordid cdi_proquest_journals_2174544774
source IEEE Electronic Library (IEL)
subjects Algorithm design and analysis
Clustering
Clustering algorithms
Clustering methods
Electronic mail
Knowledge engineering
Knowledge management
Learning
Multi-network clustering
network grouping
Networks
Nickel
non-negative matrix factorization
Subspaces
Tensile stress
title ComClus: A Self-Grouping Framework for Multi-Network Clustering
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T19%3A23%3A12IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=ComClus:%20A%20Self-Grouping%20Framework%20for%20Multi-Network%20Clustering&rft.jtitle=IEEE%20transactions%20on%20knowledge%20and%20data%20engineering&rft.au=Ni,%20Jingchao&rft.date=2018-03-01&rft.volume=30&rft.issue=3&rft.spage=435&rft.epage=448&rft.pages=435-448&rft.issn=1041-4347&rft.eissn=1558-2191&rft.coden=ITKEEH&rft_id=info:doi/10.1109/TKDE.2017.2771762&rft_dat=%3Cproquest_RIE%3E2174544774%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2174544774&rft_id=info:pmid/30416320&rft_ieee_id=8103040&rfr_iscdi=true