Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Kangyue Zheng

dblp:429/9958 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Environmental and earth informatics · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › clustering › prototype-based clustering
anchor-based clustering
1.012026
Efficient Tensorized Multi-View Anchor Graph Clustering with Affinity Propagation for Remote Sensing Data · AAAI 2026
Data mining › clustering
graph clustering
1.012026
Efficient Tensorized Multi-View Anchor Graph Clustering with Affinity Propagation for Remote Sensing Data · AAAI 2026
Data mining › clustering
multi-view clustering
1.012026
Efficient Tensorized Multi-View Anchor Graph Clustering with Affinity Propagation for Remote Sensing Data · AAAI 2026
Environmental and earth informatics
remote sensing
0.312026
Efficient Tensorized Multi-View Anchor Graph Clustering with Affinity Propagation for Remote Sensing Data · AAAI 2026

Methods — techniques the papers use, named apart from their topics

tensor schatten p-norm · 2.0alternating optimization · 2.0affinity propagation · 2.0
YearPublicationVenuePosition
2026 Efficient Tensorized Multi-View Anchor Graph Clustering with Affinity Propagation for Remote Sensing Data
abstract
Multi-view clustering of remote sensing data presents significant challenges, as it integrates diverse data representations to improve Earth observation. Although existing anchor graph-based methods have yielded promising results, they generally exhibit two key limitations: (1) the time-consuming process of directly exploring pixel clustering structures, and (2) insufficient modeling of high-order correlations among different views. To address these issues, we propose an Efficient Tensorized multi-view anchor graph clustering method with Affinity Propagation (ETAP) for remote sensing data. Based on superpixel preprocessing, anchor graphs are learned from view-specific pixels and anchors, while compressed anchor graphs are simultaneously learned from the view-specific anchors. An adaptive weighting scheme is introduced to facilitate the learning of these anchor graphs. To capture high-order correlations, tensor Schatten p-norm regularization is applied to the compressed anchor graphs. A connectivity constraint is introduced to uncover the clustering structures of anchors. Finally, pixel clustering structures are then efficiently revealed from the pseudo-labeled anchors through affinity propagation without requiring additional clustering steps. To solve the proposed formulation, we develop an alternating optimization algorithm. Extensive experiments on three public datasets demonstrate the efficacy and efficiency of the proposed method over state-of-the-art methods.
Yongshan Zhang, Kangyue Zheng, Shuaikang Yan, Xinxin Wang 0003, Zhihua Cai
AAAI2