• Title/Summary/Keyword: 사용자 선호도 정보

Search Result 979, Processing Time 0.036 seconds

Web Documents Classification with Fuzzy Integration of Multiple Structure-Adaptive Self-Organizing Maps (다중 구조적응 자기구성지도의 퍼지결합을 이용한 웹 문서 분류)

  • 김경중;조성배
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.04c
    • /
    • pp.371-373
    • /
    • 2003
  • 웹 문서를 분류하는 목적은 특정 주제별로 중요한 문서들을 구분하려는 것과 사용자의 선호도를 바탕으로 개인화를 하려는 것으로 나누어 볼 수 있다. 특히, 웹의 효율적인 탐색을 위해 사용자가 관심 있어 할 웹 문서를 분류하는 것은 중요하다 일반적으로 하나의 웹 문서는 특징 추출방법에 의해 문서 벡터로 표시되며 사용자의 선호여부나 주제번호를 클래스로 삼는다. 사용자가 선호도를 표시한 웹 문서를 사용하여 새로운 웹 문서의 선호 여부를 예측하기 위해 자기 구성지도(SOM)를 사용하면, 시각적으로 구조를 보여주어 데이터 사이의 관계를 효과적으로 이해할 수 있다. 그러나 SOM은 노드의 개수와 구조를 자동적으로 결정하지 못하는 단점이 있기 때문에, SOM의 장점을 활용하면서 자동적으로 구조를 결정하기 위해 구조적응 자기구성지도(SASOM)를 이용한다. 보다 나은 성능과 다양한 해석을 위해, 여러 개의 SASOM을 서로 다른 특징추출 방법을 이용하여 학습시킨 후 사용자가 주관적으로 분류기의 중요도를 결정할 수 있는 퍼지적분을 사용하여 결합하였다. UCI Syskill & Webert 데이터에 대한 실험결과 기존의 DT, MLP, naive Bayes 분류기 보다 향상된 성능을 보였다.

  • PDF

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.

A Study on Intelligent Navigation System using Soft-computing (소프트 컴퓨팅을 이용한 지능형 네비게이션에 관한 연구)

  • Choi, In-Chan;Lee, Hong-Gi;Jeon, Hong-Tae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.6
    • /
    • pp.799-805
    • /
    • 2010
  • In this paper, we propose an intelligent navigation system that selects a proper route for user and applies the user's preference, user's tendency and environmental state estimated by driving information of user and road state. The system uses data of sensors, navigation and intelligent transport system to evaluate conditions of roads and it considers state of user's emotion. The system also uses soft-computing method to infer and learn the user's preference and tendency. We verify the proposed algorithm by computer simulation.

A Design of PNS System Using a User's Preference Information based on LBS (LBS기반 사용자 성향을 이용한 PNS 시스템 설계)

  • Kim, Myung-Hwan;Chung, Yeong-Jee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.11a
    • /
    • pp.1113-1116
    • /
    • 2005
  • PNS 시스템은 개인 휴대 단말기나 이동전화기로 제공되는 위치 지리 정보 서비스로 개인화된 서비스라 할 수 있다. 그러나 위치기반 PNS 서비스는 단순 위치 정보의 활용만이 아니라 위치 정보를 근간으로 POI(Poin of Interest)가 제공되어야 한다. 이를 위해서는 위치 및 위치에 부가되는 상황 정보를 바탕으로 개인의 개별화된 정보가 포함되어야 한다. 그러나 이러한 서비스에서 제공되는 위치 지리 정보는 개인의 성향이나 특성에 따른 정보를 포함하지 않기 때문에 개인 선호 특성 정보가 반영되지 않아 무분별한 POI 정보가 제공되고 있다. 본 논문에서는 사용자가 선 입력한 성향정보와 History 정보로부터 추출되는 사용자 선호 특성 정보를 데이터베이스로 구축하고, 개인 선호 특성 정보를 반영하여 웹 또는 모바일 기기를 통해 POI 서비스를 제공 받을 수 있는 PNS시스템을 제안하였다.

  • PDF

A Movie Recommender Systems using Personal Disposition in Hadoop (하둡에서 개인 성향을 이용한 영화 추천시스템)

  • Kim, Sun-Ho;Kim, Se-Jun;Mo, Ha-Young;Kim, Chae-Reen;Park, Gyu-Tae;Park, Doo-Soon
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.04a
    • /
    • pp.642-644
    • /
    • 2014
  • 정보의 폭발적인 증가로 인해 사용자들은 오히려 원하는 정보를 빠른 시간에 얻는 것이 힘들어졌다. 따라서 이 문제를 해결하기 위한 다양한 방식의 새로운 서비스들이 제공되고 있다. 추천 시스템 중에서 영화를 추천해주는 방법에는 사용되는 알고리즘에는 협업필터링 방법이 가장 성공한 알고리즘으로 사용되고 있다. 협업 필터링 방법은 사용자가 자발적으로 입력한 선호도 평가치를 바탕으로 추천 하고자 하는 사용자와 취향이 비슷하다고 판단되는 사람들 즉, 최근접 이웃을 구하고 최근접 이웃의 선호도 평가치를 바탕으로 사용자에게 영화를 추천을 해주는 기법이다. 그러나 협업 필터링에는 몇 가지 대표적인 문제점이 있으며 희박성 및 확장성, 투명성이 있다. 본 논문에서는 영화 추천 시스템에서의 협업필터링의 희박성 문제를 보완하고자 개개인의 성향을 반영하여 효율이 좋은 추천 방법을 제안하고 하둡에서 성능평가를 하였다.

Collaborative Filtering for Recommendation based on Neural Network (추천을 위한 신경망 기반 협력적 여과)

  • 김은주;류정우;김명원
    • Journal of KIISE:Software and Applications
    • /
    • v.31 no.4
    • /
    • pp.457-466
    • /
    • 2004
  • Recommendation is to offer information which fits user's interests and tastes to provide better services and to reduce information overload. It recently draws attention upon Internet users and information providers. The collaborative filtering is one of the widely used methods for recommendation. It recommends an item to a user based on the reference users' preferences for the target item or the target user's preferences for the reference items. In this paper, we propose a neural network based collaborative filtering method. Our method builds a model by learning correlation between users or items using a multi-layer perceptron. We also investigate integration of diverse information to solve the sparsity problem and selecting the reference users or items based on similarity to improve performance. We finally demonstrate that our method outperforms the existing methods through experiments using the EachMovie data.

Design and Application of User Preference Information Structure and Program Information Structure (사용자 적응적 방송 수신을 위한 사용자 선호도 정보구조와 프로그램 정보구조의 설계 및 응용)

  • 윤경로;이진수;이희연
    • Journal of Broadcast Engineering
    • /
    • v.5 no.1
    • /
    • pp.94-101
    • /
    • 2000
  • User adaptive reception of broadcast programs includes the functionality such as the user adaptive filtering and browsing functionality. The user adaptive filtering means that the user can limit the list of programs to include only his/her favorite programs among hundreds of available programs. The user adaptive browsing means that the user can view a short summary of his/her selection in the way that he/she prefers. When the receiving system include the random access storage device, the automatic recording functionality of users favorite programs can be included. The user adaptive reception requires support from various meta-data such as user preference data and content description data. TV Anytime forum is a standardization effort to enable user adaptive TV reception, which means that the user can watch what s/he wants when s/he want in the way s/he wants. MPEG-7 includes not only the content description for broadcast applications but also other content descriptions such as structure information. This paper addresses the relationship between MPEG-7 and TV Anytime and investigates how MPEG-7 should be designed and be used to satisfy the requirements of the user adaptive reception of broadcast program.

  • PDF

Learning User Profile with Reinforcement Learning (강화학습 기반 사용자 프로파일 학습)

  • 김영란;한현구
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10d
    • /
    • pp.325-327
    • /
    • 2002
  • 정보검색 태스크에서 사용자 모델링의 목적은 관련정보 검색을 용이하게 해주기 위하여 사용자의 관심도 또는 필요정보의 모델을 학습하는 것으로 시간적인 속성(temporal characteristics)을 가지며 관심 이동을 적절하게 반영하여야 한다. 강화학습은 정답이 주어지지 않고 사용자의 평가만이 수치적으로 주어지는 환경에서 평가를 최대화 한다는 목표를 가지므로 사용자 프로파일 학습에 적용할 수 있다. 본 논문에서는 사용자가 문서에 대해 행하는 일련의 행위를 평가값으로 하여 사용자가 선호하는 용어를 추출한 후, 사용자 프로파일을 강화학습 알고리즘으로 학습하는 방법을 제안한다. 사용자의 선호도에 적응하는 능력을 유지하기 위하여 지역 최대값들을 피할 수 있고, 가장 좋은 장기간 최적정책에 수렴하는 R-Learning을 적용한다. R-learning은 할인된 보상값의 최적화보다 평균 보상값을 최적화하기 때문에 장기적인 사용자 모델링에 적합하다는 것을 제시한다.

  • PDF

A Group Modeling Strategy Considering Deviation of the User's Preference in Group Recommendation (그룹 추천에서 사용자 선호도의 편차를 고려한 그룹 모델링 전략)

  • Kim, HyungJin;Seo, Young-Duk;Baik, Doo-Kwon
    • Journal of KIISE
    • /
    • v.43 no.10
    • /
    • pp.1144-1153
    • /
    • 2016
  • Group recommendation analyzes the characteristics and tendency of a group rather than an individual and provides relevant information for the members of the group. Existing group recommendation methods merely consider the average and frequency of a preference. However, if the users' preferences have large deviations, it is difficult to provide satisfactory results for all users in the group, although the average and frequency values are high. To solve these problems, we propose a method that considers not only the average of a preference but also the deviation. The proposed method provides recommendations with high average values and low deviations for the preference, so it reflects the tendency of all group members better than existing group recommendation methods. Through a comparative experiment, we prove that the proposed method has better performance than existing methods, and verify that it has high performance in groups with a large number of members as well as in small groups.

Optimal Associative Neighborhood Mining using Representative Attribute (대표 속성을 이용한 최적 연관 이웃 마이닝)

  • Jung Kyung-Yong
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.43 no.4 s.310
    • /
    • pp.50-57
    • /
    • 2006
  • In Electronic Commerce, the latest most of the personalized recommender systems have applied to the collaborative filtering technique. This method calculates the weight of similarity among users who have a similar preference degree in order to predict and recommend the item which hits to propensity of users. In this case, we commonly use Pearson Correlation Coefficient. However, this method is feasible to calculate a correlation if only there are the items that two users evaluated a preference degree in common. Accordingly, the accuracy of prediction falls. The weight of similarity can affect not only the case which predicts the item which hits to propensity of users, but also the performance of the personalized recommender system. In this study, we verify the improvement of the prediction accuracy through an experiment after observing the rule of the weight of similarity applying Vector similarity, Entropy, Inverse user frequency, and Default voting of Information Retrieval field. The result shows that the method combining the weight of similarity using the Entropy with Default voting got the most efficient performance.