• Title/Summary/Keyword: recommender systems

Search Result 335, Processing Time 0.031 seconds

The Construction of Multiform User Profiles Based on Transaction for Effective Recommendation and Segmentation (효과적인 추천과 세분화를 위한 트랜잭션 기반 여러 형태 사용자 프로파일의 구축)

  • Koh, Jae-Jin;An, Hyoung-Keun
    • The KIPS Transactions:PartD
    • /
    • v.13D no.5 s.108
    • /
    • pp.661-670
    • /
    • 2006
  • With the development of e-Commerce and the proliferation of easily accessible information, information filtering systems such as recommender and SDI systems have become popular to prune large information spaces so that users are directed toward those items that best meet their needs and preferences. Until now, many information filtering methods have been proposed to support filtering systems. XML is emerging as a new standard for information. Recently, filtering systems need new approaches in dealing with XML documents. So, in this paper our system suggests a method to create multiform user profiles with XML's ability to represent structure. This system consists of two parts; one is an administrator profile definition part that an administrator defines to analyze users purchase pattern before a transaction such as purchase happens directly. an other is a user profile creation part module which is applied by the defined profile. Administrator profiles are made from DTD information and it is supposed to point the specific part of a document conforming to the DTD. Proposed system builds user's profile more accurately to get adaptability for user's behavior of buying and provide useful product information without inefficient searching based on such user's profile.

A Study on the Effect of Network Centralities on Recommendation Performance (네트워크 중심성 척도가 추천 성능에 미치는 영향에 대한 연구)

  • Lee, Dongwon
    • Journal of Intelligence and Information Systems
    • /
    • v.27 no.1
    • /
    • pp.23-46
    • /
    • 2021
  • Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.

Development of User Decision Support System for Leisure Kayak Model Design (레저용 카약 디자인 설계를 위한 사용자 의사결정 지원 시스템 개발)

  • Seong, Hyeon-Kyeong;Choi, Yong-Seok;Park, Byeong-Ho;Park, Chan-Hong;Lim, Lee-Young
    • Journal of Digital Contents Society
    • /
    • v.15 no.2
    • /
    • pp.227-235
    • /
    • 2014
  • The change from people's work-centered values to their leisure-centered values leads into the change in their life styles. In the circumstance, people's participation into sports activities seems to be an important means to improve their quality of life. Along with the change of the times, more people take part in water leisure sports including kayak. As a result, people's needs for various designs of water leisure goods are on the rise. In this sense, it is necessary to come up with strategies to actively respond to such a change. In this paper, we proposed a user decision-making support system for designing kayaks for leisure. Based on the previous studies and literatures and a questionnaire survey with consumers, it chose the sensitivity related to design. By conducting factor analysis and evaluation, it drew sensitivity and proposed kayak design layouts in the aspect of customer sensitivity preference. It is expected that the result of this study will be used not only for kayak design, but as a design guide for the equipment of water leisure sports, and will be applied for user-friendly design.

(Efficient Methods for Combining User and Article Models for Collaborative Recommendation) (협력적 추천을 위한 사용자와 항목 모델의 효율적인 통합 방법)

  • 도영아;김종수;류정우;김명원
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.5_6
    • /
    • pp.540-549
    • /
    • 2003
  • In collaborative recommendation two models are generally used: the user model and the article model. A user model learns correlation between users preferences and recommends an article based on other users preferences for the article. Similarly, an article model learns correlation between preferences for articles and recommends an article based on the target user's preference for other articles. In this paper, we investigates various combination methods of the user model and the article model for better recommendation performance. They include simple sequential and parallel methods, perceptron, multi-layer perceptron, fuzzy rules, and BKS. We adopt the multi-layer perceptron for training each of the user and article models. The multi-layer perceptron has several advantages over other methods such as the nearest neighbor method and the association rule method. It can learn weights between correlated items and it can handle easily both of symbolic and numeric data. The combined models outperform any of the basic models and our experiments show that the multi-layer perceptron is the most efficient combination method among them.

Reducing Noise Using Degree of Scattering in Collaborative Filtering System (협력적 여과 시스템에서 산포도를 이용한 잡음 감소)

  • Ko, Su-Jeong
    • The KIPS Transactions:PartB
    • /
    • v.14B no.7
    • /
    • pp.549-558
    • /
    • 2007
  • Collaborative filtering systems have problems when users rate items and the rated results depend on their feelings, as there is a possibility that the results include noise. The method proposed in this paper optimizes the matrix by excluding irrelevant ratings as information for recommendations from a user-item matrix using dispersion. It reduces the noise that results from predicting preferences based on original user ratings by inflecting the information for items and users on the matrix. The method excludes the ratings values of the utmost limits using a percentile to supply the defects of coefficient of variance and composes a weighted user-item matrix by combining the user coefficient of variance with the median of ratings for items. Finally, the preferences of the active user are predicted based on the weighted matrix. A large database of user ratings for movies from the MovieLens recommender system is used, and the performance is evaluated. The proposed method is shown to outperform earlier methods significantly.

Through the Looking Glass: The Role of Portals in South Korea's Online News Media Ecology

  • Dwyer, Tim;Hutchinson, Jonathon
    • Journal of Contemporary Eastern Asia
    • /
    • v.18 no.2
    • /
    • pp.16-32
    • /
    • 2019
  • Media manipulation of breaking news through article selection, ranking and tweaking of social media data and comment streams is a growing concern for society. We argue that the combination of human and machine curation on media portals marks a new period for news media and journalism. Although intermediary platforms routinely claim that they are merely the neutral technological platform which facilitates news and information flows, rejecting any criticisms that they are operating as de facto media organisations; instead, we argue for an alternative, more active interpretation of their roles. In this article we provide a contemporary account of the South Korean ('Korean') online news media ecology as an exemplar of how contemporary media technologies, and in particular portals and algorithmic recommender systems, perform a powerful role in shaping the kind of news and information that citizens access. By highlighting the key stakeholders and their positions within the production, publication and distribution of news media, we argue that the overall impact of the major portal platforms of Naver and Kakao is far more consequential than simply providing an entertaining media diet for consumers. These portals are central in designing how and which news is sourced, produced and then accessed by Korean citizens. From a regulatory perspective the provision of news on the portals can be a somewhat ambiguous and moving target, subject to soft and harder regulatory measures. While we investigate a specific case study of the South Korean experience, we also trace out connections with the larger global media ecology. We have relied on policy documents, stakeholder interviews and portal user 'walk throughs' to understand the changing role of news and its surfacing on a distinctive breed of media platforms.

Performance Analysis of Similarity Reflecting Jaccard Index for Solving Data Sparsity in Collaborative Filtering (협력필터링의 데이터 희소성 해결을 위한 자카드 지수 반영의 유사도 성능 분석)

  • Lee, Soojung
    • The Journal of Korean Association of Computer Education
    • /
    • v.19 no.4
    • /
    • pp.59-66
    • /
    • 2016
  • It has been studied to reflect the number of co-rated items for solving data sparsity problem in collaborative filtering systems. A well-known method of Jaccard index allowed performance improvement, when combined with previous similarity measures. However, the degree of performance improvement when combined with existing similarity measures in various data environments are seldom analyzed, which is the objective of this study. Jaccard index as a sole similarity measure yielded much higher prediction quality than traditional measures and very high recommendation quality in a sparse dataset. In general, previous similarity measures combined with Jaccard index improved performance regardless of dataset characteristics. Especially, cosine similarity achieved the highest improvement in sparse datasets, while similarity of Mean Squared Difference degraded prediction quality in denser sets. Therefore, one needs to consider characteristics of data environment and similarity measures before combining Jaccard index for similarity use.

Design and Implementation of a Customized Contents Service System for Relieving Users' Stress (사용자의 스트레스 완화를 위한 맞춤형 콘텐츠 서비스 시스템의 설계 및 구현)

  • Kim, Jin-Sung;Kim, Seung-Hoon
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.2
    • /
    • pp.101-112
    • /
    • 2011
  • As the society has become maturer, stress has emerged as a hot social issue. In this paper, we proposed the design and implementation of a customized contents service system for relieving users' stress. In the proposed system, we compute the stress index from a user's biometics and psychology, and recommend a combination of video, sound, aroma, and lighting based on the index and user's data such as preferences, and provide the recommended contents service. We first classify symptoms of stress and then define a tool for self assessment. We classify video, sound, aroma, and lighting contents as well according to the defined symptoms. We propose 3-phase customized recommender and service model for customized contents service. We design and implement a customized contents service system for relieving users' stress. Different from existing systems, this proposed system has an individually-customized system and provides a diverse combination of different content's types.

Design a Method Enhancing Recommendation Accuracy Using Trust Cluster from Large and Complex Information (대규모 복잡 정보에서 신뢰 클러스터를 이용한 추천 정확도 향상기법 설계)

  • Noh, Giseop;Oh, Hayoung;Lee, Jaehoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.1
    • /
    • pp.17-25
    • /
    • 2018
  • Recently, with the development of ICT technology and the rapid spread of smart devices, a huge amount of information is being generated. The recommendation system has helped the informant to judge the information from the information overload, and it has become a solution for the information provider to increase the profit of the company and the publicity effect of the company. Recommendation systems can be implemented in various approaches, but social information is presented as a way to improve performance. However, no research has been done to utilize trust cluster information among users in the recommendation system. In this paper, we propose a method to improve the performance of the recommendation system by using the influence between the intra-cluster objects and the information between the trustor-trustee in the cluster generated in the online review. Experiments using the proposed method and real data have confirmed that the prediction accuracy is improved than the existing methods.

POMDP Based Trustworthy Android App Recommendation Services (부분적 관찰정보기반 견고한 안드로이드 앱 추천 기법)

  • Oh, Hayoung;Goo, EunHee
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.6
    • /
    • pp.1499-1506
    • /
    • 2017
  • The use of smartphones and the launch of various apps have increased exponentially, and malicious apps have also increased. Existing app recommendation systems have been limited to operate based on static information analysis such as ratings, comments, and popularity categories of other users who are online. In this paper, we first propose a robust app recommendation system that realistically uses dynamic information of apps actually used in smartphone and considers static information and dynamic information at the same time. In other words, this paper proposes a robust Android app recommendation system by partially reflecting the time of the app, the frequency of use of the app, the interaction between the app and the app, and the number of contact with the Android kernel. As a result of the performance evaluation, the proposed method proved to be a robust and efficient app recommendation system.