This paper presents a recommendation algorithm that performs a query dependent random walk on a k-partite graph constructed from the various features relevant to the recommendatio...
Haibin Cheng, Pang-Ning Tan, Jon Sticklen, William...
Probabilistic latent semantic indexing (PLSI) represents documents of a collection as mixture proportions of latent topics, which are learned from the collection by an expectation...
Alexander Hinneburg, Hans-Henning Gabriel, Andr&eg...
We investigate four previously unexplored aspects of ensemble selection, a procedure for building ensembles of classifiers. First we test whether adjusting model predictions to p...
Rich Caruana, Art Munson, Alexandru Niculescu-Mizi...
This paper proposes a general boosting framework for combining multiple kernel models in the context of both classification and regression problems. Our main approach is built on...
In recent years, a major thread of research on kanonymity has focused on developing more flexible generalization schemes that produce higher-quality datasets. In this paper we in...