Showing Items 391400 of 537 on page 40 of 54: First Previous 35 36 37 38 39 40 41 42 43 44 45 Next Last
About: xgboost: eXtreme Gradient Boosting It is an efficient and scalable implementation of gradient boosting framework. The package includes efficient linear model solver and tree learning algorithm. The package can automatically do parallel computation with OpenMP, and it can be more than 10 times faster than existing gradient boosting packages such as gbm or sklearn.GBM . It supports various objective functions, including regression, classification and ranking. The package is made to be extensible, so that user are also allowed to define there own objectives easily. Changes:New features:  R support that is now on CRAN

About: Cubist is the regression counterpart to the C5.0 decision tree tool. Changes:Initial Announcement on mloss.org.

About: A Matlab implementation of Uncorrelated Multilinear PCA (UMPCA) for dimensionality reduction of tensor data via tensortovector projection Changes:Initial Announcement on mloss.org.

About: A python implementation of Breiman's Random Forests. Changes:Initial Announcement on mloss.org.

About: GritBot is an data cleaning and outlier/anomaly detection program. Changes:Initial Announcement on mloss.org.

About: hapFabia is an R package for identification of very short segments of identity by descent (IBD) characterized by rare variants in large sequencing data. It detects 100 times smaller segments than previous methods. Changes:o citation update o plot function improved

About: This is a Matlab/C++ "toolbox" of code for learning and inference with graphical models. It is focused on parameter learning using marginalization in the hightreewidth setting. Changes:Initial Announcement on mloss.org.

About: MLPlot is a lightweight plotting library written in Java. Changes:Initial Announcement on mloss.org.

About: OpenPRNBEM is an C++ implementation of Naive Bayes Classifier, which is a wellknown generative classification algorithm for the application such as text classification. The Naive Bayes algorithm requires the probabilistic distribution to be discrete. OpenPRNBEM uses the multinomial event model for representation. The maximum likelihood estimate is used for supervised learning, and the expectationmaximization estimate is used for semisupervised and unsupervised learning. Changes:Initial Announcement on mloss.org.
