• Title/Summary/Keyword: 사용자 선호

Search Result 1,051, Processing Time 0.032 seconds

Ontology and Rule-Based Resource Reasoning for a Personalized Service in Ubiquitous Environments (유비쿼터스 환경에서 개인화된 서비스를 위한 오톨로지와 규치 기반 자원 추론)

  • Sun-Hee Kang;Jong-Hyun Park;SungBum Hong;Young-Kuk Kim;Ji-Hoon Kang
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.985-988
    • /
    • 2008
  • 유비쿼터스 컴퓨팅 환경에서는 공유 가능한 자원들이 산재되어 존재하며 사용자는 이를 기반으로 최적의 서비스를 제공받기를 원한다. 그러나 환경 내에는 다양한 상황과 서비스들이 존재하며 사용자 개인의 선호 정보 역시 매우 다양한 것이 현실이다. 그러므로 사용자가 원하는 서비스의 제공을 위해서는 사용자가 어떠한 상황에서 어떠한 서비스를 요청했으며, 어떤 자원이 사용자의 현재 상황에 적절한지를 판단하여, 사용자 요구사항에 맞는 자원을 추론하는 과정이 반드시 필요하다. 본 논문에서는 사용자가 최적의 서비스를 제공받을 수 있도록 주변의 공유 가능한 자원들을 추론하고 이들을 추천하기 위한 방법을 제안한다. 이를 위하여 사용자의 상황을 인식하기 위한 방안으로 온톨로지를 이용한 상황추론 방법을 제안한다. 또한 사용자 선호 정보를 반영하여 개인 맞춤형 자원을 추천하기 위한 추론방법의 하나로 규칙을 이용한 추론방법을 제안한다.

Preference Prediction System using Similarity Weight granted Bayesian estimated value and Associative User Clustering (베이지안 추정치가 부여된 유사도 가중치와 연관 사용자 군집을 이용한 선호도 예측 시스템)

  • 정경용;최성용;임기욱;이정현
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.3_4
    • /
    • pp.316-325
    • /
    • 2003
  • A user preference prediction method using an exiting collaborative filtering technique has used the nearest-neighborhood method based on the user preference about items and has sought the user's similarity from the Pearson correlation coefficient. Therefore, it does not reflect any contents about items and also solve the problem of the sparsity. This study suggests the preference prediction system using the similarity weight granted Bayesian estimated value and the associative user clustering to complement problems of an exiting collaborative preference prediction method. This method suggested in this paper groups the user according to the Genre by using Association Rule Hypergraph Partitioning Algorithm and the new user is classified into one of these Genres by Naive Bayes classifier to slove the problem of sparsity in the collaborative filtering system. Besides, for get the similarity between users belonged to the classified genre and new users, this study allows the different estimated value to item which user vote through Naive Bayes learning. If the preference with estimated value is applied to the exiting Pearson correlation coefficient, it is able to promote the precision of the prediction by reducing the error of the prediction because of missing value. To estimate the performance of suggested method, the suggested method is compared with existing collaborative filtering techniques. As a result, the proposed method is efficient for improving the accuracy of prediction through solving problems of existing collaborative filtering techniques.

Application of MPEG-21 DIA Descriptions for Adaptive Color Reproduction (적응적 컬러 재생을 위한 MPEG-21 DIA 조명환경 기술자와 컬러 선호성 기술자의 활용)

  • 허영식
    • Proceedings of the IEEK Conference
    • /
    • 2003.07d
    • /
    • pp.1479-1482
    • /
    • 2003
  • MPEG-21 Part 7(Digital Item Adaptation)은 멀티미디어컨텐츠를 사용자 환경 및 사용자 특성에 적응 적으로 활용/소비하기 위한 표준이다. 본 논문에서는, 영상컨텐츠의 적응적 컬러 재생에 관련하여 MPEG-21 DIA 내에서 표준화가 진행중인 조명환경 기술자(Descriptor)와 컬러 선호성 기술자를 소개하고 이들의 활용에 관해 논한다.

  • PDF

A Study on Users Preference Using Fuzzy Logical on Electronic Commerce Systems (전자상거래 시스템에서 퍼지논리를 이용한 사용자 선호도에 관한 연구)

  • 김영천;이성주
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.11 no.1
    • /
    • pp.52-57
    • /
    • 2001
  • 인터넷의 대중화와 더불어 전자상거래에 대한 관심과 중요성이 더욱 증대되고 있다. 전자상거래에서 보다 많은 고객들을 유치하기 위해서는 거래의 안정성 보장, 시스템의 사용 편의성, 다양한 물품의 제공, 저렴한 가격 등과 함께 차별화된 고객 서비스 전략이 필요하다. 고객의 취향에 적합한 상품 정보를 제공함으로써 고객의 만족도를 증진시키고 나아가 지속적인 방문을 유도하고자 한다. 본 논문에서는 고객이 전자상거래 쇼핑몰을 방문 시 고객별로 관리되는 선호도를 활용하여 고객의 취향에 적합한 상품 정보를 제공한다. 퍼지논리를 이용하여 제품군간에 근접도를 반영함으로써 사용자에게 보다 좋은 상품 정보를 제공하는 기법을 제안한다.

  • PDF

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.

Web Search Personalization based on Preferences for Page Features (문서 특성에 대한 선호도 기반 웹 검색 개인화)

  • Lee, Soo-Jung
    • Journal of The Korean Association of Information Education
    • /
    • v.15 no.2
    • /
    • pp.219-226
    • /
    • 2011
  • Web personalization has focused on extracting web pages interesting to users, to help users searching wanted information efficiently on the web. One of the main methods to achieve this is by using queries, links and users' preferred words in the pages. In this study, we surveyed from the web users the features of pages that are considered important to themselves in selecting web pages. The survey results showed that the content of the pages is the most important. However, images and readability of the page are rated as high as the content for some users. Based on this result, we present a method for maintaining relative weights of major page features differently in the profile for each user, which is used for personalizing web search results. Performance of the proposed personalization method is analyzed to prove its superiority such that it yields as much as 1.5 times higher rate than the system utilizing both queries and preferred words and about 2.3 times higher rate than a generic search engine.

  • PDF

Push Service Technique based on Semantic Web for Personalized Services (개인화서비스를 위한 시맨틱웹 기반 푸시서비스 기법)

  • Kim, Ju-Yeon;Kim, Jong-Woo;Kim, Jin-Chun
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.6
    • /
    • pp.18-26
    • /
    • 2010
  • Many personalized services that provide users with adaptive information according to users' preferences have been researched and developed. Push services are especially expected to be more economic impact because push services satisfy user's potential needs even if the user does not require anything. In this paper, we propose Semantic Web approach in order to enhance the performance of push services. Our approach provides infrastructure to recommend contents based on semantic association by enabling information of contents and user preferences to be described on service-specific ontologies that reflect features of each service. In addition, our approach can recommend users with adaptive information based on information represented in our description model. Our approach enables information of contents and user preferences to be described with rich expressiveness, and it provides semantic interoperability.

A Topic Modeling-based Recommender System Considering Changes in User Preferences (고객 선호 변화를 고려한 토픽 모델링 기반 추천 시스템)

  • Kang, So Young;Kim, Jae Kyeong;Choi, Il Young;Kang, Chang Dong
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.2
    • /
    • pp.43-56
    • /
    • 2020
  • Recommender systems help users make the best choice among various options. Especially, recommender systems play important roles in internet sites as digital information is generated innumerable every second. Many studies on recommender systems have focused on an accurate recommendation. However, there are some problems to overcome in order for the recommendation system to be commercially successful. First, there is a lack of transparency in the recommender system. That is, users cannot know why products are recommended. Second, the recommender system cannot immediately reflect changes in user preferences. That is, although the preference of the user's product changes over time, the recommender system must rebuild the model to reflect the user's preference. Therefore, in this study, we proposed a recommendation methodology using topic modeling and sequential association rule mining to solve these problems from review data. Product reviews provide useful information for recommendations because product reviews include not only rating of the product but also various contents such as user experiences and emotional state. So, reviews imply user preference for the product. So, topic modeling is useful for explaining why items are recommended to users. In addition, sequential association rule mining is useful for identifying changes in user preferences. The proposed methodology is largely divided into two phases. The first phase is to create user profile based on topic modeling. After extracting topics from user reviews on products, user profile on topics is created. The second phase is to recommend products using sequential rules that appear in buying behaviors of users as time passes. The buying behaviors are derived from a change in the topic of each user. A collaborative filtering-based recommendation system was developed as a benchmark system, and we compared the performance of the proposed methodology with that of the collaborative filtering-based recommendation system using Amazon's review dataset. As evaluation metrics, accuracy, recall, precision, and F1 were used. For topic modeling, collapsed Gibbs sampling was conducted. And we extracted 15 topics. Looking at the main topics, topic 1, top 3, topic 4, topic 7, topic 9, topic 13, topic 14 are related to "comedy shows", "high-teen drama series", "crime investigation drama", "horror theme", "British drama", "medical drama", "science fiction drama", respectively. As a result of comparative analysis, the proposed methodology outperformed the collaborative filtering-based recommendation system. From the results, we found that the time just prior to the recommendation was very important for inferring changes in user preference. Therefore, the proposed methodology not only can secure the transparency of the recommender system but also can reflect the user's preferences that change over time. However, the proposed methodology has some limitations. The proposed methodology cannot recommend product elaborately if the number of products included in the topic is large. In addition, the number of sequential patterns is small because the number of topics is too small. Therefore, future research needs to consider these limitations.

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.

The method to Apply User Preference for On-line Shopping Mall: A Topic Map approach (온라인 쇼핑몰에서 사용자 선호도 적용 방법: 토픽맵 적용)

  • Jeong, Hwa-Young;Kim, Yoon-Ho
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.5
    • /
    • pp.925-930
    • /
    • 2011
  • In this paper, we propose a method to apply the purchase preference of a user in on-line shopping mall. To analyze the preference, we use topic preference vector. The topic is purchase count of products. In this structure, we construct the association the four factors; Purchase Hit meaning the purchase count of product, Count meaning the purchase count by other users in interesting product, Preference meaning product preference, and product meaning information of the product. By this structure and the method, we could show that proposed method displayed the product applying user preference, effectively.