Ge Zhang, Pengyuan Zhang, Jielin Pan, Yonghong Yan
{"title":"Fast variable-frame-rate decoding of speech recognition based on deep neural networks","authors":"Ge Zhang, Pengyuan Zhang, Jielin Pan, Yonghong Yan","doi":"10.1109/FSKD.2017.8393381","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8393381","url":null,"abstract":"Deep neural networks (DNN) have recently shown impressive performance as acoustic models for large vocabulary continuous speech recognition (LVCSR) tasks. Typically, the frame shift of the output of neural networks is much shorter than the average length of the modeling units, so the posterior vectors of neighbouring frames are likely to be similar. The similarity, together with the better discrimination of neural networks than typical acoustic models, shows a possibility of removing frames of neural network outputs according to the distance of posterior vectors. Then, the computation costs of beam searching can be effectively reduced. Based on that, the paper introduces a novel variable-frame-rate decoding approach based on neural network computation that accelerates the beam searching for speech recognition with minor loss of accuracy. By computing the distances of posterior vectors and removing frames with a posterior vector similar to the previous frame, the approach can make use of redundant information between frames and do a much quicker beam searching. Experiments on LVCSR tasks show a 2.4-times speed up of decoding compared to the typical framewise decoding implementation.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128157478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Carneiro, J. Rosa, Qiusheng Zheng, Xiaoming Liu, Liang Zhao
{"title":"Improving semantic role labeling using high-level classification in complex networks","authors":"M. Carneiro, J. Rosa, Qiusheng Zheng, Xiaoming Liu, Liang Zhao","doi":"10.1109/FSKD.2017.8393113","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8393113","url":null,"abstract":"While traditional supervised learning methods perform classification based only on the physical features of the data (e.g. distribution, similarity or distance), the high-level classification is characterized by its ability to capture topological features of the input data by using complex network measures. Recent works have shown that a variety of patterns can be detected by combining both features of the data, although the physical features alone are unable to uncover them. In this article we investigate such a hybrid method for the Semantic Role Labeling (SRL) task, which consists of the identification and classification of arguments in a sentence with roles that indicate semantic relations between an event and its participants. Due to its potential to improve many other natural language processing tasks, such as information extraction and plagiarism detection to name a few, we consider the SRL task over a Brazilian Portuguese corpus named PropBank-br, which was built with texts from Brazilian newspapers. Such a corpus represents a challenging classification problem as it suffers with the scarcity of annotated data and very imbalanced distributions, like the majority of non-English corpus. Experiments were performed considering the argument classification task over the whole corpus and, specifically, over the most frequent verbs. Results in the verb-specific scenario revealed that the high-level system is able to obtain a considerable gain in terms of predictive performance, even over a state-of-the-art algorithm for SRL.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114487045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A data fusion equipment monitoring method based on fuzzy set and improved D-S evidence theory","authors":"Han Ding, Ruichun Hou, Xiangqian Ding","doi":"10.1109/FSKD.2017.8392912","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8392912","url":null,"abstract":"In order to solve data problems with redundant, conflict and uncertainty in monitoring large mechanical equipment, a data fusion equipment monitoring method is proposed through the combination of fuzzy set and improved D-S evidence theory. Firstly, a recognition framework is built based on the actual situation of the equipment. Then, the likelihood of the attributes is calculated according to the fuzzy set membership function and the sensor's observation function, and the likelihood is used to determine the basic belief assignment function value of the attributes. Finally, the data fusion is carried out using the weight-based D-S's combination rule, and the state of equipment can be derived from the data fusion results. A simulation of monitoring method with application to the ozone generator is carried out using the proposed method, the results show that the accuracy of the proposed method is proved, and the uncertainty of the results is obviously reduced comparing with classic analyzing methods, which concludes that the proposed method has a practical significance in monitoring the state of equipment.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114813228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A data selection framework for k-means algorithm to mine high precision clusters","authors":"Zhengzheng Lou, Chaoyang Zhang","doi":"10.1109/FSKD.2017.8393013","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8393013","url":null,"abstract":"Traditional clustering algorithms employ all the data items to learn the cluster patterns. However, in real-world applications, some data show clear coherent behaviour and can be summarized well, while some data present weak tendencies to be assigned to any particular pattern. For such situation, this paper presents a data selection framework for K-Means algorithm to get high precision clusters from the data collection. It differs from traditional k-means-type algorithms in three respects. First, in the cluster learning process, we take the changed value of cluster's Bregman Information, which is generated by merging one data item into the potential clusters, as the measure of data item's clustering tendency. Second, only data items with strong clustering tendencies, that is the changed value of cluster's Bregman Information is less than the predefined radius, are selected to learn the cluster patterns, while the remaining data points are ignored and belong to no cluster. The clustering is non-exhaustive. Third, the radius of the clusters can be changed in the learning process. It is a dynamic learning framework. Experiments on synthetic, document and image data show the effectiveness of the proposed algorithm.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115879939","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Risk index assessment for urban natural gas pipeline leakage based on artificial neural network","authors":"Yang Zhou, Zhengwei Wu","doi":"10.1109/FSKD.2017.8392945","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8392945","url":null,"abstract":"With large-scale construction of urban natural gas pipelines, the occurrence of accidents such as fire, explosion owing to natural gas pipeline leakage has increased. How to make appropriate response strategy for urban natural gas pipeline leakage is an important topic for urban safety planner. This paper proposed an assessment program to evaluate risk of urban natural gas pipeline leakage. This system uses artificial neural network mode, which includes 10 inputs such as methane concentration, weather, corrosion, to simulate risk index of pipeline leakage. The 97-day field operation results showed that the risk index match well with field situation, which indicates the reliability and practicability of the assessment program.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115110310","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A multidimensional time-series association rules algorithm based on spark","authors":"Dongyue Liu, Bin Wu, Chao Gu, Yan Ma, Bai Wang","doi":"10.1109/FSKD.2017.8393066","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8393066","url":null,"abstract":"Fault prediction of industrial systems has been a hot research orientation in recent years, which allows the maintainer to know the operation conditions and the fault to be occurred in advance so as to reduce the risk of fault and the economic loss. In general, association rules learning is one of the most effective methods in fault prediction of industrial systems, however, traditional methods based on association rules are not suitable for sparse time-series data that are common in industrial systems (e.g. transmission line data). Although some methods based on clustering to reduce the dimension of data have been proposed, these methods may lose some of the key rules from the dataset and reduce the effectiveness of the results. In order to solve the problem, we propose a novel algorithm called Multidimensional Time-series Association Rules(MTAR) in this paper, which can fully utilize the information and find out more valuable rules from multidimensional time-series data. Meanwhile, we implement the parallelization of the algorithm based on the parallel computing framework Spark, which can improve the performance of the algorithm greatly. Experiments are conducted on the transmission line dataset in Power Grid System to show the effectiveness and the efficiency of the proposed approach.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125346576","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaofei Chang, Lei Liu, Mengtao Sun, Yalu Jia, Chunxia Zhang
{"title":"A feature optimization algorithm of concept similarity based on Chinese wikipedia","authors":"Xiaofei Chang, Lei Liu, Mengtao Sun, Yalu Jia, Chunxia Zhang","doi":"10.1109/FSKD.2017.8393108","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8393108","url":null,"abstract":"Concept similarity measure based on feature vector has wide application in various fields, but the problems of polysemy and synonym existing in feature vector affect the similarity measure. We present a feature optimization algorithm based on Chinese Wikipedia which can reduces this effect. First we build a POS feature dictionary (POS-Dic) and a POS Tongyici Cilin(POS-Cilin), and then a new feature vector is used for concept similarity measure. Experiments show that the algorithm effectively reduces the influence of polysemy and synonym on the concept similarity measure.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125725941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A parallel clustering and test partitioning techniques based mining trajectory algorithm for moving objects","authors":"Qian He, Yiting Chen, Qinghe Dong, Dongsheng Cheng","doi":"10.1109/FSKD.2017.8393312","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8393312","url":null,"abstract":"In recent years, the intelligent transportation system has been widely used to deal with traffic problems. The analysis of traffic incident is important in intelligent transportation field, and gathering patterns can model various traffic incidents. However, with the increasing amount of moving trajectory data, the traditional mining algorithms of gathering patterns cannot effectively analyze trajectory data. In this paper, we propose a parallel algorithm RDD-Gathering to discover the gathering patterns in massive trajectory data. Based on the algorithm, we further design a system framework of traffic incident analysis and prediction, which can realize the prediction of the abnormal traffic events. Finally, the accuracy and efficiency of the proposed algorithms are validated by extensive experiments based on a real trajectory dataset, and the results of experiments show that the proposed method can effectively improve the efficiency of gathering retrieval.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127182168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Information consistency in information-centric networking","authors":"Lan Shi, Peng Yin, Jianhui Lv, Ying Zhao","doi":"10.1109/FSKD.2017.8393228","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8393228","url":null,"abstract":"Information-Centric Networking (ICN) has drawn much attention and many reports have been published. However, there also exist many problems in the information management of ICN. In this paper, we mainly propose an information consistency algorithm named Breadth First Search Limit Arrangement Principle (BFSLAP). We use this algorithm to establish a new network architecture which is based on ICN information consistency. We describe the way to set up the information consistency architecture in ICN. In addition, we propose an all-gram model and a T-value formula to extract the features of contents' names. Then, we classify the contents according to these features. At last, the simulation results indicate that our BFSLAP algorithm is better than the original flooding algorithm.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130855225","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Miao Ma, Weige Zheng, Jie Wu, Kaifang Yang, Min Guo
{"title":"Multi-level image thresholding based on improved fireworks algorithm","authors":"Miao Ma, Weige Zheng, Jie Wu, Kaifang Yang, Min Guo","doi":"10.1109/FSKD.2017.8393414","DOIUrl":"https://doi.org/10.1109/FSKD.2017.8393414","url":null,"abstract":"Aiming at achieving the optimal multi-level thresholding quickly and effectively for the image segmentation, this paper proposes an improved fireworks algorithm based image segmentation method. The proposed method transforms the multi-level thresholding problem into a multivariate combinational optimization problem and then improved the fireworks algorithm for a better image segmentation. Meanwhile, the Otsu method is adopted as the fitness function, and the global search and the local search in the improved fireworks algorithm method is utilized to achieve multi-level thresholding concurrently and efficiently. The experimental results show that the improved fireworks algorithm based image segmentation method can significantly improve the segmentation efficiency comparing with other swarm intelligence algorithm based image segmentation methods.","PeriodicalId":236093,"journal":{"name":"2017 13th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134210263","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}