{"title":"Enhancing the degree of personalization through Vector Space Model and Profile Ontology","authors":"Safiya Al Sharji, M. Beer, Elizabeth Uruchurtu","doi":"10.1109/RIVF.2013.6719902","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719902","url":null,"abstract":"Web browsers need to match the users' queries to the information available data bases. However, matching the users' needs with their interests and preferences to provide personalized search results in a ranked order of relevance entails a complex interaction of information attributes and as such, it remains one of the main challenges researchers face. Information Retrieval (IR) techniques focusing specifically on using Vector Space Model (VSM) with Profile Ontology (PO) hybridizationproved an improvement on personalized search results. We improve the degree of personalization by incorporating a new metric, the Dwell Time of each search session to optimize a learned re-ranked model. For a longitudinal naturalistic study of Web interactions, search logs were gathered as stimuli for the ranking algorithms of our personalized search engine. The performance of our re-ranking mechanism using Discounted Cumulative Gain (DCG) and F-measurewas tested. The scheme devised in this study was compared with the Google search engine. It was shown that, at the 10 top ranks of our personalized search engine, 14% improvement in the relevance is achieved.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128389342","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":"Imbalanced educational data classification: An effective approach with resampling and random forest","authors":"Thi Ngoc Chau Vo, Hua Phung Nguyen","doi":"10.1109/RIVF.2013.6719882","DOIUrl":"https://doi.org/10.1109/RIVF.2013.6719882","url":null,"abstract":"Educational data mining is emerging in the data mining research arena. Despite an applied field of data mining techniques and methods, educational data mining is full of challenges that have not been completely resolved. Especially data classification in an academic credit system is a very tough task which must deal with imbalanced issues and missing data on the technical side and tackle the flexibility of the education system leading to the heterogeneity of data on the practical side. In this paper, we present our approach with a hybrid resampling scheme and random forest for the imbalanced educational data classification task with multiple classes based on student's performance. The proposed approach has not yet been available in educational data mining. Besides, it has been extensively proved in our empirical study to be effective for student's final study status prediction and usable in a knowledge-driven educational decision support system.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127112194","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":"The Lattice Structure of Rotor-Router Model","authors":"Le Manh Ha","doi":"10.1109/RIVF.2010.5633377","DOIUrl":"https://doi.org/10.1109/RIVF.2010.5633377","url":null,"abstract":"In this paper, we study the rotor router model in the relation with the famous discrete dynamical system - Chip Firing Game. We consider the rotor router model as a discrete dynamical system defined on digraph and we use order theory to show that its state space started from any state is a lattice, which implies strong structural properties. The lattice structure of the state space of a dynamical system is of great interest since it implies convergence (and more) if the state space is finite. Moreover, we also attempt to define the class $L(mathcal R)$ of lattices that are state space of a rotor router model, and compare it with the class of distributive lattices and the class of ULD lattices.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117342538","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}
Bui Nguyen Minh Hoang, H. T. N. Vy, Hong Tiet Gia, Vu Thi Minh Hang, H. Nhung, Le Nguyen Hoai Nam
{"title":"Using Bert Embedding to improve memory-based collaborative filtering recommender systems","authors":"Bui Nguyen Minh Hoang, H. T. N. Vy, Hong Tiet Gia, Vu Thi Minh Hang, H. Nhung, Le Nguyen Hoai Nam","doi":"10.1109/RIVF51545.2021.9642103","DOIUrl":"https://doi.org/10.1109/RIVF51545.2021.9642103","url":null,"abstract":"The performance of memory-based collaborative filtering recommender systems will be severely affected when the users' item preference data is sparse. In this paper, we focus on solving this issue. Our idea is to use Bert Embedding to learn a new feature set, which is denser and more semantic, for re-representing users and items. In these new features, memory-based collaborative filtering recommender systems work more efficiently. The experiments are conducted on the Movielens 100K dataset and the Yahoo Webscope R4 dataset.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122576376","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":"Determining Restricted Damerau-Levenshtein Edit-Distance of Two Languages by Extended Automata","authors":"D. Q. Thang, P. Huy","doi":"10.1109/RIVF.2010.5632914","DOIUrl":"https://doi.org/10.1109/RIVF.2010.5632914","url":null,"abstract":"Restricted Damerau-Levenshtein edit-distance is applied in many fields such as language processing, speech recognition, detecting theft of information, biology computation, etc. Modifying from the method of Mehryar Mohri (2003) which uses the composition of transducers combined with a singlesource shortest-paths algorithm to compute Levenshtein editdistance of the two languages, we propose a type of an extended automaton in order to compute the restricted DamerauLevenshtein edit-distance of the two languages. Keywords-Damerau-Levenshtein; edit-distance; extended automaton; algorithm; transducer","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115888445","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":"An Empirical Study on Bankruptcy Prediction using Ensemble Learning","authors":"Hoang Luu Quang Tien, L. Tran, Trong-Hop Do","doi":"10.1109/RIVF55975.2022.10013848","DOIUrl":"https://doi.org/10.1109/RIVF55975.2022.10013848","url":null,"abstract":"Bankruptcy prediction helps to assess the financial condition of a company and its future perspectives within the context of long-term operation on the market. Using machine learning to solve this problem can be a time-efficient and cost-effective approach. This paper introduces an approach using Ensemble learning methods to tackle the bankruptcy classification problem, which achieved the fourth position on the leader board of The 3rd Annual International Data Science & AI Competition 2022 - Structured Data Track. The data set given by the committee of the competition has a lot of challenges so we perform some preprocessing and feature engineering techniques to make the data set become cleaner for modelling. We use three ensemble algorithms, namely Random Forest, Catboost, and LightGBM to compare the performance of three algorithms on the bankruptcy classification problem and find the best result to submit to the competition. After experimenting, we achieve the best result at 98.21% Accuracy on the private leader board of the competition. The result comes from the LightGBM model trained on the data set which is enhanced through feature engineering techniques.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122461640","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":"RFL-IoT: An IoT Reconfiguration Framework Applied Fuzzy Logic for Context Management","authors":"Tuan Nguyen-Anh, Q. Trung","doi":"10.1109/RIVF.2019.8713619","DOIUrl":"https://doi.org/10.1109/RIVF.2019.8713619","url":null,"abstract":"Internet of Things (IoTs) applications normally demand n-tier distributed architecture with numerous diverse components, e.g., sensors attached over IoTs end devices in the front-end, and the web application servers, database servers in the back-end. To deal with the dynamic changes and unpredicted events in the environments, the reconfiguration and re-programming of IoTs applications on IoTs end devices are of vital importance. This issue is also called over-the-air programming (OTAP) of IoTs applications remotely through wireless IoTs network protocols. In this paper, we propose an IoTs reconfiguration framework, namely RFL-IoT, for the reconfiguration of IoTs applications upon the changes of the context and derived by the fuzzy logic for the smart context management. To validate our proposed framework, experiments have been carried out in the smart Air Conditioner application by updating new firmware to IoTs end devices to change the behaviors of the IoTs application upon the reported temperature. Results show that our proposed framework is suitable for the dynamic reconfiguration of IoTs applications, at a reasonable cost in terms of energy consumption and time for complete reconfiguration process.","PeriodicalId":171525,"journal":{"name":"Conference on Research, Innovation and Vision for the Future in Computing & Communication Technologies","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130705719","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}