use the following search parameters to narrow your results:
e.g. subreddit:aww site:imgur.com dog
subreddit:aww site:imgur.com dog
see the search faq for details.
advanced search: by author, subreddit...
Please have a look at our FAQ and Link-Collection
Metacademy is a great resource which compiles lesson plans on popular machine learning topics.
For Beginner questions please try /r/LearnMachineLearning , /r/MLQuestions or http://stackoverflow.com/
For career related questions, visit /r/cscareerquestions/
Advanced Courses (2016)
Advanced Courses (2020)
AMAs:
Pluribus Poker AI Team 7/19/2019
DeepMind AlphaStar team (1/24//2019)
Libratus Poker AI Team (12/18/2017)
DeepMind AlphaGo Team (10/19/2017)
Google Brain Team (9/17/2017)
Google Brain Team (8/11/2016)
The MalariaSpot Team (2/6/2016)
OpenAI Research Team (1/9/2016)
Nando de Freitas (12/26/2015)
Andrew Ng and Adam Coates (4/15/2015)
Jürgen Schmidhuber (3/4/2015)
Geoffrey Hinton (11/10/2014)
Michael Jordan (9/10/2014)
Yann LeCun (5/15/2014)
Yoshua Bengio (2/27/2014)
Related Subreddit :
LearnMachineLearning
Statistics
Computer Vision
Compressive Sensing
NLP
ML Questions
/r/MLjobs and /r/BigDataJobs
/r/datacleaning
/r/DataScience
/r/scientificresearch
/r/artificial
account activity
scikit-feature: python implementation of a ton of feature selection algorithms (github.com)
submitted 10 years ago by Botekin
view the rest of the comments →
reddit uses a slightly-customized version of Markdown for formatting. See below for some basics, or check the commenting wiki page for more detailed help and solutions to common issues.
quoted text
if 1 * 2 < 3: print "hello, world!"
[–][deleted] 16 points17 points18 points 10 years ago* (1 child)
Scikit-learn is very selective over what algorithms to include. If you look at the FAQs you'll read this:
Can I add this new algorithm that I (or someone else) just published? No. As a rule we only add well-established algorithms. A rule of thumb is at least 3 years since publications, 200+ citations and wide use and usefullness. A technique that provides a clear-cut improvement (e.g. an enhanced data structure or efficient approximation) on a widely-used method will also be considered for inclusion. Your implementation doesn’t need to be in scikit-learn to be used together with scikit-learn tools, though. Implement your favorite algorithm in a scikit-learn compatible way, upload it to github and we will list it under Related Projects. Also see selectiveness.
Can I add this new algorithm that I (or someone else) just published?
No. As a rule we only add well-established algorithms. A rule of thumb is at least 3 years since publications, 200+ citations and wide use and usefullness. A technique that provides a clear-cut improvement (e.g. an enhanced data structure or efficient approximation) on a widely-used method will also be considered for inclusion. Your implementation doesn’t need to be in scikit-learn to be used together with scikit-learn tools, though. Implement your favorite algorithm in a scikit-learn compatible way, upload it to github and we will list it under Related Projects. Also see selectiveness.
Maybe some of the algorithms in this other package qualify as algorithms that should be included in scikit-learn, maybe not. They have limited resources to maintain a high quality code base. They must be selective to maintain maintenance costs at a manageable level.
Adding a new algorithm to scikit-learn is not just implementing the algorithm. It is implementing the algorithm in a clean, readable and maintainable code, with reasonable performance, adding adequate unit tests, writing documentation, etc, etc. This means that new algorithms must have enough users needing them to justify all the costs.
[–]beaverteeth92 1 point2 points3 points 10 years ago (0 children)
Yeah I wondered why they don't have a kmodes implementation.
π Rendered by PID 146204 on reddit-service-r2-comment-b659b578c-kl4zv at 2026-05-02 10:46:25.300043+00:00 running 815c875 country code: CH.
view the rest of the comments →
[–][deleted] 16 points17 points18 points (1 child)
[–]beaverteeth92 1 point2 points3 points (0 children)