Weighted-object ensemble clustering: methods and analysis

Ensemble clustering has attracted increasing attention in recent years. Its goal is to combine multiple base clusterings into a single consensus clustering of increased quality. Most of the existing ensemble clustering methods treat each base clustering and each object as equally important, while so...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Knowledge and information systems 2017-05, Vol.51 (2), p.661-689
Hauptverfasser: Ren, Yazhou, Domeniconi, Carlotta, Zhang, Guoji, Yu, Guoxian
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 689
container_issue 2
container_start_page 661
container_title Knowledge and information systems
container_volume 51
creator Ren, Yazhou
Domeniconi, Carlotta
Zhang, Guoji
Yu, Guoxian
description Ensemble clustering has attracted increasing attention in recent years. Its goal is to combine multiple base clusterings into a single consensus clustering of increased quality. Most of the existing ensemble clustering methods treat each base clustering and each object as equally important, while some approaches make use of weights associated with clusters, or to clusterings, when assembling the different base clusterings. Boosting algorithms developed for classification have led to the idea of considering weighted objects during the clustering process. However, not much effort has been put toward incorporating weighted objects into the consensus process. To fill this gap, in this paper, we propose a framework called Weighted-Object Ensemble Clustering (WOEC). We first estimate how difficult it is to cluster an object by constructing the co-association matrix that summarizes the base clustering results, and we then embed the corresponding information as weights associated with objects. We propose three different consensus techniques to leverage the weighted objects. All three reduce the ensemble clustering problem to a graph partitioning one. We experimentally demonstrate the gain in performance that our WOEC methodology achieves with respect to state-of-the-art ensemble clustering methods, as well as its stability and robustness.
doi_str_mv 10.1007/s10115-016-0988-y
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1904205302</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>4321684247</sourcerecordid><originalsourceid>FETCH-LOGICAL-c349t-d873cb4d3ad5e4ddcde39aefd0717370cb565f0216b0f3792dce8a2601ab147f3</originalsourceid><addsrcrecordid>eNp1kE1LxDAQhoMouK7-AG8FL16iM03bNN5k8QsWvCgeQ5pMd7v0Y03aw_57W7oHETwMM4fnHV4exq4R7hBA3gcExJQDZhxUnvPDCVtAjIoLxOz0eKOQ8pxdhLADQJkhLpj6omqz7cnxrtiR7SNqAzVFTZGth9CTr9rNQ9RQv-1ciEzrxjH1IVThkp2Vpg50ddxL9vn89LF65ev3l7fV45pbkaieu1wKWyROGJdS4px1JJSh0oFEKSTYIs3ScqyXFVAKqWJnKTdxBmgKTGQplux2_rv33fdAoddNFSzVtWmpG4JGBUkMqYB4RG_-oLtu8GPfkcrHHqBUMlE4U9Z3IXgq9d5XjfEHjaAnmXqWqUeZepKpD2MmnjNhPxkh_-vzv6EfvEd3Mg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1887309942</pqid></control><display><type>article</type><title>Weighted-object ensemble clustering: methods and analysis</title><source>SpringerNature Journals</source><creator>Ren, Yazhou ; Domeniconi, Carlotta ; Zhang, Guoji ; Yu, Guoxian</creator><creatorcontrib>Ren, Yazhou ; Domeniconi, Carlotta ; Zhang, Guoji ; Yu, Guoxian</creatorcontrib><description>Ensemble clustering has attracted increasing attention in recent years. Its goal is to combine multiple base clusterings into a single consensus clustering of increased quality. Most of the existing ensemble clustering methods treat each base clustering and each object as equally important, while some approaches make use of weights associated with clusters, or to clusterings, when assembling the different base clusterings. Boosting algorithms developed for classification have led to the idea of considering weighted objects during the clustering process. However, not much effort has been put toward incorporating weighted objects into the consensus process. To fill this gap, in this paper, we propose a framework called Weighted-Object Ensemble Clustering (WOEC). We first estimate how difficult it is to cluster an object by constructing the co-association matrix that summarizes the base clustering results, and we then embed the corresponding information as weights associated with objects. We propose three different consensus techniques to leverage the weighted objects. All three reduce the ensemble clustering problem to a graph partitioning one. We experimentally demonstrate the gain in performance that our WOEC methodology achieves with respect to state-of-the-art ensemble clustering methods, as well as its stability and robustness.</description><identifier>ISSN: 0219-1377</identifier><identifier>EISSN: 0219-3116</identifier><identifier>DOI: 10.1007/s10115-016-0988-y</identifier><identifier>CODEN: KISNCR</identifier><language>eng</language><publisher>London: Springer London</publisher><subject>Algorithms ; Assembling ; Bias ; Classification ; Clustering ; Clusters ; Computer Science ; Data Mining and Knowledge Discovery ; Database Management ; Experiments ; Gain ; Information Storage and Retrieval ; Information systems ; Information Systems and Communication Service ; Information Systems Applications (incl.Internet) ; IT in Business ; Regular Paper ; Robustness ; State of the art ; Studies</subject><ispartof>Knowledge and information systems, 2017-05, Vol.51 (2), p.661-689</ispartof><rights>Springer-Verlag London 2016</rights><rights>Knowledge and Information Systems is a copyright of Springer, 2017.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c349t-d873cb4d3ad5e4ddcde39aefd0717370cb565f0216b0f3792dce8a2601ab147f3</citedby><cites>FETCH-LOGICAL-c349t-d873cb4d3ad5e4ddcde39aefd0717370cb565f0216b0f3792dce8a2601ab147f3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10115-016-0988-y$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10115-016-0988-y$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>315,782,786,27931,27932,41495,42564,51326</link.rule.ids></links><search><creatorcontrib>Ren, Yazhou</creatorcontrib><creatorcontrib>Domeniconi, Carlotta</creatorcontrib><creatorcontrib>Zhang, Guoji</creatorcontrib><creatorcontrib>Yu, Guoxian</creatorcontrib><title>Weighted-object ensemble clustering: methods and analysis</title><title>Knowledge and information systems</title><addtitle>Knowl Inf Syst</addtitle><description>Ensemble clustering has attracted increasing attention in recent years. Its goal is to combine multiple base clusterings into a single consensus clustering of increased quality. Most of the existing ensemble clustering methods treat each base clustering and each object as equally important, while some approaches make use of weights associated with clusters, or to clusterings, when assembling the different base clusterings. Boosting algorithms developed for classification have led to the idea of considering weighted objects during the clustering process. However, not much effort has been put toward incorporating weighted objects into the consensus process. To fill this gap, in this paper, we propose a framework called Weighted-Object Ensemble Clustering (WOEC). We first estimate how difficult it is to cluster an object by constructing the co-association matrix that summarizes the base clustering results, and we then embed the corresponding information as weights associated with objects. We propose three different consensus techniques to leverage the weighted objects. All three reduce the ensemble clustering problem to a graph partitioning one. We experimentally demonstrate the gain in performance that our WOEC methodology achieves with respect to state-of-the-art ensemble clustering methods, as well as its stability and robustness.</description><subject>Algorithms</subject><subject>Assembling</subject><subject>Bias</subject><subject>Classification</subject><subject>Clustering</subject><subject>Clusters</subject><subject>Computer Science</subject><subject>Data Mining and Knowledge Discovery</subject><subject>Database Management</subject><subject>Experiments</subject><subject>Gain</subject><subject>Information Storage and Retrieval</subject><subject>Information systems</subject><subject>Information Systems and Communication Service</subject><subject>Information Systems Applications (incl.Internet)</subject><subject>IT in Business</subject><subject>Regular Paper</subject><subject>Robustness</subject><subject>State of the art</subject><subject>Studies</subject><issn>0219-1377</issn><issn>0219-3116</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kE1LxDAQhoMouK7-AG8FL16iM03bNN5k8QsWvCgeQ5pMd7v0Y03aw_57W7oHETwMM4fnHV4exq4R7hBA3gcExJQDZhxUnvPDCVtAjIoLxOz0eKOQ8pxdhLADQJkhLpj6omqz7cnxrtiR7SNqAzVFTZGth9CTr9rNQ9RQv-1ciEzrxjH1IVThkp2Vpg50ddxL9vn89LF65ev3l7fV45pbkaieu1wKWyROGJdS4px1JJSh0oFEKSTYIs3ScqyXFVAKqWJnKTdxBmgKTGQplux2_rv33fdAoddNFSzVtWmpG4JGBUkMqYB4RG_-oLtu8GPfkcrHHqBUMlE4U9Z3IXgq9d5XjfEHjaAnmXqWqUeZepKpD2MmnjNhPxkh_-vzv6EfvEd3Mg</recordid><startdate>20170501</startdate><enddate>20170501</enddate><creator>Ren, Yazhou</creator><creator>Domeniconi, Carlotta</creator><creator>Zhang, Guoji</creator><creator>Yu, Guoxian</creator><general>Springer London</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.0</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope></search><sort><creationdate>20170501</creationdate><title>Weighted-object ensemble clustering: methods and analysis</title><author>Ren, Yazhou ; Domeniconi, Carlotta ; Zhang, Guoji ; Yu, Guoxian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c349t-d873cb4d3ad5e4ddcde39aefd0717370cb565f0216b0f3792dce8a2601ab147f3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Algorithms</topic><topic>Assembling</topic><topic>Bias</topic><topic>Classification</topic><topic>Clustering</topic><topic>Clusters</topic><topic>Computer Science</topic><topic>Data Mining and Knowledge Discovery</topic><topic>Database Management</topic><topic>Experiments</topic><topic>Gain</topic><topic>Information Storage and Retrieval</topic><topic>Information systems</topic><topic>Information Systems and Communication Service</topic><topic>Information Systems Applications (incl.Internet)</topic><topic>IT in Business</topic><topic>Regular Paper</topic><topic>Robustness</topic><topic>State of the art</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ren, Yazhou</creatorcontrib><creatorcontrib>Domeniconi, Carlotta</creatorcontrib><creatorcontrib>Zhang, Guoji</creatorcontrib><creatorcontrib>Yu, Guoxian</creatorcontrib><collection>CrossRef</collection><collection>Global News &amp; ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems Abstracts</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</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>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Knowledge and information systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ren, Yazhou</au><au>Domeniconi, Carlotta</au><au>Zhang, Guoji</au><au>Yu, Guoxian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Weighted-object ensemble clustering: methods and analysis</atitle><jtitle>Knowledge and information systems</jtitle><stitle>Knowl Inf Syst</stitle><date>2017-05-01</date><risdate>2017</risdate><volume>51</volume><issue>2</issue><spage>661</spage><epage>689</epage><pages>661-689</pages><issn>0219-1377</issn><eissn>0219-3116</eissn><coden>KISNCR</coden><abstract>Ensemble clustering has attracted increasing attention in recent years. Its goal is to combine multiple base clusterings into a single consensus clustering of increased quality. Most of the existing ensemble clustering methods treat each base clustering and each object as equally important, while some approaches make use of weights associated with clusters, or to clusterings, when assembling the different base clusterings. Boosting algorithms developed for classification have led to the idea of considering weighted objects during the clustering process. However, not much effort has been put toward incorporating weighted objects into the consensus process. To fill this gap, in this paper, we propose a framework called Weighted-Object Ensemble Clustering (WOEC). We first estimate how difficult it is to cluster an object by constructing the co-association matrix that summarizes the base clustering results, and we then embed the corresponding information as weights associated with objects. We propose three different consensus techniques to leverage the weighted objects. All three reduce the ensemble clustering problem to a graph partitioning one. We experimentally demonstrate the gain in performance that our WOEC methodology achieves with respect to state-of-the-art ensemble clustering methods, as well as its stability and robustness.</abstract><cop>London</cop><pub>Springer London</pub><doi>10.1007/s10115-016-0988-y</doi><tpages>29</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0219-1377
ispartof Knowledge and information systems, 2017-05, Vol.51 (2), p.661-689
issn 0219-1377
0219-3116
language eng
recordid cdi_proquest_miscellaneous_1904205302
source SpringerNature Journals
subjects Algorithms
Assembling
Bias
Classification
Clustering
Clusters
Computer Science
Data Mining and Knowledge Discovery
Database Management
Experiments
Gain
Information Storage and Retrieval
Information systems
Information Systems and Communication Service
Information Systems Applications (incl.Internet)
IT in Business
Regular Paper
Robustness
State of the art
Studies
title Weighted-object ensemble clustering: methods and analysis
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-04T08%3A34%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Weighted-object%20ensemble%20clustering:%20methods%20and%20analysis&rft.jtitle=Knowledge%20and%20information%20systems&rft.au=Ren,%20Yazhou&rft.date=2017-05-01&rft.volume=51&rft.issue=2&rft.spage=661&rft.epage=689&rft.pages=661-689&rft.issn=0219-1377&rft.eissn=0219-3116&rft.coden=KISNCR&rft_id=info:doi/10.1007/s10115-016-0988-y&rft_dat=%3Cproquest_cross%3E4321684247%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1887309942&rft_id=info:pmid/&rfr_iscdi=true