Sciweavers

686 search results - page 64 / 138
» Minimax Probability Machine
Sort
View
ICML
2010
IEEE
13 years 11 months ago
Finding Planted Partitions in Nearly Linear Time using Arrested Spectral Clustering
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
Nader H. Bshouty, Philip M. Long
ICML
2010
IEEE
13 years 11 months ago
Label Ranking Methods based on the Plackett-Luce Model
This paper introduces two new methods for label ranking based on a probabilistic model of ranking data, called the Plackett-Luce model. The idea of the first method is to use the ...
Weiwei Cheng, Krzysztof Dembczynski, Eyke Hül...
ICML
2010
IEEE
13 years 11 months ago
Modeling Interaction via the Principle of Maximum Causal Entropy
The principle of maximum entropy provides a powerful framework for statistical models of joint, conditional, and marginal distributions. However, there are many important distribu...
Brian Ziebart, J. Andrew Bagnell, Anind K. Dey
ICML
2010
IEEE
13 years 11 months ago
Supervised Aggregation of Classifiers using Artificial Prediction Markets
Prediction markets are used in real life to predict outcomes of interest such as presidential elections. In this work we introduce a mathematical theory for Artificial Prediction ...
Nathan Lay, Adrian Barbu
TKDE
2008
123views more  TKDE 2008»
13 years 10 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko