{"title":"An Efficient Parallel Algorithm for Mining Both Frequent Closed and Generator Sequences on Multi-core Processors","authors":"Hai V. Duong, Tin C. Truong, Bac Le","doi":"10.1109/NICS.2018.8606896","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606896","url":null,"abstract":"Compared to frequent sequence mining that is a computationally challenging task with many intermediate subsequences, frequent closed and generator sequence mining provides several benefits because it results in increased efficiency and concise representations while preserving all the information of all traditional patterns recovered from the representations. Besides, frequent closed sequences can be combined with generators to generate non-redundant sequential rules and to recover all sequential patterns as well as their frequencies quickly. However, most algorithms that have been proposed to discover either closed sequences or generators at a time and for large databases containing many long sequences are still too long to complete the work or run out of memory. Therefore, this paper, by exploiting the advantage of multi-core processor architectures, proposes a novel parallel algorithm called Par-GenCloSM for simultaneously mining both frequent closed and generator sequences in the same process. Par-GenCloSM is based on efficient techniques to quickly eliminate unpromising candidate branches and two novel strategies named EPUCloGen and GPPCloGen to reduce the global synchronization cost of the parallel model and speed up the mining process. Par-GenCloSM is the first parallel algorithm for mining frequent closed sequences and generators concurrently. Experimental results on many real-life and synthetic databases show that Par-GenCloSM outperforms state-of-the-art algorithms in terms of runtime and memory consumption, especially for long sequence databases with low minimum support thresholds.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126467266","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}
Duy Thanh Tran, H. Vo, Dung Duc Nguyen, Quan Anh Minh Nguyen, Liem T Huynh, Ly Thi Le, H. Trong, T. Quan
{"title":"A Predictive Model for ECG Signals Collected from Specialized IoT Devices using Deep Learning","authors":"Duy Thanh Tran, H. Vo, Dung Duc Nguyen, Quan Anh Minh Nguyen, Liem T Huynh, Ly Thi Le, H. Trong, T. Quan","doi":"10.1109/NICS.2018.8606828","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606828","url":null,"abstract":"Early detection and prediction of cardiac anomalies play an important role in the diagnosis and treatment of cardiovascular diseases. In medicine, electrocardiography provides valuable information for the doctors since they can accurately determine what is happening concerning the heart activities. Nevertheless, electrocardiography classification is a non-trivial challenge due to the specialties of these data as well as the reliability of manual data collection methods. With the recent advancement of the IoT technologies, some wearable IoT devices for electrocardiography monitoring have been developed. However, the data collected from those devices, though possibly automatic, pose more challenging issues for the problem of electrocardiography classification. In this paper, we propose a novel solution for electrocardiography signal classification based on Deep Learning by combining Auto Encoder and Long-Short Term Memory models to handle data collected from intelligent IoT devices Shimmer and VitalSigns Holter.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128299821","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":"Integrating Grammatical Features into CNN Model for Emotion Classification","authors":"T. Huynh, Anh-Cuong Le","doi":"10.1109/NICS.2018.8606875","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606875","url":null,"abstract":"Emotion analysis is currently an attractive research topic in data mining and natural language processing. Along with the development of technology, people are also gradually evolving to post their emotional thinking on social media. Emotional information is useful for various aspects of business such as advertisement. Automatically classifying user emotions therefore becomes very important. In this paper we firstly formulate this problem under Convolutional Neural Network (CNN) framework. Actually language to express emotions is very diverse that make deep learning techniques such as CNN are ineffective in feature learning when the training data is not large enough. To solve this problem, we propose to use predefined grammatical patterns, which contain potential emotional information, to extract external features and integrate them into the CNN model. Our experiment are performed on two datasets, the ISEAR11http://affective-sciences.org/home/research/materials-and-onlineresearch/research-material/ (International Survey On Emotion Antecedents And Reactions) dataset and the Vietnamese emotion dataset. The experimental results show that the proposed model is very effective in comparison with previous studies.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114212652","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":"Time-Frequency Distribution for Undersampled Non-stationary Signals using Chirp-based Kernel","authors":"Y. Nguyen, D. McLernon, M. Ghogho, A. Zaidi","doi":"10.1109/NICS.2018.8606839","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606839","url":null,"abstract":"Missing samples and randomly sampled non-stationary signals give rise to artifacts that spread over both the time-frequency and the ambiguity domains. These two domains are related by a two-dimensional Fourier transform. As these artifacts resemble noise, the traditional reduced interference signal-independent kernels, which belong to Cohen’s class, cannot mitigate them efficiently. In this paper, a novel signal-independent kernel in the ambiguity domain is proposed. The proposed method is based on three important facts. Firstly, any windowed non-stationary signal can be approximated as a sum of chirps. Secondly, in the ambiguity domain, any chirp resides inside certain regions, which just occupy half of the ambiguity plane. Thirdly, the missing data artifacts always appear along the Doppler axis where the chirps auto-terms do not appear. Therefore, we propose using a chirp-based fixed kernel on windowed non-stationary signals in order to remove half of the noise-like artifacts in the ambiguity domain and compensate for the missing data effect located along the Doppler axis. It is shown that our method outperforms other reduced interference time-frequency distributions.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116996985","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":"Energy-Efficient and Low Complexity Channel Coding for Wireless Body Area Networks","authors":"Hieu T. Nguyen, T. Nguyen","doi":"10.1109/NICS.2018.8606883","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606883","url":null,"abstract":"A new design framework based on the modified protograph extrinsic information transfer (PEXIT) algorithm is proposed for wireless body area networks (WBAN) communication systems. Using the proposed framework, a protograph LDPC code of rate 1/2 is designed for the WBAN channel which is statistically modelled as Rician distribution with K-factor obtained from the path loss model. The proposed protograph LDPC coded system achieves a significant coding gain of 17.5 dB over the uncoded system. This coding gain is much higher than the coding gain (6.1 dB) of irregular LDPC coded system in the additive white Gaussian noise (AWGN) channel reported previously for wireless sensor networks. This significant coding gain together with the low complexity encoder/decoder makes the protograph LDPC code an excellent candidate for WBAN communication systems where energy and complexity are among very demanding technical requirements.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124129448","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":"Improving Phonetic Recognition with Sequence-length Standardized MFCC Features and Deep Bi-Directional LSTM","authors":"Toan Pham Van, Hau Nguyen Thanh, Ta Minh Thanh","doi":"10.1109/NICS.2018.8606886","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606886","url":null,"abstract":"Phonetic recognition is one of the most challenging problems in the field of speech analysis. These applications can be mentioned such as dialect identification [1], mispronunciation detection [2], spoken document retrieval [3], and so on. There are different approaches to solve these problems such as improving the feature selection on input speech [4], applying deep learning technique [5] [6] [7] or combining both of them [8]. With the sequence data as the phonetics, the architecture which is based on recurrent neural network (RNN) is an appropriate approach [9]. It is even more powerful when combined with the improvement of features selection on input data. In our approach, we combine the Mel Frequency Cepstral Coefficients (MFCC) method with sequence-length to present the acoustic features of speech and use some RNN models to phonetic classification. Our experiments are implemented on the Texas Instruments Massachusetts Institute of Technology (TIMIT) [10] phone recognition dataset. Especially, our data processing and features selection method give consistently better results than other researches using the same neural network model. Currently, we have achieved the lowest error test rate (13.05%) by using Bidirectional LSTM, which is the best result in TIMIT dataset with the reduction of about 3.5% over the last best result [5] [6].","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129527916","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}
Van-Thanh Ta, Yen Hoang Thi, Han Le Duc, Van‐Phuc Hoang
{"title":"Fully Digital Background Calibration Technique for Channel Mismatches in TIADCs","authors":"Van-Thanh Ta, Yen Hoang Thi, Han Le Duc, Van‐Phuc Hoang","doi":"10.1109/NICS.2018.8606871","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606871","url":null,"abstract":"Time-interleaved analog-to-digital converter (TIADC) is a promising approach to meet the requirement of very high speed wireless communication systems. However, mismatches between the channels in a TIADC cause the spurious images in the output spectrum, thus decreasing its performance. Therefore, efficient correction techniques for these mismatches are highly required. In this paper, we present a fully digital background calibration technique for channel mismatches including offset, gain and timing mismatches in TIADCs using Hadamard transform and average offset mismatch errors. The proposed technique results in the removal of spurious images from the TIADC output spectrum, thus increases the signal-to-noise-and-distortion ratio (SNDR) and spurious-free dynamic range (SFDR). The performance improvement of TIADCs employing this technique is demonstrated through numerical simulations.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130012703","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":"Invited Talk #2 Vietnamese Neural Language Model for NLP Tasks With Limited Resources","authors":"Q. T. Tho","doi":"10.1109/NICS.2018.8606865","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606865","url":null,"abstract":"A statistical language model is a probability distribution over sequences of words. Language modeling is used in various computing tasks such as speech recognition, machine translation, optical character and handwriting recognition and information retrieval and other applications. Whereas n-gram is considered as a traditional language model, neural language model has been emerging recently as a means to approximate the probability of a sentence using neural networks and word embeddings. An advantage of a neural language model is that it can be further applied to other NLP tasks where the training datasets may be limited. In this talk, we realize this idea by introducing the usage of a Vietnamese neural model language trained from a large corpus of social media data. When further applying this neural model language with other NLP tasks including entity recognition, spam detection and topic modeling with relatively small training datasets; we witness improved performance achieved, as compared to other existing approaches using deep learning with typical word embedding techniques.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134267730","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":"Occluded Image Recognition with Extended Nonnegative Matrix Factorization","authors":"Viet-Hang Duong, Manh-Quan Bui, Jia-Ching Wang","doi":"10.1109/NICS.2018.8606869","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606869","url":null,"abstract":"This paper addresses the challenge of recognizing face and facial expression under occlusion situations. We have introduced an extension of nonnegative matrix factorization called angle and graph constrained nonnegative matrix factorization (AGNRIF). The proposed model is developed in term of minimizing angle of basic cone and preserving the geometrical structure of the projective data. The experimental results in the context of occluded images demonstrate that the technique of enforcing constraints on both basic and encoding matrices works well and the AGNMF method shows superior performance to other conventional NRIF approaches.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133916409","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}
Phu X. V. Nguyen, T. T. T. Hong, Kiet Van Nguyen, N. Nguyen
{"title":"Deep Learning versus Traditional Classifiers on Vietnamese Students’ Feedback Corpus","authors":"Phu X. V. Nguyen, T. T. T. Hong, Kiet Van Nguyen, N. Nguyen","doi":"10.1109/NICS.2018.8606837","DOIUrl":"https://doi.org/10.1109/NICS.2018.8606837","url":null,"abstract":"Student’s feedback is an important source of collecting students’ opinions to improve quality of training activities. Implementing sentiment analysis into student feedback data, we can determine sentiments polarities which express all problems in the institution since changes necessary will be applied to improve the quality of teaching and learning. This study focused on the machine learning and natural language processing techniques (Naive Bayes, Maximum Entropy, Long Short-Term Memory, Bi-Directional Long Short-Term Memory) on the Vietnamese Students’ Feedback Corpus collected from a university. The final results were compared and evaluated to find the most effective model based on different evaluation criteria. The experimental results show that Bi-Directional Long Short-Term Memory algorithm outperformed than three other algorithms in term of the F1-score measurement with 92.0% on the sentiment classification task and 89.6% on the topic classification task. In addition, we developed a sentiment analysis application analyzing student feedback. The application will help the institution to recognize students’ opinions about a problem and identify shortcomings that still exist. With the use of this application, the institution can propose an appropriate method to improve the quality of training activities in the future.","PeriodicalId":137666,"journal":{"name":"2018 5th NAFOSTED Conference on Information and Computer Science (NICS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131378004","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}