TABU-KM: A HYBRID CLUSTERING ALGORITHM BASED ON TABU SEARCH APPROACH

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

YAGHINI M.; GHAZANFARI N.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: International Journal of Industrial Engineering & Production Research Year:2010 | Volume:21 | Issue:2 Page(s): 71-79

Download Full-Text

View:

271

Download:

119

Cites:

Information Journal Paper

Title

TABU-KM: A HYBRID CLUSTERING ALGORITHM BASED ON TABU SEARCH APPROACH

Author(s)

YAGHINI M. | GHAZANFARI N. | Issue Writer Certificate

Keywords

CLUSTERING PROBLEM

HYBRID ALGORITHM

TABU SEARCH ALGORITHM

K-MEANS ALGORITHM

Abstract

The CLUSTERING PROBLEM under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the optimization property of tabu search and the local search capability of K-MEANS ALGORITHM together. The contribution of proposed algorithm is to produce tabu space for escaping from the trap of local optima and finding better solutions effectively. The Tabu-KM algorithm is tested on several simulated and standard datasets and its performance is compared with k-means, simulated annealing, tabu search, genetic algorithm, and ant colony optimization algorithms. The experimental results on simulated and standard test problems denote the robustness and efficiency of the algorithm and confirm that the proposed method is a suitable choice for solving data CLUSTERING PROBLEMs.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

YAGHINI, M., & GHAZANFARI, N.. (2010). TABU-KM: A HYBRID CLUSTERING ALGORITHM BASED ON TABU SEARCH APPROACH. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), 21(2), 71-79. SID. https://sid.ir/paper/556852/en

Vancouver: Copy

YAGHINI M., GHAZANFARI N.. TABU-KM: A HYBRID CLUSTERING ALGORITHM BASED ON TABU SEARCH APPROACH. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH)[Internet]. 2010;21(2):71-79. Available from: https://sid.ir/paper/556852/en

IEEE: Copy

M. YAGHINI, and N. GHAZANFARI, “TABU-KM: A HYBRID CLUSTERING ALGORITHM BASED ON TABU SEARCH APPROACH,” INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING AND PRODUCTION RESEARCH (IJIE) (ENGLISH), vol. 21, no. 2, pp. 71–79, 2010, [Online]. Available: https://sid.ir/paper/556852/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops