Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Multi-target prediction: a unifying view on problems and methods
Many problem settings in machine learning are concerned with the simultaneous prediction
of multiple target variables of diverse type. Amongst others, such problem settings arise in …
of multiple target variables of diverse type. Amongst others, such problem settings arise in …
SPrank: Semantic Path-Based Ranking for Top-N Recommendations Using Linked Open Data
In most real-world scenarios, the ultimate goal of recommender system applications is to
suggest a short ranked list of items, namely top-N recommendations, that will appeal to the …
suggest a short ranked list of items, namely top-N recommendations, that will appeal to the …
Collaborative deep metric learning for video understanding
The goal of video understanding is to develop algorithms that enable machines understand
videos at the level of human experts. Researchers have tackled various domains including …
videos at the level of human experts. Researchers have tackled various domains including …
Efficient top-n recommendation for very large scale binary rated datasets
F Aiolli - Proceedings of the 7th ACM conference on …, 2013 - dl.acm.org
We present a simple and scalable algorithm for top-N recommendation able to deal with
very large datasets and (binary rated) implicit feedback. We focus on memory-based …
very large datasets and (binary rated) implicit feedback. We focus on memory-based …
Local collaborative ranking
Personalized recommendation systems are used in a wide variety of applications such as
electronic commerce, social networks, web search, and more. Collaborative filtering …
electronic commerce, social networks, web search, and more. Collaborative filtering …
Preference completion: Large-scale collaborative ranking from pairwise comparisons
In this paper we consider the collaborative ranking setting: a pool of users each provides a
set of pairwise preferences over a small subset of the set of d possible items; from these we …
set of pairwise preferences over a small subset of the set of d possible items; from these we …
Graph-based collaborative ranking
Data sparsity, that is a common problem in neighbor-based collaborative filtering domain,
usually complicates the process of item recommendation. This problem is more serious in …
usually complicates the process of item recommendation. This problem is more serious in …
A unified point-of-interest recommendation framework in location-based social networks
Location-based social networks (LBSNs), such as Gowalla, Facebook, Foursquare,
Brightkite, and so on, have attracted millions of users to share their social friendship and …
Brightkite, and so on, have attracted millions of users to share their social friendship and …
Preference preserving hashing for efficient recommendation
Recommender systems usually need to compare a large number of items before users' most
preferred ones can be found This process can be very costly if recommendations are …
preferred ones can be found This process can be very costly if recommendations are …
Collaborative ranking with a push at the top
The goal of collaborative filtering is to get accurate recommendations at the top of the list for
a set of users. From such a perspective, collaborative ranking based formulations with …
a set of users. From such a perspective, collaborative ranking based formulations with …