Learning Cluster Type and Dissimilarity Metric for Each Cluster Using a Set of Possible Cluster Types
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.
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 ...
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 ...
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 ...
In this paper we propose to use clustering methods for automatic counting of pedestrians in video sequences. As input, we consider the output of those detection/ tracking systems that overestimate the number of targets. Clustering techniques are applied to ...
The extension of the likelihood method of Süveges (Extremes, 2007) is presented. The extension allows for finding independent clusters of extreme events and determining the range of dependence on extremal levels, and estimate clustering characteristic of t ...
Precise short-term prediction of traffic parameters such as flow and travel-time is a necessary component for many ITS applications. This work describes the research on a novel, fast, and robust algorithm which is based on a partitioning cluster analysis. ...
Clustering similar documents is a difficult task for text data mining. Difficulties stem especially from the way documents are translated into numerical vectors. In this chapter, we will present a method that uses Self Organizing Map (SOM) to cluster medic ...
The amount of multimedia content available online constantly increases, and this leads to problems for users who search for content or similar communities. Users in Flickr often self-organize in user communities through Flickr Groups. These groups are part ...
The amount of multimedia content available online constantly increases, and this leads to problems for users who search for content or similar communities. Users in Flickr often self-organize in user communities through Flickr Groups. These groups are pa ...
Trajectory data is of crucial importance for a vast range of applications involving analysis of moving objects behavior. Unfortunately, the extraction of relevant knowledge from trajectory data is hindered by the lack of semantics and the presence of error ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008
