• Title/Summary/Keyword: Contents Recommendation Method

Search Result 161, Processing Time 0.029 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.

Finding Top-k Answers in Node Proximity Search Using Distribution State Transition Graph

  • Park, Jaehui;Lee, Sang-Goo
    • ETRI Journal
    • /
    • v.38 no.4
    • /
    • pp.714-723
    • /
    • 2016
  • Considerable attention has been given to processing graph data in recent years. An efficient method for computing the node proximity is one of the most challenging problems for many applications such as recommendation systems and social networks. Regarding large-scale, mutable datasets and user queries, top-k query processing has gained significant interest. This paper presents a novel method to find top-k answers in a node proximity search based on the well-known measure, Personalized PageRank (PPR). First, we introduce a distribution state transition graph (DSTG) to depict iterative steps for solving the PPR equation. Second, we propose a weight distribution model of a DSTG to capture the states of intermediate PPR scores and their distribution. Using a DSTG, we can selectively follow and compare multiple random paths with different lengths to find the most promising nodes. Moreover, we prove that the results of our method are equivalent to the PPR results. Comparative performance studies using two real datasets clearly show that our method is practical and accurate.

A Study on Color Recommendation System for Mobile App -Focused on the Method of Color Recommendation for the Material Design Color System (모바일 앱을 위한 배색 추천 시스템에 관한 연구 -머티리얼 디자인 컬러 시스템의 색채 추천 방법을 중심으로)

  • Hwang, Seung-Hyun;Lee, Hyun-Jhin
    • The Journal of the Korea Contents Association
    • /
    • v.19 no.10
    • /
    • pp.353-363
    • /
    • 2019
  • This study is for the use of color recommendation system for the color combination of mobile application. For this study, color combination methods of a material design color system that recommends harmonized colors automatically and of a mobile web application were applied to a mobile application design and a color combination experiment was carried out. Then for a survey on the experiment using the two methods, color combinations, selected colors and satisfaction with outputs were investigated on a 7-point Likert scale. And color combination characteristics of outputs were compared. It was found that the material design color palette made it easy to select colors by systematizing the regular coloring stages of fixed colors automatically, but there were differences in color compositions and color scopes of dominant color, assort color and accent colors, which are three-color combinations of mobile web application and accent color selection function was required for each design, since only primary colors and secondary colors could be selected. Moreover, chromatic colors were used a lot in the material system because of the fixed color scopes and color combination scopes and images of color combination outcomes varied depending on the color combination scopes, even when tones with a big contrast or complementary colors were selected. The role of color composition was important according to the color combination scopes.

A Study of a Personalized Curation Service and Business Model based on Book Information (도서정보 기반의 고객 맞춤형 큐레이션 서비스 및 비즈니스 모델 연구)

  • Kwon, Hyeog-In;Na, Yun-Bin;Yu, Mi-Ok;Choi, Kwang-Sun
    • Journal of Information Technology Services
    • /
    • v.14 no.1
    • /
    • pp.251-262
    • /
    • 2015
  • This study checks the conceptual definition of domestic book curation which is still in the beginning stage, the necessity of developing service and business, domestic and overseas case of relevant service. Further, the problem of book recommendation service and the difficulty anticipated in the embodiment of service are investigated together and the business model as new IT service is suggested to supplement them. Specifically, the collection of book information and customer information (interest and purchase pattern) and the procedure of mining the collected information and the process of embodying visualization was presented in the sector of service in the first place. Then, the technical transfer of developed solution and the construction cost and the method to impose commission over contents sales are presented in the sector of business. Diverse social and economic effects are expected to realize by developing and utilizing such services, namely, promoting the distribution of excellent book which were kept in dead storage so far due to lack of marketing support, recommendation readers the proper books which are convenient and necessary.

A Method of Color KANSEI Information Extraction in Video Data (비디오 데이터에서의 컬러 감성 정보 추출 방법)

  • Choi, Jun-Ho;Hwangi, Myung-Gwon;Choi, Chang;Kim, Pan-Koo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.532-535
    • /
    • 2008
  • The requirement of Digital Culture Content(Movie, Music, Animation, Digital TV, Exhibition and etc.) is increasing so variety and quantity of content is also increasing. The Movie what majority of the digital Content is developing of technology and data. In the result, the efficient retrieval service has required and user want to use a recommendation engine and semantic retrieval methods through the recommendation system. Therefore, this paper will suggest analysing trait element of digital content data, building of retrieval technology, analysing and retrieval technology base on KANSEI vocabulary and etc. For the these, we made a extraction technology of trait element based on semantics and KANSEI processing algorithm based on color information.

  • PDF

A Study on the Improvement of Filter Bubble Phenomenon by Echo Chamber in Social Media (소셜미디어에서 에코챔버에 의한 필터버블 현상 개선 방안 연구)

  • Cho, Jinhyung;Kim, Kyujung
    • The Journal of the Korea Contents Association
    • /
    • v.22 no.5
    • /
    • pp.56-66
    • /
    • 2022
  • Due to the recent increase in information encountered on social media, algorithm-based recommendation formats selectively provide information based on user information, which often causes a filter bubble effect by an Echo Chamber. Eco-chamber refers to a phenomenon in which beliefs are amplified or strengthened by communication only in an enclosed system, and filter bubbles refer to a phenomenon in which information providers provide customized information according to users' interests, and users encounter only filtered information. The purpose of this study is to propose a method of efficiently selecting information as a way to improve the filter bubble phenomenon by such an echo chamber. The research progress method analyzed recommended algorithms used on YouTube, Facebook and Amazon. In this study, humanities solutions such as training critical thinking skills of social media users and strengthening objective ethical standards according to self-preservation laws, and technical solutions of model-based cooperative filtering or cross-recommendation methods were presented. As a result, recommended algorithms should continue to supplement technology and develop new techniques, and humanities should make efforts to overcome cognitive dissonance and prevent users from falling into confirmation bias through critical thinking training and political communication education.

Implementation of a Chatbot Application for Restaurant recommendation using Statistical Word Comparison Method (통계적 단어 대조를 이용한 음식점 추천 챗봇 애플리케이션 구현)

  • Min, Dong-Hee;Lee, Woo-Beom
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.20 no.1
    • /
    • pp.31-36
    • /
    • 2019
  • A chatbot is an important area of mobile service, which understands informal data of a user as a conversational form and provides a customized service information for user. However, there is still a lack of a service way to fully understand the user's natural language typed query dialogue. Therefore, in this paper, we extract meaningful words, such a region, a food category, and a restaurant name from user's dialogue sentences for recommending a restaurant. and by comparing the extracted words against the contents of the knowledge database that is built from the hashtag for recommending a restaurant in SNS, and provides user target information having statistically much the word-similarity. In order to evaluate the performance of the restaurant recommendation chatbot system implemented in this paper, we measured the accessibility of various user query information by constructing a web-based mobile environment. As a results by comparing a previous similar system, our chabot is reduced by 37.2% and 73.3% with respect to the touch-count and the cutaway-count respectively.

Semantic Fuzzy Implication Operator for Semantic Implication Relationship of Knowledge Descriptions in Question Answering System (질의 응답 시스템에서 지식 설명의 의미적 포함 관계를 고려한 의미적 퍼지 함의 연산자)

  • Ahn, Chan-Min;Lee, Ju-Hong;Choi, Bum-Ghi;Park, Sun
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.3
    • /
    • pp.73-83
    • /
    • 2011
  • The question answering system shows the answers that are input by other users for user's question. In spite of many researches to try to enhance the satisfaction level of answers for user question, there is a essential limitation. So, the question answering system provides users with the method of recommendation of another questions that can satisfy user's intention with high probability as an auxiliary function. The method using the fuzzy relational product operator was proposed for recommending the questions that can includes largely the contents of the user's question. The fuzzy relational product operator is composed of the Kleene-Dienes operator to measure the implication degree by contents between two questions. However, Kleene-Dienes operator is not fit to be the right operator for finding a question answers pair that semantically includes a user question, because it was not designed for the purpose of finding the degree of semantic inclusion between two documents. We present a novel fuzzy implication operator that is designed for the purpose of finding question answer pairs by considering implication relation. The new operator calculates a degree that the question semantically implies the other question. We show the experimental results that the probability that users are satisfied with the searched results is increased when the proposed operator is used for recommending of question answering system.

Analysis of the Stock Market Network for Portfolio Recommendation (주식 포트폴리오 추천을 위한 주식 시장 네트워크 분석)

  • Lee, Yun-Jung;Woo, Gyun
    • The Journal of the Korea Contents Association
    • /
    • v.13 no.11
    • /
    • pp.48-58
    • /
    • 2013
  • The stock market is constantly changing and sometimes a slump or a sudden rising in stocks happens without any special reason. So the stock market is recognized as a complex system and it is hard to predict the change on stock prices. In this paper we consider the stock market to a network consisting of stocks. We analyzed the dynamics of the Korean stock market network and evaluated the changing of the correlation between shares consisting of the time series data of 137 companies belong to KOSPI200. Our analysis shows that the stock prices tend to plummet when the correlation between stocks is very high. We propose a method for recommending the stock portfolio based on the analysis of the stock market network. To show the effectiveness of the recommended portfolio, we conducted the simulated stock investment and compared the recommended portfolio with the efficient portfolio proposed Markowitz. According to the experiment results, the rate of return of the portfolio is about 10.6% which is about 3.7% and 5.6% higher than the average rate of return of the efficient portfolio and KOSPI200 respectively.

Digital Image Quality Assessment Based on Standard Normal Deviation

  • Park, Hyung-Ju;Har, Dong-Hwan
    • International Journal of Contents
    • /
    • v.11 no.2
    • /
    • pp.20-30
    • /
    • 2015
  • We propose a new method that specifies objective image quality factors by evaluating an image quality measurement model using random images. In other words, No-Reference variables are used to evaluate the quality of an original image without using any reference for comparison. 1000 portrait images were collected from a web gallery with votes constituting over 30 recommendation values. The bottom-up data collecting process was used to calculate the following image quality factors: total range, average, standard deviation, normalized distribution, z-score, preference percentage. A final grade is awarded out of 100 points, and this method ranks and grades the final estimated image quality preference in terms of total image quality factors. The results of the proposed image quality evaluation model consist of the specific dynamic range, skin tone R, G, B, L, A, B, and RSC contrast. We can present the total for the expected preference points as the average of the objective image qualities. Our proposed image quality evaluation model can measure the preferences for an actual image using a statistical analysis. The results indicate that this is a practical image quality measurement model that can extract a subject's preferred image quality.