Search Results for "clustering"

STK++ (http://www.stkpp.org) is a versatile, fast, reliable and elegant collection of C++ classes for statistics, clustering, linear algebra, arrays (with an Eigen-like API), regression, dimension reduction, etc. Some functionalities provided by the library are available in the R environment as R functions (http://cran.at.r-project.org/web/packages/rtkore/index.html). At a convenience, we propose the source packages on sourceforge. The library offers a dense set of (mostly) template classes in C++ and is suitable for projects ranging from small one-off projects to complete data mining application suites.

...The former Matlab toolbox Gait-CAD was designed for the visualization and analysis of time series and features with a special focus to data mining problems including classification, regression, and clustering.

...For statistical classification there is a borders training feature for creating fast and general pre-trained models that nonetheless return the conditional probabilities. Libagf also includes clustering algorithms as well as comparison and validation routines. It is written in C++.

Hrothgar is a parallel minimizer and Markov Chain Monte Carlo generator by Andisheh Mahdavi of San Francisco State University. It has been used to solve optimization problems in astrophysics (galaxy cluster mass profiles) as well as in experimental particle physics (hadronic tau decays). It is probably adaptable enough to be applied to your merit function if you can write it in C.

...The program uses sum of reciprocal squared distance to calculate density at each point, with a smear factor to prevent points going to infinity. The smear factor also controls the amount of clustering. There are several options for colour output. Input is via a csv (comma-separated values) file. Now there's a nice GUI built in Baby X for Linux and Windows

Statistics modules in Perl Data Language, with a quick-start guide for non-PDL people. They make the PDL shell work like R, but with PDL threading (fast automatic iteration) of procedures including t-test, linear regression, and k-means clustering.

mlpy is a Python module for Machine Learning built on top of NumPy/SciPy and of GSL. mlpy provides high-level functions and classes allowing, with few lines of code, the design of rich workflows for classification, regression, clustering and feature selection. mlpy is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License version 3. mlpy is available both for Python >=2.6 and Python 3.X.

The final build of this software now is distributed in R, embedded in "RedeR': an R/Bioconductor package for hierarchical and nested network analysis... more about RedeR: http://bioconductor.org/packages/2.9/bioc/html/RedeR.html

An R package implementation of a consensus clustering methodology. This package allows users to perform re-sampling statistics based clustering using multiple clustering algorithms to assess the robustness of both clusters and members of clusters.

An application to perform statistical clustering analysis

This project is a prototype of a framework for Social Network Analysis created at INRIA. It provides methods for fetching, preparing, clustering and analyzing data from online Social Networks. Currently it has support only for the Twitter network.

Data Mining Platform is a platform for data mining and analysis. It contains many of the new and sophisticated methods such as kernel-based classification, two-way clustering, bayesian networks, pattern recognition for time series analysis and many other

ExoPlanet provides a graphical interface for the construction, evaluation and application of a Machine Learning model in predictive analysis. With the back-end built using the numpy and scikit-learn libraries, as a toolkit, ExoPlanet couples fast and well tested algorithms, a UI designed over the Qt4 framework, and graphs rendered using Matplotlib to provide the user with a rich interface, rapid analytics and interactive visuals. ExoPlanet is designed to have a minimal learning curve,...

...Basically this is related to the computation of the distribution of k co-occurrences of spatial events (generalising the contiguity distributions - 2 co-occurrences at distance 0) to derive spatial clustering statistics (mainly using the Shannon entropy, then called the k-spatial entropy) and methods linked to this: SOOk, SelSOOk (see caGEO paper) and scankOO (see TGIS). Another method (CAkOO) performing a k-Correspondence Analysis (i.e. on a multiway table with k entries) on the contingencies of co-occurrenceshas been already "published in my JSS paper about another R package: PTAk. ...