CLAM: Clustering Large Applications Using Metaheuristics

Authors:
Quynh Nguyen;V. J. Rayward-Smith
Affiliations:
School of Computing Sciences, University of East Anglia, Norwich, UK NR4 7TJ;School of Computing Sciences, University of East Anglia, Norwich, UK NR4 7TJ
Venue:
Journal of Mathematical Modelling and Algorithms
Year:
2011

Citing 8
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Modern heuristic techniques for combinatorial problems

Modern heuristic techniques for combinatorial problems
Variable neighborhood search

Computers and Operations Research
Tabu Search

Tabu Search
CLARANS: A Method for Clustering Objects for Spatial Data Mining

IEEE Transactions on Knowledge and Data Engineering
Efficient and Effective Clustering Methods for Spatial Data Mining

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Metaheuristics in combinatorial optimization: Overview and conceptual comparison

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

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.