{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:12:45Z","timestamp":1648897965583},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Acquisition"],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:p> Particle swarm optimization (PSO) is one of the important evolutionary algorithms. However, the traditional PSO suffers from the premature convergence problem. In view of this, a new PSO, named mutation PSO (MPSO), is proposed in this paper. The proposed MPSO not only makes use of a mutation operator to update particles\/individuals, which was originally designed for genetic algorithm (GA). But also a new weighted update rule is proposed for MPSO to produce the new swarm. Then we use the proposed MPSO to train multilayer perceptron (MLP) with two tasks: curve fitting and classification. In particular, the performance investigation is concentrated on scene classification. For a comparison purpose, MLPs trained using the error backpropagation (BP), traditional PSO and GA are also investigated. The advantages and disadvantages of these algorithms are also analyzed. Experimental results show that the proposed MPSO outperforms than other algorithms for the training of an MLP. <\/jats:p>","DOI":"10.1142\/s0219878913500046","type":"journal-article","created":{"date-parts":[[2013,4,4]],"date-time":"2013-04-04T06:26:32Z","timestamp":1365056792000},"page":"1350004","source":"Crossref","is-referenced-by-count":0,"title":["A NEW MODIFIED PARTICLE SWARM OPTIMIZATION FOR MULTILAYER PERCEPTION TRAINING WITH APPLICATIONS"],"prefix":"10.1142","volume":"09","author":[{"given":"WU","family":"JING","sequence":"first","affiliation":[{"name":"M-Lab, Innocentre 72 Tat Chee Avenue, Kowloon Tong, Hong Kong"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,4,3]]},"reference":[{"key":"rf1","author":"Bratton D.","year":"2008","journal-title":"J. Artif. Evol. Appl."},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/TMAG.2007.892513"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1504\/IJICA.2007.013400"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.4018\/jamc.2011100104"},{"key":"rf8","first-page":"279","volume":"14","author":"Wei-neng C.","year":"2010","journal-title":"IEEE Trans. Evol. Comput."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.224"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2008.920672"}],"container-title":["International Journal of Information Acquisition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219878913500046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T14:57:43Z","timestamp":1565189863000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219878913500046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":8,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2013,4,3]]},"published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1142\/S0219878913500046"],"URL":"https:\/\/doi.org\/10.1142\/s0219878913500046","relation":{},"ISSN":["0219-8789","1793-6985"],"issn-type":[{"value":"0219-8789","type":"print"},{"value":"1793-6985","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}