{"title":"Ship Classification in Remote Sensing Images using FastAI","authors":"Chittra Roungroongsom, O. Chitsobhuk","doi":"10.1109/KSE53942.2021.9648787","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648787","url":null,"abstract":"Specifying ship categories in waterways plays an important role in the field of marine surveillance, especially when classification is performed from satellite images due to the advancement in remote sensing technologies. In this paper, we presented an approach for ship classification of optical remote sensing images. Our approach was based on two aspects, modifying models and applying additional techniques to improve accuracy of classification. Two pretrained models, MobileNetV2 and DenseNet121, were modified in this work and all techniques were implemented using Fastai library. To illustrate the effectiveness of our approach, we compared the accuracy of the modified models to the original one. A public Dataset for Ship Classification in Remote sensing images (DSCR), containing six military ship types and a civilian ship type, was used for evaluation. The results showed that our modified DenseNet121 achieved the best accuracy at 99.52% and also outperformed the benchmark result of ResNet101 reported from the original dataset.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"26 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":"115259987","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}
Nhan Thien Nguyen, Dang Minh Nguyen, A. D. Le, T. Quan
{"title":"Recognizing modern Japanese magazines by combining Deep Learning with language models","authors":"Nhan Thien Nguyen, Dang Minh Nguyen, A. D. Le, T. Quan","doi":"10.1109/KSE53942.2021.9648643","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648643","url":null,"abstract":"As one of the most culturally rich countries globally, Japan also has a rich history of magazines. In modern Japanese magazines, which were published during the 19-20th centuries, Japanese usage is similar to the current style of the contemporary Japanese language. However, most of those documents are not digitized but stored as images. Due to their importance to Japanese culture, history, and other socio-scientific topics, the problem of using computers to help identify these image-based modern magazines has been investigated from research and widely disseminated through the use of different methods in Deep Learning. However, these methods are still limited to achieve strong performance in recognizing handwriting images, especially uncommon Kanji characters. In this research, we address this problem by developing a deep learning-based language model and integrating it into the current OCR system for modern Japanese magazine documents. We also propose a combination strategy between the current Japanese OCR tool and our language model. The strategy will learn where the system should rely on OCR (e.g., Hiragana and Common kanji characters recognized correctly by OCR) or language model (uncommon Kanji characters are frequently recognized incorrectly by OCR, the system should rely on the language model). Our method enjoys visible improvement once experimented with real data.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"255 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":"117330972","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":"Building a Chatbot for Supporting the Admission of Universities","authors":"Minh-Tien Nguyen, Manh Tran-Tien, Anh Phan Viet, Huy-The Vu, Van-Hau Nguyen","doi":"10.1109/KSE53942.2021.9648677","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648677","url":null,"abstract":"The admission process of universities in Vietnam is a labor-expensive task due to the involvement of humans. This paper introduces an intelligent system (a chatbot) that can support the admission process by automatically answering questions. Different from prior work that usually builds the bot from scratch, we develop the bot by using the Rasa platform. To do that, we investigate different combinations of components of natural language understanding to find the best pipeline. We also create and release a dataset in the admission domain to train the bot. Experimental results show that the pipeline using DIET with features from pre-trained language models is competitive. The introduction video of the system is also available.11https://youtu.be/gw7wvlADxnE","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"1 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":"121165429","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}
Hanh-Thong Huynh, Hai V. Duong, Tin C. Truong, Bac Le, Philippe Fournier-Viger
{"title":"Mining High Utility Sequences with a Novel Utility Function","authors":"Hanh-Thong Huynh, Hai V. Duong, Tin C. Truong, Bac Le, Philippe Fournier-Viger","doi":"10.1109/KSE53942.2021.9648660","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648660","url":null,"abstract":"Mining high utility sequential patterns (HUSP) is a popular data mining task. The goal is to find all subsequences that yield a high utility (e.g. high profit) in a quantitative sequence database (QSDB). Traditional algorithms for this task have many uses but a major limitation is that they rely on the maximum or minimum utility measures for calculating the utility of a pattern, thus assuming either a best or worst case scenario. These measures are unsuitable for many real-life applications such as business decision-making. To address this issue, this paper introduces a novel utility function (NUF) to calculate the utility of a sequence in each input sequence, which provides a trade-off between the above two extreme cases. A novel upper bound on NUF is designed as well as search space pruning strategies to eliminate unpromising candidate patterns early. These contributions are integrated into a novel efficient algorithm named FHNewUSM to discover frequent HUSPs with NUF. An experimental study with both real-life and synthetic databases shows that the proposed algorithm is efficient for mining HUSPs with NUF in terms of execution time, memory consumption and scalability.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"193 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":"133349063","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":"Esports Game Updates and Player Perception: Data Analysis of PUBG Steam Reviews","authors":"Yang Yu, Ba-Hung Nguyen, Fangyu Yu, V. Huynh","doi":"10.1109/KSE53942.2021.9648670","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648670","url":null,"abstract":"Game updates are essential because they usually contain critical patches to improve the players' experience. Compared with traditional online games, esports games abandon the storyline and emphasize the players' competitive motivation. As a result, esports games need to be updated more frequently to extend the game development life cycle. Meanwhile, developers get feedback from players' reviews on esports games to improve the game experience, services, or adjust operating strategies. However, there has been little research conducted on the influence of esports game updates on player reviews. In this study, we aim to determine the influence of the monthly update on the player community by carrying out an analysis of PUBG, one of the representatives of esports games, via topic modeling. In total, we collect approximately 300,000 reviews on Steam. Our contributions in this paper are: (i) we use the LDA model to infer and group reviews into 14 topics, (ii) we analyze the influence from esports game updates on topics prevalence over time, and (iii) we conduct sentiment analysis to reveal players' satisfaction levels with each topic.","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":"132721266","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}
Minh Q. Bui, Vu D. Tran, Nguyen Ha Thanh, Binh Dang, Le-Minh Nguyen
{"title":"How Curriculum Learning Performs on AMR Parsing","authors":"Minh Q. Bui, Vu D. Tran, Nguyen Ha Thanh, Binh Dang, Le-Minh Nguyen","doi":"10.1109/KSE53942.2021.9648646","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648646","url":null,"abstract":"Curriculum learning is a commonly used method in deep learning to improve training model efficiency. This method has been proven effective on a wide range of tasks in natural language and image processing. However, there are no studies yet fully investigating the possibility of applying this method to AMR parsing, the task of converting a sentence into an AMR, its abstract meaning representation. In this article, we experiment and investigate in detail the possibilities of applying curriculum into AMR parsing.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"31 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":"125884724","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 Graph Convolutional Networks with Transformer Layer in social-based items recommendation","authors":"T. Hoang, T. Pham, Viet-Cuong Ta","doi":"10.1109/KSE53942.2021.9648823","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648823","url":null,"abstract":"With the emergence of online social networks, social-based items recommendation has become a popular research direction. Recently, Graph Convolutional Networks have shown promising results by modeling the information diffusion process in graphs. It provides a unified framework for graph embedding that can leverage both the social graph structure and node features information. In this paper, we improve the embedding output of the graph-based convolution layer by adding a number of transformer layers. The transformer layers with attention architecture help discover frequent patterns in the embedding space which increase the predictive power of the model in the downstream tasks. Our approach is tested on two social-based items recommendation datasets, Ciao and Epinions and our model outperforms other graph-based recommendation baselines.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"1 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":"128515000","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}
Dinh Tan Nguyen, Cao Truong Tran, Trung Thanh Nguyen, Cao Bao Hoang, Van Phu Luu, Ba Ngoc Nguyen, Pou Ian Cheong
{"title":"Data Augmentation for Small Face Datasets and Face Verification by Generative Adversarial Networks Inversion","authors":"Dinh Tan Nguyen, Cao Truong Tran, Trung Thanh Nguyen, Cao Bao Hoang, Van Phu Luu, Ba Ngoc Nguyen, Pou Ian Cheong","doi":"10.1109/KSE53942.2021.9648720","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648720","url":null,"abstract":"One of the most challenging issues in the utilisation of machine learning in face datasets is the lack of data, especially when there is inadequate collection of datasets. On one hand, the cost of collecting new face images could be very costly and it depend heavily on the resources and the availability of the data collection. On the other hand, insufficient face datasets could lead to over-fitting issues in any deep learning models especially in the face verification tasks as it requires adequate amount of face dataset. Nevertheless, Generative Adversarial Networks (GANs) offers a better way to augment the data by generating synthetic face images based on the close-distributed pixels of real images. With this intention, GAN inversion was introduced to produce better performance comparing to the previous GAN concepts; by inverting a given face image back into the latent space of a pretrained GAN model with low loss transmissions. This paper demonstrates the feasibility of GAN inversion during the face verification process. We will also illustrate the comparison between previous GAN models, and traditional machine learning augmentation methods in face images generation.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"43 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":"133731197","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}
Q. Tran, H. Nguyen, Binh T. Nguyen, Vuong T. Pham, Trong T. Le
{"title":"Influence Prediction on Social Media Network through Contents and Interaction Behaviors using Attention-based Knowledge Graph","authors":"Q. Tran, H. Nguyen, Binh T. Nguyen, Vuong T. Pham, Trong T. Le","doi":"10.1109/KSE53942.2021.9648712","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648712","url":null,"abstract":"This paper presents a model for predicting the influence of information in social media networks. Given the content, the proposed model aims to approximate the influence of one user on another by learning from both user's interaction behaviors and the vast amount of content created on the network and combining with the state-of-the-art graph convolutional and attention-based methods. We compare the performance of the proposed approach with other popular methods on one dataset, manually collected from Facebook and including the real-world interactions and contents produced by users. The experimental results show that our approach could bypass other techniques with competitive results and have more scalability for applying in real-world applications, especially in influencer and content marketing campaigns.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"7 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":"114207607","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":"AimeLaw at ALQAC 2021: Enriching Neural Network Models with Legal-Domain Knowledge","authors":"Ngo Quang Huy, Nguyen Manh Duc Tuan, Nguyen Anh Duong, Pham Quang Nhat Minh","doi":"10.1109/KSE53942.2021.9648636","DOIUrl":"https://doi.org/10.1109/KSE53942.2021.9648636","url":null,"abstract":"In this paper, we present our participated systems for three Vietnamese legal text processing tasks at Automated Legal Question Answering Competition (ALQAC 2021). In our systems, we leverage the strength of traditional information retrieval methods (BM25), pre-trained masked language models (BERT), and legal domain knowledge. Our proposed methods help to overcome the shortage of training data. Especially, in the legal textual entailment task, we propose a novel data augmentation method that is based on legal domain knowledge. Evaluation results show the effectiveness of our proposed methods. Our team (AimeLaw) obtained the first prize in Task 2 (legal textual entailment) with 69.89% of accuracy; ranked second in Task 1 (legal document retrieval) with 80.61% of F2 and in Task 3 (legal question answering) with 64.77% of accuracy. We even improved the result on Task 2 to 72.16% in an extra experiment.","PeriodicalId":130986,"journal":{"name":"2021 13th International Conference on Knowledge and Systems Engineering (KSE)","volume":"38 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":"116535387","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}