Investigation of a new GRASP-based clustering algorithm applied to biological data
From MaRDI portal
Publication:2379645
DOI10.1016/j.cor.2009.02.014zbMath1183.68494OpenAlexW2014381197WikidataQ57739753 ScholiaQ57739753MaRDI QIDQ2379645
Franklina Maria Bragion Toledo, André C. P. L. F. de Carvalho, Mariá C. V. Nascimento
Publication date: 19 March 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.02.014
Related Items (5)
Community detection by modularity maximization using GRASP with path relinking ⋮ Clustering of high throughput gene expression data ⋮ A graph clustering algorithm based on a clustering coefficient for weighted graphs ⋮ A biased random-key genetic algorithm for data clustering ⋮ A novel mixed integer linear programming model for clustering relational networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Cluster analysis and mathematical programming
- Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
- Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data
- An evolutionary technique based on K-means algorithm for optimal clustering in \({\mathbb R}^{N}\)
- A scatter search approach for the minimum sum-of-squares clustering problem
- A scatter search heuristic for the capacitated clustering problem
- Finding Groups in Data
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Integer Programming and the Theory of Grouping
- Cluster Analysis and Mathematical Programming
- J-MEANS: A new local search heuristic for minimum sum of squares clustering
This page was built for publication: Investigation of a new GRASP-based clustering algorithm applied to biological data
