2013/5/7 Peter Prettenhofer <[email protected]>: > Do you need probabilities? You could just use the signed distance to each > OVA hyperplane (via ``clf.decision_function()``) to rank the classes. Maybe > the platt-scaling screws up here...
The more I find out about Platt scaling in LibSVM, the more I'm inclined to stay away from it. > You could also look at Mathieu's "lightning" project > https://github.com/mblondel/lightning - it features multinomial logistic > regression which might give better calibrated probabilities than platt > scaling... Or our own LogisticRegression. It cuts some corners, but sometimes it's good enough. -- Lars Buitinck Scientific programmer, ILPS University of Amsterdam ------------------------------------------------------------------------------ Learn Graph Databases - Download FREE O'Reilly Book "Graph Databases" is the definitive new guide to graph databases and their applications. This 200-page book is written by three acclaimed leaders in the field. The early access version is available now. Download your free book today! http://p.sf.net/sfu/neotech_d2d_may _______________________________________________ Scikit-learn-general mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/scikit-learn-general
