Concept

Single-linkage clustering

Publications associées (183)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

An Adaptive Initialization Method for Speaker Diarization based on Prosodic Features

David Imseng

The following article presents a novel, adaptive initialization scheme that can be applied to most state-ofthe-art Speaker Diarization algorithms, i.e. algorithms that use agglomerative hierarchical clustering with Bayesian Information Criterion (BIC) and ...

Idiap2010

Tuning-Robust Initialization Methods for Speaker Diarization

David Imseng

This paper investigates a typical Speaker Diarization system regarding its robustness against initialization parameter variation and presents a method to reduce manual tuning of these values significantly. The behavior of an agglomerative hierarchical clus ...

Idiap2010

Tuning-Robust Initialization Methods for Speaker Diarization

David Imseng

This paper investigates a typical speaker diarization system regarding its robustness against initialization parameter variation and presents a method to reduce manual tuning of these values significantly. The behavior of an agglomerative hierarchical clus ...

2010

Business interest in Swiss climate policy

Alexandra Quandt

Business interest associations play an important role in the decision making process of climate policy. In 2009, the revision of the Swiss CO2 law for designing post-2012 climate policy is at stake. This paper analyzes the positions and arguments of the Sw ...

NCCR Climate2010

Discovering Human Places of Interest from Multimodal Mobile Phone Data

Daniel Gatica-Perez

In this paper, a new framework to discover places-of-interest from multimodal mobile phone data is presented. Mobile phones have been used as sensors to obtain location information from usersâ€™ real lives. Two levels of clustering are used to obtain place ...

2010

Double Sparsity: Towards Blind Estimation of Multiple Channels

Rémi Gribonval

We propose a framework for blind multiple filter estimation from convolutive mixtures, exploiting the time-domain sparsity of the mixing filters and the disjointness of the sources in the time-frequency domain. The proposed framework includes two steps: (a ...

Springer-Verlag's2010

Fault-Tolerant Facility Location: a randomized dependent LP-rounding algorithm

Abstract We give a new randomized LP-rounding 1.725-approximation algorithm for the metric Fault- Tolerant Uncapacitated Facility Location problem. This improves on the previously best known 2.076-approximation algorithmof Swamy & Shmoys. To the best of ou ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Fast high-dimensional Bayesian classification and clustering

Vahid Partovi Nia

We introduce a fast approach to classification and clustering applicable to high-dimensional continuous data, based on Bayesian mixture models for which explicit computations are available. This permits us to treat classification and clustering in a single ...

EPFL2009

Appearance-based Keypoint Clustering

Pascal Fua, Sabine Süsstrunk, Vincent Lepetit, Francisco Estrada

We present an algorithm for clustering sets of detected interest points into groups that correspond to visually distinct structure. Through the use of a suitable colour and texture representation, our clustering method is able to identify keypoints that be ...

2009

A Clustering Method Based on Soft Learning of Model (Prototype) and Dissimilarity Metrics

Arash Arami

Many clustering methods are designed for especial cluster types or have good performance dealing with particular size and shape of clusters. The main problem in this connection is how to define a similarity (or dissimilarity) criterion to make an algorithm ...

Springer-Verlag2009