Ping Li 0006

dblp:62/5860-6 · also Patrick L. Lee · DBLP profile ↗
← Back
8ranked-venue papers in the field
8as first author
5since 2021 · last 2026
0000-0002-8515-7773ORCID · conflict

Domains — venue-derived; a paper can count in several

Knowledge Engineering, Semantic Web & Information Systems · 4 (4 first)Information Retrieval & Web Search · 3 (3 first)Data Mining & Knowledge Discovery · 1 (1 first)
YearPublicationVenuePosition
2026 Class semantics guided knowledge distillation for few-shot class incremental learning
Ping Li 0006, Shaoqi Tian
Inf. Sci.1
2024 Fully Transformer-Equipped Architecture for end-to-end Referring Video Object Segmentation
Ping Li 0006, Li Yuan 0007, Xianghua Xu
Inf. Process. Manag.1
2024 Bridging knowledge distillation gap for few-sample unsupervised semantic segmentation
Ping Li 0006
Inf. Sci.1
2023 Time-frequency recurrent transformer with diversity constraint for dense video captioning
Ping Li 0006, Huaxin Xiao
Inf. Process. Manag.1
2022 Coarse-to-fine few-shot classification with deep metric learning
Ping Li 0006, Guopan Zhao, Xianghua Xu
Inf. Sci.1
2015 Graph-based local concept coordinate factorization
Ping Li 0006, Jiajun Bu, Lijun Zhang 0005, Chun Chen 0001
Knowl. Inf. Syst.1
2013 Multi-label ensemble based on variable pairwise constraint projection
Ping Li 0006, Min Wu 0002
Inf. Sci.1
2012 Relational co-clustering via manifold ensemble learning
abstract
Co-clustering targets on grouping the samples and features simultaneously. It takes advantage of the duality between the samples and features. In many real-world applications, the data points or features usually reside on a submanifold of the ambient Euclidean space, but it is nontrivial to estimate the intrinsic manifolds in a principled way. In this study, we focus on improving the co-clustering performance via manifold ensemble learning, which aims to maximally approximate the intrinsic manifolds of both the sample and feature spaces. To achieve this, we develop a novel co-clustering algorithm called Relational Multi-manifold Co-clustering (RMC) based on symmetric nonnegative matrix tri-factorization, which decomposes the relational data matrix into three matrices. This method considers the inter-type relationship revealed by the relational data matrix and the intra-type information reflected by the affinity matrices. Specifically, we assume the intrinsic manifold of the sample or feature space lies in a convex hull of a group of pre-defined candidate manifolds. We hope to learn an appropriate convex combination of them to approach the desired intrinsic manifold. To optimize the objective, the multiplicative rules are utilized to update the factorized matrices and the entropic mirror descent algorithm is exploited to automatically learn the manifold coefficients. Experimental results demonstrate the superiority of the proposed algorithm.
Ping Li 0006, Jiajun Bu, Chun Chen 0001, Zhanying He
CIKM1