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

Liqin Yu

dblp:201/8402 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
4since 2021 · last 2026
0009-0000-2447-4102ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 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
1 paper
Data mining · 100%

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

TopicWeightPapersLastEvidence papers
Data mining
clustering
0.412020
A Cluster-Weighted Kernel K-Means Method for Multi-View Clustering · AAAI 2020
Data mining › clustering › kernel clustering
kernel k-means
0.412020
A Cluster-Weighted Kernel K-Means Method for Multi-View Clustering · AAAI 2020
Data mining › clustering
multi-view clustering
0.412020
A Cluster-Weighted Kernel K-Means Method for Multi-View Clustering · AAAI 2020

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

cluster-weighted kernel k-means · 0.4alternating optimization · 0.4
YearPublicationVenuePosition
2026 Innovative weighted clustering for categorical matrix-object data: new distance and cluster center considering data distribution
Liqin Yu, Fuyuan Cao, Likun Lu, Xindong You
J. Supercomput.1
2024 Exploiting heterogeneous information isolation and multi-view aggregation for multimodal recommendation
Pinyin Si, Yali Qi, Liqin Yu, Likun Lu, Qingtao Zeng
Multim. Syst.3
2022 Weighted matrix-object data clustering guided by matrix-object distributions
Liqin Yu, Fuyuan Cao
Eng. Appl. Artif. Intell.1
2021 k-Mnv-Rep: A k-type clustering algorithm for matrix-object data
Liqin Yu, Fuyuan Cao, Xiao Zhi Gao 0001, Jiye Liang
Inf. Sci.1
2020 A Cluster-Weighted Kernel K-Means Method for Multi-View Clustering
abstract
Clustering by jointly exploiting information from multiple views can yield better performance than clustering on one single view. Some existing multi-view clustering methods aim at learning a weight for each view to determine its contribution to the final solution. However, the view-weighted scheme can only indicate the overall importance of a view, which fails to recognize the importance of each inner cluster of a view. A view with higher weight cannot guarantee all clusters in this view have higher importance than them in other views. In this paper, we propose a cluster-weighted kernel k-means method for multi-view clustering. Each inner cluster of each view is assigned a weight, which is learned based on the intra-cluster similarity of the cluster compared with all its corresponding clusters in different views, to make the cluster with higher intra-cluster similarity have a higher weight among the corresponding clusters. The cluster labels are learned simultaneously with the cluster weights in an alternative updating way, by minimizing the weighted sum-of-squared errors of the kernel k-means. Compared with the view-weighted scheme, the cluster-weighted scheme enhances the interpretability for the clustering results. Experimental results on both synthetic and real data sets demonstrate the effectiveness of the proposed method.
Fuyuan Cao, Xiao Zhi Gao 0001, Liqin Yu, Jiye Liang
AAAI4