• Title/Summary/Keyword: paper recommendation

Search Result 1,134, Processing Time 0.039 seconds

The YouTube Video Recommendation Algorithm using Users' Social Category (사용자의 소셜 카테고리를 이용한 유튜브 동영상 추천 알고리즘)

  • Yoo, SoYeop;Jeong, OkRan
    • Journal of KIISE
    • /
    • v.42 no.5
    • /
    • pp.664-670
    • /
    • 2015
  • With the rapid progression of the Internet and smartphones, YouTube has grown significantly as a social media sharing site and has become popular all around the world. As users share videos through YouTube, social data are created and users look for video recommendations related to their interests. In this paper, we extract users' social category based on their social relationship and social category classification list using YouTube data. We propose the YouTube recommendation algorithm using the extracted users' social category for more accurate and meaningful recommendations. We show experiment results of its validation.

Development of User-dependent Mid-point Navigation System (사용자 중심의 중간지점 탐색 시스템의 설계 및 구현)

  • Ahn, Jonghee;Kang, Inhyeok;Seo, Seyeong;Kim, Taewoo;Heo, Yusung;Ahn, Yonghak
    • Convergence Security Journal
    • /
    • v.19 no.2
    • /
    • pp.73-81
    • /
    • 2019
  • In this paper, we propose a user-dependent mid-point navigation system using a time weighted mid-point navigation algorithm and a user preference based mid-point neighborhood recommendation system. The proposed system consists of a mid-point navigation module for calculating an mid-point by applying a time weight of each user based on a departure point between users, and a search module for providing a search for a route to the calculated mid-point. In addition, based on the mid-point search result, it is possible to increase the utilization rate of users by including a place recommending function based on user's preference. Experimental results show that the proposed system can increase the efficiency of using by the user-dependent mid-point navigation and place recommendation function.

Deep learning-based custom problem recommendation algorithm to improve learning rate (학습률 향상을 위한 딥러닝 기반 맞춤형 문제 추천 알고리즘)

  • Lim, Min-Ah;Hwang, Seung-Yeon;Kim, Jeong-Jun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.171-176
    • /
    • 2022
  • With the recent development of deep learning technology, the areas of recommendation systems have also diversified. This paper studied algorithms to improve the learning rate and studied the significance results according to words through comparison with the performance characteristics of the Word2Vec model. The problem recommendation algorithm was implemented with the values expressed through the reflection of meaning and similarity test between texts, which are characteristics of the Word2Vec model. Through Word2Vec's learning results, problem recommendations were conducted using text similarity values, and problems with high similarity can be recommended. In the experimental process, it was seen that the accuracy decreased with the quantitative amount of data, and it was confirmed that the larger the amount of data in the data set, the higher the accuracy.

Personalized News Recommendation System using Machine Learning (머신 러닝을 사용한 개인화된 뉴스 추천 시스템)

  • Peng, Sony;Yang, Yixuan;Park, Doo-Soon;Lee, HyeJung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.385-387
    • /
    • 2022
  • With the tremendous rise in popularity of the Internet and technological advancements, many news keeps generating every day from multiple sources. As a result, the information (News) on the network has been highly increasing. The critical problem is that the volume of articles or news content can be overloaded for the readers. Therefore, the people interested in reading news might find it difficult to decide which content they should choose. Recommendation systems have been known as filtering systems that assist people and give a list of suggestions based on their preferences. This paper studies a personalized news recommendation system to help users find the right, relevant content and suggest news that readers might be interested in. The proposed system aims to build a hybrid system that combines collaborative filtering with content-based filtering to make a system more effective and solve a cold-start problem. Twitter social media data will analyze and build a user's profile. Based on users' tweets, we can know users' interests and recommend personalized news articles that users would share on Twitter.

SaaS application mashup based on High Speed Message Processing

  • Chen, Zhiguo;Kim, Myoungjin;Cui, Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1446-1465
    • /
    • 2022
  • Diversified SaaS applications allow users more choices to use, according to their own preferences. However, the diversification of SaaS applications also makes it impossible for users to choose the best one. Furthermore, users can't take advantage of the functionality between SaaS applications. In this paper, we propose a platform that provides an SaaS mashup service, by extracting interoperable service functions from SaaS-based applications that independent vendors deploy and supporting a customized service recommendation function through log data binding in the cloud environment. The proposed SaaS mashup service platform consists of a SaaS aggregation framework and a log data binding framework. Each framework was concreted by using Apache Kafka and rule matrix-based recommendation techniques. We present the theoretical basis of implementing the high-performance message-processing function using Kafka. The SaaS mashup service platform, which provides a new type of mashup service by linking SaaS functions based on the above technology described, allows users to combine the required service functions freely and access the results of a rich service-utilization experience, using the SaaS mashup function. The platform developed through SaaS mashup service technology research will enable various flexible SaaS services, expected to contribute to the development of the smart-contents industry and the open market.

Machine Learning Algorithms for Predicting Anxiety and Depression (불안과 우울 예측을 위한 기계학습 알고리즘)

  • Kang, Yun-Jeong;Lee, Min-Hye;Park, Hyuk-Gyu
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.207-209
    • /
    • 2022
  • In the IoT environment, it is possible to collect life pattern data by recognizing human physical activity from smart devices. In this paper, the proposed model consists of a prediction stage and a recommendation stage. The prediction stage predicts the scale of anxiety and depression by using logistic regression and k-nearest neighbor algorithm through machine learning on the dataset collected from life pattern data. In the recommendation step, if the symptoms of anxiety and depression are classified, the principal component analysis algorithm is applied to recommend food and light exercise that can improve them. It is expected that the proposed anxiety/depression prediction and food/exercise recommendations will have a ripple effect on improving the quality of life of individuals.

  • PDF

How to improve the accuracy of recommendation systems: Combining ratings and review texts sentiment scores (평점과 리뷰 텍스트 감성분석을 결합한 추천시스템 향상 방안 연구)

  • Hyun, Jiyeon;Ryu, Sangyi;Lee, Sang-Yong Tom
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.1
    • /
    • pp.219-239
    • /
    • 2019
  • As the importance of providing customized services to individuals becomes important, researches on personalized recommendation systems are constantly being carried out. Collaborative filtering is one of the most popular systems in academia and industry. However, there exists limitation in a sense that recommendations were mostly based on quantitative information such as users' ratings, which made the accuracy be lowered. To solve these problems, many studies have been actively attempted to improve the performance of the recommendation system by using other information besides the quantitative information. Good examples are the usages of the sentiment analysis on customer review text data. Nevertheless, the existing research has not directly combined the results of the sentiment analysis and quantitative rating scores in the recommendation system. Therefore, this study aims to reflect the sentiments shown in the reviews into the rating scores. In other words, we propose a new algorithm that can directly convert the user 's own review into the empirically quantitative information and reflect it directly to the recommendation system. To do this, we needed to quantify users' reviews, which were originally qualitative information. In this study, sentiment score was calculated through sentiment analysis technique of text mining. The data was targeted for movie review. Based on the data, a domain specific sentiment dictionary is constructed for the movie reviews. Regression analysis was used as a method to construct sentiment dictionary. Each positive / negative dictionary was constructed using Lasso regression, Ridge regression, and ElasticNet methods. Based on this constructed sentiment dictionary, the accuracy was verified through confusion matrix. The accuracy of the Lasso based dictionary was 70%, the accuracy of the Ridge based dictionary was 79%, and that of the ElasticNet (${\alpha}=0.3$) was 83%. Therefore, in this study, the sentiment score of the review is calculated based on the dictionary of the ElasticNet method. It was combined with a rating to create a new rating. In this paper, we show that the collaborative filtering that reflects sentiment scores of user review is superior to the traditional method that only considers the existing rating. In order to show that the proposed algorithm is based on memory-based user collaboration filtering, item-based collaborative filtering and model based matrix factorization SVD, and SVD ++. Based on the above algorithm, the mean absolute error (MAE) and the root mean square error (RMSE) are calculated to evaluate the recommendation system with a score that combines sentiment scores with a system that only considers scores. When the evaluation index was MAE, it was improved by 0.059 for UBCF, 0.0862 for IBCF, 0.1012 for SVD and 0.188 for SVD ++. When the evaluation index is RMSE, UBCF is 0.0431, IBCF is 0.0882, SVD is 0.1103, and SVD ++ is 0.1756. As a result, it can be seen that the prediction performance of the evaluation point reflecting the sentiment score proposed in this paper is superior to that of the conventional evaluation method. In other words, in this paper, it is confirmed that the collaborative filtering that reflects the sentiment score of the user review shows superior accuracy as compared with the conventional type of collaborative filtering that only considers the quantitative score. We then attempted paired t-test validation to ensure that the proposed model was a better approach and concluded that the proposed model is better. In this study, to overcome limitations of previous researches that judge user's sentiment only by quantitative rating score, the review was numerically calculated and a user's opinion was more refined and considered into the recommendation system to improve the accuracy. The findings of this study have managerial implications to recommendation system developers who need to consider both quantitative information and qualitative information it is expect. The way of constructing the combined system in this paper might be directly used by the developers.

Dynamic Link Recommendation Based on Anonymous Weblog Mining (익명 웹로그 탐사에 기반한 동적 링크 추천)

  • Yoon, Sun-Hee;Oh, Hae-Seok
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.647-656
    • /
    • 2003
  • In Webspace, mining traversal patterns is to understand user's path traversal patterns. On this mining, it has a unique characteristic which objects (for example, URLs) may be visited due to their positions rather than contents, because users move to other objects according to providing information services. As a consequence, it becomes very complex to extract meaningful information from these data. Recently discovering traversal patterns has been an important problem in data mining because there has been an increasing amount of research activity on various aspects of improving the quality of information services. This paper presents a Dynamic Link Recommendation (DLR) algorithm that recommends link sets on a Web site through mining frequent traversal patterns. It can be employed to any Web site with massive amounts of data. Our experimentation with two real Weblog data clearly validate that our method outperforms traditional method.

Development of Gift Recommendation App according to the Individual Preference fused with e-Commerce (전자상거래와 융합한 개인의 취향에 따른 선물 추천 앱 개발)

  • Cho, Kwangmoon
    • Journal of Digital Convergence
    • /
    • v.13 no.8
    • /
    • pp.261-265
    • /
    • 2015
  • When choosing a gift for the other person what does that person like? It falls into a happy worry. Choosing the right gift for someone else associated with me is not easy in the personalized world gradually. In this paper a smart phone app is developed for reducing conflicts and saving time to choose gifts. It may help improve a person's satisfaction. It can reduce the worry and time required for buying a gift. It may also be used to make future interpersonal relationships and vitalize the relationships. For the gift recommendation in accordance with the preferences of the person through the process in accordance with the classification of each category can recommend an appropriate gift. The appropriation of the gift is updated to reflect the continuing satisfaction by recommendation status decided by the pre-survey. Any gift is recommended using the formula calculating the priority to recommend reflect a variety of weights. In addition, it is possible to increase the utilization of the app via the fusion between the e-commerce system.

Context Aware Environment based U-Health Service of Recommendation Factors Identity and Decision-Making Model Creation (상황인지 환경 기반 유헬스 서비스의 추천 요인 식별 및 의사결정 모델 생성)

  • Kim, Jae-Kwon;Lee, Young-Ho
    • Journal of Digital Convergence
    • /
    • v.11 no.5
    • /
    • pp.429-436
    • /
    • 2013
  • Context aware environment u-health service is to provide health service with recognition of a computer. The computer recognizes that a patient can contact real life in many context. Context aware environment service for recommend have to definition of context data and service recommendations related to factors shall be identified. In this paper, Context aware environment of u-health service will be provide context data related to identifies recommendations factors using multivariate analysis method and recommendations factors creation to decision tree, association rule based decision model. health service recommend for significantly context data can be distinguish through recommendation factors of identify. Also, context data of patient can know preference factors through preference decision model.