• Title/Summary/Keyword: Hybrid recommendation algorithm

Search Result 34, Processing Time 0.025 seconds

A Cascade-hybrid Recommendation Algorithm based on Collaborative Deep Learning Technique for Accuracy Improvement and Low Latency

  • Lee, Hyun-ho;Lee, Won-jin;Lee, Jae-dong
    • Journal of Korea Multimedia Society
    • /
    • v.23 no.1
    • /
    • pp.31-42
    • /
    • 2020
  • During the 4th Industrial Revolution, service platforms utilizing diverse contents are emerging, and research on recommended systems that can be customized to users to provide quality service is being conducted. hybrid recommendation systems that provide high accuracy recommendations are being researched in various domains, and various filtering techniques, machine learning, and deep learning are being applied to recommended systems. However, in a recommended service environment where data must be analyzed and processed real time, the accuracy of the recommendation is important, but the computational speed is also very important. Due to high level of model complexity, a hybrid recommendation system or a Deep Learning-based recommendation system takes a long time to calculate. In this paper, a Cascade-hybrid recommended algorithm is proposed that can reduce the computational time while maintaining the accuracy of the recommendation. The proposed algorithm was designed to reduce the complexity of the model and minimize the computational speed while processing sequentially, rather than using existing weights or using a hybrid recommendation technique handled in parallel. Therefore, through the algorithms in this paper, contents can be analyzed and recommended effectively and real time through services such as SNS environments or shared economy platforms.

Hybrid Recommendation Algorithm for User Satisfaction-oriented Privacy Model

  • Sun, Yinggang;Zhang, Hongguo;Zhang, Luogang;Ma, Chao;Huang, Hai;Zhan, Dongyang;Qu, Jiaxing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.10
    • /
    • pp.3419-3437
    • /
    • 2022
  • Anonymization technology is an important technology for privacy protection in the process of data release. Usually, before publishing data, the data publisher needs to use anonymization technology to anonymize the original data, and then publish the anonymized data. However, for data publishers who do not have or have less anonymized technical knowledge background, how to configure appropriate parameters for data with different characteristics has become a more difficult problem. In response to this problem, this paper adds a historical configuration scheme resource pool on the basis of the traditional anonymization process, and configuration parameters can be automatically recommended through the historical configuration scheme resource pool. On this basis, a privacy model hybrid recommendation algorithm for user satisfaction is formed. The algorithm includes a forward recommendation process and a reverse recommendation process, which can respectively perform data anonymization processing for users with different anonymization technical knowledge backgrounds. The privacy model hybrid recommendation algorithm for user satisfaction described in this paper is suitable for a wider population, providing a simpler, more efficient and automated solution for data anonymization, reducing data processing time and improving the quality of anonymized data, which enhances data protection capabilities.

A Many-objective Particle Swarm Optimization Algorithm Based on Multiple Criteria for Hybrid Recommendation System

  • Hu, Zhaomin;Lan, Yang;Zhang, Zhixia;Cai, Xingjuan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.2
    • /
    • pp.442-460
    • /
    • 2021
  • Nowadays, recommendation systems (RSs) are applied to all aspects of online life. In order to overcome the problem that individuals who do not meet the constraints need to be regenerated when the many-objective evolutionary algorithm (MaOEA) solves the hybrid recommendation model, this paper proposes a many-objective particle swarm optimization algorithm based on multiple criteria (MaPSO-MC). A generation-based fitness evaluation strategy with diversity enhancement (GBFE-DE) and ISDE+ are coupled to comprehensively evaluate individual performance. At the same time, according to the characteristics of the model, the regional optimization has an impact on the individual update, and a many-objective evolutionary strategy based on bacterial foraging (MaBF) is used to improve the algorithm search speed. Experimental results prove that this algorithm has excellent convergence and diversity, and can produce accurate, diverse, novel and high coverage recommendations when solving recommendation models.

Multi-Purpose Hybrid Recommendation System on Artificial Intelligence to Improve Telemarketing Performance

  • Hyung Su Kim;Sangwon Lee
    • Asia pacific journal of information systems
    • /
    • v.29 no.4
    • /
    • pp.752-770
    • /
    • 2019
  • The purpose of this study is to incorporate telemarketing processes to improve telemarketing performance. For this application, we have attempted to mix the model of machine learning to extract potential customers with personalisation techniques to derive recommended products from actual contact. Most of traditional recommendation systems were mainly in ways such as collaborative filtering, which predicts items with a high likelihood of future purchase, based on existing purchase transactions or preferences for products. But, under these systems, new users or items added to the system do not have sufficient information, and generally cause problems such as a cold start that can not obtain satisfactory recommendation items. Also, indiscriminate telemarketing attempts can backfire as they increase the dissatisfaction and fatigue of customers who do not want to be contacted. To this purpose, this study presented a multi-purpose hybrid recommendation algorithm to achieve two goals: to select customers with high possibility of contact, and to recommend products to selected customers. In addition, we used subscription data from telemarketing agency that handles insurance products to derive realistic applicability of the proposed recommendation system. Our proposed recommendation system would certainly solve the cold start and scarcity problem of existing recommendation algorithm by using contents information such as customer master information and telemarketing history. Also. the model could show excellent performance not only in terms of overall performance but also in terms of the recommendation success rate of the unpopular product.

A New Item Recommendation Procedure Using Preference Boundary

  • Kim, Hyea-Kyeong;Jang, Moon-Kyoung;Kim, Jae-Kyeong;Cho, Yoon-Ho
    • Asia pacific journal of information systems
    • /
    • v.20 no.1
    • /
    • pp.81-99
    • /
    • 2010
  • Lately, in consumers' markets the number of new items is rapidly increasing at an overwhelming rate while consumers have limited access to information about those new products in making a sensible, well-informed purchase. Therefore, item providers and customers need a system which recommends right items to right customers. Also, whenever new items are released, for instance, the recommender system specializing in new items can help item providers locate and identify potential customers. Currently, new items are being added to an existing system without being specially noted to consumers, making it difficult for consumers to identify and evaluate new products introduced in the markets. Most of previous approaches for recommender systems have to rely on the usage history of customers. For new items, this content-based (CB) approach is simply not available for the system to recommend those new items to potential consumers. Although collaborative filtering (CF) approach is not directly applicable to solve the new item problem, it would be a good idea to use the basic principle of CF which identifies similar customers, i,e. neighbors, and recommend items to those customers who have liked the similar items in the past. This research aims to suggest a hybrid recommendation procedure based on the preference boundary of target customer. We suggest the hybrid recommendation procedure using the preference boundary in the feature space for recommending new items only. The basic principle is that if a new item belongs within the preference boundary of a target customer, then it is evaluated to be preferred by the customer. Customers' preferences and characteristics of items including new items are represented in a feature space, and the scope or boundary of the target customer's preference is extended to those of neighbors'. The new item recommendation procedure consists of three steps. The first step is analyzing the profile of items, which are represented as k-dimensional feature values. The second step is to determine the representative point of the target customer's preference boundary, the centroid, based on a personal information set. To determine the centroid of preference boundary of a target customer, three algorithms are developed in this research: one is using the centroid of a target customer only (TC), the other is using centroid of a (dummy) big target customer that is composed of a target customer and his/her neighbors (BC), and another is using centroids of a target customer and his/her neighbors (NC). The third step is to determine the range of the preference boundary, the radius. The suggested algorithm Is using the average distance (AD) between the centroid and all purchased items. We test whether the CF-based approach to determine the centroid of the preference boundary improves the recommendation quality or not. For this purpose, we develop two hybrid algorithms, BC and NC, which use neighbors when deciding centroid of the preference boundary. To test the validity of hybrid algorithms, BC and NC, we developed CB-algorithm, TC, which uses target customers only. We measured effectiveness scores of suggested algorithms and compared them through a series of experiments with a set of real mobile image transaction data. We spilt the period between 1st June 2004 and 31st July and the period between 1st August and 31st August 2004 as a training set and a test set, respectively. The training set Is used to make the preference boundary, and the test set is used to evaluate the performance of the suggested hybrid recommendation procedure. The main aim of this research Is to compare the hybrid recommendation algorithm with the CB algorithm. To evaluate the performance of each algorithm, we compare the purchased new item list in test period with the recommended item list which is recommended by suggested algorithms. So we employ the evaluation metric to hit the ratio for evaluating our algorithms. The hit ratio is defined as the ratio of the hit set size to the recommended set size. The hit set size means the number of success of recommendations in our experiment, and the test set size means the number of purchased items during the test period. Experimental test result shows the hit ratio of BC and NC is bigger than that of TC. This means using neighbors Is more effective to recommend new items. That is hybrid algorithm using CF is more effective when recommending to consumers new items than the algorithm using only CB. The reason of the smaller hit ratio of BC than that of NC is that BC is defined as a dummy or virtual customer who purchased all items of target customers' and neighbors'. That is centroid of BC often shifts from that of TC, so it tends to reflect skewed characters of target customer. So the recommendation algorithm using NC shows the best hit ratio, because NC has sufficient information about target customers and their neighbors without damaging the information about the target customers.

A Hybrid Recommendation System based on Fuzzy C-Means Clustering and Supervised Learning

  • Duan, Li;Wang, Weiping;Han, Baijing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.7
    • /
    • pp.2399-2413
    • /
    • 2021
  • A recommendation system is an information filter tool, which uses the ratings and reviews of users to generate a personalized recommendation service for users. However, the cold-start problem of users and items is still a major research hotspot on service recommendations. To address this challenge, this paper proposes a high-efficient hybrid recommendation system based on Fuzzy C-Means (FCM) clustering and supervised learning models. The proposed recommendation method includes two aspects: on the one hand, FCM clustering technique has been applied to the item-based collaborative filtering framework to solve the cold start problem; on the other hand, the content information is integrated into the collaborative filtering. The algorithm constructs the user and item membership degree feature vector, and adopts the data representation form of the scoring matrix to the supervised learning algorithm, as well as by combining the subjective membership degree feature vector and the objective membership degree feature vector in a linear combination, the prediction accuracy is significantly improved on the public datasets with different sparsity. The efficiency of the proposed system is illustrated by conducting several experiments on MovieLens dataset.

A Hybrid Music Recommendation System Combining Listening Habits and Tag Information (사용자 청취 습관과 태그 정보를 이용한 하이브리드 음악 추천 시스템)

  • Kim, Hyon Hee;Kim, Donggeon;Jo, Jinnam
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.2
    • /
    • pp.107-116
    • /
    • 2013
  • In this paper, we propose a hybrid music recommendation system combining users' listening habits and tag information in a social music site. Most of commercial music recommendation systems recommend music items based on the number of plays and explicit ratings of a song. However, the approach has some difficulties in recommending new items with only a few ratings or recommending items to new users with little information. To resolve the problem, we use tag information which is generated by collaborative tagging. According to the meaning of tags, a weighted value is assigned as the score of a tag of an music item. By combining the score of tags and the number of plays, user profiles are created and collaborative filtering algorithm is executed. For performance evaluation, precision, recall, and F-measure are calculated using the listening habit-based recommendation, the tag score-based recommendation, and the hybrid recommendation, respectively. Our experiments show that the hybrid recommendation system outperforms the other two approaches.

An Intelligent Recommendation Service System for Offering Halal Food (IRSH) Based on Dynamic Profiles

  • Lee, Hyun-ho;Lee, Won-jin;Lee, Jae-dong
    • Journal of Korea Multimedia Society
    • /
    • v.22 no.2
    • /
    • pp.260-270
    • /
    • 2019
  • As the growth of developing Islamic countries, Muslims are into the world. The most important thing for Muslims to purchase food, ingredient, cosmetics and other products are whether they were certified as 'Halal'. With the increasing number of Muslim tourists and residents in Korea, Halal restaurants and markets are on the rise. However, the service that provides information on Halal restaurants and markets in Korea is very limited. Especially, the application of recommendation system technology is effective to provide Halal restaurant information to users efficiently. The profiling of Halal restaurant information should be preceded by design of recommendation system, and design of recommendation algorithm is most important part in designing recommendation system. In this paper, an Intelligent Recommendation Service system for offering Halal food (IRSH) based on dynamic profiles was proposed. The proposed system recommend a customized Halal restaurant, and proposed recommendation algorithm uses hybrid filtering which is combined by content-based filtering, collaborative filtering and location-based filtering. The proposed algorithm combines several filtering techniques in order to improve the accuracy of recommendation by complementing the various problems of each filtering. The experiment of performance evaluation for comparing with existed restaurant recommendation system was proceeded, and result that proposed IRSH increase recommendation accuracy using Halal contents was deducted.

Analysis on Filter Bubble reinforcement of SNS recommendation algorithm identified in the Russia-Ukraine war (러시아-우크라이나 전쟁에서 파악된 SNS 추천알고리즘의 필터버블 강화현상 분석)

  • CHUN, Sang-Hun;CHOI, Seo-Yeon;SHIN, Seong-Joong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.3
    • /
    • pp.25-30
    • /
    • 2022
  • This study is a study on the filter bubble reinforcement phenomenon of SNS recommendation algorithm such as YouTube, which is a characteristic of the Russian-Ukraine war (2022), and the victory or defeat factors of the hybrid war. This war is identified as a hybrid war, and the use of New Media based on the SNS recommendation algorithm is emerging as a factor that determines the outcome of the war beyond political leverage. For this reason, the filter bubble phenomenon goes beyond the dictionary meaning of confirmation bias that limits information exposed to viewers. A YouTube video of Ukrainian President Zelensky encouraging protests in Kyiv garnered 7.02 million views, but Putin's speech only 800,000, which is a evidence that his speech was not exposed to the recommendation algorithm. The war of these SNS recommendation algorithms tends to develop into an algorithm war between the US (YouTube, Twitter, Facebook) and China (TikTok) big tech companies. Influenced by US companies, Ukraine is now able to receive international support, and in Russia, under the influence of Chinese companies, Putin's approval rating is over 80%, resulting in conflicting results. Since this algorithmic empowerment is based on the confirmation bias of public opinion by 'filter bubble', the justification that a new guideline setting for this distortion phenomenon should be presented shortly is drawing attention through this Russia-Ukraine war.

Recommendation System using 2-Way Hybrid Collaborative Filtering in E-Business (전자상거래에서 2-Way 혼합 협력적 필터링을 이용한 추천 시스템)

  • 김용집;정경용;이정현
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.175-178
    • /
    • 2003
  • Two defects have been pointed out in existing user-based collaborative filtering such as sparsity and scalability, and the research has been also made progress, which tries to improve these defects using item-based collaborative filtering. Actually there were many results, but the problem of sparsity still remains because of being based on an explicit data. In addition, the issue has been pointed out. which attributes of item arenot reflected in the recommendation. This paper suggests a recommendation method using nave Bayesian algorithm in hybrid user and item-based collaborative filtering to improve above-mentioned defects of existing item-based collaborative filtering. This method generates a similarity table for each user and item, then it improves the accuracy of prediction and recommendation item using naive Bayesianalgorithm. It was compared and evaluated with existing item-based collaborative filtering technique to estimate the accuracy.

  • PDF