Publication

INFORMATION THEORETIC CLUSTERING FOR UNSUPERVISED DOMAIN-ADAPTATION

Publications associées (43)

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

Robust audio segmentation

Jitendra Ajmera

Audio segmentation, in general, is the task of segmenting a continuous audio stream in terms of acoustically homogenous regions, where the rule of homogeneity depends on the task. This thesis aims at developing and investigating efficient, robust and unsup ...

EPFL2005

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

Robust Audio Segmentation

Hervé Bourlard, Jitendra Ajmera

IDIAP2004

Robust Audio Segmentation

Hervé Bourlard, Jitendra Ajmera

École Polytechnique Fédérale de Lausanne2004

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

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

On Optimal Update Policies and Cluster Sizes for 2-Tier Distributed Systems

Anwitaman Datta, Prasenjit Dey

We try to analyze a generic model for 2-tier distributed systems, exploring the possibility of optimal cluster sizes from an information management perspective, such that the overall cost for updating and searching information may be minimized by adopting ...

2003

Algorithms for Video Structuring

Daniel Gatica-Perez, Jean-Marc Odobez

Video structuring aims at automatically finding structure in a video sequence. Occupying a key-position within video analysis, it is a fundamental step for quality indexing and browsing. As a low level video analysis, video structuring can be seen as a ser ...

IDIAP2002

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