Abstract
In this paper we show that diversity-driven widening, the parallel exploration of the model space with focus on developing diverse models, can improve hierarchical agglomerative clustering. Depending on the selected linkage method, the model that is found through the widened search achieves a better silhouette coefficient than its sequentially built counterpart.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akbar, Z., Ivanova, V.N., Berthold, M.R.: Parallel data mining revisited. better, not faster. In: Proceedings of the 11th International Symposium on Intelligent Data Analysis, pp. 23–34 (2012)
Caruana, R., Elhawary, M., Nguyen, N., Smith, C.: Meta clustering. In: 2006 Sixth International Conference on Data Mining, ICDM 2006, pp. 107–118. IEEE (2006)
Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. PAMI 1(2), 224–227 (1979)
Day, W.H.E.: Optimal algorithms for comparing trees with labeled leaves. J. Classif. 2(1), 7–28 (1985)
Graf, H.P., Cosatto, E., Bottou, L., Dourdanovic, I., Vapnik, V.: Parallel support vector machines: the cascade SVM. In: Advances in Neural Information Processing Systems, pp. 521–528 (2004)
Hastie, T., Tibshirani, R., Friedman, J., Hastie, T., Friedman, J., Tibshirani, R.: The Elements of Statistical Learning, vol. 2. Springer, New York (2009)
Ivanova, V.N., Berthold, M.R.: Diversity-driven widening. In: Tucker, A., Höppner, F., Siebes, A., Swift, S. (eds.) IDA 2013. LNCS, vol. 8207, pp. 223–236. Springer, Heidelberg (2013)
Kaufman, L., Rousseeuw, P.: Clustering by means of medoids. Reports of the Faculty of Mathematics and Informatics, Faculty of Mathematics and Informatics (1987)
Kruskal, J.B., Wish, M.: Multidimensional Scaling, vol. 11. Sage, Beverly Hills (1978)
Lichman, M.: UCI machine learning repository (2013)
Lozano, J.A., Larranaga, P.: Applying genetic algorithms to search for the best hierarchical clustering of a dataset. Pattern Recogn. Lett. 20(9), 911–918 (1999)
Manning, C.D., Raghavan, P., Schütze, H.: Introduction to Information Retrieval, vol. 1. Cambridge university press, Cambridge (2008)
Meinl, T.: Maximum-score diversity selection. Ph.D. thesis, University of Konstanz, July 2010
Olson, C.F.: Parallel algorithms for hierarchical clustering. Parallel Comput. 21(8), 1313–1325 (1995)
Robinson, D.F., Foulds, L.R.: Comparison of phylogenetic trees. Math. Biosci. 53(12), 131–147 (1981)
Rousseeuw, P.J.: Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53–65 (1987)
Sampson, O., Berthold, M.R.: Widened KRIMP: better performance through diverse parallelism. In: Blockeel, H., van Leeuwen, M., Vinciotti, V. (eds.) IDA 2014. LNCS, vol. 8819, pp. 276–285. Springer, Heidelberg (2014)
Srivastava, A., Han, E.-H., Kumar, V., Singh, V.: Parallel formulations of decision-tree classification algorithms. In: Guo, Y., Grossman, R. (eds.) High Performance Data Mining, pp. 237–261. Springer, US (2002)
Sundararajan, N., Saratchandran, P.: Parallel Architectures for Artificial Neural Networks: Paradigms and Implementations, 1st edn. IEEE Computer Society Press, Los Alamitos (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Fillbrunn, A., Berthold, M.R. (2015). Diversity-Driven Widening of Hierarchical Agglomerative Clustering. In: Fromont, E., De Bie, T., van Leeuwen, M. (eds) Advances in Intelligent Data Analysis XIV. IDA 2015. Lecture Notes in Computer Science(), vol 9385. Springer, Cham. https://doi.org/10.1007/978-3-319-24465-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-24465-5_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-24464-8
Online ISBN: 978-3-319-24465-5
eBook Packages: Computer ScienceComputer Science (R0)