2020 12th International Conference on Knowledge and Systems Engineering (KSE)最新文献

筛选
英文 中文
Build a search engine for the knowledge of the course about Introduction to Programming based on ontology Rela-model 构建基于本体关联模型的《程序设计导论》课程知识搜索引擎
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287775
Xuan-Thien Pham, Tuan-Vi Tran, Van-Thanh Nguyen-Le, Vuong T. Pham, H. Nguyen
{"title":"Build a search engine for the knowledge of the course about Introduction to Programming based on ontology Rela-model","authors":"Xuan-Thien Pham, Tuan-Vi Tran, Van-Thanh Nguyen-Le, Vuong T. Pham, H. Nguyen","doi":"10.1109/KSE50997.2020.9287775","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287775","url":null,"abstract":"STEM education is the modern educational method. The knowledge of programming is very important for studying in STEM education, especially in information technology. In this paper, an intelligent search engine for the knowledge of the course about Introduction to Programming is constructed. The knowledge model is organized based on the improved ontology of Rela-model, which represents concepts of the course, relations between those concepts and some inference rules to query the knowledge of programming. Based on this ontology, the problems for querying the knowledge of the course are proposed based on their semantic. The search system has been tested in the real- world by students studying the course. The experimental results are positive for the effectiveness of the system.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122462931","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}
引用次数: 6
A new similarity measure of IFSs and its applications 一种新的ifs相似性度量方法及其应用
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287689
Tran Due Quynh, N. X. Thao, N. Thuan, Neuven Van Dinh
{"title":"A new similarity measure of IFSs and its applications","authors":"Tran Due Quynh, N. X. Thao, N. Thuan, Neuven Van Dinh","doi":"10.1109/KSE50997.2020.9287689","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287689","url":null,"abstract":"Similarity measures between Intuitionistic fuzzy sets (IFSs) play an important role and they have many applications in machine learning and multi-criteria decision making. However, there are few existing similarity measures. In this paper, we propose a new similarity measure between Intuitionistic fuzzy sets (IFSs). We first present a new mathematical formula and then prove that it satisfies all the conditions of similarity measures. The usefulness of the new similarity measure is pointed out by considering a simple classification problem. The results show that the proposed measure can be used to predict the class of a new sample while some of other measures cannot do it. Next, we apply the new similarity measure for solving multi criteria decision making (MCDM) problems. The results are compared with the ones by using some other similarity measures. The experimentation reports that the new similarity measure may provide different ranking of alternatives but it provides the same optimal solution.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132649085","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}
引用次数: 4
An agent-based model for mixed traffic in Vietnam based on virtual local lanes 基于虚拟本地车道的越南混合交通代理模型
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287400
Tu Dang-Huu, B. Gaudou, Doanh Nguyen-Ngoc, N. C. Lê
{"title":"An agent-based model for mixed traffic in Vietnam based on virtual local lanes","authors":"Tu Dang-Huu, B. Gaudou, Doanh Nguyen-Ngoc, N. C. Lê","doi":"10.1109/KSE50997.2020.9287400","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287400","url":null,"abstract":"The rapid urbanization and urban spread in developing countries create a huge number of challenges urban planners have to face. As an example, congestion has become a major issue in Vietnam and caused huge economic losses as well as an increase in air pollutant emissions. Tackling such an issue requires huge improvements in the city organization and infrastructure. Choosing the most appropriate solution among existing ones or imagining new ones require tools to understand their impact and assess their feasibility, effectiveness and acceptability. Computer simulation is a tool of choice to assess the interactions between dynamics at both macro-level (the city) or micro-level (a single road or a crossroad). Existing tools have nevertheless mainly been designed for cities with traffic dominated by cars that are supposed to respect regulations. These assumptions cannot be applied to traffic in Vietnam which is characterized by a mix of cars, motorbikes and other vehicle types and low respect of road lanes. This paper proposes an agent-based model simulating in a more realistic way the traffic in Vietnam using the GAMA platform. We illustrate its capabilities on two characteristic toy case studies (straight road and crossroad) and a real case study in rush hour and lower traffic situations.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133172456","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}
引用次数: 4
Abstractive Sentence Summarization with Encoder-Convolutional Neural Networks 基于编码器-卷积神经网络的抽象句子摘要
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287809
Toi Nguyen, Toai Le, Nhi-Thao Tran
{"title":"Abstractive Sentence Summarization with Encoder-Convolutional Neural Networks","authors":"Toi Nguyen, Toai Le, Nhi-Thao Tran","doi":"10.1109/KSE50997.2020.9287809","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287809","url":null,"abstract":"Summarization is the task of condensing a piece of text to produce a short version while preserving important elements and the meaning of content There have two main methods to summarize the text such as extractive summarization and abstractive summarization. Abstractive Sentence Summarization generates a shorter version of a set of documents while attempting to preserve its meaning. In this work, we introduce an architecture called the pointer-gen E-Conv (PGEC) whose conditioning is the combination between pointer-generator and a novel convolutional network with a weight normalization. Our model gains a 32.28 ROUGE-1 score on the Gigaword test set and a 27.13 ROUGE-1 score on the DUC 2004 dataset These results have shown that PGEC outperforms the recently proposed methods on both datasets.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131275857","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}
引用次数: 0
An approach for semantic-based searching in learning resources 一种基于语义的学习资源搜索方法
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287798
Tran Thanh Dien, Le Van Trung, Nguyen Thai-Nghe
{"title":"An approach for semantic-based searching in learning resources","authors":"Tran Thanh Dien, Le Van Trung, Nguyen Thai-Nghe","doi":"10.1109/KSE50997.2020.9287798","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287798","url":null,"abstract":"Currently, online learning has been widely applied in education and training. Especially, when it is difficult for lecturers and learners to get close to each other in the context of Covid-19 epidemic period, online learning shows its availability and necessary. Learning materials provided in the educational institutions are diverse; almost lectures are stored as files but have not been totally arranged in a standard database system. Therefore, searching information about curriculum and lectures still face difficulties. This paper proposes a solution for semantic-based searching in learning resources. Firstly, ontologies are built to represent information of lectures. When users enter a query, the system pre-processes it (e.g., word segmentation, removing stop words), and then provides it to classifier (e.g., SVM) to identify the corresponding domain (or topic), aiming to narrow the search space in the ontology. After classifying, the key phrases will be queried in the appropriate ontology to result in related lectures. Experiments on lectures in the domains of information technology show that the proposed model is feasible.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117158440","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}
引用次数: 1
Disease subtyping using community detection from consensus networks 从共识网络中使用社区检测进行疾病分型
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287843
Hung Nguyen, Bang Tran, Duc Tran, Quang-Huy Nguyen, Duc-Hau Le, Tin Nguyen
{"title":"Disease subtyping using community detection from consensus networks","authors":"Hung Nguyen, Bang Tran, Duc Tran, Quang-Huy Nguyen, Duc-Hau Le, Tin Nguyen","doi":"10.1109/KSE50997.2020.9287843","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287843","url":null,"abstract":"Cancer is a complex disease including a range of disorders that are activated simultaneously by multiple biological processes on multiple levels. Various genome-wide profiling techniques have been developed to capture the dynamics of these processes at the epigenomic, transcriptomic, and proteomic levels. Integrative analysis of data from these sources has the potential to differentiate cancer subtypes from a holistic perspective that reveals connections that otherwise cannot be detected using observations from a single data type. In this article, we present a novel approach named DSCC (Disease Subtyping using Community detection from Consensus networks) that is able to discover disease subtypes from multi-omics data and is robust against noise. In an extensive analysis using simulation studies and 5,782 real patients belonging to 20 cancer datasets from The Cancer Genome Atlas, we demonstrate that DSCC outperforms state-of- the-art methods by correctly identifying known patient groups and novel subtypes with significantly different survival profiles.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117293618","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}
引用次数: 3
iK-means: an improvement of the iterative k-means partitioning algorithm k-means:迭代k-means划分算法的改进
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287221
Thu Kim Le, L. Vinh, Dong Do Due, Bui Ngoc Thang, Thao Thi Phuong Nguyen
{"title":"iK-means: an improvement of the iterative k-means partitioning algorithm","authors":"Thu Kim Le, L. Vinh, Dong Do Due, Bui Ngoc Thang, Thao Thi Phuong Nguyen","doi":"10.1109/KSE50997.2020.9287221","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287221","url":null,"abstract":"The evolutionary processes vary among sites of an alignment that strongly affect the accuracy of phylogenetic tree reconstruction. Partitioning an alignment into sub-alignments of sites such that the evolutionary processes at sites in the same sub-alignment are highly similar is a proper strategy. Gene features might be used as reasonable indicators to partition an alignment. However, the gene feature information is not always available or efficient Computational partitioning methods like iterative k-means has been proposed to automatically partition sites into groups based on the similarity of evolutionary rates of sites. Despite obtaining compelling results in terms of AICc and BIC measurements, the k-means method forms a group of all and only invariant sites that results in bias/wrong phylogenetic trees. In this paper, we improve the k-means algorithm by re-classifying invariant sites into different sub-alignments based on their likelihood values. Experimental results on simulated and empirical DNA datasets showed that the new method, called iK-means, overcame the pitfall of the K-means method, consequently, helps improve the quality of the partitioning sub-alignments. We recommend using the iK-means method to level up the accuracy in inferring phylogenetic trees.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116415529","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}
引用次数: 0
IoT Malware Detection based on Latent Representation 基于潜在表示的物联网恶意软件检测
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287373
C. N. Van, V. Phan, Cao Van Loi, Khanh Duy Tung Nguyen
{"title":"IoT Malware Detection based on Latent Representation","authors":"C. N. Van, V. Phan, Cao Van Loi, Khanh Duy Tung Nguyen","doi":"10.1109/KSE50997.2020.9287373","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287373","url":null,"abstract":"This paper proposes a new approach for IoT malware detection system based on the analysis of IoT network traffic features. First, we use an autoencoder network to gather latent presentation of the input data. This is followed by a classifier to identify whether an IoT network traffic is malware or benign. We carry out a comprehensive comparison of different input feature sets and figure out that using latent representation is more effective than the original features. This proves that autoencoder network can compress the IoT network traffic features and keep only the most meaningful features. The model latent representation and classifies IoT malware and benign with high performance. Another finding is that our trained model can detect new types of abnormal IoT network traffics which do not appear in the training process.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129365821","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}
引用次数: 0
Rotat3D: A Knowledge Graph Embedding using Relational Rotation in 3D Vector Space Rotat3D:在三维向量空间中使用关系旋转的知识图嵌入
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287591
Quan Dang, An Mai, M. Ngo, Thanh Bui
{"title":"Rotat3D: A Knowledge Graph Embedding using Relational Rotation in 3D Vector Space","authors":"Quan Dang, An Mai, M. Ngo, Thanh Bui","doi":"10.1109/KSE50997.2020.9287591","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287591","url":null,"abstract":"To extract the entities and understand the relations in knowledge graphs is probably one of the challenging research focuses recently in machine learning community. In this paper, we aim to study one of the narrow-down problem of learning the embedding of entities and relations in knowledge graphs. From using a 3D rotation transformation in high dimensional vector spaces, we present a new method for knowledge graph embedding named Rotat3D. More specifically, the 3D-valued embeddings will be used to represent for the entities in the graphs, in which the rotations are modeled as popular rotation formulation in 3D vector spaces. Experimental results, carried out on four common benchmark datasets for link prediction, have shown that our proposed Rotat3D method is able to infer the common relation patterns in a graph more easily, and also has a critical improvement compared with some other state-of-the-art methods.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123299716","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}
引用次数: 1
Node-aware convolution in Graph Neural Networks for Predicting molecular properties 基于节点感知卷积的图神经网络预测分子性质
2020 12th International Conference on Knowledge and Systems Engineering (KSE) Pub Date : 2020-11-12 DOI: 10.1109/KSE50997.2020.9287744
Linh Le Pham Van, Q. Tran, T. Pham, Quoc Long Tran
{"title":"Node-aware convolution in Graph Neural Networks for Predicting molecular properties","authors":"Linh Le Pham Van, Q. Tran, T. Pham, Quoc Long Tran","doi":"10.1109/KSE50997.2020.9287744","DOIUrl":"https://doi.org/10.1109/KSE50997.2020.9287744","url":null,"abstract":"Molecular property prediction is a challenging task which aims to solve various issues of science namely drug discovery, materials discovery. It focuses on understanding the structure-property relationship between atoms in a molecule. Previous approaches have to face difficulties dealing with the various structure of the molecule as well as heavy computational time. Our model, in particular, utilizes the idea of message passing neural network and Schnet on the molecular graph with enhancement by adding the Node-aware Convolution and Edge Update layer in order to acquire the local information of the graph and to propagate interaction between atoms. Through experiments, our model has been shown the outperformance with previous deep learning methods in predicting quantum mechanical, calculated molecular properties in the QM9 dataset and magnetic interaction of two atoms in molecules approaches.","PeriodicalId":275683,"journal":{"name":"2020 12th International Conference on Knowledge and Systems Engineering (KSE)","volume":"355 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123338581","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}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信