Heuristic Approaches for the Quartet Method of Hierarchical Clustering

	This Article
	Subscribers, please Login Purchase article: $19 PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Sergio Consoli Articles by Kenneth Darby-Dowman Articles by Gijs Geleijnse Articles by Jan Korst Articles by Steffen Pauws

PrePrint

ISSN: 1041-4347

	ASCII Text	x
	Sergio Consoli, Kenneth Darby-Dowman, Gijs Geleijnse, Jan Korst, Steffen Pauws, "Heuristic Approaches for the Quartet Method of Hierarchical Clustering," IEEE Transactions on Knowledge and Data Engineering, vol. 99, no. 1, pp. , , 5555.

	BibTex	x
	@article{ 10.1109/TKDE.2009.188, author = {Sergio Consoli and Kenneth Darby-Dowman and Gijs Geleijnse and Jan Korst and Steffen Pauws}, title = {Heuristic Approaches for the Quartet Method of Hierarchical Clustering}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {99}, number = {1}, issn = {1041-4347}, year = {5555}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.188}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - Heuristic Approaches for the Quartet Method of Hierarchical Clustering IS - 1 SN - 1041-4347 SP EP EPD - A1 - Sergio Consoli, A1 - Kenneth Darby-Dowman, A1 - Gijs Geleijnse, A1 - Jan Korst, A1 - Steffen Pauws, PY - 5555 KW - Clustering KW - heuristic methods KW - optimization KW - graphs and networks VL - 99 JA - IEEE Transactions on Knowledge and Data Engineering ER -

Sergio Consoli, Brunel University, Uxbridge

Kenneth Darby-Dowman, Brunel University, Uxbridge, Middlesex

Gijs Geleijnse, Philips Research Eindhoven, Eindhoven

Jan Korst, Philips Research Eindhoven, Eindhoven

Steffen Pauws, Philips Research Eindhoven, Eindhoven

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.188

Given a set of objects and their pairwise distances, we wish to determine a visual representation of the data. We use the quartet paradigm to compute a hierarchy of clusters of the objects. The method is based on an NP-hard graph optimization problem called the Minimum Quartet Tree Cost problem. This paper presents and compares several heuristic approaches to approximate the optimal hierarchy. The performance of the algorithms is tested through extensive computational experiments and it is shown that the Reduced Variable Neighbourhood Search heuristic is the most effective approach to the problem, obtaining high quality solutions in short computational running times.

Index Terms:

Clustering, heuristic methods, optimization, graphs and networks

Citation:

Sergio Consoli, Kenneth Darby-Dowman, Gijs Geleijnse, Jan Korst, Steffen Pauws, "Heuristic Approaches for the Quartet Method of Hierarchical Clustering," IEEE Transactions on Knowledge and Data Engineering, 05 Oct. 2009. IEEE computer Society Digital Library. IEEE Computer Society, <http://doi.ieeecomputersociety.org/10.1109/TKDE.2009.188>

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.