Zhibin Deng

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

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

Theory of computation · 7 · 1 first-author · 3 since 2021Artificial intelligence and machine learning · 3 · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 One-to-many two-sided matching decision of logistics O2O platform considering the intermediary benefit
Zhibin Deng
Knowl. Inf. Syst.1
2024 A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem
Cheng Lu 0007, Jitao Ma, Zhibin Deng, Wenxun Xing
J. Glob. Optim.3
2023 New semidefinite relaxations for a class of complex quadratic programming problems
Yingzhe Xu, Cheng Lu 0007, Zhibin Deng, Ya-Feng Liu
J. Glob. Optim.3
2023 Coevolution modeling of group behavior and opinion based on public opinion perception
Weimin Li 0001, Zhibin Deng, Fangfang Liu 0008, Jianjia Wang, Ruiqiang Guo, Can Wang 0004, Qun Jin
Knowl. Based Syst.3
2022 Modeling social network behavior spread based on group cohesion under uncertain environment
abstract
Summary Behavior is autonomous, convergent, and uncertain, which brings challenges to the modeling of social network behavior spread. In this article, we propose a behavior spread model based on group cohesion under uncertain environments. First, for behavioral convergence, we define group cohesion to quantify the convergent effects of group. Second, based on the game theory to model the autonomy of behavior, according to the characteristics of the game payoffs changing with time and the depth of spread, and integrating group cohesion, a dynamic game payoffs calculation method is designed. Finally, aiming at the uncertainty of behavior, a group behavior spread model based on random utility theory is established. Experiments on multiple real social network behavior spread datasets demonstrate the effectiveness of the proposed model in modeling and predicting behavior spread processes under uncertain environments.
Weimin Li 0001, Zhibin Deng, Xiaokang Zhou, Qun Jin, Bin Sheng 0002
Concurr. Comput. Pract. Exp.2
2022 Robust kernel-free support vector regression based on optimal margin distribution
Jian Luo 0006, Shu-Cherng Fang, Zhibin Deng, Ye Tian 0006
Knowl. Based Syst.3
2021 A branch-and-bound algorithm for solving max-k-cut problem
Cheng Lu 0007, Zhibin Deng
J. Glob. Optim.2
2019 A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
Cheng Lu 0007, Zhibin Deng, Xiaoling Guo
J. Glob. Optim.2
2018 Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming
Cheng Lu 0007, Zhibin Deng, Weiqiang Zhang 0001, Shu-Cherng Fang
J. Glob. Optim.2
2017 An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
Cheng Lu 0007, Zhibin Deng, Qingwei Jin
J. Glob. Optim.2
2017 A New Fuzzy Set and Nonkernel SVM Approach for Mislabeled Binary Classification With Applications
abstract
This paper proposes a new approach based on the kernel-free quadratic surface support vector machine model to handle a binary classification problem with mislabeled information. Unlike the traditional fuzzy and robust support vector machine models that reduce the weights of suspectable mislabeled points or even discard them, our new method first adopts the intuitionistic fuzzy set method to detect those suspectable mislabeled points, then deletes their labels, and indiscriminately utilizes their full position information to build a semisupervised model. In this way, we can not only eliminate the negative effect of mislabeled information but also avoid the difficult task of searching proper kernel functions in classical SVM models. Besides, to improve the efficiency and accuracy, a branch-and-bound algorithm is designed to accelerate the solving process. After that, we conduct some numerical tests with both artificial and real-world datasets to verify the superior performance of our proposed method among several benchmark methods. Furthermore, the proposed method is applied to brain-computer interface and credit risk assessment. The promising results strongly demonstrate the effectiveness of our method and show its big potential in some real applications.
Ye Tian 0006, Zhibin Deng, Jian Luo 0006, Yueqing Li
IEEE Trans. Fuzzy Syst.3
2015 Conic approximation to nonconvex quadratic programming with convex quadratic constraints
Zhibin Deng, Shu-Cherng Fang, Qingwei Jin, Cheng Lu 0007
J. Glob. Optim.1