Related Experiment Video
Updated: Sep 19, 2025

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
Published on: February 15, 2017
Incomplete multi-view clustering via efficient anchor tensor recovery framework
Jintian Ji1, Songhe Feng1, Jie Huang2
1School of Computer Science and Technology, Beijing Jiaotong University, Beijing, 100044, China; Key Laboratory of Big Data & Artificial Intelligence in Transportation, Ministry of Education, Beijing Jiaotong University, Beijing, 100044, China.
Abstract:
Tensor-based Incomplete Multi-view Clustering (TIMC) methods have received widespread attention due to the powerful data recovery capability of capturing cross-view high-order correlation. Although such methods have achieved remarkable progress, they still suffer from the following problems: (1) The extremely high computational complexity makes it hard for tensor-based methods to handle large-scale multi-view data. (2) Geometric structure constraints in the sample space often lead to high computational complexity and redundancy of structural information. (3) The commonly used Tensor Nuclear Norm (TNN) over-penalizes the primary rank components, leading to a sub-optimal representation tensor. Being aware of these, we propose Incomplete Multi-View Clustering with Efficient Anchor Tensor Recovery Framework (EATER). Specifically, it learns a group of anchors to construct a low-rank anchor tensor to recover the missing data with the high-order correlation among views and the geometric structure in the learned representation tensor is enhanced by an Anchor Laplacian Regularization (ALR). Moreover, instead of employing TNN, we adopt a tighter Non-convex Tensor Rank (NTR) to capture the multi-view high-order correlation effectively. An efficient iterative optimization algorithm is designed to solve the EATER, which is time-economical and enjoys favorable convergence. Extensive experimental results on various datasets demonstrate the superiority of the proposed algorithm as compared to state-of-the-art methods.
Related Concept Videos
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Anchoring Junctions
The Anchoring-and-Adjustment Heuristic
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Multicompartment Models: Overview
These models offer a more comprehensive representation of drug behavior in the body than one-compartment models. They accommodate the complexity of drug distribution,...
Vector Algebra: Method of Components
In many applications, the magnitudes and directions of...

