4.7 Article

Self-Weighted Clustering With Adaptive Neighbors

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TNNLS.2019.2944565

关键词

Data models; Adaptation models; Covariance matrices; Kernel; Laplace equations; Learning systems; Support vector machines; Adaptive neighbors; block-diagonal similarity matrix; clustering; weighted features

资金

  1. National Key Research and Development Program of China [2018AAA0101902]
  2. National Natural Science Foundation of China [61936014, 61772427, 61751202]
  3. Fundamental Research Funds for the Central Universities [G2019KY0501]

向作者/读者索取更多资源

Many modern clustering models can be divided into two separated steps, i.e., constructing a similarity graph (SG) upon samples and partitioning each sample into the corresponding cluster based on SG. Therefore, learning a reasonable SG has become a hot issue in the clustering field. Many previous works that focus on constructing better SG have been proposed. However, most of them follow an ideal assumption that the importance of different features is equal, which is not adapted in practical applications. To alleviate this problem, this article proposes a self-weighted clustering with adaptive neighbors (SWCAN) model that can assign weights for different features, learn an SG, and partition samples into clusters simultaneously. In experiments, we observe that the SWCAN can assign weights for different features reasonably and outperform than comparison clustering models on synthetic and practical data sets.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Computer Science, Artificial Intelligence

Graph-Based Soft-Balanced Fuzzy Clustering

Chaodie Liu, Feiping Nie, Rong Wang, Xuelong Li

Summary: Spectral clustering has gained increasing attention for its well-defined mathematical frameworks and superior performance. However, there are still two limitations to be solved: the unpredictable deviation in clustering results and the lack of interpretability for data points in the boundary area. To address these challenges, a graph-based soft-balanced fuzzy clustering (GBFC) model is proposed. It explicitly preserves the nonnegative property of the clustering indicator matrix and imposes row normalization on it. Additionally, a novel balanced constraint is designed to regularize the clustering results and constrain the cluster size.

IEEE TRANSACTIONS ON FUZZY SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

An Effective and Efficient Algorithm for K-Means Clustering With New Formulation

Feiping Nie, Ziheng Li, Rong Wang, Xuelong Li

Summary: K-means is a simple and popular clustering algorithm, widely used in machine learning research. It aims to find cluster centers and minimize the squared distances between samples and their nearest centers. In this paper, a novel K-means algorithm is proposed, which reformulates the objective function and introduces an efficient iterative re-weighted algorithm for optimization. The algorithm shows faster convergence rate compared to the Lloyd's algorithm, while maintaining the same computational complexity. Experimental results on benchmark datasets demonstrate the effectiveness and efficiency of the proposed algorithm.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2023)

Article Computer Science, Artificial Intelligence

A Differentiable Perspective for Multi-View Spectral Clustering With Flexible Extension

Zhoumin Lu, Feiping Nie, Rong Wang, Xuelong Li

Summary: Multi-view clustering aims to discover common patterns from multi-source data, utilizing the data-driven nature and larger search space of deep learning methods. However, deep learning methods lack interpretability compared to traditional methods that have more stability in optimization. This paper proposes a multi-view spectral clustering model that combines the advantages of both traditional and deep learning methods, achieving better performance in multi-view clustering and semi-supervised classification tasks while maintaining interpretability and stability.

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE (2023)

Article Computer Science, Artificial Intelligence

Joint Learning of Anchor Graph-Based Fuzzy Spectral Embedding and Fuzzy K-Means

Jianyong Zhu, Wenjie Zhao, Hui Yang, Feiping Nie

Summary: This article introduces an innovative spectral embedding method, AFSEFK, which combines the learning of anchor graph-based fuzzy spectral embedding model and fuzzy K-means. It optimizes the membership relationships and learns the local and global structures in the data simultaneously. The article also proposes a method to enhance the quality of similarity graphs and clustering performance.

IEEE TRANSACTIONS ON FUZZY SYSTEMS (2023)

Article Automation & Control Systems

Joint EEG Feature Transfer and Semisupervised Cross-Subject Emotion Recognition

Yong Peng, Honggang Liu, Wanzeng Kong, Feiping Nie, Bao-Liang Lu, Andrzej Cichocki

Summary: In this article, a joint EEG feature transfer and semi-supervised cross-subject emotion recognition model is proposed to enhance emotion recognition performance by optimizing the shared subspace projection matrix and target label. The spatial-frequency activation patterns of critical EEG frequency bands and brain regions in cross-subject emotion expression are quantitatively identified by analyzing the learned shared subspace.

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS (2023)

Article Computer Science, Artificial Intelligence

Rank-r Discrete Matrix Factorization for Anchor Graph Clustering

Jingjing Xue, Feiping Nie, Rong Wang, Xuelong Li

Summary: This paper presents a novel graph clustering model called Rank-$r$r Discrete Matrix Factorization (DMF-RR), which has linear time complexity and can directly obtain discrete solutions without post-processing. By constraining the factor matrices to be indicator matrices, DMF-RR captures the clustering structure and utilizes an anchor graph. Extensive experiments demonstrate the superiority of DMF-RR.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2023)

Article Computer Science, Artificial Intelligence

Discriminative Projected Clustering via Unsupervised LDA

Feiping Nie, Xia Dong, Zhanxuan Hu, Rong Wang, Xuelong Li

Summary: This work proposes a parameter-free clustering model called discriminative projected clustering (DPC) for low-dimensional and discriminative projection learning and clustering. The connection between DPC and linear discriminant analysis (LDA) is theoretically analyzed, and experiments demonstrate the effectiveness and efficiency of DPC in real-world applications.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Discrete Robust Principal Component Analysis via Binary Weights Self-Learning

Feiping Nie, Sisi Wang, Zheng Wang, Rong Wang, Xuelong Li

Summary: Principal component analysis (PCA) is unable to overcome the influence of outliers. Existing robust PCA methods have limitations and a new discrete robust PCA algorithm is proposed to eliminate the influence of outliers completely and improve anomaly detection capability.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Multitask Learning for Classification Problem via New Tight Relaxation of Rank Minimization

Wei Chang, Feiping Nie, Yijie Zhi, Rong Wang, Xuelong Li

Summary: Multitask learning is a joint learning paradigm that combines multiple related tasks to improve performance. It has been observed that different tasks share a low-dimensional common subspace. To approximate the rank minimization problem, two regularization-based models are proposed to minimize the k minimal singular values. Compared to the standard trace norm, these models provide tighter approximations and better capture the low-dimensional subspace among multiple tasks.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Effective Clustering via Structured Graph Learning

Danyang Wu, Feiping Nie, Jitao Lu, Rong Wang, Xuelong Li

Summary: This paper proposes a structured graph learning (SGL) framework to improve clustering stability. SGL adaptively learns a structured affinity graph that contains exact k connected components, allowing clustering assignments to be directly obtained based on the graph connectivity. The simultaneous construction of the graph and structured graph learning effectively alleviates the mismatch problem, and an efficient algorithm is proposed to solve the optimization problems involved. Numerical experiments on synthetic and real datasets demonstrate the effectiveness of the proposed methods.

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING (2023)

Article Computer Science, Artificial Intelligence

Multi-View and Multi-Order Structured Graph Learning

Rong Wang, Penglei Wang, Danyang Wu, Zhensheng Sun, Feiping Nie, Xuelong Li

Summary: Recently, graph-based multi-view clustering (GMC) has attracted attention for achieving promising performance. However, existing SGL methods suffer from sparse graphs lacking useful information. To address this, we propose the M(2)SGL model, introducing multiple different order graphs into the SGL procedure. The model outperforms state-of-the-art benchmarks in empirical results.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Efficient Discrete Clustering With Anchor Graph

Jingyu Wang, Zhenyu Ma, Feiping Nie, Xuelong Li

Summary: This paper introduces a simple and fast method called Efficient Discrete Clustering with Anchor Graph (EDCAG) to address the efficiency and accuracy issues of spectral clustering on large-scale data. The method uses sparse anchors to accelerate graph construction and designs an intraclass similarity maximization model to handle anchor graph cut problems and exploit more explicit data structures. It also employs a fast coordinate rising algorithm to optimize discrete labels of samples and anchors. Experimental results demonstrate the rapidity and competitive clustering effect of EDCAG.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Computer Science, Artificial Intelligence

Double-Structured Sparsity Guided Flexible Embedding Learning for Unsupervised Feature Selection

Yu Guo, Yuan Sun, Zheng Wang, Feiping Nie, Fei Wang

Summary: In this article, a novel unsupervised feature selection model, DSFEL, is proposed. DSFEL includes a module for learning a block-diagonal structural sparse graph to represent the clustering structure and another module for learning a completely row-sparse projection matrix using the l(2,0)-norm constraint to select distinctive features. Experimental results on nine real-world datasets demonstrate that the proposed method outperforms existing state-of-the-art unsupervised feature selection methods.

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS (2023)

Article Automation & Control Systems

Sparse Trace Ratio LDA for Supervised Feature Selection

Zhengxin Li, Feiping Nie, Danyang Wu, Zheng Wang, Xuelong Li

Summary: Classification is a fundamental task in data mining, but high-dimensional data can degrade classification performance. To solve this problem, dimensionality reduction, including feature extraction and feature selection, is usually adopted. In this study, we propose a supervised feature selection method that combines the discriminative power of linear discriminant analysis (LDA) with the advantages of feature selection. This method uses trace ratio LDA with p-norm regularization and imposes an orthogonal constraint on the projection matrix. Experimental results on synthetic and real-world datasets demonstrate the effectiveness of the proposed method.

IEEE TRANSACTIONS ON CYBERNETICS (2023)

Article Geochemistry & Geophysics

Fuzzy C-Multiple-Means Clustering for Hyperspectral Image

Xiaojun Yang, Mingjun Zhu, Bo Sun, Zheng Wang, Feiping Nie

Summary: Currently, unsupervised hyperspectral image segmentation methods face challenges due to noise and anomalies in the data. To address this, this letter proposes a method called fuzzy C-multiple-means (FCMM), which divides data points into multiple subclusters and defines c clusters. Unlike traditional clustering algorithms, FCMM uses an optimization problem for the fuzzy affiliation matrix and an alternating iterative update method to enhance robustness and reduce the effect of outliers in the datasets. Experiments on several HSI datasets validate the effectiveness of FCMM.

IEEE GEOSCIENCE AND REMOTE SENSING LETTERS (2023)

暂无数据