• Journal of Korea Society of Digital Industry and Information Management
• /
• v.15 no.3
• /
• pp.69-78
• /
• 2019

The amount of data is increasing significantly as information and communication technology advances, mobile, cloud computing, the Internet of Things and social network services become commonplace. As the data grows exponentially, there is a growing demand for services that recommend the information that users want from large amounts of data. Collaborative filtering method is commonly used in information recommendation methods. One of the problems with collaborative filtering-based recommendation method is the cold start problem. In this paper, we propose a method to improve the cold start problem. That is, it solves the cold start problem by mapping the item evaluation data that does not exist to the initial user to the automatically generated data from the mobile app. We describe the main contents of the proposed method and explain the proposed method through the book recommendation scenario. We show the superiority of the proposed method through comparison with existing methods.

• The KIPS Transactions:PartC
• /
• v.16C no.5
• /
• pp.543-554
• /
• 2009

The openness of the Web allows any user to access any type of information easily at any time and anywhere. However, with function of easy access for useful information, internet has dysfunctions of providing users with harmful contents indiscriminately. Some information, such as adult content, is not appropriate for children. To protect children from these harmful contents, many filtering softwares are developed. However, these softwares can not prevent harmful contents, perfectly, because of some limitations. In this paper, we analyze existing eleven filtering softwares and state the limitation of these softwares. Furthermore, we propose requirements for new filtering software which overcomes the limitations, and describe framework of the new software.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.19 no.3
• /
• pp.221-232
• /
• 2023

In this paper, we propose a recommendation system based on the latent factor model using matrix factorization, which is one of the most commonly used collaborative filtering algorithms for recommendation systems. In particular, by introducing the concept of creating a list of recommended content and a list of non-preferred recommended content, and removing the non-preferred recommended content from the list of recommended content, we propose a method to ultimately increase the satisfaction. The experiment confirmed that using a separate list of non-preferred content to find non-preferred content increased precision by 135%, accuracy by 149%, and F1 score by 72% compared to using the existing recommendation list. In addition, assuming that users do not view non-preferred content through the proposed algorithm, the average evaluation score of a specific user used in the experiment increased by about 35%, from 2.55 to 3.44, thereby increasing user satisfaction. It has been confirmed that this algorithm is more effective than the algorithms used in existing recommendation systems.

• Journal of Korea Multimedia Society
• /
• v.19 no.11
• /
• pp.1878-1890
• /
• 2016

Web 2.0 has features produced the content through the user of the participation and share. The content production activities have became active since social network service appear. The social bookmark, one of social network service, is service that lets users to store useful content and share bookmarked contents between personal users. Unlike Internet search engines such as Google and Naver, the content stored on social bookmark is searched based on tag keyword information and unnecessary information can be excluded. Social bookmark can make users access to selected content. However, quick access to content that users want is difficult job because of the user of the participation and share. Our paper suggests a method recommending search word to be able to access quickly to content. A method is suggested by using Collaborative Filtering and Jaccard similarity coefficient. The performance of suggested system is verified with experiments that compare by 'Delicious' and "Feeltering' with our system.

• The Journal of the Korea Contents Association
• /
• v.14 no.4
• /
• pp.418-424
• /
• 2014

This paper aim; to develop the National R&D Information Navigation System(NRnDINS) that is convenient and easy to use by the researchers on the basis of information filtering and visualization by converging and integrating the three types of the contents, namely, paper, report and project at the stage of development of the information system An information system is developed by establishing ontology and RDF on the three types of contents, and by applying information filtering and semantic search technology after having created the prototype for the screen by reflecting the user needs analysis and information visualization elements surveyed at the previous stage of information service planning. In this paper, to make the measure for information filtering, R&D navigation index is prosed and implemented, and NRnDINS capable of integrated search of the R&D contents through information visualization is developed. Also, for the testing of the developed system, the preference survey for its design by 1m persons and usability test of the system by 10 users are performed The result of the survey on the preference for the design is affirmative with 85% of the subjects finding it favorable and the composite receptivity is good with the score of 87.2 the results of the usability test. However, it was also found that further development of the personalization functions is needed. It is hoped that the R&D navigation index of the proposed and implemented in this paper would present quantitative objectivity and will induce further development of other information filtering index of contents in the future.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.1-10
• /
• 2013

Personalization aims to provide customized contents to each user by using the user's personal preferences. In this sense, the core parts of personalization are regarded as recommendation technologies, which can recommend the proper contents or products to each user according to his/her preference. Prior studies have proposed novel recommendation technologies because they recognized the importance of recommender systems. Among several recommendation technologies, collaborative filtering (CF) has been actively studied and applied in real-world applications. The CF, however, often suffers sparsity or scalability problems. Prior research also recognized the importance of these two problems and therefore proposed many solutions. Many prior studies, however, suffered from problems, such as requiring additional time and cost for solving the limitations by utilizing additional information from other sources besides the existing user-item matrix. This study proposes a novel implicit rating approach for collaborative filtering in order to mitigate the sparsity problem as well as to enhance the performance of recommender systems. In this study, we propose the methods of reducing the sparsity problem through supplementing the user-item matrix based on the implicit rating approach, which measures the trust level among users via the existing user-item matrix. This study provides the preliminary experimental results for testing the usefulness of the proposed model.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.7-9
• /
• 2004

With the development of e-commerce and information access, recommender systems have become a popular technique to prune large information spaces so that users are directed toward those items that best meet their needs and preferences. In this paper, clustering technique is applied in the collaborative recommender framework to consider semantic contents available from the user profiles. We also suggest methods to construct user profiles from rating information and attributes of items to accommodate user preferences. Further, we show that the correct application of the semantic content information obtained from user profiles does enhance the effectiveness of collaborative recommendation.

• The Journal of the Korea Contents Association
• /
• v.7 no.4
• /
• pp.66-73
• /
• 2007

Internet is a part of our common life and tremendous information is cumulated. In these trends, the personalization becomes a very important technology which could find exact information to present users. Previous personalized services use content based filtering which is able to recommend by analyzing the content and collaborative filtering which is able to recommend contents according to preference of users group. But, collaborative filtering needs the evaluation of some amount of data. Also, It cannot reflect all data of users because it recommends items based on data of some users who have similar inclination. Therefore, we need a new recommendation method which can recommend prefer items without preference data of users. In this paper, we proposed the apparel coordination system using personalized preference on the semantic web. This paper provides the results which this system can reduce the searching time and advance the customer satisfaction measurement according to user's feedback to system.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.6
• /
• pp.259-268
• /
• 2018

The purpose of this study is to propose a training method customized to the level of cognitive abilities to increase users' interest and engagement while using cognitive function training contents. The level of cognitive ability of the users was based on the clustering based on the users' information and Mini-Mental Statue Examination-Korea Child test score using the K-means algorithm applied collaborative filtering. The results were applied to the integrated cognitive function training system, and the contents order and difficulty level of the cognitive function training area were recommended to the user's cognitive ability level. Particularly, the contents difficulty control was designed to give a high immersion feeling by applying the 'flow theory' method that users can repeatedly feel tension and comfort. In conclusion, the user-customized cognitive function training method proposed in this paper can be expected to be more effective and rehabilitative results than existing therapists' subjective setting of contents order and difficulty level.

• Journal of KIISE:Software and Applications
• /
• v.32 no.7
• /
• pp.581-591
• /
• 2005

Collaborative filtering systems have problems involving sparsity and the provision of recommendations by making correlations between only two users' preferences. These systems recommend items based only on the preferences without taking in to account the contents of the items. As a result, the accuracy of recommendations depends on the data from user-rated items. When users rate items, it can be expected that not all users ran do so earnestly. This brings down the accuracy of recommendations. This paper proposes a collaborative recommendation method for extracting typical group preferences using user-item matrix optimization and user profiles in collaborative tittering systems. The method excludes unproven users by using entropy based on data from user-rated items and groups users into clusters after generating user profiles, and then extracts typical group preferences. The proposed method generates collaborative user profiles by using association word mining to reflect contents as well as preferences of items and groups users into clusters based on the profiles by using the vector space model and the K-means algorithm. To compensate for the shortcoming of providing recommendations using correlations between only two user preferences, the proposed method extracts typical preferences of groups using the entropy theory The typical preferences are extracted by combining user entropies with item preferences. The recommender system using typical group preferences solves the problem caused by recommendations based on preferences rated incorrectly by users and reduces time for retrieving the most similar users in groups.