Pub Date : 2024-03-06DOI: 10.46223/hcmcoujs.tech.en.14.1.2927.2024
Hong Thi Thu Phan, Vuong Luong Nguyen, Trinh Quoc Vo, Nguyen Ho Trong Pham
This article proposes an enhanced knowledge-based collaborative filtering model for movie recommendation services to address the limitations of collaborative filtering in capturing the diverse preferences and specific characteristics of movies. The proposed model integrates external knowledge sources, such as movie plots and reviews, to enrich the recommendation process. By leveraging this additional information, the model can better understand movies’ unique features and attributes, improving recommendation accuracy and relevance. The knowledge-based features are extracted and incorporated into the collaborative filtering framework, enhancing the model’s ability to match user preferences with movie characteristics. Experiments are conducted using the MovieLens dataset to evaluate the proposed model. The MAE and RMSE metrics are employed to assess the quality of recommendations. Comparative analyses are conducted against various baseline approaches, including popularity-based, CF-based, content-based, and hybrid recommendation models. The experimental results demonstrate the effectiveness of the proposed knowledge-based collaborative filtering model. The proposed model consistently outperforms the baselines, providing more accurate and personalized recommendations.
本文为电影推荐服务提出了一种基于知识的增强型协同过滤模型，以解决协同过滤在捕捉电影的不同偏好和具体特征方面的局限性。该模型整合了外部知识源，如电影情节和评论，以丰富推荐过程。通过利用这些附加信息，该模型可以更好地理解电影的独特特征和属性，从而提高推荐的准确性和相关性。基于知识的特征被提取出来并纳入协同过滤框架，从而增强了模型将用户偏好与电影特征相匹配的能力。我们使用 MovieLens 数据集进行了实验，以评估所提出的模型。采用 MAE 和 RMSE 指标来评估推荐的质量。与各种基线方法进行了比较分析，包括基于流行度的推荐模型、基于 CF 的推荐模型、基于内容的推荐模型和混合推荐模型。实验结果证明了所提出的基于知识的协同过滤模型的有效性。所提出的模型始终优于基线方法，能提供更准确、更个性化的推荐。
{"title":"Hybrid knowledge-infused collaborative filtering for enhanced movie clustering and recommendation","authors":"Hong Thi Thu Phan, Vuong Luong Nguyen, Trinh Quoc Vo, Nguyen Ho Trong Pham","doi":"10.46223/hcmcoujs.tech.en.14.1.2927.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.tech.en.14.1.2927.2024","url":null,"abstract":"This article proposes an enhanced knowledge-based collaborative filtering model for movie recommendation services to address the limitations of collaborative filtering in capturing the diverse preferences and specific characteristics of movies. The proposed model integrates external knowledge sources, such as movie plots and reviews, to enrich the recommendation process. By leveraging this additional information, the model can better understand movies’ unique features and attributes, improving recommendation accuracy and relevance. The knowledge-based features are extracted and incorporated into the collaborative filtering framework, enhancing the model’s ability to match user preferences with movie characteristics. Experiments are conducted using the MovieLens dataset to evaluate the proposed model. The MAE and RMSE metrics are employed to assess the quality of recommendations. Comparative analyses are conducted against various baseline approaches, including popularity-based, CF-based, content-based, and hybrid recommendation models. The experimental results demonstrate the effectiveness of the proposed knowledge-based collaborative filtering model. The proposed model consistently outperforms the baselines, providing more accurate and personalized recommendations.","PeriodicalId":512408,"journal":{"name":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","volume":"6 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140261909","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}
Pub Date : 2024-03-05DOI: 10.46223/hcmcoujs.tech.en.14.1.2966.2024
Si Tran
Construction safety monitoring is vital in enhancing site safety, such as tracking entering hazardous areas and the correlation between workers and other hazard entities. Therein, computer vision-based image/video processing, one of the emerging technologies, has been actively used to automatically identify and recognize unsafe conditions. However, the construction site has various potential hazard situations during the project. Due to the site’s complexity, many visual devices simultaneously participate in monitoring. It challenges developing and operating corresponding detection algorithms at specific workplaces and times. Besides, safety information detected by computer vision must be organized before being delivered to stakeholders. Hence, this study proposes an approach for construction safety monitoring using vision intelligence technology and BIM-cloud, called BMT. The BMT comprises two modules: (1) the virtual model based on the 4D BIM-cloud model, which provides the spatial-temporal information to decide computer vision algorithm adoptions; (2) the construction physical model built the vision intelligence technologies, which is supported by (1) and deliver safety status and update into the BIM-cloud model to visualize and deliver the risk level to related employees. The efficiency of the BMT approach is validated by testing with the preliminary implementation of a prototype.
{"title":"Integrating BIM and computer vision for preventing Hazards at construction sites","authors":"Si Tran","doi":"10.46223/hcmcoujs.tech.en.14.1.2966.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.tech.en.14.1.2966.2024","url":null,"abstract":"Construction safety monitoring is vital in enhancing site safety, such as tracking entering hazardous areas and the correlation between workers and other hazard entities. Therein, computer vision-based image/video processing, one of the emerging technologies, has been actively used to automatically identify and recognize unsafe conditions. However, the construction site has various potential hazard situations during the project. Due to the site’s complexity, many visual devices simultaneously participate in monitoring. It challenges developing and operating corresponding detection algorithms at specific workplaces and times. Besides, safety information detected by computer vision must be organized before being delivered to stakeholders. Hence, this study proposes an approach for construction safety monitoring using vision intelligence technology and BIM-cloud, called BMT. The BMT comprises two modules: (1) the virtual model based on the 4D BIM-cloud model, which provides the spatial-temporal information to decide computer vision algorithm adoptions; (2) the construction physical model built the vision intelligence technologies, which is supported by (1) and deliver safety status and update into the BIM-cloud model to visualize and deliver the risk level to related employees. The efficiency of the BMT approach is validated by testing with the preliminary implementation of a prototype.","PeriodicalId":512408,"journal":{"name":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","volume":"13 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140263579","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}
Pub Date : 2024-03-05DOI: 10.46223/hcmcoujs.tech.en.14.1.2955.2024
Phung Truong
This study explores the problem of maximizing the sum rate in uplink multi-user Multiple-Input Multiple-Output (MIMO) using Rate-Splitting Multiple Access (RSMA) systems. The investigation revolves around the scenario where the Users (UEs) are single-antenna nodes transmitting data to a multi-antenna Base Station (BS) through the RSMA technique. The optimization process encompasses determining parameters such as UEs’ transmit powers, decoding order, and detection vector at the BS. An approach based on Deep Reinforcement Learning (DRL) is introduced to address this challenge. This DRL framework involves an action-refined stage and applies a Deep Deterministic Policy Gradient (DDPG)-based strategy. Simulation outcomes effectively demonstrate the convergence of the proposed DRL framework, where it converges after approximately 1,800 episodes. Also, the results prove the superior performance of the proposed method when compared to established benchmark strategies, where it is up to 45% and 86% higher than the local search and random schemes, respectively.
{"title":"A sum rate maximization problem in uplink MIMO with RSMA systems","authors":"Phung Truong","doi":"10.46223/hcmcoujs.tech.en.14.1.2955.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.tech.en.14.1.2955.2024","url":null,"abstract":"This study explores the problem of maximizing the sum rate in uplink multi-user Multiple-Input Multiple-Output (MIMO) using Rate-Splitting Multiple Access (RSMA) systems. The investigation revolves around the scenario where the Users (UEs) are single-antenna nodes transmitting data to a multi-antenna Base Station (BS) through the RSMA technique. The optimization process encompasses determining parameters such as UEs’ transmit powers, decoding order, and detection vector at the BS. An approach based on Deep Reinforcement Learning (DRL) is introduced to address this challenge. This DRL framework involves an action-refined stage and applies a Deep Deterministic Policy Gradient (DDPG)-based strategy. Simulation outcomes effectively demonstrate the convergence of the proposed DRL framework, where it converges after approximately 1,800 episodes. Also, the results prove the superior performance of the proposed method when compared to established benchmark strategies, where it is up to 45% and 86% higher than the local search and random schemes, respectively.","PeriodicalId":512408,"journal":{"name":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","volume":"11 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140265203","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}
Movies are a primary source of entertainment, but finding specific content can be challenging given the exponentially increasing number of movies produced each year. Recommendation systems are extremely useful for solving this problem. While various approaches exist, Collaborative Filtering (CF) is the most straightforward. CF leverages user input and historical preferences to determine user similarity and suggest movies. Matrix Factorization (MF) is one of the most popular Collaborative Filtering (CF) techniques. It maps users and items into a joint latent space, using a vector of latent features to represent each user or item. However, traditional MF techniques are static, while user cognition and product variety are constantly evolving. As a result, traditional MF approaches struggle to accommodate the dynamic nature of user-item interactions. To address this challenge, we propose a Dynamic Matrix Factorization CF model for movie recommendation systems (DMF-CF) that considers the dynamic changes in user interactions. To validate our approach, we conducted evaluations using the standard MovieLens dataset and compared it to state-of-the-art models. Our preliminary findings highlight the substantial benefits of DMF-CF, which outperforms recent models on the MovieLens-100K and MovieLens-1M datasets in terms of Mean Absolute Error (MAE) and Root Mean Squared Error (RMSE) metrics.
{"title":"Dynamic matrix factorization-based collaborative filtering in movie recommendation services","authors":"Vuong Luong Nguyen, Trinh Quoc Vo, Hoai Thi Thuy Nguyen","doi":"10.46223/hcmcoujs.tech.en.14.1.2922.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.tech.en.14.1.2922.2024","url":null,"abstract":"Movies are a primary source of entertainment, but finding specific content can be challenging given the exponentially increasing number of movies produced each year. Recommendation systems are extremely useful for solving this problem. While various approaches exist, Collaborative Filtering (CF) is the most straightforward. CF leverages user input and historical preferences to determine user similarity and suggest movies. Matrix Factorization (MF) is one of the most popular Collaborative Filtering (CF) techniques. It maps users and items into a joint latent space, using a vector of latent features to represent each user or item. However, traditional MF techniques are static, while user cognition and product variety are constantly evolving. As a result, traditional MF approaches struggle to accommodate the dynamic nature of user-item interactions. To address this challenge, we propose a Dynamic Matrix Factorization CF model for movie recommendation systems (DMF-CF) that considers the dynamic changes in user interactions. To validate our approach, we conducted evaluations using the standard MovieLens dataset and compared it to state-of-the-art models. Our preliminary findings highlight the substantial benefits of DMF-CF, which outperforms recent models on the MovieLens-100K and MovieLens-1M datasets in terms of Mean Absolute Error (MAE) and Root Mean Squared Error (RMSE) metrics.","PeriodicalId":512408,"journal":{"name":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","volume":"22 8","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140264957","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}
Pub Date : 2024-03-05DOI: 10.46223/hcmcoujs.tech.en.14.1.2921.2024
Vy Thuy Tong, Hieu Chi Tran, Kiet Trung Tran
In today’s era of digital healthcare transformation, there is a growing demand for swift responses to mental health queries. To meet this need, we introduce an AI-driven chatbot system designed to automatically address frequently asked questions in psychology. Leveraging a range of classifiers including Support Vector Machine (SVM), K-Nearest Neighbors (KNN), and Naïve Bayes, our system extracts insights from expert data sources and employs natural language processing techniques like LDA Topic Modeling and Cosine similarity to generate contextually relevant responses. Through rigorous experimentation, we find that SVM surpasses Naïve Bayes and KNN in accuracy, precision, recall, and F1-score, making it our top choice for constructing the final response system. This research underscores the effectiveness of ensemble classifiers, particularly SVM, in providing accurate and valuable information to enhance mental health support in response to common psychological inquiries.
{"title":"Performance comparison ensemble classifier’s performance in answering frequently asked questions about psychology","authors":"Vy Thuy Tong, Hieu Chi Tran, Kiet Trung Tran","doi":"10.46223/hcmcoujs.tech.en.14.1.2921.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.tech.en.14.1.2921.2024","url":null,"abstract":"In today’s era of digital healthcare transformation, there is a growing demand for swift responses to mental health queries. To meet this need, we introduce an AI-driven chatbot system designed to automatically address frequently asked questions in psychology. Leveraging a range of classifiers including Support Vector Machine (SVM), K-Nearest Neighbors (KNN), and Naïve Bayes, our system extracts insights from expert data sources and employs natural language processing techniques like LDA Topic Modeling and Cosine similarity to generate contextually relevant responses. Through rigorous experimentation, we find that SVM surpasses Naïve Bayes and KNN in accuracy, precision, recall, and F1-score, making it our top choice for constructing the final response system. This research underscores the effectiveness of ensemble classifiers, particularly SVM, in providing accurate and valuable information to enhance mental health support in response to common psychological inquiries.","PeriodicalId":512408,"journal":{"name":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","volume":"11 11","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140263543","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}
Pub Date : 2024-03-05DOI: 10.46223/hcmcoujs.tech.en.14.1.2920.2024
Linh Nguyen Mai Vu, Hieu Chi Tran, Anh Thi Tram Nguyen
The objective of this study is to investigate the final exam scheduling process at the Ho Chi Minh City Open University and develop an automated exam scheduling application. Our primary objectives are to prevent students from having conflicting exam schedules and to ensure that no student has to take more than two exams on the same day. This research focuses on applying graph coloring algorithms to the problem of automatic exam scheduling. Our research findings indicate that the graph coloring algorithm is highly effective for automated exam scheduling. This study has the potential to expand and support the development of an automatic exam scheduling and management system, in line with our overall goals. We conduct the experiments on the practical data at HCMCOU and obtain promising results.
{"title":"A study on constructing an efficient examination scheduling system","authors":"Linh Nguyen Mai Vu, Hieu Chi Tran, Anh Thi Tram Nguyen","doi":"10.46223/hcmcoujs.tech.en.14.1.2920.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.tech.en.14.1.2920.2024","url":null,"abstract":"The objective of this study is to investigate the final exam scheduling process at the Ho Chi Minh City Open University and develop an automated exam scheduling application. Our primary objectives are to prevent students from having conflicting exam schedules and to ensure that no student has to take more than two exams on the same day. This research focuses on applying graph coloring algorithms to the problem of automatic exam scheduling. Our research findings indicate that the graph coloring algorithm is highly effective for automated exam scheduling. This study has the potential to expand and support the development of an automatic exam scheduling and management system, in line with our overall goals. We conduct the experiments on the practical data at HCMCOU and obtain promising results.","PeriodicalId":512408,"journal":{"name":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","volume":"16 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140264229","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}
Pub Date : 2024-03-05DOI: 10.46223/hcmcoujs.tech.en.14.1.3141.2024
Huan The Phung, Nghia Van Luong
In the context of the emergence of more and more administrative documents, the need to ensure accuracy and improve the quality of these documents becomes increasingly important. This research focuses on applying advanced language models to detect spelling errors in administrative documents. Specifically, in this study, a new method using a language model based on the Transformers architecture is proposed to automatically detect and correct common spelling errors in administrative documents. This method combines the model’s ability to understand context and grammar to identify words or phrases that are likely to be misspelled. The proposed method is tested on a dataset containing real administrative documents, and the experimental results show that the proposed model is capable of detecting spelling errors with significant performance, helping to improve accuracy. and improve the quality of administrative documents. This research not only contributes to improving the quality of administrative documents but also opens up new research directions in applying language models to issues related to natural language processing in the field of administration.
{"title":"Detecting spelling errors in Vietnamese administrative document using large language models","authors":"Huan The Phung, Nghia Van Luong","doi":"10.46223/hcmcoujs.tech.en.14.1.3141.2024","DOIUrl":"https://doi.org/10.46223/hcmcoujs.tech.en.14.1.3141.2024","url":null,"abstract":"In the context of the emergence of more and more administrative documents, the need to ensure accuracy and improve the quality of these documents becomes increasingly important. This research focuses on applying advanced language models to detect spelling errors in administrative documents. Specifically, in this study, a new method using a language model based on the Transformers architecture is proposed to automatically detect and correct common spelling errors in administrative documents. This method combines the model’s ability to understand context and grammar to identify words or phrases that are likely to be misspelled. The proposed method is tested on a dataset containing real administrative documents, and the experimental results show that the proposed model is capable of detecting spelling errors with significant performance, helping to improve accuracy. and improve the quality of administrative documents. This research not only contributes to improving the quality of administrative documents but also opens up new research directions in applying language models to issues related to natural language processing in the field of administration.","PeriodicalId":512408,"journal":{"name":"HO CHI MINH CITY OPEN UNIVERSITY JOURNAL OF SCIENCE - ENGINEERING AND TECHNOLOGY","volume":"10 5","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140264238","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：