• Title/Summary/Keyword: Recommendation Techniques

Search Result 207, Processing Time 0.041 seconds

Scalable Collaborative Filtering Technique based on Adaptive Clustering (적응형 군집화 기반 확장 용이한 협업 필터링 기법)

  • Lee, O-Joun;Hong, Min-Sung;Lee, Won-Jin;Lee, Jae-Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.20 no.2
    • /
    • pp.73-92
    • /
    • 2014
  • An Adaptive Clustering-based Collaborative Filtering Technique was proposed to solve the fundamental problems of collaborative filtering, such as cold-start problems, scalability problems and data sparsity problems. Previous collaborative filtering techniques were carried out according to the recommendations based on the predicted preference of the user to a particular item using a similar item subset and a similar user subset composed based on the preference of users to items. For this reason, if the density of the user preference matrix is low, the reliability of the recommendation system will decrease rapidly. Therefore, the difficulty of creating a similar item subset and similar user subset will be increased. In addition, as the scale of service increases, the time needed to create a similar item subset and similar user subset increases geometrically, and the response time of the recommendation system is then increased. To solve these problems, this paper suggests a collaborative filtering technique that adapts a condition actively to the model and adopts the concepts of a context-based filtering technique. This technique consists of four major methodologies. First, items are made, the users are clustered according their feature vectors, and an inter-cluster preference between each item cluster and user cluster is then assumed. According to this method, the run-time for creating a similar item subset or user subset can be economized, the reliability of a recommendation system can be made higher than that using only the user preference information for creating a similar item subset or similar user subset, and the cold start problem can be partially solved. Second, recommendations are made using the prior composed item and user clusters and inter-cluster preference between each item cluster and user cluster. In this phase, a list of items is made for users by examining the item clusters in the order of the size of the inter-cluster preference of the user cluster, in which the user belongs, and selecting and ranking the items according to the predicted or recorded user preference information. Using this method, the creation of a recommendation model phase bears the highest load of the recommendation system, and it minimizes the load of the recommendation system in run-time. Therefore, the scalability problem and large scale recommendation system can be performed with collaborative filtering, which is highly reliable. Third, the missing user preference information is predicted using the item and user clusters. Using this method, the problem caused by the low density of the user preference matrix can be mitigated. Existing studies on this used an item-based prediction or user-based prediction. In this paper, Hao Ji's idea, which uses both an item-based prediction and user-based prediction, was improved. The reliability of the recommendation service can be improved by combining the predictive values of both techniques by applying the condition of the recommendation model. By predicting the user preference based on the item or user clusters, the time required to predict the user preference can be reduced, and missing user preference in run-time can be predicted. Fourth, the item and user feature vector can be made to learn the following input of the user feedback. This phase applied normalized user feedback to the item and user feature vector. This method can mitigate the problems caused by the use of the concepts of context-based filtering, such as the item and user feature vector based on the user profile and item properties. The problems with using the item and user feature vector are due to the limitation of quantifying the qualitative features of the items and users. Therefore, the elements of the user and item feature vectors are made to match one to one, and if user feedback to a particular item is obtained, it will be applied to the feature vector using the opposite one. Verification of this method was accomplished by comparing the performance with existing hybrid filtering techniques. Two methods were used for verification: MAE(Mean Absolute Error) and response time. Using MAE, this technique was confirmed to improve the reliability of the recommendation system. Using the response time, this technique was found to be suitable for a large scaled recommendation system. This paper suggested an Adaptive Clustering-based Collaborative Filtering Technique with high reliability and low time complexity, but it had some limitations. This technique focused on reducing the time complexity. Hence, an improvement in reliability was not expected. The next topic will be to improve this technique by rule-based filtering.

Understanding the Performance of Collaborative Filtering Recommendation through Social Network Analysis (소셜네트워크 분석을 통한 협업필터링 추천 성과의 이해)

  • Ahn, Sung-Mahn;Kim, In-Hwan;Choi, Byoung-Gu;Cho, Yoon-Ho;Kim, Eun-Hong;Kim, Myeong-Kyun
    • The Journal of Society for e-Business Studies
    • /
    • v.17 no.2
    • /
    • pp.129-147
    • /
    • 2012
  • Collaborative filtering (CF), one of the most successful recommendation techniques, has been used in a number of different applications such as recommending web pages, movies, music, articles and products. One of the critical issues in CF is why recommendation performances are different depending on application domains. However, prior literatures have focused on only data characteristics to explain the origin of the difference. Scant attentions have been paid to provide systematic explanation on the issue. To fill this research gap, this study attempts to systematically explain why recommendation performances are different using structural indexes of social network. For this purpose, we developed hypotheses regarding the relationships between structural indexes of social network and recommendation performance of collaboration filtering, and empirically tested them. Results of this study showed that density and inconclusiveness positively affected recommendation performance while clustering coefficient negatively affected it. This study can be used as stepping stone for understanding collaborative filtering recommendation performance. Furthermore, it might be helpful for managers to decide whether they adopt recommendation systems.

Method of Profile Storage for Improving Accuracy and Searching Time on Ubiquitous Computing

  • Jang, Chang-Bok;Lee, Joon-Dong;Lee, Moo-Hun;Cho, Sung-Hoon;Choi, Eui-In
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.12
    • /
    • pp.1709-1718
    • /
    • 2006
  • Users are able to use the information and service more free than previous wire network due to development of wireless network and device. For this reason, various studies on ubiquitous networks have been conducted. Various contexts brought in this ubiquitous environment, have recognized user's action through sensors. This results in the provision of better services. Because services exist in various places in ubiquitous networks, the application has the time of services searching. In addition, user's context is very dynamic, so a method needs to be found to recommend services to user by context. Therefore, techniques for reducing the time of service and increasing accuracy of recommendation are being studied. But it is difficult to quickly and appropriately provide large numbers of services, because only basic context information is stored. For this reason, we suggest DUPS(Dimension User Profile System), which stores location, time, and frequency information of often used services. Because previous technique used to simple information for recommending service without predicting services which is going to use on future, we can provide better service, and improve accuracy over previous techniques.

  • PDF

Intelligent Marketing and Merchandising Techniques for an Internet Shopping Mall (인터넷 쇼핑몰에서의 지능화된 마케팅과 상품화 계획 기법)

  • Ha, Sung-Ho;Park, Sang-Chan
    • Asia pacific journal of information systems
    • /
    • v.12 no.3
    • /
    • pp.71-88
    • /
    • 2002
  • In this paper, intelligent marketing and merchandising methods utilizing data mining and Web mining techniques are proposed for online retailers to survive and succeed in gaining competitive advantage in a highly competitive environment. The first part of this paper explains the procedures of one-to-one marketing based on customer relationship management(CRM) techniques and personalized recommendation lists generation. The second part illustrates Web merchandising methods utilizing data mining techniques, such as association and sequential pattern mining. We expect that our Web marketing and merchandising methods will both provide a currently operating Internet shopping mall with more selling opportunities and give more useful product information to customers.

Product Recommender System for Online Shopping Malls using Data Mining Techniques (데이터 마이닝을 이용한 인터넷 쇼핑몰 상품추천시스템)

  • Kim, Kyoung-Jae;Kim, Byoung-Guk
    • Journal of Intelligence and Information Systems
    • /
    • v.11 no.1
    • /
    • pp.191-205
    • /
    • 2005
  • This paper presents a novel product recommender system as a tool fur differentiated marketing service of online shopping malls. Ihe proposed model uses genetic algorithnt one of popular global optimization techniques, to construct a personalized product recommender systen The genetic algorinun may be useful to recommendation engine in product recommender system because it produces optimal or near-optimal recommendation rules using the customer profile and transaction data. In this study, we develop a prototype of WeLbased personalized product recommender system using the recommendation rules fi:om the genetic algorithnL In addition, this study evaluates usefulness of the proposed model through the test fur user satisfaction in real world.

  • PDF

Design and Implementation of a System for Recommending Related Content Using NoSQL (NoSQL 기반 연관 콘텐츠 추천 시스템의 설계 및 구현)

  • Ko, Eun-Jeong;Kim, Ho-Jun;Park, Hyo-Ju;Jeon, Young-Ho;Lee, Ki-Hoon;Shin, Saim
    • Journal of Korea Multimedia Society
    • /
    • v.20 no.9
    • /
    • pp.1541-1550
    • /
    • 2017
  • The increasing number of multimedia content offered to the user demands content recommendation. In this paper, we propose a system for recommending content related to the content that user is watching. In the proposed system, relationship information between content is generated using relationship information between representative keywords of content. Relationship information between keywords is generated by analyzing keyword collocation frequencies in Internet news corpus. In order to handle big corpus data, we design an architecture that consists of a distributed search engine and a distributed data processing engine. Furthermore, we store relationship information between keywords and relationship information between keywords and content in NoSQL to handle big relationship data. Because the query optimizer of NoSQL is not as well developed as RDBMS, we propose query optimization techniques to efficiently process complex queries for recommendation. Experimental results show that the performance is improved by up to 69 times by using the proposed techniques, especially when the number of requested related keywords is small.

Design of a Mirror for Fragrance Recommendation based on Personal Emotion Analysis (개인의 감성 분석 기반 향 추천 미러 설계)

  • Hyeonji Kim;Yoosoo Oh
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.28 no.4
    • /
    • pp.11-19
    • /
    • 2023
  • The paper proposes a smart mirror system that recommends fragrances based on user emotion analysis. This paper combines natural language processing techniques such as embedding techniques (CounterVectorizer and TF-IDF) and machine learning classification models (DecisionTree, SVM, RandomForest, SGD Classifier) to build a model and compares the results. After the comparison, the paper constructs a personal emotion-based fragrance recommendation mirror model based on the SVM and word embedding pipeline-based emotion classifier model with the highest performance. The proposed system implements a personalized fragrance recommendation mirror based on emotion analysis, providing web services using the Flask web framework. This paper uses the Google Speech Cloud API to recognize users' voices and use speech-to-text (STT) to convert voice-transcribed text data. The proposed system provides users with information about weather, humidity, location, quotes, time, and schedule management.

The Product Recommender System Combining Association Rules and Classification Models: The Case of G Internet Shopping Mall (연관규칙기법과 분류모형을 결합한 상품 추천 시스템: G 인터넷 쇼핑몰의 사례)

  • Ahn, Hyun-Chul;Han, In-Goo;Kim, Kyoung-Jae
    • Information Systems Review
    • /
    • v.8 no.1
    • /
    • pp.181-201
    • /
    • 2006
  • As the Internet spreads, many people have interests in e-CRM and product recommender systems, one of e-CRM applications. Among various approaches for recommendation, collaborative filtering and content-based approaches have been investigated and applied widely. Despite their popularity, traditional recommendation approaches have some limitations. They require at least one purchase transaction per user. In addition, they don't utilize much information such as demographic and specific personal profile information. This study suggests new hybrid recommendation model using two data mining techniques, association rule and classification, as well as intelligent agent to overcome these limitations. To validate the usefulness of the model, it was applied to the real case and the prototype web site was developed. We assessed the usefulness of the suggested recommendation model through online survey. The result of the survey showed that the information of the recommendation was generally useful to the survey participants.

Personalized TV Program Recommendation in VOD Service Platform Using Collaborative Filtering (VOD 서비스 플랫폼에서 협력 필터링을 이용한 TV 프로그램 개인화 추천)

  • Han, Sunghee;Oh, Yeonhee;Kim, Hee Jung
    • Journal of Broadcast Engineering
    • /
    • v.18 no.1
    • /
    • pp.88-97
    • /
    • 2013
  • Collaborative filtering(CF) for the personalized recommendation is a successful and popular method in recommender systems. But the mainly researched and implemented cases focus on dealing with independent items with explicit feedback by users. For the domain of TV program recommendation in VOD service platform, we need to consider the unique characteristic and constraints of the domain. In this paper, we studied on the way to convert the viewing history of each TV program episodes to the TV program preference by considering the series structure of TV program. The former is implicit for personalized preference, but the latter tells quite explicitly about the persistent preference. Collaborative filtering is done by the unit of series while data gathering and final recommendation is done by the unit of episodes. As a result, we modified CF to make it more suitable for the domain of TV program VOD recommendation. Our experimental study shows that it is more precise in performance, yet more compact in calculation compared to the plain CF approaches. It can be combined with other existing CF techniques as an algorithm module.

The Development of Users' Interesting Points Analyses Method and POI Recommendation System for Indoor Location Based Services (실내 위치기반 서비스를 위한 사용자 관심지점 탐사 기법과 POI추천 시스템의 구현)

  • Kim, Beoum-Su;Lee, Yeon;Kim, Gyeong-Bae;Bae, Hae-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.17 no.5
    • /
    • pp.81-91
    • /
    • 2012
  • Recently, as location-determination of indoor users is available with the development of variety of localization techniques for indoor location-based service, diverse indoor location based services are proposed. Accordingly, it is necessary to develop individualized POI recommendation service for recommending most interested points of large-scale commercial spaces such as shopping malls and departments. For POI recommendation, it is necessary to study the method for exploring location which users are interested in location with considering user's mobility in large-scale commercial spaces. In this paper, we proposed POI recommendation system with the definition of users' as 'Stay point' in order to consider users' various interest locations. By using the proposed algorithm, we analysis users' Stay points, then mining the users' visiting pattern to finished the proposed. POI Recommendation System. The proposed system decreased data more dramatically than that of using user's entire mobility data and usage of memory.