Jueliang Hu

Jueliang Hu

Auto-generated profile, based on publicly available information

Jueliang Hu

Department of Mathematics, Zhejiang Sci-Tech University, Hangzhou, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
25 January 2021 in IEEE Access
Verified
Journal Article
Open access
YZYuao Zhang
Yuao Zhang
QWQingbiao Wu
Qingbiao Wu
JHJueliang Hu
Jueliang Hu
Extreme learning machine (ELM) has become popular in recent years, due to its robust approximation capacity and fast learning speed. It is common to add a $\ell _{2}$ penalty term in basic ELM to avoid over-fitting. However, in $\ell _{2}$ -regularized extreme learning machine ( $\ell _{2}$ -RELM), choosing a suitable regularization factor is random and time consuming. In order to select a satisfactory regularization factor automatically, we proposed an adaptive regularized extreme learning machine (A-RELM) by replacing the regularization factor with a function. The function is defined in terms of the output weights named regularization function. And an iterative algorithm is proposed for obtaining the output weights, therefore, allowing for deriving their values simultaneously. Besides, the constructed regularization function ensures the convexity of the model, which contributes to a globally optimal solution. The convergence analysis of the iterative algorithm guarantees the effectiveness of the model training. Experimental results on some UCI benchmarks and the Yale face database B indicate the superiority of our proposed algorithm.

19 September 2012 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
YJYiwei Jiang
Yiwei Jiang
ZWZewei Weng
Zewei Weng
JHJueliang Hu
Jueliang Hu

20 November 2014 in International Transactions in Operational Research
Verified
Journal Article
Closed access
PDF file
YJYiwei Jiang
Yiwei Jiang
FYFeng Yu
Feng Yu
PZPing Zhou
Ping Zhou
JHJueliang Hu
Jueliang Hu

5 June 2018 in Journal of Combinatorial Optimization
Verified
Journal Article
Closed access
PDF file
JDJianming Dong
Jianming Dong
RJRuyan Jin
Ruyan Jin
JHJueliang Hu
Jueliang Hu
GLGuohui Lin
Guohui Lin

1 January 2007 in Journal of Zhejiang University-SCIENCE A
Verified
Journal Article
Closed access
PDF file
SHSHUGUANG HAN
SHUGUANG HAN
YJYi-Wei Jiang
Yi-Wei Jiang
JHJue-Liang Hu
Jue-Liang Hu
In this paper we investigate a variant of the scheduling problem on two uniform machines with speeds 1 and s. For this problem, we are given two potential uniform machines to process a sequence of independent jobs. Machines need to be activated before starting to process, and each machine activated incurs a fixed machine activation cost. No machines are initially activated, and when a job is revealed, the algorithm has the option to activate new machines. The objective is to minimize the sum of the makespan and the machine activation cost. We design optimal online algorithms with competitive ratio of (2s+1)/(s+1) for every s≥1.

10 January 2020 in Journal of Scheduling
Verified
Journal Article
Closed access
PDF file
JDJianming Dong
Jianming Dong
JCJoshua Chang
Joshua Chang
BSBing Su
Bing Su
JHJueliang Hu
Jueliang Hu
GLGuohui Lin
Guohui Lin