• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.99-114
• /
• 2011

Collaborative Filtering (CF) suffers from two major problems:sparsity and cold-start recommendation. This paper focuses on the cold-start problem for new customers with no purchase records and the sparsity problem for the customers with very few purchase records. For the purpose, we propose a method for the new customer recommendation by using a combined measure based on three well-used centrality measures to identify the customers who are most likely to become neighbors of the new customer. To alleviate the sparsity problem, we also propose a hybrid approach that applies our method to customers with very few purchase records and CF to the other customers with sufficient purchases. To evaluate the effectiveness of our method, we have conducted several experiments using a data set from a department store in Korea. The experiment results show that the combination of two measures makes better recommendations than not only a single measure but also the best-seller-based method and that the performance is improved when applying the hybrid approach.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.40 no.4
• /
• pp.154-163
• /
• 2017

Collaborative filtering, one of the most widely used techniques to build recommender systems, is based on the idea that users with similar preferences can help one another find useful items. Credit card user behavior analytics show that most customers hold three or less credit cards without duplicates. This behavior is one of the most influential factors to data sparsity. The 'cold-start' problem caused by data sparsity prevents recommender system from providing recommendation properly in the personalized credit card recommendation scenario. We propose a personalized credit card recommender system to address the cold-start problem, using multiple user profiles. The proposed system consists of a training process and an application process using five user profiles. In the training process, the five user profiles are transformed to five user networks based on the cosine similarity, and an integrated user network is derived by weighted sum of each user network. The application process selects k-nearest neighbors (users) from the integrated user network derived in the training process, and recommends three of the most frequently used credit card by the k-nearest neighbors. In order to demonstrate the performance of the proposed system, we conducted experiments with real credit card user data and calculated the F1 Values. The F1 value of the proposed system was compared with that of the existing recommendation techniques. The results show that the proposed system provides better recommendation than the existing techniques. This paper not only contributes to solving the cold start problem that may occur in the personalized credit card recommendation scenario, but also is expected for financial companies to improve customer satisfactions and increase corporate profits by providing recommendation properly.

• Journal of Mechanical Science and Technology
• /
• v.16 no.7
• /
• pp.942-949
• /
• 2002

The use of a combined starter/generator integrated into the drive train of an automobile offers several possibilities for improvement of fuel economy The use of such a starter/generator system is made feasible by a switch from a 14 volts electrical system to a 42 volts system, however, the sizing of the components is not a trivial problem. This study combines a dynamic electromechanical model of the starter, battery and power electronics with the nonlinear mechanics of the piston/crankshaft system and a thermofluid model of the compression and expansion processes to investigate the cold start problem. The example involves the start of an eight cylinder engine at -25 degrees Celsius. This paper shows how the mechatronic V8 engine of an automotive starter/generator system for the startability works well.

• Journal of Information Processing Systems
• /
• v.17 no.2
• /
• pp.426-439
• /
• 2021

To alleviate the cold-start problem and data sparsity in web service recommendation and meet the personalized needs of users, this paper proposes a personalized web service recommendation method based on a hybrid social network and multi-objective immune optimization. The network adds the element of the service provider, which can provide more real information and help alleviate the cold-start problem. Then, according to the proposed service recommendation framework, multi-objective immune optimization is used to fuse multiple attributes and provide personalized web services for users without adjusting any weight coefficients. Experiments were conducted on real data sets, and the results show that the proposed method has high accuracy and a low recall rate, which is helpful to improving personalized recommendation.

• Journal of Information Technology Applications and Management
• /
• v.29 no.6
• /
• pp.81-93
• /
• 2022

As deep learning technology in natural language and visual processing has rapidly developed, collaborative filtering-based recommendation systems using deep learning technology are being actively introduced in the recommendation field. In this study, OCF-GAN, a hybrid collaborative filtering model using GAN, was proposed to solve the one-class and cold-start problems, and its usefulness was verified through performance evaluation. OCF-GAN based on conditional GAN consists of a generator that generates a pattern similar to the actual user preference pattern and a discriminator that tries to distinguish the actual preference pattern from the generated preference pattern. When the training is completed, user preference vectors are generated based on the actual distribution of preferred items. In addition, the cold-start problem was solved by using a hybrid collaborative filtering recommendation method that additionally utilizes user and item profiles. As a result of the performance evaluation, it was found that the performance of the OCF-GAN with additional information was superior in all indicators of the Top 5 and Top 20 recommendations compared to the existing GAN-based recommender. This phenomenon was more clearly revealed in experiments with cold-start users and items.

• Smart Structures and Systems
• /
• v.31 no.5
• /
• pp.485-500
• /
• 2023

Machine learning-based structural health monitoring (ML-based SHM) methods are researched extensively in the recent decade due to the availability of advanced information and sensing technology. ML methods are well-known for their pattern recognition capability for complex problems. However, the main obstacle of ML-based SHM is that it often requires pre-collected historical data for model training. In most actual scenarios, damage presence can be detected using the unsupervised learning method through anomaly detection, but to further identify the damage types would require prior knowledge or historical events as references. This creates the cold-start problem, especially for new and unobserved structures. Modal-based methods identify damages based on the changes in the structural global properties but often require dense measurements for accurate results. Therefore, a two-stage hybrid modal-machine learning damage detection scheme is proposed. The first stage detects damage presence using Principal Component Analysis-Frequency Response Function (PCA-FRF) in an unsupervised manner, whereas the second stage further identifies the damage. To solve the cold-start problem, mode shape assessment using the first mode is initiated when no trained model is available yet in the second stage. The damage identified by the modal-based method would be stored for future training. This work highlights the performance of the scheme in alleviating the cold-start issue as it transitions through different phases, starting from zero damage sample available. Results showed that single and multiple damages can be identified at an acceptable accuracy level even when training samples are limited.

• Journal of Korea Multimedia Society
• /
• v.25 no.8
• /
• pp.1242-1250
• /
• 2022

When recommending cold items that do not have user-item interactions to users, even we adopt state-of-the-arts algorithms, the predicted information of cold items tends to have lower accuracy compared to warm items which have enough user-item interactions. The lack of information makes for recommender systems to recommend monotonic items which have a few top popular contents matched to user preferences. As a result, under-diversified items have a negative impact on not only recommendation diversity but also on recommendation accuracy when recommending cold items. To address the problem, we adopt a diversification algorithm which tries to make distributions of accumulated contents embedding of the two items groups, recommended items and the items in the target user's already interacted items, similar. Evaluation on a real world data set CiteULike shows that the proposed method improves not only the diversity but also the accuracy of cold item recommendation.

• Journal of KIISE:Software and Applications
• /
• v.33 no.11
• /
• pp.953-964
• /
• 2006

Due to the usefulness of the collaborative filtering, it has been widely used in both the research and commercial field. However, there are still some challenges for it to be more efficient, especially the scalability problem, the sparsity problem and the cold start problem. In this paper. we address these problems and provide a novel distributed approach based on agents collaboration for the problems. We have tried to solve the scalability problem by making each agent save its users ratings and broadcast them to the users friends so that only friends ratings and his own ratings are kept in an agents local database. To reduce quality degradation of recommendation caused by the lack of rating data, we introduce a method using friends opinions instead of real rating data when they are not available. We also suggest a collaborative filtering algorithm based on user profile to provide new users with recommendation service. Experiments show that our suggested approach is helpful to the new user problem as well as is more scalable than traditional centralized CF filtering systems and alleviate the sparsity problem.

• Journal of Computing Science and Engineering
• /
• v.7 no.1
• /
• pp.21-29
• /
• 2013

The introduction of recommender systems to existing online services is now practically inevitable, with the increasing number of items and users on online services. Popular recommender systems have successfully implemented satisfactory systems, which are usually based on collaborative filtering. However, collaborative filtering-based recommenders suffer from well-known problems, such as popularity bias, and the cold-start problem. In this paper, we propose an innovative collaborative-filtering based recommender system, which uses the concepts of Experts and Novices to create fine-grained recommendations that focus on being novel, while being kept relevant. Experts and Novices are defined using pre-made clusters of similar items, and the distribution of users' ratings among these clusters. Thus, in order to generate recommendations, the experts are found dynamically depending on the seed items of the novice. The proposed recommender system was built using the MovieLens 1 M dataset, and evaluated with novelty metrics. Results show that the proposed system outperforms matrix factorization methods according to discovery-based novelty metrics, and can be a solution to popularity bias and the cold-start problem, while still retaining collaborative filtering.

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.494-507
• /
• 2020

This study proposed the movie recommendation system based on the user's personal information and movies rated using the method of k-clique and normalized discounted cumulative gain. The main idea is to solve the problem of cold-start and to increase the accuracy in the recommendation system further instead of using the basic technique that is commonly based on the behavior information of the users or based on the best-selling product. The personal information of the users and their relationship in the social network will divide into the various community with the help of the k-clique method. Later, the ranking measure method that is widely used in the searching engine will be used to check the top ranking movie and then recommend it to the new users. We strongly believe that this idea will prove to be significant and meaningful in predicting demand for new users. Ultimately, the result of the experiment in this paper serves as a guarantee that the proposed method offers substantial finding in raw data sets by increasing accuracy to 87.28% compared to the three most successful methods used in this experiment, and that it can solve the problem of cold-start.