• Proceedings of the Korean Society of Computer Information Conference
• /
• 2020.07a
• /
• pp.279-280
• /
• 2020

최근 소셜 미디어로 이름을 알린 이색 카페와 맛집을 찾아다니는 문화가 확산되는 추세이다. 블로그 포털 검색을 통해 찾아본 맛집은 광고성 게시물이 많아서 신뢰도가 떨어지고, 맛집 관련 게시물 수가 많아서 모든 게시물들을 수동으로 읽기는 불가능하다. 본 논문에서는 사용자들이 선호해서 자발적으로 공유하는 신뢰도 높은 인스타그램의 맛집 포스트 데이터를 이용하여 아이템 기반의 협업 필터링(Item-based Collaborative Filtering) 기법을 통해 사용자의 취향에 맞고 선호할 만한 맛집을 자동으로 추천해주는 알고리즘 및 시스템을 소개한다.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.221-226
• /
• 2021

Collaborative filtering based recommender systems recommend user-preferrable items based on rating history and are essential function for the current various commercial purposes. In order to determine items to recommend, prediction of preference score for unrated items is estimated based on similar rating history. Previous studies usually employ two methods individually, i.e., similar user based or similar item based ones. These methods have drawbacks of degrading prediction accuracy in case of sparse user ratings data or when having difficulty with finding similar users or items. This study suggests a new rating prediction method by integrating the two previous methods. The proposed method has the advantage of consulting more similar ratings, thus improving the recommendation quality. The experimental results reveal that our method significantly improve the performance of previous methods, in terms of prediction accuracy, relevance level of recommended items, and that of recommended item ranks with a sparse dataset. With a rather dense dataset, it outperforms the previous methods in terms of prediction accuracy and shows comparable results in other metrics.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.7
• /
• pp.1083-1091
• /
• 2017

As big data technologies have been developed and massive data have exploded from users through various channels, CEO of global IT enterprise mentioned core importance of data in next generation business. Therefore various machine learning technologies have been necessary to apply data driven services but especially recommendation has been core technique in viewpoint of directly providing summarized information or exact choice of items to users in information flooding environment. Recently evolved recommendation techniques have been proposed by many researchers and most of service companies with big data tried to apply refined recommendation method on their online business. For example, Amazon used item to item collaborative filtering method on its sales distribution platform. In this paper, we develop a commercial web service for suggesting music contents and implement three representative collaborative filtering methods on the service. We also produce recommendation lists with three methods based on real world sample data and evaluate the usefulness of them by comparison among the produced result. This study is meaningful in terms of suggesting the right direction and practicality when companies and developers want to develop web services by applying big data based recommendation techniques in practical environment.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.43 no.3
• /
• pp.349-360
• /
• 2019

This study analyzes the trends of recommendation services for customized fashion styles in relation to artificial intelligence. To achieve this goal, the study examined filtering technologies of collaborative, content based, and deep-learning as well as analyzed the characteristics of recommendation services in the users' purchasing process. The results of this study showed that the most universal recommendation technology is collaborative filtering. Collaborative filtering was shown to allow intuitive searching of similar fashion styles in the cognition of need stage, and appeared to be useful in comparing prices but not suitable for innovative customers who pursue early trends. Second, content based filtering was shown to utilize body shape as a key personal profile item in order to reduce the possibility of failure when selecting sizes online, which has limits to being able to wear the product beforehand. Third, fashion style recommendations applied with deep-learning intervene with all user processes of buying products online that was also confirmed to penetrate into the creative area of image tag services, virtual reality services, clothes wearing fit evaluation services, and individually customized design services.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.10-12
• /
• 2003

Recommender systems help consumers to find the useful products from the overloaded information. Researchers have developed content-based recommenders, collaborative recommenders, and a few hybrid systems. In this research, we extend the classic collaborative recommenders by clustering method to form a hybrid recommender system. Using the clustering method, we can recommend the products based on not only the user ratings but also other useful information from user profiles or attributes of items. Through our experiments on well-known MovieLens data set, we found that the information provided by the attributes of item on the item-based collaborative filter shows advantage over the information provided by user profiles on the user-based collaborative filter.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.543-551
• /
• 2015

As the use of internet and mobile devices became generalized, users utilizing search and recommendation in order to find the information they want in the midst of various websites have become common. In order to recommend more appropriate item for users, this paper proposes a recommendation technique that reflects the users' preference change following the flow of time by applying users' activity and time information. The proposed technique, after classifying the data in categories including the tag information that is considered at the time of choosing the items, only uses the data that users' preference change following the flow of time is reflected. For the users who prefer the corresponding category, the item that is extracted by applying tag information to collaboration filtering technique is recommended and for general users, items are recommended based on the ranking calculated by using the tag information. The proposed technique was experimented by using hetrec2011-movielens-2k data set. The experiment result indicated that the proposed technique has been more enhanced the accuracy, appropriacy, compared to item-based, user-based method.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.127-135
• /
• 2011

It is required that an e-learning system has a content recommendation component which helps a learner choose an item. In order to predict items concerning learner's interest, collaborative filtering and content-based filtering methods have been most widely used. The methods recommend items for a learner based on other learner's interests without considering the knowledge level of the learner. So, the effectiveness of the recommendation can be reduced when the number of overall users are relatively small. Also, it is not easy to recommend a newly added item. In order to address the problem, we propose a content recommendation method based on the similarity and the difficulty of an item. By using a recommendation function that reflects both characteristics of items, a higher-level leaner can choose more difficult but less similar items, while a lower-level learner can select less difficult but more similar items, Thus, a learner can be presented items according to his or her level of achievement, which is irrelevant to other learner's interest.

• Journal of KIISE
• /
• v.44 no.6
• /
• pp.621-627
• /
• 2017

Collaborative filtering is a technique that effectively recommends unrated items for users. Collaborative filtering is based on the similarity of the items evaluated by users. The existing top-N recommendation methods are based on pair-wise and list-wise preference models. However, these methods do not effectively represent the relative preference of items that are evaluated by users, and can not reflect the importance of each item. In this paper, we propose a new method to represent user's latent preference by combining an existing preference model and the notion of inverse user frequency. The proposed method improves the accuracy of existing methods by up to two times.

• The Journal of Society for e-Business Studies
• /
• v.14 no.1
• /
• pp.1-11
• /
• 2009

Many neighbors are needed for making the recommendation quality better and stable in collaborative filtering. Furthermore, the quality is not so good mainly due to a reason that high similarity between two users does not guarantee the same preference to items considered for recommendation. Dissimilar users who have consistency in item selection can be useful for predicting preferences. This paper proposes a new collaborative filtering method, defining trust based on consistency for improving this phenomenon. Empirical studies show that such a method reduces the number of neighbors required to make the recommendation quality stable and the recommendation quality itself is also significantly improved.

• The Journal of Korean Institute of Information Technology
• /
• v.16 no.12
• /
• pp.109-114
• /
• 2018

Collaborative filtering has been widely utilized in recommender systems as typical algorithm for outstanding performance. Since it depends on item rating history structurally, The more sparse rating matrix is, the lower its recommendation accuracy is, and sometimes it is totally useless. Variety of hybrid approaches have tried to combine collaborative filtering and content-based method for improving the sparsity issue in rating matrix. In this study, a new method is suggested for the same purpose, but with different perspective, it deals with no-match situation in person-person similarity evaluation. This method is called the transitive similarity model because it is based on relation graph of people, and it compares recommendation accuracy by applying to Movielens open dataset.