Search Results for "clustering algorithm matlab" - Page 2
Sort By:
Showing 124 open source projects for "clustering algorithm matlab"
View related business solutions-
Test your software product anywhere in the worldGlobal App Testing is a managed pool of freelancers used by Google, Meta, Microsoft, and other world-beating software companies.
-
Build Securely on Azure with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
1
AmPEP and AxPEP
Sequence-based Antimicrobial Peptide Prediction by Random Forest
Antimicrobial peptides (AMPs) are promising candidates in the fight against multidrug-resistant pathogens due to its broad range of activities and low toxicity. However, identification of AMPs through wet-lab experiment is still expensive and time consuming. AmPEP is an accurate computational method for AMP prediction using the random forest algorithm. The prediction model is based on the distribution patterns of amino acid properties along the sequence. Our optimal model, AmPEP with 1:3 data... -
2
PyArmadillo
linear algebra library for Python
PyArmadillo - streamlined linear algebra library for Python, with emphasis on ease of use. Alternative to NumPy / SciPy. * Main page: https://pyarma.sourceforge.io * Documentation: https://pyarma.sourceforge.io/docs.html * Bug reports: https://pyarma.sourceforge.io/faq.html * Git repo: https://gitlab.com/jason-rumengan/pyarma -
3
Isolation Similarity
aNNE similarity based on Isolation Kernel
Demo of using aNNE similarity for DBSCAN. Written by Xiaoyu Qin, Monash University, March 2019, version 1.0 This software is under GNU General Public License version 3.0 (GPLv3) This code is a demo of method described by the following publication: Qin, X., Ting, K.M., Zhu, Y. and Lee, V.C., 2019, July. Nearest-neighbour-induced isolation similarity and its impact on density-based clustering. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 33, pp. 4755-4762... -
4
A2RMS Algorithm
Implementation of the A2RMS Algorithm in Matlab
Implementation of the A2RMS Algorithm for univariate densities defined for real values. -
Build Securely on AWS with Proven FrameworksMoving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
-
5
Relative Overestimation VOP
VOP compression for MRI with overestimation control
**** This work is outdated! For better compression and speed use these: ***** https://sourceforge.net/projects/enhanced-sar-compression/ Virtual Observation Points SAR compression. Contains multiple Algorithms: Compression according to Eichfelder et al. and Lee et al. The Lee algorithm is enhanced by including overestimation control to reduce maximum relative overestimation. All algorithms are implemented in Matlab and were optimized for enhanced speed. Needs Matlab R2016b at least... -
6
weka-MTreeClusterer
Flat clustering algorithm based on MTrees implemented for weka.
-
7
DSeg software
A MATLAB program to segment filamentous bacteria and hyphae structures
The analysis of microscopy image has been the basis to our current understanding of the cellular growth and morphogenesis. The quantitative evaluation of morphological changes in the biological processes is therefore important to characterize cell structures. Here we present an image analysis tool DSeg to overcome the difficulties in finding complicated elongated cell shapes by using time-lapse data and cell morphological constraints. A fast binary level-set based algorithm is implemented... -
8
XBioSiP
RTL & Behavioral Models (Approx.) of Pan-Tompkins Application Stages
The "XBioSiP" library contains the RTL (VHDL) and behavioral (MATLAB) models of the approximate adders and multipliers used for designing approximate versions of the bio-signal processing Pan-Tompkins algorithm, including all of its application stages. This work was published in DAC 2019. In case of usage please refer to: B. S. Prabakaran, S. Rehman, M. Shafique, “XBioSiP: A Methodology for Approximate Bio-Signal Processing at the Edge”, IEEE/ACM 56th Design Automation Conference (DAC... -
9
Clustering by Shared Subspaces
Grouping Points by Shared Subspaces for Effective Subspace Clustering
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 -
Crowdtesting That Delivers | TesteumTesteum connects your software, app, or website to a worldwide network of testers, delivering detailed feedback in under 48 hours. Ensure functionality and refine UX on real devices, all at a fraction of traditional costs. Trusted by startups and enterprises alike, our platform streamlines quality assurance with actionable insights.
-
10
Invariant curve calculations in Matlab
Calculating stable & unstable curves for 2 dimensional maps in matlab.
This is an implementation that follows closely the algorithm for calculating stable curves, described by J. P. England, B. Krauskopf, H. M. Osinga in the paper "Computing One-Dimensional Stable Manifolds and Stable Sets of Planar Maps without the Inverse" published in SIAM J. APPLIED DYNAMICAL SYSTEMS 3.2 (2004), 161-190. The package also contains an implementation for calculating the unstable curves which is based on the paper "Growing 1D and Quasi-2D Unstable Manifolds of Maps" by Bernd... -
11
De_Lux
Deconvolution of luminescence cross-talk in microplate reader data
An algorithm to deconvolve the luminescence cross-talk in high-throughput gene expression profiling to recover the true luminescence activity of a microplate. -
12
Distance Scaling
A Distance Scaling Method to Improve Density-Based Clustering
These functions implement a distance scaling method, proposed by Ye Zhu, Kai Ming Ting, and Maia Angelova, "A Distance Scaling Method to Improve Density-Based Clustering", in PAKDD2018 proceedings: https://doi.org/10.1007/978-3-319-93040-4_31. -
13
NNC
Nuclear Norm Clustering
We present Nuclear Norm Clustering (NNC), an algorithm that can be used in different fields as a promising alternative to the k-means clustering method, and that is less sensitive to outliers. The NNC algorithm requires users to provide a data matrix M and a desired number of cluster K. We employed simulate annealing techniques to choose an optimal L that minimizes NN(L). To evaluate the advantages of our newly developed algorithm, we compared the performance of both 16 public datasets and 2... -
14
spark-msna
Algorithm on Spark for aligning multiple similar DNA/RNA sequences
The algorithm uses suffix tree for identifying common substrings and uses a modified Needleman-Wunsch algorithm for pairwise alignments. In order to improve the efficiency of pairwise alignments, an unsupervised learning based on clustering technique is used to create a knowledge base to guide them. -
15
popt4jlib
Parallel Optimization Library for Java
popt4jlib is an open-source parallel optimization library for the Java programming language supporting both shared memory and distributed message passing models. Implements a number of meta-heuristic algorithms for Non-Linear Programming, including Genetic Algorithms, Differential Evolution, Evolutionary Algorithms, Simulated Annealing, Particle Swarm Optimization, Firefly Algorithm, Monte-Carlo Search, Local Search algorithms, Gradient-Descent-based algorithms, as well as some well-known... -
16
DGRLVQ
Dynamic Generalized Relevance Learning Vector Quantization
Some of the usual problems for Learning vector quantization (LVQ) based methods are that one cannot optimally guess about the number of prototypes required for initialization for multimodal data structures i.e.these algorithms are very sensitive to initialization of prototypes and one has to pre define the optimal number of prototypes before running the algorithm. If a prototype, for some reasons, is ‘outside’ the cluster which it should represent and if there are points of a different... -
17
ECO
Matlab implementation of the ECO tracker
ECO (Efficient Convolution Operators for Tracking) is a high-performance object tracking algorithm developed by Martin Danelljan and collaborators. It is based on discriminative correlation filters and designed to handle appearance changes, occlusions, and scale variations in visual object tracking tasks. The code provides a MATLAB implementation of the ECO and ECO-HC (high-speed) variants and was one of the top performers on multiple visual tracking benchmarks. -
18
A Generic Platform for Iris Recognition
A framework that allows iris recognition algorithms to be evaluated
This MATLAB based framework allows iris recognition algorithms from all four stages of the recognition process (segmentation, normalisation, encoding and matching) to be automatically evaluated and interchanged with other algorithms performing the same function. The algorithm for each stage can be selected from a list of available algorithms, with selection available for subfunctions as well. The selected algorithms can then be tested either manually against individual iris images... -
19
The purpose of this program is to provide the user with a convenient algorithm for automatic Independent Component (IC) selection with respect to the contributions of the ICs to a certain event-related brain potential (ERP). www.jan-wessel.de
-
20
All future developments will be implemented in the new MATLAB toolbox SciXMiner, please visit https://sourceforge.net/projects/scixminer/ to download the newest version. 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.
-
21
TESTIMAGES
Testing images for scientific purposes
... patterns). Please cite the following papers when using any image in this archive: * ASUNI N, GIACHETTI A, "TESTIMAGES: A Large Data Archive For Display and Algorithm Testing", Journal of Graphics Tools, Volume 17, Issue 4, 2015, pages 113-125, DOI:10.1080/2165347X.2015.1024298 * ASUNI N, GIACHETTI A, "TESTIMAGES: a large-scale archive for testing visual devices and basic image processing algorithms", STAG - Smart Tools & Apps for Graphics Conference, 2014. -
22
Density-ratio based clustering
Discovering clusters with varying densities
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... -
23
This package includes a collection of MATLAB files which are designed to: 1. Given a calibration scan of the image of a point emitter with an engineered point spread function (PSF), 2. Perform a phase retrieval algorithm based on maximum likelihood estimation (MLE) of a phase aberration term which is added to the theoretical pupil function of the imaging system. 3. Use the phase-retrieved pupil function to perform single-emitter localization. Accompanying publication available here...
-
24
QSdpR
Viral Quasispecies Reconstruction software based on QSdpR algorithm
This is a viral quasispecies reconstruction software for quasispecies assembly problem on mRNA viruses, which is based on a correlation clustering approach and uses semidefinite optimization framework. The software accepts a reference genome, a NGS read set aligned to this reference and set of SNP locations in the form of a vcf file and outputs an optimal set of reconstructed species genomes which describes the underlying viral population. -
25
BISD
Batch incremental SNN-DBSCAN clustering algorithm
Incremental data mining algorithms process frequent up- dates to dynamic datasets efficiently by avoiding redundant computa- tion. Existing incremental extension to shared nearest neighbor density based clustering (SNND) algorithm cannot handle deletions to dataset and handles insertions only one point at a time. We present an incremen- tal algorithm to overcome both these bottlenecks by efficiently identify- ing affected parts of clusters while processing updates to dataset in batch...
