<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://repozitorij.uni-lj.si/IzpisGradiva.php?id=121038"><dc:title>Stability of Hierarchical Clustering</dc:title><dc:creator>Turanjanin,	Aleksandra	(Avtor)
	</dc:creator><dc:creator>Zupan,	Blaž	(Mentor)
	</dc:creator><dc:subject>hierarchical clustering</dc:subject><dc:subject>stability</dc:subject><dc:subject>dendrogram</dc:subject><dc:subject>unsupervised learning</dc:subject><dc:description>Hierarchical clustering is an unsupervised data mining technique that infers a set of nested, hierarchically organised clusters. Even slight permutations in the data can change the clustering structure. Ideally, we should only be interested in the stable part of the clustering hierarchy. It is thus essential to assess the stability of the nodes in the hierarchy. In this thesis, we review the approaches to determine the stability and statistical significance of the clusters. While all the reviewed methods use resampling, their results could be substantially different because of the details in the implementation and stability scoring. The approach called pvclust is recently most used in practical applications. In its R implementation, it suffers from low speed and visualisation of results. We have implemented pvclust in Python, yielding an implementation that is almost an order of magnitude faster than the version in R. Our implementation is currently the only opensource Python implementation of stability analysis of hierarchical clustering. To visualise the results and enable interactive explorative data analysis, we also incorporated our implementation in the Orange data mining toolbox.</dc:description><dc:date>2020</dc:date><dc:date>2020-09-29 10:40:01</dc:date><dc:type>Magistrsko delo/naloga</dc:type><dc:identifier>121038</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
