Search Results for "clustering algorithm matlab" - Page 5

ACADO Toolkit is a software environment and algorithm collection for automatic control and dynamic optimization. It provides a general framework for using a great variety of algorithms for direct optimal control, including model predictive control, state and parameter estimation and robust optimization. ACADO Toolkit is implemented as self-contained C++ code and comes along with user-friendly MATLAB interface.

EToS (Efficient Technology of Spike sorting; Extracellular recording To Spike trains) is an open-source system for spike sorting. EToS contains the programs of spike detection, feature extraction and clustering.

RandTree is a MatLab based tree simulator program where the algorithm is based on Honda's model. We have used probabilistic generation of branches in order to simulate visually realistic tree structures. This program is designed to generate branching structures with bifurcation branching pattern (sympodial branching). By changing the probabilities and branching angles, you can generate different shapes of trees.

The Stanford Machine Learning Course Exercises repository contains programming assignments from the well-known Stanford Machine Learning online course. It includes implementations of a variety of fundamental algorithms using Python and MATLAB/Octave. The repository covers a broad set of topics such as linear regression, logistic regression, neural networks, clustering, support vector machines, and recommender systems. Each folder corresponds to a specific algorithm or concept, making it easy for learners to navigate and practice. The exercises serve as practical, hands-on reinforcement of theoretical concepts taught in the course. ...

This project (CvHMM) is an implementation of discrete Hidden Markov Models (HMM) based on OpenCV. It is simple to understand and simple to use. The Zip file contains one header for the implementation and one main.cpp file for a demonstration of how it works. Hope it becomes useful for your projects.

This is a MATLAB implementation of inverse compositional Active Appearance Models (AAMs), as described in the "Active Appearance Models Revisited" paper by Iain Matthews and Simon Baker.

In this Project, it is attempted to implement the software for the Galaxy-based Search Algorithm (the GbSA). The GbSA is a continuous optimization algorithm inspired from nature. It tries to mimic the spiral movement of spiral galaxies along with a chaotic process to search the solution space for a given continuous optimization problem. For this purpose, a local search is also employed for fine-tuning of the obtained solution.

Note: This project is no longer maintained. An updated pure Python and experimental MatLab versions are located at https://github.com/robb-brown/GFT. The Fast S-Transform package implements a novel algorithm that solves the S-Transform with O(NlogN) computational complexity. This Fast S-Transform algorithm is fully invertible, and requires only O(N) storage space.

...Because BLIM Toolbox is meant to work with other Argus software, it is programmed in Matlab. For the BLIM Toolbox to run, Matlab needs to be installed. However, knowledge of Matlab programming is not required for using the toolbox.

This project was developed for ESTs. However, there is no reason it cannot be extended for use on amplicon sequences from 454. It is used in conjunction with WCDest clustering software.

Gepoclu - Gene Positional Clustering is a suite of Matlab functions for performing positional clustering on genes with optional use of expression data such as what can be obtained from Microarray, EST and qRT-PCR, and PCR.

PocketAnalyzerPCA combines a geometric algorithm for detecting pockets in proteins with Principal Component Analysis and clustering. This enables visualization and analysis of pocket conformational distributions of large sets of protein structures.

Leark is a Data Mining library developed in C#.NET. It contains several methods for ranking web documents described with a set of normalized features, and a feature selection algorithm. The methods are based on perceptron and clustering.

Complex Systems is a toolbox for SCILAB software. This toolbox measures some parameters for graphs representing complex systems: degree distribution, average neighboring degree, average clustering, and shell index (from k-core decomposition).

A tool to automate (i) software/algorithm benchmarking varying a set of control parameters, (ii) manage and summarize the results using plots and tables. The software works with any standalone command line based software or MATLAB.

This project applies an interpretation of a k-NN algorithm to a library of GPS commuter data for speed prediction. The overall goal is to lay the foundation for a power management protocol for use in electric vehicles with hybrid energy storage.

BorderFlow implements a general-purpose graph clustering algorithm. It maximizes the inner to outer flow ratio from the border of each cluster to the rest of the graph.

Perform local clustering on vector data. Alternatively: psi_square, psisquare

A MATLAB spectral clustering package to handle large data sets (200,000 RCV1 data) on a 4GB memory general machine. We implement various ways of approximating the dense similarity matrix, including nearest neighbors and the Nystrom method.

This project aims to provide open source software implementing the Wedge algorithm for the estimation of parameters in dynamical systems models. This project also seeks to create tutorials and resources for those using Wedge.

A particle swarm optimization demo written by students in the digital communication msc program (2010) at uni-kiel.

Fluster is a clustering algorithm for the Google Maps API v3. It manages all your markers on the map and summarizes them to "clustered markers" if there is not enough space around them. Acts like MarkerClusterer for v2.

This is a set of octave-functions to simulate grover's quantum search algorithm in which we introduce spontaneously decaying qubits. See http://arxiv.org/abs/quant-ph/0609047. This is a modification to account for multiple item searching.

Linear Time Invariant (LTI) system identification using particle swarm optimization (PSO) algorithm. Creators : Vahid Kiani, Hadi Sadoghi Yazdi

Java package to study a clustering model described in the paper \"Novel Clustering Algorithm Based Upon Games on Evolving Network\" by Q. Li, Z. Chen, Y. He and J-P. Jiang (in arxiv: http://arxiv.org/pdf/0812.5064v1), generalizations and similar issues.