Essays about: "Hierarchy Clustering"
Showing result 1 - 5 of 13 essays containing the words Hierarchy Clustering.
-
1. Analysis of communication protocols used for wireless Sensor networks
University essay from Linnéuniversitetet/Institutionen för fysik och elektroteknik (IFE)Abstract : Wireless Sensor Networks (WSNs) have attracted growing interest from both realcustomers and the scientific community in the recent years due to their powerfulcapabilities and varied applications. Each wireless sensor node relays data to thebase station (BS) directly in the direct communication protocol. READ MORE
-
2. Model-Based versus Data-Driven Control Design for LEACH-based WSN
University essay from KTH/Maskinkonstruktion (Inst.)Abstract : In relation to the increasing interest in implementing smart cities, deployment of widespread wireless sensor networks (WSNs) has become a current hot topic. Among the application’s greatest challenges, there is still progress to be made concerning energy consumption and quality of service. READ MORE
-
3. Speaker Diarization System for Call-center data
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : To answer the question who spoke when, speaker diarization (SD) is a critical step for many speech applications in practice. The task of our project is building a MFCC-vector based speaker diarization system on top of a speaker verification system (SV), which is an existing Call-centers application to check the customer’s identity from a phone call. READ MORE
-
4. Hierarchical Clustering of Time Series using Gaussian Mixture Models and Variational Autoencoders
University essay from Lunds universitet/Matematisk statistikAbstract : This thesis proposes a hierarchical clustering algorithm for time series, comprised of a variational autoencoder to compress the series and a Gaussian mixture model to merge them into an appropriate cluster hierarchy. This approach is motivated by the autoencoders good results in dimensionality reduction tasks and by the likelihood framework given by the Gaussian mixture model. READ MORE
-
5. Multi-scale clustering in graphs using modularity
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : This thesis provides a new hierarchical clustering algorithm for graphs, named Paris, which can be interpreted through the modularity score and its resolution parameter. The algorithm is agglomerative and based on a simple distance between clusters induced by the probability of sampling node pairs. READ MORE