Search Results for "two"

These functions implement a subspace clustering algorithm, proposed by Ye Zhu, Kai Ming Ting, and Mark J. Carman: "Grouping Points by Shared Subspaces for Effective Subspace Clustering", Published in Pattern Recognition Journal at https://doi.org/10.1016/j.patcog.2018.05.027

This site provides the source code of two approaches for density-ratio based clustering, used for discovering clusters with varying densities. One approach is to modify a density-based clustering algorithm to do density-ratio based clustering by using its density estimator to compute density-ratio. The other approach involves rescaling the given dataset only. An existing density-based clustering algorithm, which is applied to the rescaled dataset, can find all clusters with varying densities that would otherwise impossible had the same algorithm been applied to the unscaled dataset. ...

...The first package is about the basic mass estimation (including one-dimensional mass estimation and Half-Space Tree based multi-dimensional mass estimation). This packages contains the necessary codes to run on MATLAB. 2. The second package includes source and object files of DEMass-DBSCAN to be used with the WEKA system. 3. The third package DEMassBayes includes the source and object files of a Bayesian classifier using DEMass. DEMassBayes.7z has jar file to be used with WEKA and a readme file listing parameters used. The source files are included in DEMassBayes_Source.7z. 4. ...

The proposed filter-based algorithm uses a bank of Gabor filters to capture both local and global details in a fingerprint as a compact fixed length FingerCode. The fingerprint matching is based on the Euclidean distance between the two corresponding FingerCodes and hence is extremely fast. We are able to achieve a verification accuracy which is only marginally inferior to the best results of minutiae-based algorithms published in the open literature. Our system performs better than a state-of-the-art minutiae-based system when the performance requirement of the application system does not demand a very low false acceptance rate. ...

Implementation of duration high-order hidden Markov model (DHO-HMM) in Matlab with application in speech recognition.

...Please cite: [1] Sethu Vijayakumar, Aaron D'Souza and Stefan Schaal, Incremental Online Learning in High Dimensions, Neural Computation, vol. 17, no. 12, pp. 2602-2634 (2005). [2] Stefan Klanke, Sethu Vijayakumar and Stefan Schaal, A Library for Locally Weighted Projection Regression, Journal of Machine Learning Research (JMLR), vol. 9, pp. 623--626 (2008). More details and usage guidelines on the code website.

We present the Community Detection Toolbox (CDTB), a MATLAB toolbox which can be used to perform community detection. The CDTB contains several functions from the following categories. 1. graph generators; 2. clustering algorithms; 2. cluster number selection functions; 4. clustering evaluation functions. Furthermore, CDTB is designed in a parametric manner so that the user can add his own functions and extensions. The CDTB can be used in at least three ways. The user can employ the functions from the MATLAB command line; or he can write his own code, incorporating the CDTB functions; or he can use the Graphical User Interface (GUI) which automates the community detection and includes some data visualization options.

Computer Vision Application.

DHAC distribution

Content-based Image Retrieval (CBIR) consists of retrieving visually similar images to a given query image from a database of images. It is done by comparing selected visual features such as color, texture and shape from the image database.

An adaptive neural network and evolutionary algorithms approach to the machine learning tasks, based on the modular graph grammars. Tested on the "two spirals problem" and other tasks. Implemented in Matlab and C++.

This project contains code for evaluation of reflection symmetry detection algorithms

Function 1. classifier_knn 2. accuracy_knn Description 1. Returns the estimated label of one test instance, the k nearest training instances, the k nearest training labels and creates a chart circulating the nearest training instances (chart 2-D of the first two features of each instance). 2. Returns the estimated labels of one or multiple test instances and the accuracy of the estimates.