RSS Feed - BlogShowing Items 241-260 of 676 on page 13 of 34: First Previous 8 9 10 11 12 13 14 15 16 17 18 Next Last
About: jblas is a fast linear algebra library for Java. jblas is based on BLAS and LAPACK, the de-facto industry standard for matrix computations, and uses state-of-the-art implementations like ATLAS for all its computational routines, making jBLAS very fast. Changes:Changes from 1.0:
|
About: Java package for calculating Entropy for Machine Learning Applications. It has implemented several methods of handling missing values. So it can be used as a lab for examining missing values. Changes:Discretizing numerical values is added to calculate mode of values and fractional replacement of missing ones. class diagram is on the web http://profs.basu.ac.ir/bathaeian/free_space/jemla.rar
|
About: The JINSECT toolkit is a Java-based toolkit and library that supports and demonstrates the use of n-gram graphs within Natural Language Processing applications, ranging from summarization and summary evaluation to text classi?cation and indexing. Changes:
|
About: machine learning library in java for easy development of new kernels and kernel algorithms Changes:Version 3.0 /! Warning: this version is incompatible with previous code
|
About: The Java package jLDADMM is released to provide alternative choices for topic modeling on normal or short texts. It provides implementations of the Latent Dirichlet Allocation topic model and the one-topic-per-document Dirichlet Multinomial Mixture model (i.e. mixture of unigrams), using collapsed Gibbs sampling. In addition, jLDADMM supplies a document clustering evaluation to compare topic models. Changes:Initial Announcement on mloss.org.
|
About: A Java library to create, process and manage mixtures of exponential families. Changes:Initial Announcement on mloss.org.
|
About: JNCC2 is the open-source implementation of the Naive Credal Classifier2 (NCC2), i.e., an extension of Naive Bayes towards imprecise probabilities, designed to deliver robust classifications even on [...] 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: A Java framework for statistical analysis and classification of biological sequences Changes:New classes and packages:
New features and improvements:
|
About: Jubatus is a general framework library for online and distributed machine learning. It currently supports classification, regression, clustering, recommendation, nearest neighbors, anomaly detection, and graph analysis. Loose model sharing provides higher scalability, better performance, and real-time capabilities, by combining online learning with distributed computations. Changes:0.5.0 add new supports for clustering and nearest neighbors. For more detail, see http://t.co/flMcTcYZVs
|
About: The K-tree is a scalable approach to clustering inspired by the B+-tree and k-means algorithms. Changes:Release of K-tree implementation in Python. This is targeted at a research and rapid prototyping audience.
|
About: Learns dynamic network changes across conditions and visualize the results in Cytoscape. Changes:Initial Announcement on mloss.org.
|
About: Kernel-Based Analysis of Biological Sequences Changes:
|
About: KEEL (Knowledge Extraction based on Evolutionary Learning) is an open source (GPLv3) Java software tool that can be used for a large number of different knowledge data discovery tasks. KEEL provides a simple GUI based on data flow to design experiments with different datasets and computational intelligence algorithms (paying special attention to evolutionary algorithms) in order to assess the behavior of the algorithms. It contains a wide variety of classical knowledge extraction algorithms, preprocessing techniques (training set selection, feature selection, discretization, imputation methods for missing values, among others), computational intelligence based learning algorithms, hybrid models, statistical methodologies for contrasting experiments and so forth. It allows to perform a complete analysis of new computational intelligence proposals in comparison to existing ones. Moreover, KEEL has been designed with a two-fold goal: research and educational. KEEL is also coupled with KEEL-dataset: a webpage that aims at providing to the machine learning researchers a set of benchmarks to analyze the behavior of the learning methods. Concretely, it is possible to find benchmarks already formatted in KEEL format for classification (such as standard, multi instance or imbalanced data), semi-supervised classification, regression, time series and unsupervised learning. Also, a set of low quality data benchmarks is maintained in the repository. Changes:Initial Announcement on mloss.org.
|
About: Kernel-based Learning Platform (KeLP) is Java framework that supports the implementation of kernel-based learning algorithms, as well as an agile definition of kernel functions over generic data representation, e.g. vectorial data or discrete structures. The framework has been designed to decouple kernel functions and learning algorithms, through the definition of specific interfaces. Once a new kernel function has been implemented, it can be automatically adopted in all the available kernel-machine algorithms. KeLP includes different Online and Batch Learning algorithms for Classification, Regression and Clustering, as well as several Kernel functions, ranging from vector-based to structural kernels. It allows to build complex kernel machine based systems, leveraging on JSON/XML interfaces to instantiate prediction models without writing a single line of code. Changes:In addition to minor improvements and bug fixes, this release includes:
Check out this new version from our repositories. API Javadoc is already available. Your suggestions will be very precious for us, so download and try KeLP 2.2.2!
|
About: KeplerWeka represents the integration of all the functionality of the WEKA Machine Learning Workbench into the open-source scientific workflow Kepler. Among them are classification, [...] Changes:
|
About: A Matlab benchmarking toolbox for online and adaptive regression with kernels. Changes:
|
About: The Kernel-Machine Library is a free (released under the LGPL) C++ library to promote the use of and progress of kernel machines. Changes:Updated mloss entry (minor fixes).
|
About: Efficient implementation of penalized multiple logistic regression (aka multi-class) with Mercer kernels, aka MAP approximation to the multi-class Gaussian process model. This includes [...] Changes:Initial Announcement on mloss.org.
|
About: kernlab provides kernel-based Machine Learning methods for classification, regression, clustering, novelty detection, quantile regression and dimensionality reduction. Among other methods kernlab [...] Changes:minor fixes in kcca and ksvm functions
|