Muzhou Hou

Muzhou Hou

orcid

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 February 2021 in Pattern Recognition
Verified
Journal Article
Closed access
ZWZheng Wang
Zheng Wang
YXYing Xiao
Ying Xiao
YLYong Li
Yong Li
JZJie Zhang
Jie Zhang
FLFanggen Lu
Fanggen Lu
XLXiaowei Liu
Xiaowei Liu

5 September 2018 in Neural Processing Letters
Verified
Journal Article
Closed access
PDF file
HSHongli Sun
Hongli Sun
MHMuzhou Hou
Muzhou Hou
YYYunlei Yang
Yunlei Yang
TZTianle Zhang
Tianle Zhang
FWFutian Weng
Futian Weng
FHFeng Han
Feng Han

19 December 2018 in Advances in Difference Equations
Verified
Journal Article
Open access
PDF file
YYYunlei Yang
Yunlei Yang
MHMuzhou Hou
Muzhou Hou
JLJianshu Luo
Jianshu Luo
This paper develops a Legendre neural network method (LNN) for solving linear and nonlinear ordinary differential equations (ODEs), system of ordinary differential equations (SODEs), as well as classic Emden–Fowler equations. The Legendre polynomial is chosen as a basis function of hidden neurons. A single hidden layer Legendre neural network is used to eliminate the hidden layer by expanding the input pattern using Legendre polynomials. The improved extreme learning machine (IELM) algorithm is used for network weights training when solving algebraic equation systems, and several algorithm steps are summed up. Convergence was analyzed theoretically to support the proposed method. In order to demonstrate the performance of the method, various testing problems are solved by the proposed approach. A comparative study with other approaches such as conventional methods and latest research work reported in the literature are described in detail to validate the superiority of the method. Experimental results show that the proposed Legendre network with IELM algorithm requires fewer neurons to outperform the numerical algorithm in the latest literature in terms of accuracy and execution time.

11 January 2020 in Journal of Ambient Intelligence and Humanized Computing
Verified
Journal Article
Closed access
PDF file
FWFutian Weng
Futian Weng
YCYinhao Chen
Yinhao Chen
ZWZheng Wang
Zheng Wang
MHMuzhou Hou
Muzhou Hou
JLJianshu Luo
Jianshu Luo
ZTZhongchu Tian
Zhongchu Tian

26 March 2019 in Soft Computing
Verified
Journal Article
Closed access
PDF file
YYYunlei Yang
Yunlei Yang
MHMuzhou Hou
Muzhou Hou
HSHongli Sun
Hongli Sun
TZTianle Zhang
Tianle Zhang
FWFutian Weng
Futian Weng
JLJianshu Luo
Jianshu Luo

5 August 2010 in IEEE Transactions on Neural Networks
Verified
Journal Article
Closed access
MHMuzhou Hou
Muzhou Hou
XHXuli Han
Xuli Han
It is well known that single hidden layer feedforward networks with radial basis function (RBF) kernels are universal approximators when all the parameters of the networks are obtained through all kinds of algorithms. However, as observed in most neural network implementations, tuning all the parameters of the network may cause learning complicated, poor generalization, overtraining and unstable. Unlike conventional neural network theories, this brief gives a constructive proof for the fact that a decay RBF neural network with n + 1 hidden neurons can interpolate n + 1 multivariate samples with zero error. Then we prove that the given decay RBFs can uniformly approximate any continuous multivariate functions with arbitrary precision without training. The faster convergence and better generalization performance than conventional RBF algorithm, BP algorithm, extreme learning machine and support vector machines are shown by means of two numerical experiments.