RSS Feed - Blog
About: Jmlp is a java platform for both of the machine learning experiments and application. I have tested it on the window platform. But it should be applicable in the linux platform due to the cross-platform of Java language. It contains the classical classification algorithm (Discrete AdaBoost.MH, Real AdaBoost.MH, SVM, KNN, MCE,MLP,NB) and feature reduction(KPCA,PCA,Whiten) etc. Changes:Initial Announcement on mloss.org.
|
|
About: The toolbox from the paper Near-optimal Experimental Design for Model Selection in Systems Biology (Busetto et al. 2013, submitted) implemented in MATLAB. Changes:Initial Announcement on mloss.org.
|
About: An open-source framework for benchmarking of feature selection algorithms and cost functions. Changes:Initial Announcement on mloss.org.
|
About: Oboe is a software for Chinese syntactic parsing, and it can display syntactic trees in a graphical view with two kinds of representation: phrase tree and dependency tree. So it is very helpful for NLP researchers, especially for researchers focusing on syntax-based methods. Changes:Initial Announcement on mloss.org.
|
About: R package implementing statistical test and post hoc tests to compare multiple algorithms in multiple problems. Changes:Initial Announcement on mloss.org.
|
About: Ran He, Wei-Shi Zheng,Tieniu Tan, and Zhenan Sun. Half-quadratic based Iterative Minimization for Robust Sparse Representation. Submitted to IEEE Trans. on Pattern Analysis and Machine Intelligence. Changes:Initial Announcement on mloss.org.
|
About: This program implements a novel robust sparse representation method, called the two-stage sparse representation (TSR), for robust recognition on a large-scale database. Based on the divide and conquer strategy, TSR divides the procedure of robust recognition into outlier detection stage and recognition stage. The extensive numerical experiments on several public databases demonstrate that the proposed TSR approach generally obtains better classification accuracy than the state-of-the-art Sparse Representation Classification (SRC). At the same time, by using the TSR, a significant reduction of computational cost is reached by over fifty times in comparison with the SRC, which enables the TSR to be deployed more suitably for large-scale dataset. Changes:Initial Announcement on mloss.org.
|
About: Software for Automatic Construction and Inference of DBNs Based on Mathematical Models Changes:Initial Announcement on mloss.org.
|
About: Kaiye Wang, Ran He, Wei Wang, Liang Wang, Tiuniu Tan. Learning Coupled Feature Spaces for Cross-modal Matching. In ICCV, 2013. Changes:Initial Announcement on mloss.org.
|
About: This is an unoptimized implementation of the RFD binary descriptor, which is published in the following paper. B. Fan, et al. Receptive Fields Selection for Binary Feature Description. IEEE Transaction on Image Processing, 2014. doi: http://dx.doi.org/10.1109/TIP.2014.2317981 Changes:Initial Announcement on mloss.org.
|
About: A simple and clear OpenCV based extended Kalman filter(EKF) abstract class implementation,absolutely following standard EKF equations. Special thanks to the open source project of KFilter1.3. It is easy to inherit it to implement a variable state and measurement EKF for computer vision and INS usages. Changes:Initial Announcement on mloss.org.
|
About: This is an exact implementation of Histogram of Oriented Gradient as mentioned in the paper by Dalal. Changes:Initial Announcement on mloss.org.
|
About: Nonnegative Sparse Coding, Discriminative Semi-supervised Learning, sparse probability graph Changes:Initial Announcement on mloss.org.
|
About: Simple and hopefully clean and easy to follow implementation of the Generalized Learning Vector Quantizer (GLVQ) with variants for metric adaptation (RGLVQ, GMLVQ, LiRaM). Changes:Initial Announcement on mloss.org.
|
About: This is a library for solving nu-SVM by using Wolfe's minimum norm point algorithm. You can solve binary classification problem. Changes:Initial Announcement on mloss.org.
|
About: The auto-encoder based data clustering toolkit provides a quick start of clustering based on deep auto-encoder nets. This toolkit can cluster data in feature space with a deep nonlinear nets. Changes:Initial Announcement on mloss.org.
|
About: This MATLAB package provides the Deep Quadratic Tree (DQT) and the Normalized Pixel Difference (NPD) based face detector training method proposed in our PAMI 2015 paper. It is fast, and effective for unconstrained face detection. For more details, please visit http://www.cbsr.ia.ac.cn/users/scliao/projects/npdface/. Changes:Initial Announcement on mloss.org.
|
About: This code is developed based on Uriel Roque's active set algorithm for the linear least squares problem with nonnegative variables in: Portugal, L.; Judice, J.; and Vicente, L. 1994. A comparison of block pivoting and interior-point algorithms for linear least squares problems with nonnegative variables. Mathematics of Computation 63(208):625-643.Ran He, Wei-Shi Zheng and Baogang Hu, "Maximum Correntropy Criterion for Robust Face Recognition," IEEE TPAMI, in press, 2011. Changes:Initial Announcement on mloss.org.
|
About: MLPlot is a lightweight plotting library written in Java. Changes:Initial Announcement on mloss.org.
|
