检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Wu Qing Wang Fan Fan Jiulun Hou Jing
机构地区:[1]School of Automation,Xi'an University of Posts and Telecommunications,Xi'an 710121,China [2]School of Telecommunication and Information Engineering&School of Artificial Intelligence,Xi'an University of Posts and Telecommunications,Xi'an 710121,China [3]School of Humanities and Foreign Languages,Xi'an University of Posts and Telecommunications,Xi'an 710121,China
出 处:《The Journal of China Universities of Posts and Telecommunications》2023年第2期61-72,共12页中国邮电高校学报(英文版)
基 金:supported by the National Natural Science Foundation of China(51875457);the Key Research Project of Shaanxi Province(2022GY-050,2022GY-028);the Natural Science Foundation of Shaanxi Province of China(2022JQ-636,2022JQ-705,2021JQ-714);Shaanxi Youth Talent Lifting Plan of Shaanxi Association for Science and Technology(20220129)。
摘 要:As a way of training a single hidden layer feedforward network(SLFN),extreme learning machine(ELM)is rapidly becoming popular due to its efficiency.However,ELM tends to overfitting,which makes the model sensitive to noise and outliers.To solve this problem,L_(2,1)-norm is introduced to ELM and an L_(2,1)-norm robust regularized ELM(L_(2,1)-RRELM)was proposed.L_(2,1)-RRELM gives constant penalties to outliers to reduce their adverse effects by replacing least square loss function with a non-convex loss function.In light of the non-convex feature of L_(2,1)-RRELM,the concave-convex procedure(CCCP)is applied to solve its model.The convergence of L_(2,1)-RRELM is also given to show its robustness.In order to further verify the effectiveness of L_(2,1)-RRELM,it is compared with the three popular extreme learning algorithms based on the artificial dataset and University of California Irvine(UCI)datasets.And each algorithm in different noise environments is tested with two evaluation criterions root mean square error(RMSE)and fitness.The results of the simulation indicate that L_(2,1)-RRELM has smaller RMSE and greater fitness under different noise settings.Numerical analysis shows that L_(2,1)-RRELM has better generalization performance,stronger robustness,and higher anti-noise ability and fitness.
关 键 词:extreme learning machine(ELM) non-convex loss L_(2 1)-norm concave-convex procedure(CCCP)
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.179