During the last decades, learning a low-dimensional space with discriminative information for dimension reduction (DR) has gained a surge of interest. However, it's not accessible for these DR methods to achieve satisfactory performance when facing the features from multiple views. In multi-view learning problems, one instance can be represented by multiple heterogeneous features, which are highly related but sometimes look different from each other. In addition, correlations between features from multiple views always vary greatly, which challenges the capability of multi-view learning methods. Consequently, constructing a multi-view learning framework with generalization and scalability, which could take advantage of multi-view information as much as possible, is extremely necessary but challenging. To implement the above target, this paper proposes a novel multi-view learning framework based on similarity consensus, which makes full use of correlations among multi-view features while considering the scalability and robustness of the framework. It aims to straightforwardly extend those existing DR methods into multi-view learning domain by preserving the similarity between different views to capture the low-dimensional embedding. Two schemes based on pairwise-consensus and centroid-consensus are separately proposed to force multiple views to learn from each other and then an iterative alternating strategy is developed to obtain the optimal solution. The proposed method is evaluated on 5 benchmark datasets and comprehensive experiments show that our proposed multi-view framework can yield comparable and promising performance with previous approaches proposed in recent literatures.
Graph Similarity Regularized Softmax for Semi-Supervised Node Classification
School of Mathematics and Physics, North China Electric Power University(华北电力大学数理学院);School of Mathematical Sciences, Beijing Normal University(北京师范大学数学科学学院)
Robust Hashing for Multi-View Data: Jointly Learning Low-Rank Kernelized Similarity Consensus and Hash Functions
The University of Adelaide(阿德莱德大学);The University of New South Wales(新南威尔士大学)
学习散列函数/代码用于多视图数据的相似性搜索正吸引越来越多的关注,其中相似的散列代码被分配给表征跨视图的一致邻域关系的数据对象。这类传统方法存在三个固有的局限性:1)它们通常采用两阶段方案,首先构造相似性矩阵,然后是随后的哈希函数学习; 2)这些方法通常是在假设具有多种表示的数据样本是无噪声的基础上开发的,这在实际应用中是不切实际的; 3)由于使用数据库($O(N)$)中的所有$N$点构建邻域图,往往会导致训练模型繁琐。在本文中,我们激发的问题,联合和有效地训练强大的哈希函数的数据对象与多特征表示,可能是噪声破坏。为了实现鲁棒性和训练效率,我们提出了一种有效和高效地学习低秩核化\footnote{We use kernelized similarity rather than kernel, as it is not a squared symmetric matrix for data-landmark affinity matrix.}散列函数的方法。具体地说,我们利用地标图来构造易处理的多视图相似性矩阵,以自动发现数据中的邻域结构。为了学习鲁棒的哈希函数,使用潜在的低秩核函数来构造哈希函数,以适应线性不可分的数据。特别是,潜在的核相似性矩阵恢复多个基于核的相似性矩阵的秩最小化。在真实世界的多视图数据集上进行的大量实验验证了我们的方法在存在错误损坏的情况下的有效性。
C$^{2}$IMUFS: Complementary and Consensus Learning-based Incomplete Multi-view Unsupervised Feature Selection
Southwestern University of Finance and Economics(西南财经大学);JD Intelligent Cities Research(京东智能城市研究院);JD Intelligent Cities Business Unit(京东智能城市事业部);University of Central Florida(中佛罗里达大学);Southwest Jiaotong University(西南交通大学)
Detection of Alzheimer's Disease Using Graph-Regularized Convolutional Neural Network Based on Structural Similarity Learning of Brain Magnetic Resonance Images
Lakehead University(湖首大学);University of Calgary(卡尔加里大学)
Semi-supervised Learning with Regularized Laplacian
Inria(法国国家信息与自动化研究所);Trapeznikov Institute of Control Sciences of the Russian Academy of Sciences(俄罗斯科学院特拉佩兹尼科夫控制科学研究所);St. Petersburg State University(圣彼得堡国立大学)
Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering
The University of New South Wales(新南威尔士大学);The University of Adelaide(阿德莱德大学);Australian Centre for Robotic Vision(澳大利亚机器人视觉中心);The University of Melbourne(墨尔本大学);University of Technology Sydney(悉尼科技大学)
Structure-aware Hybrid-order Similarity Learning for Multi-view Unsupervised Feature Selection
Joint Laboratory of Data Science and Business Intelligence, School of Statistics and Data Science, Southwestern University of Finance and Economics(数据科学与商务智能联合实验室,统计与数据科学学院,西南财经大学);Big Data Laboratory on Financial Security and Behavior, SWUFE (Laboratory of Philosophy and Social Sciences, Ministry of Education)(金融安全与行为大数据实验室,SWUFE(哲学社会科学实验室,教育部));Department of Electrical Engineering and Computer Science, University of Kansas(电气与计算机工程系,堪萨斯大学);School of Computing and Artificial Intelligence, Southwest Jiaotong University(计算与人工智能学院,西南交通大学)
Grasping the Finer Point: A Supervised Similarity Network for Metaphor Detection
Computer Laboratory, University of Cambridge(剑桥大学计算机实验室);Facebook AI Research(Facebook人工智能研究院);The ALTA Institute, University of Cambridge(剑桥大学ALTA研究所)
Similarity-Based Bike Station Expansion via Hybrid Denoising Autoencoders
Department of Engineering Cybernetics Norwegian University of Science(工程 cybernetics 系 Norwegian 科学大学);Department of Architecture(建筑系);Planning Norwegian University of Science(规划 Norwegian 科学大学)
Implicitly Normalized Online PCA: A Regularized Algorithm with Exact High-Dimensional Dynamics
Machine Learning and Information Processing Group, KUIS AI Center(机器学习与信息处理组,KUIS人工智能中心);Department of Electrical and Electronics Engineering(电子与电气工程系)
Local Sample-weighted Multiple Kernel Clustering with Consensus Discriminative Graph
National University of Defense Technology(国防科技大学);Hunan University(湖南大学);Supercomputing and Cloud Computing Institute(超级计算与云计算研究院);State University of New York, New Paltz(纽约州立大学新帕尔茨分校)
Harbin Institute of Technology at Shenzhen(哈尔滨工业大学(深圳));Southern University of Science and Technology(南方科技大学);Shenzhen University(深圳大学);Peng Cheng Laboratory(鹏城实验室)
Regularized Latent Dynamics Prediction is a Strong Baseline For Behavioral Foundation Models
Department of Computing Science, University of Alberta, Canada(阿尔伯塔大学计算机科学系);Alberta Machine Intelligence Institute (Amii)(阿尔伯塔机器智能研究所);Canada CIFAR AI Chair(加拿大CIFAR人工智能 chair);The University of Texas at Austin(德克萨斯大学奥斯汀分校);University of Massachusetts Amherst(马萨诸塞大学阿姆赫斯特分校)