Search Results for "clustering algorithm matlab"
Sort By:
Showing 164 open source projects for "clustering algorithm matlab"
View related business solutions-
Enterprise-grade ITSM, for every businessFreshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
1
Clustering.jl
A Julia package for data clustering
Methods for data clustering and evaluation of clustering quality. -
2
PlatEMO
Evolutionary multi-objective optimization platform
Evolutionary multi-objective optimization platform. PlatEMO consists of a number of MATLAB functions without using any other libraries. Any machines able to run MATLAB can use PlatEMO regardless of the operating system. PlatEMO includes more than ninety existing popular MOEAs, including genetic algorithm, differential evolution, particle swarm optimization, memetic algorithm, estimation of distribution algorithm, and surrogate model-based algorithm. Most of them are representative algorithms... -
3
MatlabMachine
Machine learning algorithms
Matlab-Machine is a comprehensive collection of machine learning algorithms implemented in MATLAB. It includes both basic and advanced techniques for classification, regression, clustering, and dimensionality reduction. Designed for educational and research purposes, the repository provides clear implementations that help users understand core ML concepts. -
4
hctsa
Highly comparative time-series analysis
hctsa is a Matlab software package for running highly comparative time-series analysis. It extracts thousands of time-series features from a collection of univariate time series and includes a range of tools for visualizing and analyzing the resulting time-series feature matrix. -
Build apps or websites quickly on a fully managed platformRun frontend and backend services, batch jobs, host LLMs, and queue processing workloads without the need to manage infrastructure.
-
5
The Operator Splitting QP Solver
The Operator Splitting QP Solver
OSQP uses a specialized ADMM-based first-order method with custom sparse linear algebra routines that exploit structure in problem data. The algorithm is absolutely division-free after the setup and it requires no assumptions on problem data (the problem only needs to be convex). It just works. OSQP has an easy interface to generate customized embeddable C code with no memory manager required. OSQP supports many interfaces including C/C++, Fortran, Matlab, Python, R, Julia, Rust. -
6
sktime
A unified framework for machine learning with time series
sktime is a library for time series analysis in Python. It provides a unified interface for multiple time series learning tasks. Currently, this includes time series classification, regression, clustering, annotation, and forecasting. It comes with time series algorithms and scikit-learn compatible tools to build, tune and validate time series models. Our objective is to enhance the interoperability and usability of the time series analysis ecosystem in its entirety. sktime provides a unified... -
7
HDBSCAN
A high performance implementation of HDBSCAN clustering
HDBSCAN - Hierarchical Density-Based Spatial Clustering of Applications with Noise. Performs DBSCAN over varying epsilon values and integrates the result to find a clustering that gives the best stability over epsilon. This allows HDBSCAN to find clusters of varying densities (unlike DBSCAN), and be more robust to parameter selection. In practice this means that HDBSCAN returns a good clustering straight away with little or no parameter tuning -- and the primary parameter, minimum cluster size... -
8
Alink
Alink is the Machine Learning algorithm platform based on Flink
Alink is Alibaba’s scalable machine learning algorithm platform built on Apache Flink, designed for batch and stream data processing. It provides a wide variety of ready-to-use ML algorithms for tasks like classification, regression, clustering, recommendation, and more. Written in Java and Scala, Alink is suitable for enterprise-grade big data applications where performance and scalability are crucial. It supports model training, evaluation, and deployment in real-time environments... -
9
TIGRE
TIGRE: Tomographic Iterative GPU-based Reconstruction Toolbox
TIGRE is an open-source toolbox for fast and accurate 3D tomographic reconstruction for any geometry. Its focus is on iterative algorithms for improved image quality that have all been optimized to run on GPUs (including multi-GPUs) for improved speed. It combines the higher-level abstraction of MATLAB or Python with the performance of CUDA at a lower level in order to make it both fast and easy to use. TIGRE is free to download and distribute: use it, modify it, add to it, and share it. Our... -
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.
-
10
DeepSqueak
DeepSqueak Using Machine Vision to Accelerate Bioacoustics Research
Using Machine Vision to Accelerate Bioacoustics Research. -
11
Smile
Statistical machine intelligence and learning engine
Smile is a fast and comprehensive machine learning engine. With advanced data structures and algorithms, Smile delivers the state-of-art performance. Compared to this third-party benchmark, Smile outperforms R, Python, Spark, H2O, xgboost significantly. Smile is a couple of times faster than the closest competitor. The memory usage is also very efficient. If we can train advanced machine learning models on a PC, why buy a cluster? Write applications quickly in Java, Scala, or any JVM... -
12
Armadillo
fast C++ library for linear algebra & scientific computing
* Fast C++ library for linear algebra (matrix maths) and scientific computing * Easy to use functions and syntax, deliberately similar to Matlab / Octave * Uses template meta-programming techniques to increase efficiency * Provides user-friendly wrappers for OpenBLAS, Intel MKL, LAPACK, ATLAS, ARPACK, SuperLU and FFTW libraries * Useful for machine learning, pattern recognition, signal processing, bioinformatics, statistics, finance, etc. * Downloads: http://arma.sourceforge.net... -
13
GNSS-SDR
An open source software-defined GNSS receiver
An open source software-defined Global Navigation Satellite Systems (GNSS) receiver written in C++ and based on the GNU Radio framework. -
14
High-performance package for SemiDefinite Programs The software SDPA (SemiDefinite Programming Algorithm) is one of the most efficient and stable software packages for solving SDPs based on the primal-dual interior-point method.
-
15
syre
Synchronous Reluctance (machines) - evolution
SyR-e is a Matlab/Octave package developed to design, evaluate and optimize synchronous reluctance and permanent magnet machines. To perform Finite Element Analysis (FEA) SyR-e is linked to FEMM software, and the simulation process (model creation, pre-processing, post-processing) is automatic and completely controlled from SyR-e code. For the design section, SyR-e embeds automatic procedures based on design equations, minimal FEA simulations or multi-objective optimization algorithm joined... -
16
iElectrodes
intracranial electrodes localization toolbox
iElectrodes is a free and open-source Matlab® toolbox to obtain intracranial electrode coordinates from MRI and CT images. Precise and reliable localization can be achieved fast and in a semiautomatic way with minimal user intervention. The toolbox works with ECoG (subdural grids and strips) and SEEG (depth) electrodes. The new GridFit algorithm can precisely localize high-density electrodes (up to 3mm). Brain parcellations (atlas) and surfaces can be imported to aid 2D and 3D visualization... -
17
Enhanced SAR Compression
VOP Algorithm with improved speed and compression
This work is described in: Orzada S, Fielder TM, Quick HH, Ladd ME, "A local SAR compression algorithm with improved compression, speed and flexibility", https://doi.org/10.1002/mrm.28739. This new algorithm is an iterative expansion of the exisisting local SAR compression algorithm for MRI proposed by Lee et al. ( https://doi.org/10.1002/mrm.23140) The number of VOPs is approximately halved with the new algorithm, while at the same time the compression time is reduced with speed-up... -
18
AngClust
AngClust: Angle-based feature clustering for time series
Citation: Aimin Li, Siqi Xiong, Junhuai Li, Saurav Mallik, Yajun Liu, Rong Fei, Hongfang Zhou, Guangming Liu. AngClust: Angle Feature-Based Clustering for Short Time Series Gene Expression Profiles. January 2022. IEEE/ACM transactions on computational biology and bioinformatics / IEEE, ACM. DOI: 10.1109/TCBB.2022.3192306 Full text: https://ieeexplore.ieee.org/document/9833353/ https://pubmed.ncbi.nlm.nih.gov/35853049/ Highlights * We proposed a novel clustering algorithm based... -
19
MultiSpecEPR
MultiSpec EPR handles and present several spectra 1D and 2D
MultiSpec EPR is a program made to handle and to present several spectra (up to 4000) simultaneously or one by one as well as EPR spectra with two dimensions. It loads spectra from Bruker EPR instruments. It has a new algorithm for automatic peak picking which is very efficient and a very fast and accurate line fitting. It makes colorful figures that can be transferred directly to the scientific articles of one or multiple spectra. Save txt tables of the peaks and integrals that can... -
20
Bandicoot
fast C++ library for GPU linear algebra & scientific computing
* Fast GPU linear algebra library (matrix maths) for the C++ language, aiming towards a good balance between speed and ease of use * Provides high-level syntax and functionality deliberately similar to Matlab * Provides an API that is aiming to be compatible with Armadillo for easy transition between CPU and GPU linear algebra code * Useful for algorithm development directly in C++, or quick conversion of research code into production environments * Distributed under the permissive Apache... -
21
RAFTS³G
Rapid Alignment Free Tool for Sequences Similarity Search to Groups
| RAFTS3G - Rapid Alignment Free Tool for Sequences Similarity Search to Groups| % Clustering algoritm to create homology clusters based on RAFTS3 (VIALLE, R. A.) % More informations about RAFTS3 in: https://sourceforge.net/projects/rafts3/ % Professional and Technical Education Sector from the Federal University of Paraná - Bioinformatic Lab. % Federal of Paraná University - UFPR % Dr. Alcides Vieira Arco-verde street, 1225 % CEP: 81520-260 Jardim das Américas % Curitiba... -
22
Blueprint XAS is a Matlab-based suite designed for the processing and analysis of near-edge x-ray absorption spectroscopy (XAS) data. The suite is designed primarily to assist users in exploring reasonable fit solutions while minimizing user bias.
-
23
MScDB
A Mass Spectrometry Centric Protein Sequence Database for Proteomics
... theoretical and empirical information from large-scale proteomic data to generate a mass spectrometry centric protein sequence database (MScDB). The core modules of MScDB are an in-silico proteolytic digest and a peptide centric clustering algorithm that groups protein sequences that are indistinguishable by mass spectrometry. -
24
GRAMPC
A gradient-based augmented Lagrangian framework for embedded NMPC
GRAMPC is a nonlinear MPC framework that is suitable for dynamical systems with sampling times in the (sub)millisecond range and that allows for an efficient implementation on embedded hardware. The algorithm is based on an augmented Lagrangian formulation with a tailored gradient method for the inner minimization problem. GRAMPC is implemented in plain C with an additional interface to C++ and MATLAB/Simulink. The basic structure and usage of GRAMPC are described in the documentation... -
25
Stoner-Wohlfarth hysteresis
Hysteresis of ellipsoidal single domain ferromagnetic particle.
Magnetization process of a single domain ellipsoidal particle: SW_particle. Magnetization of isotropic bulk material composed of 100 particles: SW_bulk. The details of the algorithm are described in the paper: 1. Zsolt Szabó, Amália Iványi, Computer-aided simulation of Stoner–Wohlfarth model, Journal of Magnetism and Magnetic Materials, Volumes 215–216, 2, June 2000, Pages 33-36. 2. Zsolt Szabó, Amália Iványi, Preisach Type Bulk Vector Hysteresis Model from Generalized...
