Neural Network World最新文献

筛选
英文 中文
Traffic data analysis using deep Elman and gated recurrent auto-encoder 使用深度Elman和门控循环自编码器的交通数据分析
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2020-01-01 DOI: 10.14311/NNW.2020.30.023
S. Mehralian, M. Teshnehlab, B. Nasersharif
{"title":"Traffic data analysis using deep Elman and gated recurrent auto-encoder","authors":"S. Mehralian, M. Teshnehlab, B. Nasersharif","doi":"10.14311/NNW.2020.30.023","DOIUrl":"https://doi.org/10.14311/NNW.2020.30.023","url":null,"abstract":"Traffic flow prediction is one of the most interesting machine learning applications in real-world problems that can help anyone move around. In this study, we proposed a feature extraction structure for multivariate time series using Elman recurrent auto-encoder. We added loopback from the encoder layer of the normal auto-encoder to regard sequence information between successive data. The feedback layer implemented using Elman neural network and GRU cells, then the model is trained by different optimization algorithms. The models are also trained using the Emotional Learning method in which we involve the derivative of the error in the cost function to avoid local minimums and keep the last state of the network. We used the proposed method for classification and prediction problems on traffic data from the California Department of Transportation Performance Measurement System (PeMS). The results show that our structure can successfully extract a compact representation of traffic data useful for reconstructing of original data, classification, and prediction. The results also show that adding the recurrent layer to the feature extractor (auto-encoder) leads to better results in the classification phase in comparison with standard methods that do not use the recurrence during feature extraction.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67123878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
A discrete butterfly-inspired optimization algorithm for solving Permutation Flow-Shop scheduling Problems 求解置换流水车间调度问题的离散蝴蝶启发优化算法
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2020-01-01 DOI: 10.14311/nnw.2020.30.015
X. Qi, Yuan Zhonghu, Xiaowei Han, Shixin Liu
{"title":"A discrete butterfly-inspired optimization algorithm for solving Permutation Flow-Shop scheduling Problems","authors":"X. Qi, Yuan Zhonghu, Xiaowei Han, Shixin Liu","doi":"10.14311/nnw.2020.30.015","DOIUrl":"https://doi.org/10.14311/nnw.2020.30.015","url":null,"abstract":"Permutation Flow-Shop Scheduling Problem (PFSP) which exists in many manufacturing systems is a classic combinatorial optimization problem. Studies have shown that the PFSP including more than three machines belongs to the NP-hard problems and is difficult to solve. Based on a new bio-inspired algorithm – Artificial Butterfly Optimization (ABO) algorithm, this paper presents a Discrete Artificial Butterfly Optimization (DABO) algorithm to find the permutation that gives the smallest completion time or the smallest total flow time. The performance of the proposed algorithm is tested on well-known benchmark suites of Car, Reeves and Taillard. The experimental results show that the proposed algorithm is able to provide very promising and competitive results on most benchmark functions. The DABO algorithm is then employed for one production optimization problem.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"30 1","pages":"211-229"},"PeriodicalIF":0.8,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67123502","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
THE ECG SIGNAL CLASSIFICATION BASED ON ENSEMBLE LEARNING OF PSO-ELM ALGORITHM 基于pso-elm算法集成学习的心电信号分类
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2020-01-01 DOI: 10.14311/nnw.2020.30.018
Wei Li, Bin Li, Hong Guo, Yixian Fang, Fengjuan Qiao, Shuwang Zhou
{"title":"THE ECG SIGNAL CLASSIFICATION BASED ON ENSEMBLE LEARNING OF PSO-ELM ALGORITHM","authors":"Wei Li, Bin Li, Hong Guo, Yixian Fang, Fengjuan Qiao, Shuwang Zhou","doi":"10.14311/nnw.2020.30.018","DOIUrl":"https://doi.org/10.14311/nnw.2020.30.018","url":null,"abstract":"ECG anomaly detection plays an important role in clinical medicine. So far, a number of ECG recognition technologies have emerged in this field, but most often suffer from slow training and instability. Considering that the Extreme Learning Machine (ELM) and Particle Swarm Optimization (PSO) algorithm have the advantages of fast learning speed and strong generalization ability, this paper integrates multiple independent PSO-ELM model and proposes a novel ensemble learning framework termed as E-PSO-ELM to realize ECG signals recognition. More specifically, the individual PSO-ELM adopts the input weight and hidden layer deviation of ELM as the particles in the PSO algorithm, and takes the root mean square error of ELM training sample as the adaptive value of the particles, so as to enhance the stability of the network and realize high ECG recognition rate. The simulation results on MIT-BIH Arrhythmia Database show that E-PSO-ELM has a high classification accuracy rate of 98.23 %. In addition, compared with other algorithms, the stability of E-PSO-ELM is more prominent, which can reduce the probability of operating errors. Therefore, E-PSO-ELM has a high practical value.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"30 1","pages":"265-279"},"PeriodicalIF":0.8,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67123572","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Unsupervised facial expression detection using genetic algorithm 基于遗传算法的无监督面部表情检测
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2020-01-01 DOI: 10.14311/nnw.2020.30.005
Rahool Dembani, Wang Zheng, Meijun Sun, Nooruddin
{"title":"Unsupervised facial expression detection using genetic algorithm","authors":"Rahool Dembani, Wang Zheng, Meijun Sun, Nooruddin","doi":"10.14311/nnw.2020.30.005","DOIUrl":"https://doi.org/10.14311/nnw.2020.30.005","url":null,"abstract":"Interpersonal communication can be done by understanding the clues of facial expressions. As its importance increase in behavior and clinical studies, so automatic detection of facial expressions is an open research area for the last few decades. Efforts of expression detection by a human being are easy and effective but the machine needs some more understanding. This paper proposes a face expression clustering using a genetic algorithm. Image get convert into binary format for finding the related cluster selection in different phases of genetic algorithm. Proposed work has utilized a modified teacher learning-based optimization algorithm where the population gets updated in each phase to get the best representative features. A real dataset of facial expression was used in this work. A comparison of the proposed model was done with existing models on different evaluation parameters. It was obtained that the proposed work has improved precision, recall, the accuracy of facial expression identification without any training.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"30 1","pages":"65-75"},"PeriodicalIF":0.8,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67123666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
PROBABILISTIC ANALYSIS OF THE CONVERGENCE OF THE DIFFERENTIAL EVOLUTION ALGORITHM 差分进化算法收敛性的概率分析
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2020-01-01 DOI: 10.14311/nnw.2020.30.017
R. Knobloch, J. Mlynek
{"title":"PROBABILISTIC ANALYSIS OF THE CONVERGENCE OF THE DIFFERENTIAL EVOLUTION ALGORITHM","authors":"R. Knobloch, J. Mlynek","doi":"10.14311/nnw.2020.30.017","DOIUrl":"https://doi.org/10.14311/nnw.2020.30.017","url":null,"abstract":"Differential evolution algorithms represent an efficient framework to tackle complicated optimization problems with many variables and involved constraints. Nevertheless, the classic differential evolution algorithms in general do not ensure the convergence to the global minimum of the cost function. Therefore, the authors of the article designed a modification of these algorithms that guarantees the global convergence in the asymptotic and probabilistic sense. The modification consists in adding a certain ratio of random individuals to each generation formed by the algorithm. The random individuals limit the premature convergence to the local minimum and contribute to more thorough exploration of the search space. This article concentrates specifically on the role of random individuals in the identification of the global minimum of the cost function. Besides, the paper also contains some useful estimates of the probability of finding the global minimum of the corresponding cost function.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"30 1","pages":"249-263"},"PeriodicalIF":0.8,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67123516","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Underwater acoustic signal analysis: preprocessing and classification by deep learning 水声信号分析:深度学习预处理与分类
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2020-01-01 DOI: 10.14311/nnw.2020.30.007
Hao Wu, Qingzeng Song, Guanghao Jin
{"title":"Underwater acoustic signal analysis: preprocessing and classification by deep learning","authors":"Hao Wu, Qingzeng Song, Guanghao Jin","doi":"10.14311/nnw.2020.30.007","DOIUrl":"https://doi.org/10.14311/nnw.2020.30.007","url":null,"abstract":"The identification and classification is important parts of the research in the field like underwater acoustic signal processing. Recently, deep learning technology has been utilized to achieve good performance in the underwater acoustic signal case. On the other side, there are still some problems should be solved. The first one is that it cannot achieve high accuracy by the dataset that is transformed into audio spectrum. The second one is that the accuracy of classification on the dataset is still low, so that, it cannot satisfy the real demand. To solve those problems, we firstly evaluated four popular spectrums (Audio Spectrum, Image Histogram, Demon and LOFAR) for data preprocessing and selected the best one that is suitable for the neural networks (LeNet, ALEXNET, VGG16). Then, among these methods, we modified a neural network(LeNet) to fit the dataset that is transformed by the spectrum to improve the classification accuracy. The experimental result shows that the accuracy of our method can achieve 97.22 %, which is higher than existing methods and it met the expected target of practical application.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"30 1","pages":"85-96"},"PeriodicalIF":0.8,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67123898","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Working memory, impulsivity and emotional regulation correlates with frontal asymmetry of healthy young subjects during auditory session 听觉过程中工作记忆、冲动和情绪调节与大脑额叶不对称相关
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2020-01-01 DOI: 10.14311/NNW.2020.30.024
S. Maitra, M. Chatterjee, A. Sasidharan, S. Sinha, K. Mukhopadhyay
{"title":"Working memory, impulsivity and emotional regulation correlates with frontal asymmetry of healthy young subjects during auditory session","authors":"S. Maitra, M. Chatterjee, A. Sasidharan, S. Sinha, K. Mukhopadhyay","doi":"10.14311/NNW.2020.30.024","DOIUrl":"https://doi.org/10.14311/NNW.2020.30.024","url":null,"abstract":"Background : Specific frequency oscillations provide idea about functioning of underlying brain regions. Brain oscillations and event based assessment of cognitive functions like working memory (WM), impulsivity (Imp) and emotional regulation (ER) were reported to influence each other in different ethnic groups. But how these traits are regulated in healthy Indian adults was not explored widely. Aims: We analyzed link between scalp electrical activity and different neuropsychological traits in higher education aspirants. Method: All the traits were self-assessed using standard questionnaires. QEEG was performed during an audio-sensory session. Tracings collected through BESS software were analyzed using SPSS. Results: Less impulsive individuals exhibited higher frontal theta and beta activity. Higher frontal theta activity was associated with higher ER, whereas higher theta and alpha activity showed association with WM deficit. Individuals with higher Imp and happiness exhibited higher frontal hemispheric asymmetry for theta and alpha, while those with lower asymmetry for alpha and beta activity showed higher ER. Beta asymmetry was positively related with happiness. Conclusions: We infer that variability in behaviour of healthy adults is influenced by differential frontal brain impulses and could be considered for providing individualized assistance to emotionally vulnerable individuals.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"93 1","pages":"365-378"},"PeriodicalIF":0.8,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67124376","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
AN OPTIMAL DATA AGGREGATION SCHEME FOR WIRELESS SENSOR NETWORK USING QOS PARAMETERS WITH EFFICIENT FAILURE DETECTION AND LOSS RECOVERY TECHNIQUE 一种基于qos参数的无线传感器网络数据聚合方案,并结合有效的故障检测和损失恢复技术
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2019-01-01 DOI: 10.14311/nnw.2019.29.019
A. R. Basha, C. Yaashuwanth
{"title":"AN OPTIMAL DATA AGGREGATION SCHEME FOR WIRELESS SENSOR NETWORK USING QOS PARAMETERS WITH EFFICIENT FAILURE DETECTION AND LOSS RECOVERY TECHNIQUE","authors":"A. R. Basha, C. Yaashuwanth","doi":"10.14311/nnw.2019.29.019","DOIUrl":"https://doi.org/10.14311/nnw.2019.29.019","url":null,"abstract":"WSN: Wireless Sensor Networks play a significant part in its modern era but its limited power supply acts as a blocking stone in it growth. In order to save energy in WSN the concept of aggregator node is introduced, where the aggregator node would act as a mid-point between the source and destination node during the data transmission. The data aggregation process creates major problems like excess energy expenditure, and delay. In the process of eliminating or reducing the delay and energy expenditure, the researchers have been handled in different ways. Applications like environment monitoring, target tracking, military surveillance and health care require reliable and accurate information. Many researchers have proposed data aggregation techniques to enhance the latency, average energy consumption and average network lifetime. However, these techniques are not sufficient to address situations like node failure and loss recovery. This paper proposes to build a solid wireless sensor system which concentrate on efficient optimal data aggregation along with additional QoS metrics such as failure detection and loss recovery. The first contribution of this paper is to propose an Improved Wolf Optimization (IWO) algorithm for clustering. The clustering process includes an efficient cluster formation like, Cluster Head (CH), and Sub Head (SH) selection. The second contribution of this paper is inclusion of failure detection and loss recovery. The former is developed based on Multi-criteria Moths-Flame Decisionmaking (MMFD) model and the latter is achieved through SH. SH node will act as the backup node for cluster head when failure instances are detection. CH recovers the lost data through SH, which minimize the additional delay of backup node selection process and save much more energy. The results are simulated using network simulator 2 tool and it is compared with existing techniques. The Network Simulator – 2 results disclose that the findings are better than the available existing methodologies.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67123021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
REGP: A NEW POOLING ALGORITHM FOR DEEP CONVOLUTIONAL NEURAL NETWORKS Regp:一种新的深度卷积神经网络池化算法
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2019-01-01 DOI: 10.14311/NNW.2019.29.004
Ozal Yildirim, U. Baloglu
{"title":"REGP: A NEW POOLING ALGORITHM FOR DEEP CONVOLUTIONAL NEURAL NETWORKS","authors":"Ozal Yildirim, U. Baloglu","doi":"10.14311/NNW.2019.29.004","DOIUrl":"https://doi.org/10.14311/NNW.2019.29.004","url":null,"abstract":"In this paper, we propose a new pooling method for deep convolutional neural networks. Previously introduced pooling methods either have very simple assumptions or they depend on stochastic events. Different from those methods, RegP pooling intensely investigates the input data. The main idea of this approach is finding the most distinguishing parts in regions of the input by investigating neighborhood regions to construct the pooled representation. RegP pooling improves the efficiency of the learning process, which is clearly visible in the experimental results. Further, the proposed pooling method outperformed other widely used hand-crafted pooling methods on several benchmark datasets.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67120365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
DEEP HOG: A HYBRID MODEL TO CLASSIFY BANGLA ISOLATED ALPHA-NUMERICAL SYMBOLS 深猪:分类孟加拉语孤立字母数字符号的混合模型
IF 0.8 4区 计算机科学
Neural Network World Pub Date : 2019-01-01 DOI: 10.14311/NNW.2019.29.009
S. Sharif, M. Mahboob
{"title":"DEEP HOG: A HYBRID MODEL TO CLASSIFY BANGLA ISOLATED ALPHA-NUMERICAL SYMBOLS","authors":"S. Sharif, M. Mahboob","doi":"10.14311/NNW.2019.29.009","DOIUrl":"https://doi.org/10.14311/NNW.2019.29.009","url":null,"abstract":"Bangla is known to be the second most widely used script in the South Asian region. Despite its wide usage, a complete study with all available Bangla handwritten image classes is still due. This work proposes a hybrid model to classify all available handwritten image classes and unifying the existing benchmark datasets. The feasibility of the different handcrafted features in the hybrid model also has been demonstrated. Moreover, the proposed hybrid model obtain a maximum accuracy of 89.91 % in validation phase with a total of 259 Bangla alpha-numerical image classes. With the same number of image classes, the proposed hybrid model shows a testing accuracy of 89.28 % on 15,175 testing samples. The comparison results demonstrate that the proposed hybrid-HOG model can outperform the existing state-of-the-art classification models in Bangla handwritten alpha-numerical image classification. The code will be available on https://github.com/sharif-apu/hybrid-259.","PeriodicalId":49765,"journal":{"name":"Neural Network World","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67122887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信