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

Xingyu Xue

dblp:224/4078 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · conflict

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 2 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 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
2 papers
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
1.722025
Image Clustering With Transition Probabilities Learning · IEEE Trans. Image Process. 2025
Tensorized Label Learning Based Fast Fuzzy Clustering · AAAI 2025
Data mining › clustering
multi-view clustering
1.722025
Image Clustering With Transition Probabilities Learning · IEEE Trans. Image Process. 2025
Tensorized Label Learning Based Fast Fuzzy Clustering · AAAI 2025
Data mining › clustering › prototype-based clustering
anchor-based clustering
0.912025
Tensorized Label Learning Based Fast Fuzzy Clustering · AAAI 2025
Data mining › clustering
fuzzy clustering
0.912025
Tensorized Label Learning Based Fast Fuzzy Clustering · AAAI 2025
Data mining › clustering
image clustering
0.912025
Image Clustering With Transition Probabilities Learning · IEEE Trans. Image Process. 2025
Data mining › clustering
large-scale clustering
0.912025
Tensorized Label Learning Based Fast Fuzzy Clustering · AAAI 2025

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

schatten p-norm regularization · 1.7transition probabilities learning · 0.9tensorized label learning · 0.9balanced regularization · 0.9anchor graph factorization · 0.9
YearPublicationVenuePosition
2025 Tensorized Label Learning Based Fast Fuzzy Clustering
abstract
Multi-view graph clustering methods have been widely concerned due to the ability of dealing with arbitrarily shaped datasets. However, many methods with higher time and space complexity make them challenging to deal with large-scale datasets. Besides, many fuzzy clustering methods needs additional regularization terms or hyper-parameters to obtain the membership matrix or avoid trivial solutions, which weakens the model generalization ability. Furthermore, inconsistent clustering labels can arise when there are significant discrepancies between views, making it challenging to effectively leverage the complementary information from different views. To this end, we propose Tensorized Label Learning based Fast Fuzzy Clustering (TLLFFC). Specifically, we design a novel balanced regularization term to reduce pressure of tuning regularization parameters for fuzzy clustering. The label transmission strategy with the anchor graph makes TLLFFC suitable for large-scale datasets. Moreover, incorporating the Schatten p-norm regularization on the label matrices can effectively unearth the complementary information distributed among views, thereby align the labels across views more consistently. Extensive experiments verify the superiority of TLLFFC.
Xingyu Xue, Quanxue Gao, Qianqian Wang 0001
AAAI1
2025 Image Clustering With Transition Probabilities Learning
abstract
Large-scale multi-view clustering for image data has achieved impressive clustering performance and efficiency. However, most methods lack interpretability in clustering and do not fully consider the complementarity of distributions between different views. To address these problems, we introduce Multi-View Clustering with Transition Probabilities Learning (MVC-TPL). Specifically, we construct an anchor graph factorization model from the perspective of transition probabilities, while simultaneously learning transition probability matrices from samples to clusters and from anchor points to clusters, serving as soft label matrices for samples and anchor points, respectively. This model enables one-step label acquisition and provides the model with a sound probability interpretation. Moreover, since the clusters of samples and anchor points should be consistent across all views, we employ Schatten p-norm regularization on the two matrices, effectively mining the complementary information distributed among the views, thereby aligning the labels across views more consistently. Comprehensive testing on four small-scale datasets and three large-scale datasets confirms the effectiveness of this model.
Xingyu Xue, Quanxue Gao, Ming Yang 0024, Cheng Deng 0002
IEEE Trans. Image Process.1