I am using sgdclassifier for document clasification.
 where (n_samples, n_features) = (12000, 500000). 
 In my project in some of the cases the category chosen leads to 
 post-processing the document and again trying to predict, in which case it
 should not predict the same category, but return the next best match. There
 are similar situations where current selected category may be invalid (in
 terms of the overall solution not classification), and next best match might
 be selected depending on the algorithm/use case. So
 -is there a way to predict next best match directly?
 -or is there a best way to switch to something like knn (which initially 
  showed less promise in terms of predicting correctly)
-A


------------------------------------------------------------------------------
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

Reply via email to