Weighted Multi-View Data Clustering via Joint Non-Negative Matrix Factorization

G. Khan, Jie Hu, Tianrui Li, Bassoma Diallo, Qianqian Huang
{"title":"Weighted Multi-View Data Clustering via Joint Non-Negative Matrix Factorization","authors":"G. Khan, Jie Hu, Tianrui Li, Bassoma Diallo, Qianqian Huang","doi":"10.1109/ISKE47853.2019.9170204","DOIUrl":null,"url":null,"abstract":"In recent years, datasets which exist in present world are comprising of various representations of the data or in multiview environment, which frequently give the important data to each other. Multi-view clustering based on Non-negative matrix factorization (NMF) has turned to be a very hot direction of research in the field of Pattern Reognition, Machine Learning (ML), and data mining. and data mining due to unsupervised confuse information of Numerous Views. The main problem of employing NMF to multi-view clustering is how to define the factorizations to give significant and commensurate clustering solutions. Specially, multi-view clustering based NMF has achieved extensive attention due to its dimensionality reduction property. Existing methods based on NMF barely produced meaningful clustering solution from heterogeneous numerous views due to their complementary behaviors. To address this issue, we design a innovative NMF technique based Multiview clustering approach, which gives the more meaningful and compatible clustering solution over Numerous Views. The main outcome of the work, is to a design combined NMF method with view weight and constraint co-efficient which will bring the clustering solution to a common point for each view. The effectiveness of propose method is validated by conducting the experiments on real-world datasets.","PeriodicalId":399084,"journal":{"name":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 14th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE47853.2019.9170204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

In recent years, datasets which exist in present world are comprising of various representations of the data or in multiview environment, which frequently give the important data to each other. Multi-view clustering based on Non-negative matrix factorization (NMF) has turned to be a very hot direction of research in the field of Pattern Reognition, Machine Learning (ML), and data mining. and data mining due to unsupervised confuse information of Numerous Views. The main problem of employing NMF to multi-view clustering is how to define the factorizations to give significant and commensurate clustering solutions. Specially, multi-view clustering based NMF has achieved extensive attention due to its dimensionality reduction property. Existing methods based on NMF barely produced meaningful clustering solution from heterogeneous numerous views due to their complementary behaviors. To address this issue, we design a innovative NMF technique based Multiview clustering approach, which gives the more meaningful and compatible clustering solution over Numerous Views. The main outcome of the work, is to a design combined NMF method with view weight and constraint co-efficient which will bring the clustering solution to a common point for each view. The effectiveness of propose method is validated by conducting the experiments on real-world datasets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
联合非负矩阵分解加权多视图数据聚类
近年来,目前世界上存在的数据集是由数据的各种表示形式或多视图环境组成的,它们经常相互提供重要的数据。基于非负矩阵分解(NMF)的多视图聚类已经成为模式识别、机器学习和数据挖掘领域的一个非常热门的研究方向。由于无数视图的无监督混淆信息而进行数据挖掘。将NMF应用于多视图聚类的主要问题是如何定义分解,从而给出有效的、相称的聚类解。特别是基于多视图聚类的NMF由于其降维特性而受到广泛关注。现有的基于NMF的聚类方法由于具有互补性,难以从异构多视图中得到有意义的聚类解。为了解决这个问题,我们设计了一种创新的基于NMF技术的多视图聚类方法,该方法在众多视图上提供了更有意义和兼容的聚类解决方案。本文的主要成果是设计了一种结合视图权值和约束系数的NMF方法,使每个视图的聚类解达到一个公共点。在实际数据集上进行了实验,验证了该方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Incremental Learning for Transductive SVMs ISKE 2019 Table of Contents Consensus: The Minimum Cost Model based Robust Optimization A Learned Clause Deletion Strategy Based on Distance Ratio Effects of Real Estate Regulation Policy of Beijing Based on Discrete Dependent Variables Model
×
引用
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