Chao Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Chao Chen has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Boliang Sun
Laboratory for Big Data and Decision, National University of Defense Technology, Changsha 410073, China
1 shared publication De-Feng Kong
1 shared publicationDefeng Kong
1 shared publicationHao Zhang
Naval War Gaming Center, Naval Command College, Nanjing 210016, P. R. China
1 shared publicationJian Zhang
Naval War Gaming Center, Naval Command College, Nanjing 210016, P. R. China
1 shared publication- Jianmai Shi
National University of Defense Technology
1 shared publication
Latest Publications
- Open Access
- 4 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 68479-68494
Online Semi-Supervised Learning With Multiple Regularization Terms
Online semi-supervised learning (OS2L) has received much attention recently because of its well practical usefulness. Most of existing studies of online semi-supervised learning related to manifold regularization. In this study, we propose a novel online semi-supervised learning framework with multiple regularization terms based on the notion of ascending the dual function in constrained optimization. Using Fenchel conjugate, different semi-supervised regularization terms can be integrated in the dual function easily and directly. This approach is derived by updating limited dual coefficient variables on each learning round. To be practical, we also employ buffering strategies and sparse approximation approaches in this work. Experimental studies show that our methods achieve accuracy comparable to offline algorithms while consuming less time and memory. Specially, our online semi-supervised learning algorithms can handle the settings where the target hyperplane of classification continually drifts with the sequence of arriving instances. This paper paves a way to the design and analysis of online semi-supervised learning algorithms with multiple regularization terms.
- 4 February 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 7, 68479-68494
Open AccessOnline Semi-Supervised Learning With Multiple Regularization Terms
Online semi-supervised learning (OS2L) has received much attention recently because of its well practical usefulness. Most of existing studies of online semi-supervised learning related to manifold regularization. In this study, we propose a novel online semi-supervised learning framework with multiple regularization terms based on the notion of ascending the dual function in constrained optimization. Using Fenchel conjugate, different semi-supervised regularization terms can be integrated in the dual function easily and directly. This approach is derived by updating limited dual coefficient variables on each learning round. To be practical, we also employ buffering strategies and sparse approximation approaches in this work. Experimental studies show that our methods achieve accuracy comparable to offline algorithms while consuming less time and memory. Specially, our online semi-supervised learning algorithms can handle the settings where the target hyperplane of classification continually drifts with the sequence of arriving instances. This paper paves a way to the design and analysis of online semi-supervised learning algorithms with multiple regularization terms.
- Open Access
- 21 January 2018
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2018, 1-10
Route Planning for Military Ground Vehicles in Road Networks under Uncertain Battlefield Environment
Route planning for military ground vehicles in the uncertain battlefield is a special kind of route planning problem, as the military vehicles face a great of uncertain and unpredicted attacks. This paper models these uncertainties in the road network by a set of discrete scenarios. A th shortest-path method is introduced to find intact routes from the origin to the destination for each vehicle. A binary integer programming is presented to formulate the problem. As the combination of the uncertainties results in a huge number of scenarios, we employed the sample average approximation method to obtain a robust solution for the problem. The solution approach is illustrated and tested through three road networks with different scales. The computational results show that, for networks of small scale, our method can provide a good solution with a sample of small size, while, for the large network, with sample of small size, this method usually leads to a suboptimal solution, but a good solution can still be obtained as the sample size grows bigger. In addition, variation trend of the deviation with different sample size indicates that a sample of larger size can bring more stability to the results.- 21 January 2018
- Published by Wiley in Journal of Advanced Transportation
- Vol. 2018, 1-10
Open AccessRoute Planning for Military Ground Vehicles in Road Networks under Uncertain Battlefield Environment
Route planning for military ground vehicles in the uncertain battlefield is a special kind of route planning problem, as the military vehicles face a great of uncertain and unpredicted attacks. This paper models these uncertainties in the road network by a set of discrete scenarios. A th shortest-path method is introduced to find intact routes from the origin to the destination for each vehicle. A binary integer programming is presented to formulate the problem. As the combination of the uncertainties results in a huge number of scenarios, we employed the sample average approximation method to obtain a robust solution for the problem. The solution approach is illustrated and tested through three road networks with different scales. The computational results show that, for networks of small scale, our method can provide a good solution with a sample of small size, while, for the large network, with sample of small size, this method usually leads to a suboptimal solution, but a good solution can still be obtained as the sample size grows bigger. In addition, variation trend of the deviation with different sample size indicates that a sample of larger size can bring more stability to the results. - 25 February 2015
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 26 (04)
Analysis and optimization of cross-immunity epidemic model on complex networks
There are various infectious diseases in real world, and these diseases often spread on a network of population and compete for the limited hosts. Cross-immunity is an important disease competing pattern, which has attracted the attention of many researchers. In this paper, we discovered an important conclusion for two cross-immunity epidemics on a network. When the infectious ability of the second epidemic takes a fixed value, the infectious ability of the first epidemic has an optimal value which minimizes the sum of the infection sizes of the two epidemics. We also proposed a simple mathematical analysis method for the infection size of the second epidemic using the cavity method. The proposed method and conclusion are verified by simulation results. Minor inaccuracies of the existing mathematical methods for the infection size of the second epidemic are also found and discussed in experiments, which have not been noticed in existing research.
- 25 February 2015
- Published by World Scientific Pub Co Pte Ltd in International Journal of Modern Physics C
- Vol. 26 (04)
Analysis and optimization of cross-immunity epidemic model on complex networks
There are various infectious diseases in real world, and these diseases often spread on a network of population and compete for the limited hosts. Cross-immunity is an important disease competing pattern, which has attracted the attention of many researchers. In this paper, we discovered an important conclusion for two cross-immunity epidemics on a network. When the infectious ability of the second epidemic takes a fixed value, the infectious ability of the first epidemic has an optimal value which minimizes the sum of the infection sizes of the two epidemics. We also proposed a simple mathematical analysis method for the infection size of the second epidemic using the cavity method. The proposed method and conclusion are verified by simulation results. Minor inaccuracies of the existing mathematical methods for the infection size of the second epidemic are also found and discussed in experiments, which have not been noticed in existing research.
- 1 November 2014
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 38 (21-22) , 5269-5278
Modeling and solution of COA development based on timed influence net and game theory
- 1 November 2014
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 38 (21-22) , 5269-5278
Modeling and solution of COA development based on timed influence net and game theory
- 1 June 2014
- Published by Military Operations Research Society in Military Operations Research
- Vol. 19 (2) , 35-58
Modeling and Development of Course of Action by Considering Uncertainty and Antagonism
- 1 June 2014
- Published by Military Operations Research Society in Military Operations Research
- Vol. 19 (2) , 35-58
Modeling and Development of Course of Action by Considering Uncertainty and Antagonism