• [email protected]
  • +971 507 888 742
Submit Manuscript
SciAlert
  • Home
  • Journals
  • Information
    • For Authors
    • For Referees
    • For Librarian
    • For Societies
  • Contact
  1. Journal of Applied Sciences
  2. Vol 11 (19), 2011
  3. 3447-3453
  • Online First
  • Current Issue
  • Previous Issues
  • More Information
    Aims and Scope Editorial Board Guide to Authors Article Processing Charges
    Submit a Manuscript

Journal of Applied Sciences

Year: 2011 | Volume: 11 | Issue: 19 | Page No.: 3447-3453
DOI: 10.3923/jas.2011.3447.3453

Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Article Trend



Total views 442

Search


Authors


Adnan Kharrousheh

Country: Malaysia

Salwani Abdullah

Country: Malaysia

Mohd Zakree Ahmad Nazri

Country: Malaysia

Keywords


  • Clustering
  • modified tabu search
  • K-means
  • double tabu list
Short Communication

A Modified Tabu Search Approach for the Clustering Problem

Adnan Kharrousheh, Salwani Abdullah and Mohd Zakree Ahmad Nazri
Clustering is a data mining technique used to classify a number of objects into k clusters without advance knowledge such that the distance between objects within a same cluster and its center is minimised. The modelling for such problems is quite complex and searching for optimal solution usually impractical in term of computation times. Therefore, metaheuristic methods are used to find an acceptable solution within reasonable computational time. The problem addressed here provides the motivation for this work to develop a metaheuristic method to solve clustering problems. Most of previous techniques are based on K-means algorithm. However, K-means algorithm is highly depends on the initial state and very fast to get trap in local optimal solution. This work presents a modified tabu search approach to solve clustering problems that consists of two phases i.e., a constructive phase to generate an initial solution using K-means algorithm and an improvement phase, where a modified tabu search is employed with an aim to enhance the solution quality obtained from the first phase. In this study, a double tabu lists is introduced where the first tabu list is used to keep the neighbourhood structures and the second tabu list is used to keep the moves that are involved in that particular neighbourhood structure. The performance of the proposed algorithm is tested on five well-known datasets. Preliminary computational experiments are encouraging and compare positively with both the K-means and a standard tabu search alone.
PDF Fulltext XML References Citation

How to cite this article

Adnan Kharrousheh, Salwani Abdullah and Mohd Zakree Ahmad Nazri, 2011. A Modified Tabu Search Approach for the Clustering Problem. Journal of Applied Sciences, 11: 3447-3453.

DOI: 10.3923/jas.2011.3447.3453

URL: https://scialert.net/abstract/?doi=jas.2011.3447.3453

Related Articles

Constrained Association Rules for Medical Data
Automatic Tissue Segmentation in Medical Images using Differential Evolution
Partitioning an Image Database by K_means Algorithm
Imitating K-Means to Enhance Data Selection
Segmentation of Satellite Imagery using RBF Neural Network and Genetic Algorithm
A Hybrid Evolutionary Algorithm Based on ACO and SA for Cluster Analysis
AntClust: An Ant Algorithm for Swarm-Based Image Clustering

Leave a Comment


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

Useful Links

  • Journals
  • For Authors
  • For Referees
  • For Librarian
  • For Socities

Contact Us

Office Number 1128,
Tamani Arts Building,
Business Bay,
Deira, Dubai, UAE

Phone: +971 507 888 742
Email: [email protected]

About Science Alert

Science Alert is a technology platform and service provider for scholarly publishers, helping them to publish and distribute their content online. We provide a range of services, including hosting, design, and digital marketing, as well as analytics and other tools to help publishers understand their audience and optimize their content. Science Alert works with a wide variety of publishers, including academic societies, universities, and commercial publishers.

Follow Us
© Copyright Science Alert. All Rights Reserved