Ngoc-Dong Pham, Thi-Hanh Le, Thanh-Dat Do, Thanh-Toan Vuong, Thi-Hong Vuong, Quang-Thuy Ha
{"title":"Vietnamese Fake News Detection Based on Hybrid Transfer Learning Model and TF-IDF","authors":"Ngoc-Dong Pham, Thi-Hanh Le, Thanh-Dat Do, Thanh-Toan Vuong, Thi-Hong Vuong, Quang-Thuy Ha","doi":"10.1109/KSE53942.2021.9648676","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648676","url":null,"abstract":"There are a lot of studies about fake news detection on English social networks. However, Vietnamese fake news detection on social networks still limit. In this paper, we propose a new approach for Vietnamese Fake News Detection on Social Network Sites using a pre-train language model PhoBERT combine with Term Frequency - Inverse Document Frequency (TF-IDF) for word embedding and Convolutional Neural Network (CNN) for features extracting. Our proposed model is trained and evaluated on the dataset of Reliable Intelligence Identification on Vietnamese SNSs (ReINTEL) shared task. We process text data into two scenarios: raw data and processed data to elucidate the hypothesis of pre-processing data on social networks. In addition, we use the different extra features to improve the efficiency of model. We compare our proposed model with the baseline methods. The proposed model achieved outstanding results with 0.9538 AUC score on raw data.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124575605","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}
Viet-Thanh Le, Thanh-Hai Tran, Van-Nam Hoang, Van-Hung Le, Thi-Lan Le, Hai Vu
{"title":"SST-GCN: Structure aware Spatial-Temporal GCN for 3D Hand Pose Estimation","authors":"Viet-Thanh Le, Thanh-Hai Tran, Van-Nam Hoang, Van-Hung Le, Thi-Lan Le, Hai Vu","doi":"10.1109/KSE53942.2021.9648765","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648765","url":null,"abstract":"Human hand gesture is an efficient way of communication for Human-computer interaction (HCI) applications. To this end, one of the main requirements is an automatic hand pose estimation. Existing methods usually explore spatial relationships among hand joints in a single image to estimate the 3D hand pose. By doing so, the temporal constraints among hand poses are under-investigated. In this paper, we propose SST-GCN (Structure aware Spatial-Temporal Graphic Convolutional Network) that incorporates both spatial dependencies and temporal consistencies to improve 3D hand pose estimation results. Our method bases on an existing spatial-temporal GCN for 3D pose estimation. In addition, we introduce a new loss function that takes geometric constraints of hand structure into account. Our proposed method takes a 2D hand pose as an input to estimates the 3D hand pose. Finally, we evaluate our method on the First-Person Hand Action Benchmark (FPHAB) dataset. The experimental results show that the proposed method gives promising results in comparison with the original ST-GCN network.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116466264","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}
Nguyen Ha Thanh, Minh Q. Bui, Chau Nguyen, Tung Le, Phuong Minh Nguyen, Binh Dang, Vuong Thi Hai Yen, Teeradaj Racharak, Nguyen Le Minh, Duc-Vu Tran, Phan Viet Anh, Nguyen Truong Son, Huy-Tien Nguyen, Bhumindr Butr-indr, P. Vateekul, P. Boonkwan
{"title":"A Summary of the ALQAC 2021 Competition","authors":"Nguyen Ha Thanh, Minh Q. Bui, Chau Nguyen, Tung Le, Phuong Minh Nguyen, Binh Dang, Vuong Thi Hai Yen, Teeradaj Racharak, Nguyen Le Minh, Duc-Vu Tran, Phan Viet Anh, Nguyen Truong Son, Huy-Tien Nguyen, Bhumindr Butr-indr, P. Vateekul, P. Boonkwan","doi":"10.1109/kse53942.2021.9648724","DOIUrl":"https://doi.org/10.1109/kse53942.2021.9648724","url":null,"abstract":"We summarize the evaluation of the first Automated Legal Question Answering Competition (ALQAC 2021). The competition this year contains three tasks, which aims at processing the statute law document, which are Legal Text Information Retrieval (Task 1), Legal Text Entailment Prediction (Task 2), and Legal Text Question Answering (Task 3). The final goal of these tasks is to build a system that can automatically determine whether a particular statement is lawful. There is no limit to the approaches of the participating teams. This year, there are 5 teams participating in Task 1, 6 teams participating in Task 2, and 5 teams participating in Task 3. There are in total 36 runs submitted to the organizer. In this paper, we summarize each team's approaches, official results, and some discussion about the competition. Only results of the teams who successfully submit their approach description paper are reported in this paper.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134628971","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":"fastTIGER: A rapid method for estimating evolutionary rates of sites from large datasets","authors":"Thu Kim Le, L. Vinh","doi":"10.1109/KSE53942.2021.9648748","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648748","url":null,"abstract":"The evolutionary processes vary among sites of an alignment, called rate heterogeneity, that must be properly handled when analyzing the evolutionary relationships among species based on their genomic data. To this end, methods have been proposed to estimate the relative evolutionary rates between sites. Tree Independent Generation of Evolutionary Rates (TIGER) is a popular method to estimate the evolutionary rates among sites. However, the TIGER method is computationally expensive to calculate the evolutionary rates for large datasets, especially for whole genome datasets. In this paper, we present a simplified, fast, and accurate method, called fastTIGER, to estimate evolutionary rates for large datasets. Experiments on several large real datasets show that the evolutionary rates from the fastTIGER method have a reasonable correlation with ones estimated from the TIGER method while the fastTIGER method is several orders of magnitudes faster than the TIGER method. Moreover, the site rates estimated by fastTIGER method are as good as the ones estimated from the TIGER method in partitioning alignments to build maximum likelihood trees. The fastTIGER method enhances us to study the evolutionary relationships among species using their genomic data.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115628464","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}
Quoc-An Nguyen, Quoc-Hung Duong, Minh-Quang Nguyen, Huy-Son Nguyen, Hoang-Quynh Le, Duy-Cat Can, Tam Doan Thanh, Mai-Vu Tran
{"title":"A Hybrid Multi-answer Summarization Model for the Biomedical Question-Answering System","authors":"Quoc-An Nguyen, Quoc-Hung Duong, Minh-Quang Nguyen, Huy-Son Nguyen, Hoang-Quynh Le, Duy-Cat Can, Tam Doan Thanh, Mai-Vu Tran","doi":"10.1109/KSE53942.2021.9648640","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648640","url":null,"abstract":"In natural language processing problems, text summarization is a difficult problem and always attracts attention from the research community, especially working on biomedical text data which lacks supporting tools and techniques. In this scientific research report, we propose a multi-document summarization model for the responses in the biomedical question and answer system. Our model includes components which is a combination of many advanced techniques as well as some improved methods proposed by authors. We present research methods applied to two main approaches: an extractive summarization architecture based on multi scores and state-of-the-art techniques, presenting our novel prosper-thy-neighbor strategies to improve performance; EAHS model (Extractive-Abstractive hybrid model) based on a denoising auto-encoder for pre-training sequence-to-sequence models (BART). In which we propose a question-driven filtering phase to optimize the selection of the most useful information. Our propose model has achieved positive results with the best ROUGE-1/ROUGE-L scores being the runner-up by ROUGE-2 $F1$ score by extractive summarization results (over 24 participated teams in MEDIQA2021).","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127377489","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":"Apply Bert-based models and Domain knowledge for Automated Legal Question Answering tasks at ALQAC 2021","authors":"Truong-Thinh Tieu, Chieu-Nguyen Chau, Nguyen-Minh-Hoang Bui, Truong-Son Nguyen, Le-Minh Nguyen","doi":"10.1109/KSE53942.2021.9648727","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648727","url":null,"abstract":"With robust development in NLP (Natural Language Processing) methods and Deep Learning, there are a variety of solutions to the problems in question answering systems that achieve extraordinary results. In this paper, we describe our approach using at the Automated Legal Question Answering Competition (ALQAC) 2021. In this competition, we achieved the first prize of all tasks with the scores of 88.07%, 71.02%, 69.89% in Task 1, Task 2 and Task 3 respectively.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117120847","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 Representation Learning for Vietnamese Speaker Recognition","authors":"Cao Truong Tran, Dinh Tan Nguyen, Ho Tan Hoang","doi":"10.1109/KSE53942.2021.9648808","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648808","url":null,"abstract":"Speaker recognition is the process of identifying an individual from their voices, and it has been widely applied in many real-world applications. Recently, deep learning has instigated a revolutionary high success rate in speaker recognition. The major advantage of deep learning over conventional methods for speaker recognition is attributed to its representation ability, and the ability to produce highly abstract embedding features from utterances. Recent researches had revealed that deep learning method in learning speaker features from raw data, is strongly depending on a speaker's language. However, only minimal researches had done on deep learning over Vietnamese speaker recognition to present. Nevertheless, this paper has proposed a deep transfer learning method which integrates both transfer learning and deep learning to build models for Vietnamese speaker recognition. Our experimental results indicated that the proposed method is able to build accurate models for Vietnamese speaker recognition.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129118291","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":"KSE 2021 Conference Committee","authors":"","doi":"10.1109/kse53942.2021.9648822","DOIUrl":"https://doi.org/10.1109/kse53942.2021.9648822","url":null,"abstract":"","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126530276","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":"Leveraging CPLEX to Solve the Vehicle Routing Problem with Time Windows","authors":"Van Manh Tran, T. Vu","doi":"10.1109/KSE53942.2021.9648591","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648591","url":null,"abstract":"In recent years, the problem of urban traffic has become increasingly urgent when the number of vehicles has increased rapidly while the transport infrastructure has not kept up with the increasing needs of passengers and drivers. Ridesharing or vehicle sharing are the optimal solutions to save travel time and cost and enhance convenience for passengers and vehicle drivers. The vehicle routing problem with time window (VRPTW), an expansion of Vehicle Routing Problem (VRP), has been examined in recent literature to find the most effective solutions to address the arrangement of customers with known requests while minimizing the cost on a given set of routes. This paper presents a model to address the vehicle routing problem with time windows (VRPTW) applying Mixed-Integer Programming (MIP) to optimize transportation costs and vehicles' numbers. The mathematical model of MIP was conducted in Java using the Branch and Cut algorithm and dynamic search algorithm in the IBM CPLEX library (cplex.jar). The model has been tested with two well-known cases of Solomon's benchmarking problem. The testing results demonstrate that both the cost and the number of vehicles are optimized reasonably with this model. Furthermore, sensitivity analysis for passenger nodes conducted on this model results indicates that the computation time and the number of vehicles increased when the number of customer nodes increased. This paper has widened several directions for future research to develop optimal solutions to vehicle sharing.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123038923","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}
Cu Vinh Loc, Nguyen Thanh Nhan, V. Truong, Tran Hoang Viet, Le Hoang Thao, Nguyen Hoang Viet
{"title":"Content based Lecture Video Retrieval using Textual Queries: to be Smart University","authors":"Cu Vinh Loc, Nguyen Thanh Nhan, V. Truong, Tran Hoang Viet, Le Hoang Thao, Nguyen Hoang Viet","doi":"10.1109/KSE53942.2021.9648820","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648820","url":null,"abstract":"The amount of lecture videos is rapidly growing due to the popularity of massive online open courses in academic institutions. Thus, the efficient method for lecture video retrieval in various languages is needed. In this paper, we propose an approach for automated lecture video indexing and retrieval. First, the lecture video is segmented into keyframes in a manner that the duplication of these frames is minimal. The textual information embedded in each keyframe is then extracted. We consider this issue as a matter of text detection and recognition. The text detection is solved by our segmentation network in which we propose a binarization approach for optimizing text locations in an image. For text recognition, we take advantage of VietOCR to recognize both English and Vietnamese text. Lastly, we integrate a vector-based semantic search in ElasticSearch to enhance the ability of lecture video search. The experimental results show that our approach gives high performance in detecting and recognizing the text content in both English and Vietnamese as well as enhancing the speed and accuracy of lecture video retrieval.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116776653","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}