Journal article · 2026 · Open access

Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering

Liangchen Hu, Yongkang Zhou, Yiwei Zhu, Zhenlei Dai, Zhenghua Chen, Yonglong Luo, Biao Jie, Wensheng Zhang

IEEE Transactions on Neural Networks and Learning Systems, PP, 1–15 · Published 12 November 2026 · DOI 10.1109/tnnls.2026.3749246

Open full textCite this paper

In brief

“Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering” is a 2026 journal article by Liangchen Hu and 7 co-authors, published in IEEE Transactions on Neural Networks and Learning Systems. OpenAlex counts 0 citations as of 18 November 2026. It is open access under a CC BY licence: the full text is free to read at IEEE Transactions on Neural Networks and Learning Systems.

Citations
0
Authors
8

Abstract

Practical data scenarios usually produce dynamic multiview data, such as user behaviors and sensor signals. Conventional clustering methods have two key defects. First, they need full recomputation for data updates, which reduces computational efficiency. Second, existing incremental methods separate view information fusion from discrete label generation, thus causing continuous error accumulation. To solve the above problems, this article proposes an incremental ultiview discrete spectral clustering (IMDSC) method. IMDSC builds a unified framework to jointly optimize dynamic consensus affinity graph construction, spectral embedding learning, and cluster label prediction, and it can adapt to evolving data and maintain stable clustering performance. Specifically, IMDSC adopts a weighted fusion strategy to build a consensus affinity matrix based on cross-temporal spectral embeddings, and it also preserves the geometric structure of the embedding space via graph regularization. To suppress the embedding space drift in incremental learning, this method introduces an orthogonal rotation matrix. This matrix aligns final spectral embeddings with discrete cluster indicators and eliminates the extra errors brought by the traditional $K$ -means postprocessing step in spectral clustering. Comparative experiments on multiple public benchmark datasets verify that the proposed IMDSC outperforms state-of-the-art methods in both clustering accuracy and computational efficiency.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Hu, L., Zhou, Y., Zhu, Y., Dai, Z., Chen, Z., Luo, Y., Jie, B., & Zhang, W. (2026). Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering. IEEE Transactions on Neural Networks and Learning Systems, PP, 1–15. https://doi.org/10.1109/tnnls.2026.3749246

MLA 9

Hu, Liangchen, et al. “Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering.” IEEE Transactions on Neural Networks and Learning Systems, vol. PP, 2026, pp. 1–15. https://doi.org/10.1109/tnnls.2026.3749246.

Chicago

Hu, Liangchen, Yongkang Zhou, Yiwei Zhu, Zhenlei Dai, Zhenghua Chen, Yonglong Luo, Biao Jie, and Wensheng Zhang. 2026. “Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering.” IEEE Transactions on Neural Networks and Learning Systems PP: 1–15. https://doi.org/10.1109/tnnls.2026.3749246.

Harvard

Hu, L. et al. (2026) ‘Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering’, IEEE Transactions on Neural Networks and Learning Systems, PP, pp. 1–15. doi:10.1109/tnnls.2026.3749246.

IEEE

L. Hu et al., “Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering,” IEEE Transactions on Neural Networks and Learning Systems, vol. PP, pp. 1–15, 2026, doi: 10.1109/tnnls.2026.3749246.

BibTeX

@article{hu2026learning,
  title     = {{Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering}},
  author    = {Hu, Liangchen and Zhou, Yongkang and Zhu, Yiwei and Dai, Zhenlei and Chen, Zhenghua and Luo, Yonglong and Jie, Biao and Zhang, Wensheng},
  journal   = {IEEE Transactions on Neural Networks and Learning Systems},
  year      = {2026},
  volume    = {PP},
  pages     = {1--15},
  doi       = {10.1109/tnnls.2026.3749246},
  url       = {https://doi.org/10.1109/tnnls.2026.3749246}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research

  • incremental clustering
  • multi-view clustering
  • dynamic data
  • graph regularization

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Hu, L., Zhou, Y., Zhu, Y., Dai, Z., Chen, Z., Luo, Y., Jie, B., & Zhang, W. (2026). Learning Consensus Graph From Cross-Temporal Spectral Embeddings for Incremental Multiview One-Step Discrete Clustering. IEEE Transactions on Neural Networks and Learning Systems, PP, 1–15. https://doi.org/10.1109/tnnls.2026.3749246

How many times has this paper been cited?

0 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at IEEE Transactions on Neural Networks and Learning Systems: sign in and open the full text from this page.

Who wrote this paper?

Liangchen Hu, Yongkang Zhou, Yiwei Zhu, Zhenlei Dai, Zhenghua Chen, Yonglong Luo, Biao Jie, Wensheng Zhang.

What is the DOI of this paper?

10.1109/tnnls.2026.3749246, permanently at https://doi.org/10.1109/tnnls.2026.3749246. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.