0


多子空间表示和发现

Multi-Subspace Representation and Discovery
课程网址: http://videolectures.net/ecmlpkdd2011_ding_subspace/  
主讲教师: Chris Ding
开课单位: 德克萨斯大学
开课时间: 2011-11-30
课程语种: 英语
中文简介:
本文提出了多子空间发现问题,并提供了一种理论解决方案,可以保证同时恢复子空间的数量,每个子空间的维数以及每个子空间的数据点成员。我们进一步提出了一种数据表示模型来处理有噪声的现实世界数据。我们开发了一种新颖的优化方法来学习所提出的模型,该模型可以保证收敛到全局优化器。作为我们模型的应用,我们首先将我们的解决方案应用于一系列机器学习问题中的预处理,包括聚类,分类和半监督学习。我们发现我们的方法自动获得稳健的数据表示,保留了高维数据的仿射子空间结构,并在学习任务中生成更准确的结果。我们还建立了一个强大的独立分类器,它直接利用我们的稀疏和低秩表示模型。实验结果表明,我们的方法通过预处理提高了数据质量,独立分类器优于某些最先进的学习方法。
课程简介: This paper presents the multi-subspace discovery problem and provides a theoretical solution which is guaranteed to recover the number of subspaces, the dimensions of each subspace, and the members of data points of each subspace simultaneously. We further propose a data representation model to handle noisy real world data. We develop a novel optimization approach to learn the presented model which is guaranteed to converge to global optimizers. As applications of our models, we first apply our solutions as preprocessing in a series of machine learning problems, including clustering, classification, and semisupervised learning. We found that our method automatically obtains robust data presentation which preserves the affine subspace structures of high dimensional data and generate more accurate results in the learning tasks. We also establish a robust standalone classifier which directly utilizes our sparse and low rank representation model. Experimental results indicate our methods improve the quality of data by preprocessing and the standalone classifier outperforms some state-of-the-art learning approaches.
关 键 词: 多子空间; 数据点; 全局优化器
课程来源: 视频讲座网
最后编审: 2020-07-31:yumf
阅读次数: 75