• Journal of Internet Computing and Services
• /
• v.14 no.5
• /
• pp.59-67
• /
• 2013

In this paper, we propose the LAR_CF, latent attribute rating-based collaborative filtering, that is robust to data sparsity problem which is one of traditional problems caused of decreasing rating prediction accuracy. As compared with that existing collaborative filtering method uses a preference rating rated by users as feature vector to calculate similarity between objects, the proposed method improves data sparsity problem using unique attributes of two target objects with existing explicit preference. We consider MovieLens 100k dataset and its item attributes to evaluate the LAR_CF. As a result of artificial data sparsity and full-rating experiments, we confirmed that rating prediction accuracy can be improved rating prediction accuracy in data sparsity condition by the LAR_CF.

• The Journal of the Korea Contents Association
• /
• v.7 no.11
• /
• pp.23-33
• /
• 2007

The collaborative filtering has used the nearest neighborhood method based on the preference and the similarity using the Pearson correlation coefficient. Therefore, it does not reflect content of the items and has the problems of the sparsity and scalability as well. the item-based collaborative filtering has been practically used to improve these defects, but it still does not reflect attributes of the item. In this paper, we propose the user and item based collaborative filtering using the classification property and Naive Bayesian to supplement the defects in the existing recommendation system. The proposed method complexity refers to the item similarity based on explicit data and the user similarity based on implicit data for handing the sparse problem. It applies to the Naive Bayesian to the result of reference. Also, it can enhance the accuracy as computation of the item similarity reflects on the correlative rank among the classification property to reflect attributes.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.2
• /
• pp.135-146
• /
• 2010

In this paper, we propose an Recommendation System for supporting self-directed learning on e-learning marketplace. The key idea of this system is recommendation system using revised collaborative filtering to support marketplace. Exisiting collaborative filtering method consists of 3 stages as preparing low data, building familiar customer group by selecting nearest neighbor, creating recommendation list. This study designs recommendation system to support self-directed learning by using collaborative filtering added nearest neighbor learning course that considered industry and learning level. This service helps to select right learning course to learner in industry. Recommendation System can be built by many method and to recommend the service content including explicit properties using revised collaborative filtering method can solve limitations in existing content recommendation.

• Journal of Broadcast Engineering
• /
• v.18 no.1
• /
• pp.88-97
• /
• 2013

Collaborative filtering(CF) for the personalized recommendation is a successful and popular method in recommender systems. But the mainly researched and implemented cases focus on dealing with independent items with explicit feedback by users. For the domain of TV program recommendation in VOD service platform, we need to consider the unique characteristic and constraints of the domain. In this paper, we studied on the way to convert the viewing history of each TV program episodes to the TV program preference by considering the series structure of TV program. The former is implicit for personalized preference, but the latter tells quite explicitly about the persistent preference. Collaborative filtering is done by the unit of series while data gathering and final recommendation is done by the unit of episodes. As a result, we modified CF to make it more suitable for the domain of TV program VOD recommendation. Our experimental study shows that it is more precise in performance, yet more compact in calculation compared to the plain CF approaches. It can be combined with other existing CF techniques as an algorithm module.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.27 no.7
• /
• pp.853-858
• /
• 2003

The suitable estimation of the filter width in the dynamic eddy viscosity model were investigated in high Reynolds number channel flow. In this study, the improvement on matters by optimizing the test filter shape was attempted through the numerical experiment. The way that select optimum test filter width is recommended. Some test filters, one is based on a discrete representation of the top-hat filter and another are based on a high-order filtering operation, are evaluated in simulations of the turbulent channel flow at Reynolds number 1020, based on friction velocity and channel half width. It appears that the estimation of test filter width practically can decrease the dissipative nature of dynamic eddy viscosity model with explicit test filter. It shows that the value of the filter width ratio used in the dynamic procedure must match the properties of the test filter actually used in the calculation.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.6
• /
• pp.37-48
• /
• 2010

In general, an HTTP server sends information in response to requests from clients. Since it does not support active information delivery to clients, it can not efficiently provide the rapidly changing information to clients. Overcoming this shortcoming of the HTTP protocol, the technology known as server push enables the HTTP server to actively provide information to clients without explicit requests from clients. Adobe BlazeDS is a web server supporting the server push technology, helping users to develop web-based push applications. Unfortunately, since the BlaseDS server have no functions of filtering the information to be pushed according to various types of users, there are difficulties in developing push applications handling various situations in a efficient way. In this paper, to support effective development of push applications on BlazeDS we present the methods of adding a message filtering facility to BlazeDS and utilizing it. According to the filtering request of clients, the message filtering facility modifies information to be pushed, sending the modified information to the clients. The extended BlazeDS server with the message filtering facility provides environments to easily develop push services customized for various clients with their own situations.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.35 no.3
• /
• pp.289-297
• /
• 2011

The explicit finite element method is an essential tool for solving large problems with severe nonlinear characteristics, but its results can be difficult to interpret. In particular, it can be impossible to evaluate its acceleration responses because of severe discontinuity, extreme noise or aliasing. We suggest a new post-processing method for transient responses and their response spectra. We propose smoothing methods using a Gaussian kernel without in depth knowledge of the complex frequency characteristics; such methods are successfully used in the filtering of digital signals. This smoothing can be done by measuring the velocity results and monitoring the response spectra. Gaussian kernel smoothing gives a better smoothness and representation of the peak values than other approaches do. The floor response spectra can be derived using smoothed accelerations for the design.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.6
• /
• pp.70-75
• /
• 2000

This paper examines the performance of adaptive filtering algorithms in relation to the asymptotic relative efficiency (ARE) of estimators. The adaptive filtering algorithms are Hybrid II and modified zero forcing (MZF) algorithms. The Hybrid II and MZF algorithms are simplified forms of the LMS algorithm, which use the polarity of the input signal, and polarities of the error and input signals, respectively. The ARE of estimators for each algorithm is analyzed under the condition of the same convergence speed. Computer simulations for adaptive equalization are performed to check the validity of the theory. The explicit expressions for the ARE values of the Hybrid II and MZF algorithms are derived, and its results have similar values to the results of computer simulation. It also revealed that the ARE values depend on the correlation coefficients between input signal and error signal.

• The Journal of the Korea Contents Association
• /
• v.10 no.11
• /
• pp.10-19
• /
• 2010

The progress of computers and Web has given rise to a rapid increase of the quantity of the useful information, which is making the demand of recommender systems widely expanding. Like in other domains, a recommender system in a digital library is important, but there are only a few studies about the recommender system of research papers, Moreover none is there in korea to our knowledge. In the paper, we seek for a way to develop the NDSL recommender system of research papers based on the survey of related studies. We conclude that NDSL needs to modify the way to collect user's interests from explicit to implicit method, and to use user-based and memory-based collaborative filtering mixed with contents-based filtering(CF). We also suggest the method to mix two filterings and the use of personal ontology to improve user satisfaction.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4892-4911
• /
• 2015

Trust as one of important social relations has attracted much attention from researchers in the field of social network-based recommender systems. In trust network-based recommender systems, there exist normally two roles for users, truster and trustee. Most of trust-based methods generally utilize explicit links between truster and trustee to find similar neighbors for recommendation. However, there possibly exist implicit correlations between users, especially for users with the same role (truster or trustee). In this paper, we propose a novel Collaborative Filtering method called CF-TC, which exploits Trust Context to discover implicit correlation between users with the same role for recommendation. In this method, each user is first represented by the same-role users who are co-occurring with the user. Then, similarities between users with the same role are measured based on obtained user representation. Finally, two variants of our method are proposed to fuse these computed similarities into traditional collaborative filtering for rating prediction. Using two publicly available real-world Epinions and Ciao datasets, we conduct comprehensive experiments to compare the performance of our proposed method with some existing benchmark methods. The results show that CF-TC outperforms other baseline methods in terms of RMSE, MAE, and recall.