We describe an algorithm for converting linear support vector machines and any other arbitrary hyperplane-based linear classifiers into a set of non-overlapping rules that, unlike...
Learning-to-rank algorithms, which can automatically adapt ranking functions in web search, require a large volume of training data. A traditional way of generating training examp...
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Most learning algorithms for undirected graphical models require complete inference over at least one instance before parameter updates can be made. SampleRank is a rankbased lear...
Sameer Singh, Limin Yao, Sebastian Riedel, Andrew ...
Discovering communities from documents involved in social discourse is an important topic in social network analysis, enabling greater understanding of the relationships among act...
Ding Zhou, Isaac G. Councill, Hongyuan Zha, C. Lee...