Weighted semi-supervised manifold clustering via sparse representation

Amir Abedi, R. Monsefi, Davood Zabih Zadeh
{"title":"Weighted semi-supervised manifold clustering via sparse representation","authors":"Amir Abedi, R. Monsefi, Davood Zabih Zadeh","doi":"10.1109/ICCKE.2016.7802146","DOIUrl":null,"url":null,"abstract":"over the last few years, manifold clustering has attracted considerable interest in high-dimensional data clustering. However achieving accurate clustering results that match user desires and data structure is still an open problem. One way to do so is incorporating additional information that indicate relation between data objects. In this paper we propose a method for constrained clustering that take advantage of pairwise constraints. It first solves an optimization program to construct an affinity matrix according to pairwise constraints and manifold structure of data, then applies spectral clustering to find data clusters. Experiments demonstrated that our algorithm outperforms other related algorithms in face image datasets and has comparable results on hand-written digit datasets.","PeriodicalId":205768,"journal":{"name":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"203 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 6th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE.2016.7802146","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

over the last few years, manifold clustering has attracted considerable interest in high-dimensional data clustering. However achieving accurate clustering results that match user desires and data structure is still an open problem. One way to do so is incorporating additional information that indicate relation between data objects. In this paper we propose a method for constrained clustering that take advantage of pairwise constraints. It first solves an optimization program to construct an affinity matrix according to pairwise constraints and manifold structure of data, then applies spectral clustering to find data clusters. Experiments demonstrated that our algorithm outperforms other related algorithms in face image datasets and has comparable results on hand-written digit datasets.
基于稀疏表示的加权半监督流形聚类
在过去的几年中,流形聚类引起了人们对高维数据聚类的极大兴趣。然而,如何获得符合用户需求和数据结构的准确聚类结果仍然是一个悬而未决的问题。这样做的一种方法是合并指示数据对象之间关系的附加信息。本文提出了一种利用成对约束的约束聚类方法。该方法首先根据数据的两两约束和流形结构,求解一个优化程序来构造亲和矩阵,然后应用谱聚类方法寻找数据聚类。实验表明,我们的算法在人脸图像数据集上优于其他相关算法,在手写数字数据集上也有相当的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信