The use of mutual information as a similarity measure in agglomerative hierarchical cluster-ing (AHC) raises an important issue: some correction needs to be applied for the dimension-ality of variables. In this work, we formulate the decision of merging dependent multivariate normal variables in an AHC procedure as a Bayesian model comparison. We found that the Bayesian formulation naturally shrinks the empirical covariance matrix towards a matrix set a priori (e.g., the identity), provides an automated stopping rule, and corrects for dimension-ality using a term that scales up the measure as a function of the dimensionality of the vari-ables. Also, the resulting log Bayes factor is asymptotically proportional to the plug-in estimate of mut...
Most clustering algorithms assume that all dimensions of the data can be described by a single struc...
<p>Clustering methods are designed to separate heterogeneous data into groups of similar objects suc...
An important task in data mining is to identify natural clusters in data. Relational clustering [1],...
<div><p>The use of mutual information as a similarity measure in agglomerative hierarchical clusteri...
International audienceThe use of mutual information as a similarity measure in agglomerative hierarc...
International audienceThe use of mutual information as a similarity measure in agglomerative hierarc...
The use of mutual information as a similarity measure in agglomerative hierarchical clustering (AHC)...
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal ...
This supplemental article provides additional details and validation for Bayesian consensus clusteri...
Mutual information is a very popular measure for comparing clusterings. Previous work has shown that...
Hierarchical models are extensively used in pharmacokinetics and longitudinal studies. When the esti...
This article establishes a general formulation for Bayesian model-based clustering, in which subset ...
Abstract We introduce a new Bayesian model for hierarchical clustering based on a priorover trees ca...
We present a conceptually simple method for hierarchical clustering of data called mutual informatio...
Clustering by maximizing the dependency between (margin) groupings or partitionings of co-occurring...
Most clustering algorithms assume that all dimensions of the data can be described by a single struc...
<p>Clustering methods are designed to separate heterogeneous data into groups of similar objects suc...
An important task in data mining is to identify natural clusters in data. Relational clustering [1],...
<div><p>The use of mutual information as a similarity measure in agglomerative hierarchical clusteri...
International audienceThe use of mutual information as a similarity measure in agglomerative hierarc...
International audienceThe use of mutual information as a similarity measure in agglomerative hierarc...
The use of mutual information as a similarity measure in agglomerative hierarchical clustering (AHC)...
We present a novel algorithm for agglomerative hierarchical clustering based on evaluating marginal ...
This supplemental article provides additional details and validation for Bayesian consensus clusteri...
Mutual information is a very popular measure for comparing clusterings. Previous work has shown that...
Hierarchical models are extensively used in pharmacokinetics and longitudinal studies. When the esti...
This article establishes a general formulation for Bayesian model-based clustering, in which subset ...
Abstract We introduce a new Bayesian model for hierarchical clustering based on a priorover trees ca...
We present a conceptually simple method for hierarchical clustering of data called mutual informatio...
Clustering by maximizing the dependency between (margin) groupings or partitionings of co-occurring...
Most clustering algorithms assume that all dimensions of the data can be described by a single struc...
<p>Clustering methods are designed to separate heterogeneous data into groups of similar objects suc...
An important task in data mining is to identify natural clusters in data. Relational clustering [1],...