• Title/Summary/Keyword: collaborative user profile

Search Result 42, Processing Time 0.026 seconds

A Recommendation System using Dynamic Profiles and Relative Quantification

  • Lee, Se-Il;Lee, Sang-Yong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.7 no.3
    • /
    • pp.165-170
    • /
    • 2007
  • Recommendation systems provide users with proper services using context information being input from many sensors occasionally under ubiquitous computing environment. But in case there isn't sufficient context information for service recommendation in spite of much context information, there can be problems of resulting in inexact result. In addition, in the quantification step to use context information, there are problems of classifying context information inexactly because of using an absolute classification course. In this paper, we solved the problem of lack of necessary context information for service recommendation by using dynamic profile information. We also improved the problem of absolute classification by using a relative classification of context information in quantification step. As the result of experiments, expectation preference degree was improved by 7.5% as compared with collaborative filtering methods using an absolute quantification method where context information of P2P mobile agent is used.

Collaborative Filtering using User Profiles Considering Temporal Variation and Context Information (시간적 변화를 고려한 사용자 프로파일과 컨텍스트 정보를 적용한 협력적 필터링)

  • Lee, Se-Il;Lee, Sang-Yong
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.04a
    • /
    • pp.261-264
    • /
    • 2007
  • 유비궈터스 환경의 추천 시스템에서는 협력적 필터링을 위하여 컨텍스트 정보를 사용하고 있으나, 컨텍스트 정보의 부족으로 인하여 추천 결과가 정확하지 않는 경우가 발생하게 된다. 이러한 문제를 해결하기 위하여 컨텍스트 정보와 더불어 사용자 프로파일의 서비스 이력 정보를 사용하였으나, 사용자 프로파일의 서비스 이력 정보는 시간이 지남에 따라 사용자의 기호가 변하거나 유행에 영향을 받을 수 있는 문제점이 있다. 또한 컨텍스트 정보와 사용자 프로파일의 서비스 이력 정보는 상황에 따라 적절히 연동하지 못하여 부정확한 예측을 할 수가 있다. 본 논문에서는 시간의 경과에 따라 사용자의 기호나 유행이 변하는 경우, 사용자 프로파일의 서비스 이력 정보들을 일률적인 값으로 적용하는 것이 아니라 시간에 따라 가중치를 달리 적용하는 방법을 사용하였다. 그리고 컨텍스트 정보와 사용자 프로파일의 서비스 이력 정보가 상황에 따라 적절히 연동하지 못하는 문제는 협력적 필터링하여 나온 결과에 컨텍스트 정보와 사용자 프로파일의 서비스 이력 정보의 가중치를 달리 적용하여 통합함으로써 예측성을 높일 수 있었다.

  • PDF

Collaborative Filtering using User Profiles Informal ion and Real-Time Context Information (사용자 프로파일 정보와 실시간 컨텍스트 정보를 이용한 협력적 필터링)

  • Lee Se-Il;Lee Sang-Yong
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2006.05a
    • /
    • pp.336-339
    • /
    • 2006
  • 추천시스템에서 가장 많이 사용하고 있는 협력적 필터링 방법을 모바일 기기 등에서 사용하려면 추천 정보와 사용자들의 평가 정보가 부족하여 추천의 질이 떨어지게 된다. 이러한 문제를 해결하기 위해 실시간으로 얻어진 컨텍스트 정보를 정량화하여 협력적 필터링에 적용함으로써 보다 나은 추천 결과를 얻을 수 있었다. 그럼에도 불구하고 평가를 하기 위한 컨텍스트 정보가 충분하지 못한 경우 부정확한 결과를 가져올 수 있다. 또한 사용자 정보 평가 과정 중 정량화 단계의 분류 과정을 단순히 하게 되면 서비스 받는 사용자가 정확한 그룹에 분류되어 정확도가 결여되는 문제가 발생한다. 본 논문에서는 실시간으로 얻을 수 있는 컨텍스트 정보가 부족한 경우, 내용 기반 필터링에서 많이 사용하고 있는 사용자 프로파일 정보를 실시간 컨텍스트 정보와 결합한다. 그리고 정량화 단계를 개선하여 협력적 필터링함으로써 기존의 방법보다 향상된 결과를 얻을 수 있다.

  • PDF

Dynamic Recommendation System for a Web Library by Using Cluster Analysis and Bayesian Learning (군집분석과 베이지안 학습을 이용한 웹 도서 동적 추천 시스템)

  • Choi, Jun-Hyeog;Kim, Dae-Su;Rim, Kee-Wook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.5
    • /
    • pp.385-392
    • /
    • 2002
  • Collaborative filtering method for personalization can suggest new items and information which a user hasn t expected. But there are some problems. Not only the steps for calculating similarity value between each user is complex but also it doesn t reflect user s interest dynamically when a user input a query. In this paper, classifying users by their interest makes calculating similarity simple. We propose the a1gorithm for readjusting user s interest dynamically using the profile and Bayesian learning. When a user input a keyword searching for a item, his new interest is readjusted. And the user s profile that consists of used key words and the presence frequency of key words is designed and used to reflect the recent interest of users. Our methods of adjusting user s interest using the profile and Bayesian learning can improve the real satisfaction of users through the experiment with data set, collected in University s library. It recommends a user items which he would be interested in.

A Study of Music Recommendation System in P2P Network using Collaborative Filtering (P2P 환경에서 협업 필터링을 이용한 음악 추천 시스템에 대한 연구)

  • Won, Hee-Jae;Park, Kyu-Sik
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.10
    • /
    • pp.1338-1346
    • /
    • 2008
  • In this paper, we propose a new P2P-based music recommendation system. In comparison with previous system in client-server environment, the proposed system shows higher quality of music recommendation through real-time sharing of music preference information between peers. A collaborative filtering is implemented as a recommendation algorithm. As a user preference profile, we use the inherit KID music genre index contained in all legitimate music file instead of music feature vectors as in previous research so that the proposed system can mitigate the performance degradation and high computational load caused by feature inaccuracy and feature extraction. The performance of the proposed system is evaluated in various ways with real 16-weeks transaction data provided by Korean music portal, 5 company and it shows comparative quality of recommendation with only small amount of computational load.

  • PDF

Exploiting Query Proximity and Graph Profiling Method for Tag-based Personalized Search in Folksonomy (질의어의 근접성 정보 및 그래프 프로파일링 기법을 이용한 태그 기반 개인화 검색)

  • Han, Keejun;Jang, Jincheul;Yi, Mun Yong
    • Journal of KIISE
    • /
    • v.41 no.12
    • /
    • pp.1117-1125
    • /
    • 2014
  • Folksonomy data, which is derived from social tagging systems, is a useful source for understanding a user's intention and interest. Using the folksonomy data, it is possible to create an accurate user profile which can be utilized to build a personalized search system. However there are limitations in some of the traditional methods such as Vector Space Model(VSM) for user profiling and similarity computation. This paper suggests a novel method with graph-based user and document profile which uses the proximity information of query terms to improve personalized search. We demonstrate the performance of the suggested method by comparing its performance with several state-of-the-art VSM based personalization models in two different folksonomy datasets. The results show that the proposed model constantly outperforms the other state-of-the-art personalization models. Furthermore, the parameter sensitivity results show that the proposed model is parameter-free in that it is not affected by the idiosyncratic nature of datasets.

Personalized Movie Recommendation System Using Context-Aware Collaborative Filtering Technique (상황기반과 협업 필터링 기법을 이용한 개인화 영화 추천 시스템)

  • Kim, Min Jeong;Park, Doo-Soon;Hong, Min;Lee, HwaMin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.289-296
    • /
    • 2015
  • The explosive growth of information has been difficult for users to get an appropriate information in time. The various ways of new services to solve problems has been provided. As customized service is being magnified, the personalized recommendation system has been important issue. Collaborative filtering system in the recommendation system is widely used, and it is the most successful process in the recommendation system. As the recommendation is based on customers' profile, there can be sparsity and cold-start problems. In this paper, we propose personalized movie recommendation system using collaborative filtering techniques and context-based techniques. The context-based technique is the recommendation method that considers user's environment in term of time, emotion and location, and it can reflect user's preferences depending on the various environments. In order to utilize the context-based technique, this paper uses the human emotion, and uses movie reviews which are effective way to identify subjective individual information. In this paper, this proposed method shows outperforming existing collaborative filtering methods.

Collaborative Filtering with Improved Quantification Process for Real-time Context Information (실시간 컨텍스트 정보의 정량화 단계를 개선한 협력적 필터링)

  • Lee, Se-Il;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.4
    • /
    • pp.488-493
    • /
    • 2007
  • In general, recommendation systems quantify real-time context information obtained in the stage of collaborative filtering and use quantified context information in order to recommend services. But the recommendation systems can have problems of recommending inaccurate information because of lack of context information or classifying users into inaccurate groups because of simple classification works in the stage of quantification. In this paper, we solved the problems of lack of context information obtained in real-time by combining users' profile information used in the contents-based filtering and context information obtained in real-time. In addition, we tried collaborative filtering at the quantification stage by improving absolute classification methods to relative ones. As the result of experiments, this method improved prediction preference by 5.8% than real-time recommendation systems using context information in pure P2P environment.

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.

An Agent-based Approach for Distributed Collaborative Filtering (분산 협력 필터링에 대한 에이전트 기반 접근 방법)

  • Kim, Byeong-Man;Li, Qing;Howe Adele E.;Yeo, Dong-Gyu
    • Journal of KIISE:Software and Applications
    • /
    • v.33 no.11
    • /
    • pp.953-964
    • /
    • 2006
  • Due to the usefulness of the collaborative filtering, it has been widely used in both the research and commercial field. However, there are still some challenges for it to be more efficient, especially the scalability problem, the sparsity problem and the cold start problem. In this paper. we address these problems and provide a novel distributed approach based on agents collaboration for the problems. We have tried to solve the scalability problem by making each agent save its users ratings and broadcast them to the users friends so that only friends ratings and his own ratings are kept in an agents local database. To reduce quality degradation of recommendation caused by the lack of rating data, we introduce a method using friends opinions instead of real rating data when they are not available. We also suggest a collaborative filtering algorithm based on user profile to provide new users with recommendation service. Experiments show that our suggested approach is helpful to the new user problem as well as is more scalable than traditional centralized CF filtering systems and alleviate the sparsity problem.