RSS Feed - Blog
About: The Weka workbench contains a collection of visualization tools and algorithms for data analysis and predictive modelling, together with graphical user interfaces for easy access to this [...] Changes:This release include a lot of bug fixes and improvements. Some of these are detailed at http://jira.pentaho.com/projects/DATAMINING/issues/DATAMINING-771 As usual, for a complete list of changes refer to the changelogs.
|
About: The proposed hashing algorithm leverages the bootstrap sampling idea and integrates it with PCA, resulting in a new projection method called Bagging PCA Hashing. Changes:Initial Announcement on mloss.org.
|
About: a tool for marking samples in images for database building, also including algorithm of LBP,HOG,and classifiers of SVM (six kernels), adaboost,BP and convolutional networks, extreme learning machine. 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: Jie Gui et al., "How to estimate the regularization parameter for spectral regression discriminant analysis and its kernel version?", IEEE Transactions on Circuits and Systems for Video Technology, vol. 24, no. 2, pp. 211-223, 2014 Changes:Initial Announcement on mloss.org. |
About: Jie Gui, Zhenan Sun, Guangqi Hou, Tieniu Tan, "An optimal set of code words and correntropy for rotated least squares regression", International Joint Conference on Biometrics, 2014, pp. 1-6 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: 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: Q. Dong, Two-dimensional relaxed representation, Neurocomputing, 121:248-253, 2013, http://dx.doi.org/10.1016/j.neucom.2013.04.044 Changes:Initial Announcement on mloss.org.
|
About: This evaluation toolkit provides a unified framework for evaluating bag-of-words based encoding methods over several standard image classification datasets. Changes:Initial Announcement on mloss.org.
|
About: This letter proposes a new multiple linear regression model using regularized correntropy for robust pattern recognition. First, we motivate the use of correntropy to improve the robustness of the classicalmean square error (MSE) criterion that is sensitive to outliers. Then an l1 regularization scheme is imposed on the correntropy to learn robust and sparse representations. Based on the half-quadratic optimization technique, we propose a novel algorithm to solve the nonlinear optimization problem. Second, we develop a new correntropy-based classifier based on the learned regularization scheme for robust object recognition. Extensive experiments over several applications confirm that the correntropy-based l1 regularization can improve recognition accuracy and receiver operator characteristic curves under noise corruption and occlusion. Changes:Initial Announcement on mloss.org.
|
About: Robust sparse representation has shown significant potential in solving challenging problems in computer vision such as biometrics and visual surveillance. Although several robust sparse models have been proposed and promising results have been obtained, they are either for error correction or for error detection, and learning a general framework that systematically unifies these two aspects and explore their relation is still an open problem. In this paper, we develop a half-quadratic (HQ) framework to solve the robust sparse representation problem. By defining different kinds of half-quadratic functions, the proposed HQ framework is applicable to performing both error correction and error detection. More specifically, by using the additive form of HQ, we propose an L1-regularized error correction method by iteratively recovering corrupted data from errors incurred by noises and outliers; by using the multiplicative form of HQ, we propose an L1-regularized error detection method by learning from uncorrupted data iteratively. We also show that the L1-regularization solved by soft-thresholding function has a dual relationship to Huber M-estimator, which theoretically guarantees the performance of robust sparse representation in terms of M-estimation. Experiments on robust face recognition under severe occlusion and corruption validate our framework and findings. Changes:Initial Announcement on mloss.org.
|
About: JProGraM (PRObabilistic GRAphical Models in Java) is a statistical machine learning library. It supports statistical modeling and data analysis along three main directions: (1) probabilistic graphical models (Bayesian networks, Markov random fields, dependency networks, hybrid random fields); (2) parametric, semiparametric, and nonparametric density estimation (Gaussian models, nonparanormal estimators, Parzen windows, Nadaraya-Watson estimator); (3) generative models for random networks (small-world, scale-free, exponential random graphs, Fiedler random graphs/fields), subgraph sampling algorithms (random walk, snowball, etc.), and spectral decomposition. Changes:JProGraM 13.2 -- CHANGE LOG Release date: February 13, 2012 New features: -- Support for Fiedler random graphs/random field models for large-scale networks (ninofreno.graph.fiedler package); -- Various bugfixes and enhancements (especially in the ninofreno.graph and ninofreno.math package).
|
About: Classification rule based on Bayesian naive Bayes models with feature selection bias corrected Changes:Fetched by r-cran-robot on 2012-12-01 00:00:07.510624
|
About: Python Machine Learning Toolkit Changes:Added LASSO (using coordinate descent optimization). Made SVM classification (learning and applying) much faster: 2.5x speedup on yeast UCI dataset.
|
About: The UniverSVM is a SVM implementation written in C/C++. Its functionality comprises large scale transduction via CCCP optimization, sparse solutions via CCCP optimization and data-dependent [...] Changes:Minor changes: fix bug on set_alphas_b0 function (thanks to Ferdinand Kaiser - ferdinand.kaiser@tut.fi)
|
About: MDP is a Python library of widely used data processing algorithms that can be combined according to a pipeline analogy to build more complex data processing software. The base of available algorithms includes signal processing methods (Principal Component Analysis, Independent Component Analysis, Slow Feature Analysis), manifold learning methods ([Hessian] Locally Linear Embedding), several classifiers, probabilistic methods (Factor Analysis, RBM), data pre-processing methods, and many others. Changes:What's new in version 3.3?
|
About: Text-to-Speech (TTS) is a kind of speech processing technology that converts text into speech. It involves phonetics, linguistics, digital signal processing technology, computer technology, multimedia technology, and other technologies. It is a frontier technology in Chinese information processing field. With TTS technology, any text used to be read by eyes can also be listened by ears. Changes:Initial Announcement on mloss.org.
|
|
About: We study the problem of robust feature extraction based on L21 regularized correntropy in both theoretical and algorithmic manner. In theoretical part, we point out that an L21-norm minimization can be justified from the viewpoint of half-quadratic (HQ) optimization, which facilitates convergence study and algorithmic development. In particular, a general formulation is accordingly proposed to unify L1-norm and L21-norm minimization within a common framework. In algorithmic part, we propose an L21 regularized correntropy algorithm to extract informative features meanwhile to remove outliers from training data. A new alternate minimization algorithm is also developed to optimize the non-convex correntropy objective. In terms of face recognition, we apply the proposed method to obtain an appearance-based model, called Sparse-Fisherfaces. Extensive experiments show that our method can select robust and sparse features, and outperforms several state-of-the-art subspace methods on largescale and open face recognition datasets. Changes:Initial Announcement on mloss.org. |