An evolutionary technique based on K-means algorithm for optimal clustering in \({\mathbb R}^{N}\)
From MaRDI portal
Publication:1857031
DOI10.1016/S0020-0255(02)00208-6zbMath1033.68595WikidataQ61941608 ScholiaQ61941608MaRDI QIDQ1857031
Sanghamitra Bandyopadhyay, Ujjwal Maulik
Publication date: 11 February 2003
Published in: Information Sciences (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (15)
A dynamic clustering based differential evolution algorithm for global optimization ⋮ Investigation of a new GRASP-based clustering algorithm applied to biological data ⋮ A multiple pheromone table based ant colony optimization for clustering ⋮ A new distance with derivative information for functional \(k\)-means clustering algorithm ⋮ Particle swarm optimization with age-group topology for multimodal functions and data clustering ⋮ Evolutionary fuzzy clustering of relational data ⋮ Automatic clustering using genetic algorithms ⋮ Improving fuzzy c-means clustering via quantum-enhanced weighted superposition attraction algorithm ⋮ A clustering method to identify representative financial ratios ⋮ Differential evolution and particle swarm optimisation in partitional clustering ⋮ A robust dynamic niching genetic algorithm with niche migration for automatic clustering problem ⋮ Clustering stability-based evolutionary K-means ⋮ Clustering: a neural network approach ⋮ Basic co-occurrence latent semantic vector space model ⋮ A tabu search approach for the minimum sum-of-squares clustering problem
Cites Work
This page was built for publication: An evolutionary technique based on K-means algorithm for optimal clustering in \({\mathbb R}^{N}\)
