Ashok Dhakal, A. Alsadoon, P. Prasad, Angelika Maag, A. Elchouemi, Win Maung, V. Q. Nguyen
{"title":"Wearable Devices for Monitoring Dementia Sufferers: A Review and Framework for Discussion","authors":"Ashok Dhakal, A. Alsadoon, P. Prasad, Angelika Maag, A. Elchouemi, Win Maung, V. Q. Nguyen","doi":"10.1109/KSE.2019.8919373","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919373","url":null,"abstract":"A growing number of people suffer from dementia and need to be monitored for safety. Options are nursing homes or home monitoring through smart devices. This article aims to provide an overview of available technology for indoor and outdoor monitoring. We also propose a framework through which current and future systems can be evaluated consisting of Data, Transfer and Storage and Monitoring (DTSM). We analyze wearable devices, means of data collection and data transfer, data accessibility during storage and throughout analysis. We evaluate the DTSM framework in terms of completeness and acceptance. 30 state of the art research papers are classified to identify systems components, evaluated against the DTSM taxonomy. This research contributes to future systems development underpinning wearable devices for the purpose of tracking human activities.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"241 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116135938","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":"Forecasting Trading-Time based Profit-Making Strategies in Forex Industry: Using Australian Forex Data","authors":"Mihiran Rupasinghe, M. Halgamuge, N. Q. Vinh","doi":"10.1109/KSE.2019.8919432","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919432","url":null,"abstract":"Due to the constant fluctuation on global currency rates, it is challenging to make predictions on trading in foreign exchange (Forex) currency market without an intensive analysis; hence, traders struggle to make a profit. This study aims to analyze the relationship between the trade open time and profit in the Forex currency market to help traders to increase the chance of winning trades and make a profit. We developed a technique to observe the most suitable time duration to trade and the profit. This technique assists traders to enhance the chance of winning trades and make a profit by identifying whether it is more likely to make a profit when they keep the trade opened for a longer time or a shorter time. A Forex dataset (N=1,000,000 trades) from a third-party broker database based in Australia has been used. The collected data were filtered according to the popularity of currency pairs. Five currency pairs (as EUR vs USD, GBP vs JPY, USD vs JPY, GBP vs USD and EUR vs JPY) were further analyzed using Support Vector Machine (SVM) with the Radial Basis Function (RBF) kernel and K-Means clustering algorithms. It showed that EUR vs USD and USD vs JPY have sensitive movements of profit with the trading time. The highest profit was observed trading time in between 5 to 15 minutes. Our analysis illustrates that shorter time traders are making more profits than the longer time traders. Hence, this study demonstrates that Forex traders make a profit when the market has a unique volatile situation. This study should be useful as a reference for researches in Forex market analyses and Forex Industry to utilize profitmaking strategies.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132146919","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":"Deep Feature Fusion for Breast Cancer Diagnosis on Histopathology Images","authors":"Hung Le Minh, Manh Mai Van, T. Lang","doi":"10.1109/KSE.2019.8919462","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919462","url":null,"abstract":"This paper presents a deep feature fusion method based on the concept of 'residual connection' of ResNet to effectively extract distinguishable features which help to improve the classification performance of the Breast cancer prediction on histopathology images. Specifically, we fuse the features extracted from different blocks of Inception-V3 to merge the features learned. The concatenated features are considered as rich information which could capture the deep features of the images. Three experiments were also conducted to investigate the three factors that may affect the classification performance: 1) Feature extractor or Fine-tuningƒ 2) Normalization vs. Non-normalization and 3) The effectiveness of our deep feature fusion method. The dataset used in this study includes 400 microscopy images collected from the ICIAR 2018 Grand Challenge on Breast Cancer histopathology images. The images are divided into 4 classes which indicate the aggressiveness levels of breast cancer, described as Normal (N), Benign (B), In Situ Carcinoma (IS) or Invasive Carcinoma (IV) according to the predominant cancer type in each image. Experimental results show that our proposed deep feature fusion method can achieve a very high classification accuracy with 95% in distinguishing 4 types of cancer classes and 97.5% for differentiating two combined groups of cancer, which are Carcinoma (N+B) and Non-carcinoma (IS+IV).","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133929531","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":"Clustering Automation Test Faults","authors":"X. Nguyen, Phu-Khoa Nguyen, Vu Nguyen","doi":"10.1109/KSE.2019.8919435","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919435","url":null,"abstract":"Black-box user interface testing has become a powerful and popular approach in automated software testing. Since the increasing number of test cases which need to be run at each iteration leads to more execution faults, the process of analyzing test failures to find the root cause or to triage usually consumes much effort. Hence, there is a need that these errors be clustered into groups based on their root cause to facilitate debugging and maintenance purposes. In this paper, we propose an automated text clustering approach along with a semi-automated version for clustering errors in term of their root causes which can help save a lot of effort in triaging and fixing bugs. Our experiment uses datasets from three different projects, two of which are industrial ones, with more than 300 errors generated in total. The results show that our approach outperforms other existing baseline methods that are utilized widely in classification and clustering field indicating that the strategy may be effective.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133381036","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}
Pham Van Ha, N. X. Truong, D. Laffly, A. Jourdan, N. T. Thanh
{"title":"Evaluation of Maximum Likelihood Estimation and regression methods for fusion of multiple satellite Aerosol Optical Depth data over Vietnam","authors":"Pham Van Ha, N. X. Truong, D. Laffly, A. Jourdan, N. T. Thanh","doi":"10.1109/KSE.2019.8919417","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919417","url":null,"abstract":"This paper applied different data fusion methods including Maximum Likelihood Estimation (MLE) and Linear Regression methods on satellite images over Vietnam areas from Moderate Resolution Imaging Spectroradiometer (MODIS) and Visible Infrared Imaging Radiometer Suite (VIIRS) sensors. In comparison with ground station Aerosol Robotic Network (AERONET), the regression method is better than Maximum Likelihood Estimator (MLE). Our results show that the fusion methods can improve both data coverage and quality of satellite aerosol optical depth (AOD). Strong correlations were observed between fused AOD and AERONET AOD (R2 = 0.8118, 0.7511 for Terra regression and MLE method, respectively). This paper presented the evaluation of data fusion algorithm and highlighted its importance on the satellite AOD data coverage and quality methods from multiple sensors.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502171","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 multi-objective cooperative coevolutionary approach for remote sensing image classification.","authors":"V. Vu, L. Bui, Trung-Thanh Nguyen","doi":"10.1109/KSE.2019.8919371","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919371","url":null,"abstract":"A current problem that classification algorithms on high-resolution satellite images are addressing is the feature selection problem (FSP). The number of object’s features on satellite images is often very large. However, not all these features contribute equally to the classification results. There are still many redundant, unrelated features. It is, therefore, necessary to select these features before performing the classification step. Besides, with the selected feature set, selecting a suitable classifier also plays a very important role. In this study, the authors solve this problem with a multi-objective co-operative co-evolutionary approach (MCCA). In the MCCA, we use two populations evolving together: one population helps to find the most important set of features (named Feature population) and the other helps to get the most appropriate classifier (named Classifier population). The performance of the MCCA is examined on three satellite image datasets. From experimental results, the proposed algorithm has shown the efficiency in improving classification accuracy as well as reducing the number of characteristics.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122270985","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 corpus for aspect-based sentiment analysis in Vietnamese","authors":"Minh-Hao Nguyen, T. Nguyen, D. Thin, N. Nguyen","doi":"10.1109/KSE.2019.8919448","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919448","url":null,"abstract":"Recently, researchers have shown an increased interest in the aspect-based sentiment analysis problem. The goal is to extract valuable information concerning the aspects mentioned in users comments. This problem can be divided into three sub-tasks: term extraction, aspect detection, and polarity detection. In this paper, we present a new annotated corpus for studies on the two sub-tasks: aspect detection and polarity detection. Our corpus includes 7,828 restaurant reviews at document-level. We also performed a supervised learning method with rich features, achieving the F1-score of 87.13% for the aspect detection and the F1-score of 59.20% for polarity detection. Our corpus is published for research purpose1.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129862747","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}
Hong-Nhung Bui, Trong-Sinh Vu, Tri-Thanh Nguyen, Thi-Cham Nguyen, Quang-Thuy Ha
{"title":"A Compact Trace Representation Using Deep Neural Networks for Process Mining","authors":"Hong-Nhung Bui, Trong-Sinh Vu, Tri-Thanh Nguyen, Thi-Cham Nguyen, Quang-Thuy Ha","doi":"10.1109/KSE.2019.8919355","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919355","url":null,"abstract":"In process mining, trace representation has a significant effect on the process discovery problem. The challenge is to get highly informative but low-dimensional vector space from event logs. This is required to improve the quality of the trace clustering problem for generating the process models clear enough to inspect. Though traditional trace representation methods have specific advantages, their vector space often has a big number of dimensions. In this paper, we address this problem by proposing a new trace representation method based on the deep neural networks. Experimental results prove our proposal not only is better than the alternatives, but also significantly helps to reduce the dimension of trace representation.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129186039","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":"On the Traveling Salesman Problem with Hierarchical Objective Function","authors":"T. Dam, D. T. Nguyen, Q. Bui, T. Do","doi":"10.1109/KSE.2019.8919421","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919421","url":null,"abstract":"We address a novel variant of the wellknown Traveling Salesman Problem (TSP) called the Traveling Salesman Problem with Hierarchical Objective (TSPHO). In this problem, the customers are divided in to several groups with decreasing priority levels, i.e., the first group is more important than the second one and the second one is more important than the third one, and so on. The difference between TSPHO and the classical TSP lies in the objective function. The Hierarchical Objective does not minimize the total travel cost, but aims to minimize the completion time of the first group then the completion time of the second group, etc. A transformation of the TSPHO into an equivalent Asymmetric TSP is first proposed from which one can use efficient TSP solvers such as Concorde or Lin-Kernighan-Helsgaun (LKH) to solve the problem. A genetic algorithm is also developed as an alternative solution. Computational results show the performance of our methods.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115549889","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}
Hoang Duc Vinh, Vu Van Son, T. Hoang, C. Ta, Pham Thanh Hiep
{"title":"Performance Analysis of NOMA Beamforming Multiple Users Relay Systems","authors":"Hoang Duc Vinh, Vu Van Son, T. Hoang, C. Ta, Pham Thanh Hiep","doi":"10.1109/KSE.2019.8919322","DOIUrl":"https://doi.org/10.1109/KSE.2019.8919322","url":null,"abstract":"In order to improve performance of multiple users (MUs) systems, several relays are deployed to help a base station (BS) decode and forward signals to end users. We propose that the BS utilize a beamforming approach to transmit its signal to relays, and then relays forward the received signals to users by non-orthogonal multiple access (NOMA) scheme. The system performance is shown through a close-form outage probability over Rayleigh fading channel with assumption of perfect successive interference cancellation. The calculation results are compared with simulation results to verify our theoretical analysis. Furthermore, the proposed combination of NOMA and beamforming method is compared with the conventional orthogonal multiple access method and an impact of imperfect channel state information on the system performance is also discussed.","PeriodicalId":439841,"journal":{"name":"2019 11th International Conference on Knowledge and Systems Engineering (KSE)","volume":"198 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114189825","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}