- 1、本文档共10页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
A subspace co-training framework for multi-view clustering.pdf
Pattern Recognition Letters 41 (2014) 73–82
Contents lists available at ScienceDirect
Pattern Recognition Letters
journal homepage: /locate/patrec
A subspace co-training framework for multi-view clustering q
Xuran Zhao ?, Nicholas Evans, Jean-Luc Dugelay
EURECOM, Multimedia Communication Department, Campus SophiaTech, 450 Route des Chappes, 06410 Biot, France
article info
Article history: Available online 8 December 2013
Keywords: Multi-view clustering Subspace clustering Co-training
abstract
This paper addresses the problem of unsupervised clustering with multi-view data of high dimensionality. We propose a new algorithm which learns discriminative subspaces in an unsupervised fashion based upon the assumption that a reliable clustering should assign same-class samples to the same cluster in each view. The framework combines the simplicity of k-means clustering and Linear Discriminant Analysis (LDA) within a co-training scheme which exploits labels learned automatically in one view to learn discriminative subspaces in another. The effectiveness of the proposed algorithm is demonstrated empirically under scenarios where the conditional independence assumption is either fully satis?ed (audio-visual speaker clustering) or only partially satis?ed (handwritten digit clustering and document clustering). Signi?cant improvements over alternative multi-view clustering approaches are reported in both cases. The new algorithm is ?exible and can be readily adapted to use different distance measures, semi-supervised learning, and non-linear problems.
ó 2013 Elsevier B.V. All rights reserved.
1. Introduction
The recent explosion of multimedia information on the Internet demands effective clustering techniques capable of handling huge quantities of potentially complex data. First, multimedia data are generally represented in high-dimensional spaces in which the so-called curse-of-dimensionality makes the application of many clustering techniques somewhat troublesome. Second, by i
您可能关注的文档
- A compact internal drum test rig for measurements of rolling contact forces between a single tread block and a substrate.pdf
- A compact system to extract topography information from scenes viewed by a miniaturized submersible explorer.pdf
- A comparative study of Mg and Pt contacts on semi-insulating GaAs Electrical and XPS characterization.pdf
- A computational stochastic multiscale methodology for MEMS structures involving adhesive contact.pdf
- A computerized method for loaded tooth contact analysis of high-contact-ratio spur gears with or without flank modification considering tip corner contact and shaft misalignment.pdf
- A contact smoothing method for arbitrary surface meshes using Nagata patches.pdf
- A continuum theory of soils Viewed as peculiar immiscible mixtures.pdf
- A corrective solution for finding the effects of edge-rounding on complete contact between elastically similar bodies. Part I Contact law and normal contact considerations.pdf
- A corrective solution for finding the effects of edge-rounding on complete contact between elastically similar bodies. Part II Near-edge asymptotes and the effect of shear.pdf
- A coupled FEMDEM model for pipe conveyor systems Analysis of the contact forces on belt.pdf
文档评论(0)