Kai Zhang 0029

dblp:55/957-29 · DBLP profile ↗
← Back
11ranked-venue papers in the field
0as first author
9since 2021 · last 2026
0000-0002-6691-6762ORCID · conflict

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

Knowledge Engineering, Semantic Web & Information Systems · 9Information Retrieval & Web Search · 1Other / Interdisciplinary · 1
YearPublicationVenuePosition
2026 Multi-view consensus graph subspace clustering via embedding spatial information of features
Mingguang Shao, Jian Wang 0010, Kai Zhang 0029, Sergey Ablameyko 0001
Inf. Sci.4
2025 An enhanced sparse multiobjective evolutionary algorithm in large-scale multiobjective optimization
Jian Wang 0010, Kai Zhang 0029, Bin Yuan 0004, Caili Dai, Sergey Ablameyko 0001
Inf. Sci.3
2025 Achieving fair medical image segmentation in foundation models with adversarial visual prompt tuning
Kai Zhang 0029, Fuyan Zhang, Chuanguang Yang, Zhongliang Guo 0001, Weiping Ding 0001, Tingwen Huang
Inf. Sci.3
2023 Pseudo inverse versus iterated projection: Novel learning approach and its application on broad learning system
Faliang Yin, Kai Zhang 0029, Jian Wang 0010, Nikhil R. Pal
Inf. Sci.3
2022 Sensitivity analysis of Takagi-Sugeno fuzzy neural network
Jian Wang 0010, Qin Chang, Tao Gao 0003, Kai Zhang 0029, Nikhil R. Pal
Inf. Sci.4
2022 Nonstationary fuzzy neural network based on FCMnet clustering and a modified CG method with Armijo-type rule
Bingjie Zhang 0001, Xiaoling Gong, Jian Wang 0010, Fengzhen Tang, Kai Zhang 0029, Wei Wu 0010
Inf. Sci.5
2021 Collaborative Representation for Deep Meta Metric Learning
abstract
Most metric learning methods utilize all training data to construct a single metric, and it is usually over-fitting on the "salient" feature. To overcome this issue, we propose a deep meta metric learning method based on collaborative representation. We construct multiple episodes from the original training data to train a general metric, where each episode consists of a query set and a support set. Then, we introduce a collaborative representation method, which fits the query sample with the support samples per class. We predict the query sample's label via the optimal fitness among the query sample and the support samples in each specific class. Besides, we adopt a hard mining strategy to learn a more discriminative metric according to increasing the training tasks' difficulty. Experiments verify that our method achieves state-of-the-art results on three re-ID benchmark datasets.
Weifeng Liu 0001, Kai Zhang 0029, Baodi Liu
ICMR3
2021 Efficient hierarchical surrogate-assisted differential evolution for high-dimensional expensive optimization
Guodong Chen 0002, Kai Zhang 0029, Xiaoming Xue 0001, Jian Wang 0010, Chuanjin Yao
Inf. Sci.3
2021 Semi-supervised classification by graph p-Laplacian convolutional networks
Sichao Fu, Weifeng Liu 0001, Kai Zhang 0029, Yicong Zhou, Dapeng Tao
Inf. Sci.3
2020 Local structure alignment guided domain adaptation with few source samples
abstract
Domain adaptation has received lots of attention for its high efficiency in dealing with cross-domain learning tasks. Most existing domain adaptation methods adopt the strategies relying on large amounts of source label information, which limits their applications in the real world where only a few label samples are available. We exploit the local geometric connections to tackle this problem and propose a Local Structure Alignment (LSA) guided domain adaptation method in this paper. LSA leverages the Nyström method to describe the distribution difference from the geometric perspective and then perform the distribution alignment between domains. Specifically, LSA constructs a domain-invariant Hessian matrix to locally connect the data of the two domains through minimizing the Nyström approximation error. And then it integrates the domain-invariant Hessian matrix with the semi-supervised learning and finally builds an adaptive semi-supervised model. Extensive experimental results validate that the proposed LSA outperforms the traditional domain adaptation methods especially when only sparse source label information is available.
Yuying Cai, Baodi Liu, Weifeng Liu 0001, Kai Zhang 0029, Changsheng Xu
MMAsia5
2020 A recalling-enhanced recurrent neural network: Conjugate gradient learning algorithm and its convergence analysis
Tao Gao 0003, Xiaoling Gong, Kai Zhang 0029, Jian Wang 0010, Tingwen Huang, Jacek M. Zurada
Inf. Sci.3