Publication

Dynamic clustering and propagation of congestion in heterogeneously congested urban traffic networks

Publications associées (113)

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

Kernelized Infomax Clustering

We propose a simple information-theoretic clustering approach based on maximizing the mutual information

I(\sfx,y)

between the unknown cluster labels

y

and the training patterns

\sfx

with respect to parameters of specifically constrained encoding dis ...

IDIAP2005

Discovering Coherent Biclusters from Gene Expression Data Using Zero-Suppressed Binary Decision Diagrams

Giovanni De Micheli, Luca Benini

The biclustering method can be a very useful analysis tool when some genes have multiple functions and experimental conditions are diverse in gene expression measurement. This is because the biclustering approach, in contrast to the conventional clustering ...

2005

Analysis of a Synonymy Network

Paolo De Los Rios, Jean-Cédric Chappelier, David Gfeller

The purpose of this report is to present the study of a linguistic network based on the relation of synonymy. The network has been extracted from a dictionary of synonyms in French. Due to errors and ambiguities in the data, the synonyms are not always gro ...

2004

Protocol overheads in networks

Prasenjit Dey

To increase network capacity, it may not be sufficient to just increase the capacity of the networks. It may be necessary to reduce the network overhead bits, to leave more room for the data bits, to increase the network capacity. As network functions beco ...

EPFL2004

Making Retrieval Faster Through Document Clustering

David Grangier, Alessandro Vinciarelli

This work addresses the problem of reducing the time between query submission and results output in a retrieval system. The goal is achieved by considering only a database fraction as small as possible during the retrieval process. Our approach is based on ...

IDIAP2004

Noisy Text Clustering

David Grangier, Alessandro Vinciarelli

This work presents document clustering experiments performed over noisy texts (i.e. text that have been extracted through an automatic process like speech or character recognition). The effect of recognition errors on different clustering techniques is mea ...

IDIAP2004

Effect of Recognition Errors on Text Clustering

David Grangier, Alessandro Vinciarelli

This paper presents clustering experiments performed over noisy texts (i.e. texts that have been extracted through an automatic process like character or speech recognition). The effect of recognition errors is investigated by comparing clustering results ...

IDIAP2004

Finding Structure in Home Videos by Probabilistic Hierarchical Clustering

Daniel Gatica-Perez

Accessing, organizing, and manipulating home videos present technical challenges due to their unrestricted content and lack of storyline. In this paper, we present a methodology to discover cluster structure in home videos, which uses video shots as the un ...

2003

A clustering technique for the identification of piecewise affine and hybrid systems

Giancarlo Ferrari Trecate

We propose a new technique for the identification of discrete-time hybrid systems in the Piece-Wise Affine (PWA) form. This problem can be formulated as the reconstruction of a possibly discontinuous PWA map with a multi-dimensional domain. In order to ach ...

2003

Single-linkage clustering for optimal classification in piecewise affine regression

Giancarlo Ferrari Trecate

When performing regression with piecewise affine maps, the most challenging task is to classify the data points, i.e. to correctly attribute a data point to the affine submodel that most likely generated it. In this paper, we consider a regression scheme s ...

2003

Kernelized Infomax Clustering

We propose a simple information-theoretic clustering approach based on maximizing the mutual information

I(\sfx,y)

between the unknown cluster labels

y

and the training patterns

\sfx

with respect to parameters of specifically constrained encoding dis ...

IDIAP2005