Neighbor Collaborative Filtering Research Articles

Cell-specific imputation of drug connectivity mapping with incomplete data.

Drug repositioning allows expedited discovery of new applications for existing compounds, but re-screening vast compound libraries is often prohibitively expensive. "Connectivity mapping" is a process that links drugs to diseases by identifying compounds whose impact on expression in a collection of cells reverses the disease's impact on expression in disease-relevant tissues. The LINCS project has expanded the universe of compounds and cells for which data are available, but even with this effort, many clinically useful combinations are missing. To evaluate the possibility of repurposing drugs despite missing data, we compared collaborative filtering using either neighborhood-based or SVD imputation methods to two naive approaches via cross-validation. Methods were evaluated for their ability to predict drug connectivity despite missing data. Predictions improved when cell type was taken into account. Neighborhood collaborative filtering was the most successful method, with the best improvements in non-immortalized primary cells. We also explored which classes of compounds are most and least reliant on cell type for accurate imputation. We conclude that even for cells in which drug responses have not been fully characterized, it is possible to identify unassayed drugs that reverse in those cells the expression signatures observed in disease.

Behavior-Interior-Aware User Preference Analysis Based on Social Networks

There is a growing trend recently in big data analysis that focuses on behavior interiors, which concern the semantic meanings (e.g., sentiment, controversy, and other state-dependent factors) in explaining the human behaviors from psychology, sociology, cognitive science, and so on, rather than the data per se as in the case of exterior dimensions. It is more intuitive and much easier to understand human behaviors with less redundancy in concept by exploring the behavior interior dimensions, compared with directly using behavior exteriors. However, they usually approach from a unidimensional perspective with a lack of a sense of interrelatedness. Thus, integrating multiple behavior dimensions together into some numerical measures to form a more comprehensive view for subsequent prediction processes becomes a pivotal issue. Moreover, these studies usually focus on the magnitude but neglect the associated temporal features. In this paper, we propose a behavior interior dimension-based neighborhood collaborative filtering method for the top-N hashtag adoption frequency prediction that takes into account the interdependence in temporal dynamics. Our proposed approach couples the similarity in user preference and their impact propagation, by integrating the linear threshold model and the enhanced CF model based on behavior interiors. Experiments on Twitter demonstrate that the behavior-interior-aware CF models achieve better adoption prediction results than the state-of-the-art methods, and the joint consideration of similarity in user preference and their impact propagation results in a significant improvement than treating them separately.

A Novel Hybrid Similarity Calculation Model

This paper addresses the problems of similarity calculation in the traditional recommendation algorithms of nearest neighbor collaborative filtering, especially the failure in describing dynamic user preference. Proceeding from the perspective of solving the problem of user interest drift, a new hybrid similarity calculation model is proposed in this paper. This model consists of two parts, on the one hand the model uses the function fitting to describe users’ rating behaviors and their rating preferences, and on the other hand it employs the Random Forest algorithm to take user attribute features into account. Furthermore, the paper combines the two parts to build a new hybrid similarity calculation model for user recommendation. Experimental results show that, for data sets of different size, the model’s prediction precision is higher than the traditional recommendation algorithms.

TasteMiner: Mining partial tastes for neighbor-based collaborative filtering

Neighbor-based collaborative filtering is one of the most practical recommendation approaches that is renowned because of its simplicity and explanation. However, the big limitation is its high computational complexity. It is demonstrated that clustering-based algorithms, that restrict the neighborhood space, speed up the recommendation process at the price of lower accuracy. We propose a new algorithm, called TasteMiner that efficiently learns partial users taste to restrict the neighborhood space. We frame TasteMiner as a method for neighborhood collaborative filtering, and show its effectiveness compared to previous algorithms

Privacy preserving collaborative filtering for KNN attack resisting

Privacy preserving is an essential aspect of modern recommender systems. However, the traditional approaches can hardly provide a rigid and provable privacy guarantee for recommender systems, especially for those systems based on collaborative filtering (CF) methods. Recent research revealed that by observing the public output of the CF, the adversary could infer the historical ratings of the particular user, which is known as the KNN attack and is considered a serious privacy violation for recommender systems. This paper addresses the privacy issue in CF by proposing a Private Neighbor Collaborative Filtering (PriCF) algorithm, which is constructed on the basis of the notion of differential privacy. PriCF contains an essential privacy operation, Private Neighbor Selection, in which the Laplace noise is added to hide the identity of neighbors and the ratings of each neighbor. To retain the utility, the Recommendation-Aware Sensitivity and a re-designed truncated similarity are introduced to enhance the performance of recommendations. A theoretical analysis shows that the proposed algorithm can resist the KNN attack while retaining the accuracy of recommendations. The experimental results on two real datasets show that the proposed PriCF algorithm retains most of the utility with a fixed privacy budget.

Sparsity-Tolerated Algorithm with Missing Value Recovering in User-based Collaborative Filtering Recommendation

Personalized recommendation plays an important role in both e-commerce area and information filtering area. The neighborhood based collaborative filtering algorithm has already been used successfully. However, with the overwhelming explosion of Internet content, the problem of data sparsity has become more and more severe. The effect of data sparsity problem lies in both similarity computation and prediction generation, but very few works focus on the latter. This paper presents a hierarchy k-nearest neighbor collaborative filtering algorithm. It fills in the missing value by constructing multiple layers of nearest neighbors for users to generate better prediction. Experiments validated that the algorithm proposed in this paper achieved higher prediction accuracy with extreme sparse data.

An Improved Personalized Recommendation System Research

In order to find information of interest and found valuable information resources in enrich Internet data. This paper describes a personalized recommendation system, personalized recommendation system is an intelligent recommendation system to help e-commerce site for customers to provide complete personalized shopping decision support and information services. for the User Rating data extreme sparseness, This paper presents nearest neighbor collaborative filtering algorithm based on project score predicted ,experiments show that this method can improve the quality of recommendation system.

Goal-based hybrid filtering for user-to-user Personalized Recommendation

Recommendation systems are gaining great importance with e-Learning and multimedia on the internet. It fails in some situations such as new-user profile (cold-start) issue. To overcome this issue, we propose a novel goalbased hybrid approach for user-to-user personalized similarity recommendation and present its performance accuracy. This work also helps to improve collaborative filtering using k-nearest neighbor as neighborhood collaborative filtering (NCF) and content-based filtering as content-based collaborative filtering (CBCF). The purpose of combining k-nn with recommendation approaches is to increase the relevant recommendation accuracy and decrease the new-user profile (cold-start) issue. The proposed goal-based approach associated with nearest neighbors, compare personalized profile preferences and get the similarities between users. The paper discussed research architecture, working of proposed goal-based approach, its experimental steps and initial results. DOI: http://dx.doi.org/10.11591/ijece.v3i3.2419