MCExplorer: Interactive Exploration of Multiple (Subspace) Clustering Solutions

Stephan Günnemann, Hardy Kremer, Ines Färber, T. Seidl
{"title":"MCExplorer: Interactive Exploration of Multiple (Subspace) Clustering Solutions","authors":"Stephan Günnemann, Hardy Kremer, Ines Färber, T. Seidl","doi":"10.1109/ICDMW.2010.29","DOIUrl":null,"url":null,"abstract":"Large amounts of data are ubiquitous today. Data mining methods like clustering were introduced to gain knowledge from these data. Recently, detection of multiple clusterings has become an active research area, where several alternative clustering solutions are generated for a single dataset. Each of the obtained clustering solutions is valid, of importance, and provides a different interpretation of the data. The key for knowledge extraction, however, is to learn how the different solutions are related to each other. This can be achieved by a comparison and analysis of the obtained clustering solutions. We introduce our demo MCExplorer, the first tool that allows for interactive exploration, browsing, and visualization of multiple clustering solutions on several granularities. MCExplorer is applicable to the output of both fullspace and subspace clustering approaches.","PeriodicalId":170201,"journal":{"name":"2010 IEEE International Conference on Data Mining Workshops","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Data Mining Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDMW.2010.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Large amounts of data are ubiquitous today. Data mining methods like clustering were introduced to gain knowledge from these data. Recently, detection of multiple clusterings has become an active research area, where several alternative clustering solutions are generated for a single dataset. Each of the obtained clustering solutions is valid, of importance, and provides a different interpretation of the data. The key for knowledge extraction, however, is to learn how the different solutions are related to each other. This can be achieved by a comparison and analysis of the obtained clustering solutions. We introduce our demo MCExplorer, the first tool that allows for interactive exploration, browsing, and visualization of multiple clustering solutions on several granularities. MCExplorer is applicable to the output of both fullspace and subspace clustering approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多(子空间)聚类解决方案的交互式探索
如今,大量的数据无处不在。引入了聚类等数据挖掘方法来从这些数据中获取知识。近年来,多聚类的检测已成为一个活跃的研究领域,其中针对单个数据集生成了几种不同的聚类解决方案。得到的每个聚类解决方案都是有效的、重要的,并提供了对数据的不同解释。然而,知识提取的关键是了解不同的解决方案是如何相互关联的。这可以通过比较和分析得到的聚类解决方案来实现。我们将介绍我们的演示MCExplorer,这是第一个允许对多个粒度的多个集群解决方案进行交互式探索、浏览和可视化的工具。MCExplorer适用于全空间和子空间聚类方法的输出。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Quantum Path Integral Inspired Query Sequence Suggestion for User Search Task Simplification PTCR-Miner: Progressive Temporal Class Rule Mining for Multivariate Temporal Data Classification Bridging Folksonomies and Domain Ontologies: Getting Out Non-taxonomic Relations SIMPLE: Interactive Analytics on Patent Data Parallel EM-Clustering: Fast Convergence by Asynchronous Model Updates
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1