Publications associées (44)

Clustering citation histories in the Physical Review

Giovanni Colavizza, Massimo Franceschet

We investigate publications through their citation histories – the history events are the citations given to the article by younger publications and the time of the event is the date of publication of the citing article. We propose a methodology, based on ...
Elsevier Science Bv2016

Nmf-Based Blind Source Separation Using A Linear Predictive Coding Error Clustering Criterion

Xin Guo

Non-negative matrix factorization (NMF) based sound source separation involves two phases: First, the signal spectrum is decomposed into components which, in a second step, are clustered in order to obtain estimates of the source signal spectra. The major ...
Ieee2015

Cluster Validity Measure and Merging System for Hierarchical Clustering considering Outliers

Jean-Philippe Thiran, Devis Tuia, Volker Gass, Frank Grégoire Jean de Morsier, Maurice Borgeaud

Clustering algorithms have evolved to handle more and more complex structures. However, measures allowing to qualify the quality of such partitions are rare and only specic to certain algorithms. In this work, we propose a new cluster validity measure (CVM ...
Elsevier2015

Experimental Aeroelastic Investigation of Vibrating Turbine Blade Clusters

Peter Ott, Achim Zanker

The presented work consists of the presentation and discussion of unsteady experimental results of controlled vibration measurements for two single-blade and two cluster test cases subjected to the same subsonic flow conditions. The experiments were perfor ...
Lappeenranta University of Technology2013

Discovering places of interest in everyday life from smartphone 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. A place-of-interest is defined as a location where ...
Springer2013

Total activation: fMRI deconvolution through spatio-temporal regularization

Dimitri Nestor Alice Van De Ville, Fikret Isik Karahanoglu, François Lazeyras

Confirmatory approaches to fMRI data analysis look for evidence for the presence of pre-defined regressors modeling contributions to the voxel time series, including the BOLD response following neuronal activation. As more complicated questions arise about ...
Elsevier2013

On the Relation of Slow Feature Analysis and Laplacian Eigenmaps

The past decade has seen a rise of interest in Laplacian eigenmaps (LEMs) for nonlinear dimensionality reduction. LEMs have been used in spectral clustering, in semisupervised learning, and for providing efficient state representations for reinforcement le ...
Massachusetts Institute of Technology Press2011

Robust and Hierarchical Stop Discovery in Sparse and Diverse Trajectories

Quoc Viet Hung Nguyen, Zhixian Yan, Le Hung Tran, Ngoc Hoan Do

The advance of GPS tracking technique brings a large amount of trajectory data. To better understand such mobility data, semantic models like “stop/move” (or inferring “activity”, “transportation mode”) recently become a hot topic for trajectory data analy ...
2011

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

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 ...
2010

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.