CLAM: Clustering Large Applications Using Metaheuristics

CLAM: Clustering Large Applications Using Metaheuristics

0.00 Avg rating0 Votes
Article ID: iaor20112337
Volume: 10
Issue: 1
Start Page Number: 57
End Page Number: 78
Publication Date: Mar 2011
Journal: Journal of Mathematical Modelling and Algorithms
Authors: ,
Keywords: computational analysis
Abstract:

Clustering remains one of the most difficult challenges in data mining. This paper proposes a new algorithm, CLAM, using a hybrid metaheuristic between VNS and Tabu Search to solve the problem of k‐medoid clustering. The new technique is compared to the well‐known CLARANS. Experimental results show that, given the same computation times, CLAM is more effective.

Reviews

Required fields are marked *. Your email address will not be published.