...
Learning  Clustering  Data Clustering
Data Clustering is an unsupervised learning algorithm that creates a new variable, [Factor_i]. The states of this variable represent the induced clusters.
...
From a technical perspective, the segment segments should be:
 Homogeneous/pure;
 Have clear differences with the other segments;
 Stable.
...
 Expectation: the network is used with its current distributions for computing the posterior probabilities of [Factor_i], for the entire set of observations described in the data set; These probabilities are used for soft imputing [Factor_i];
 Maximization: based on this imputationthese imputations, the distributions of the network are updated via MaximumLikelihood. Then, the The algorithm goes back to Expectation, until no significant changes occur to the distributions.
...
This new feature has been added for improving the stability of the induced solution (3^{rd} technical quality). It consists in of creating a data set dataset made of a subset of the Factors that have been created while searching for the best segmentation, and then using Data Clustering on these new variables. The final solution is thus a summary of the best solutions that have been found (4^{th} purpose).
Info 

The five Manifest variables (bottom of the graph) are used in the data set dataset for describing the observations. The Factor variables [Factor_1], [Factor_2], and [Factor_3] have been induced with Data Clustering. They arethen imputed to create a new data setdataset. In this example, three Factor variables are used for creating the final solution [Factor_4]. 
Example 

Let's use a data set dataset that contains house sale prices for King County, which includes the city of Seattle, Washington. It includes describes homes sold between May 2014 and May 2015. More preciselyspecifically, we have extracted the 94 houses that are more than 100 years old, that have been renovated, and come with a basement. For the sake of simplicity, we are just describing the houses here with the 5 Manifest variables below, discretized into 2 bins.
The wizard below describes shows the setting settings used for segmenting these houses: After 100 steps, the best solution consists in segmenting the houses into 4 groups . The mapping below is the best solution. Below, the mapping (Analysis  Report  Target  Relationship with Target Node  Mapping) shows the created states/segments:
This radar chart (Analysis  Report  Target  Posterior Mean Analysis  Radar Chart) allows interpreting the generated segments. As we can see, they are easily distinguishable (2^{nd} technical quality). This Thus, the solution with 4 segments thus satisfies the first two technical qualities listed above. However, what about the 3^{rd }one, the stability? Below are the scores of the 10 best solutions that have been generated while learning: Even though the best solution is made of 4 segments, this is the only solution with 4 clusters, all the other ones having pretty much have nearly the same score, but with 3 clusters. Thus, we can assume that a solution with 3 clusters would be more stable. Using MetaClustering on the 10 best solutions (10%) indeed generates a final solution made of 3 clusters. This mapping juxtaposes the mapping of the initial solution with 4 segments (lower opacity) and of the one corresponding to the metaclustering solution. The relationships between the final and initial segments are as follows:

...
As stated in the Context, Data Clustering with Bayesian network networks is typically done with ExpectationMaximization (EM) on a Naive structure. Thus, this it is based on the hypothesis that the Manifests variables Manifest variables are conditionally independent of each others given other given [Factor_i]. Therefore, the Naive structure is well suited for finding observations that look the same (1^{st} purpose), but not so good for finding observations that behave similarly (2^{nd} purpose). The behavior should be represented with by direct relationships between the Manifests.
Our new Multinet clustering is an EM^{2} algorithm based both on a Naive structure (Look) and on a set of Maximum Weight Spanning Trees (MWST) (Behavior). Once the distributions of the Naive are randomly set, the algorithm works as follows:
 Expectation_Naive: the Naive network is used with its current distributions for computing the posterior probabilities of [Factor_i], for the entire set of observations described in the data set; These probabilities are used for hardimputing [Factor_i], i.e. choosing the state with the highest posterior probability;
 Maximization_MWST: [Factor_i] is used as a breakout variable. A An MWST is learned on each subset of data.
 Expectation_MWST: the joint probabilities of the observations are computed with each MWST and used for updating the imputation of [Factor_i].
 Maximization_Naive: based on this updated imputation, the distributions of the Naive network are updated via MaximumLikelihood. Then, the algorithm goes back to Expectation_Naive, until no significant changes occur to the distributions.
...
Info 

Setting a weight of 0 for Behavior defines a Data Clustering quite similar to the usual one, but based on hard imputation instead of soft imputation. 
Example 

Let's use the same data set that describes houses in Seattle. The wizard below describes show the setting settings we used for segmenting these the houses: After 100 steps, the best solution consists in segmenting the houses into 3 three groups is the best solution. The final network is a Naive Augmented Network, with a direct link between 2 two Manifests anifest variables (that are thus , which are, therefore, not independent given the segmentation, i.e. the Behavior part). Note that this dependency is valid for C3 only (conclusion drawn after some , which can be seen after performing inference with the network). The radar chart allows analyzing the Look of the segments. 
New Feature: Heterogeneity Weight
This new option allows selecting the segmentation that maximizes The assumption that the data is homogeneous, given all the Manifest Variables, can sometimes be unrealistic. There may be significant heterogeneity in the data across unobserved groups, and it can bias the machinelearned Bayesian networks. This phenomenon is known as Unobserved Heterogeneity, i.e. an unobserved variable in the dataset.
Data Clustering represents a solution for searching for such hidden unobserved groups (3^{rd} purpose). However, whereas the default scoring function in Data Clustering is based on the entropy of the data, finding heterogenous groups requires modifying the scoring function.
We thus defined a Heterogeneity Index :
,
with
where:
 is the induced Factor,
 are the states of the Factor, i.e. the segments used to split the data,
 is the marginal probability of state , i.e. the relative size of the segment,
 is the set of Manifest variables,
 is the entire data set,
 is the subset of the data that corresponds to the segment
 is the Mutual Information between the Manifest variable and the Target node computed on the data set .
The Heterogeneity Weight allows setting a weight of the Heterogeneity Index in the score, which will, therefore, bias the selection of the solutions toward segmentations that maximize the Mutual Information of the Manifest variables with the Target Node.
Example 

Let's use the entire data set that describes houses in Seattle, with this subset of Manifest variables:
After setting Price (K$) as a Target Node and selecting all the other variables, we use the following settings for Data Clustering: This returns a solution with 2 segments, generating an a Heterogeneity Index of 60%. This indicates thus , therefore, that using [Factor_i] as a breakout variable would allow increasing by 60% increase the sum of the Mutual Informations of the Manifest variables with the Target Node by 60 %. The MultiQuadrant below highlights the improvement of the Mutual Information. The points correspond to the Mutual Informations on the entire data set, and the vertical scales shows show the variations of the Mutual Informations by splitting the data based on the values of [Factor_i]. 
Info 

The Heterogeneity Index is computed on the Manifest variables that are used during the segmentation only. In order to take into account other variables in the computation of the index, these variables have to be included in the segmentation, with a weight of 0 for preventing them to influence the segmentation. 
New Feature: Random Weights
By default, the weight associated with a variable is set to 1. Whereas a weight of 0 renders the variable purely illustrative, a weight of 2 is equivalent to duplicating the variable in the dataset. The option Mutual Information Weight, introduced in version 5.1, allows weighting the variable by taking into account its Mutual Information with the Target node.
As of version 7.0, a new option, Random Weights, allows to modify the weight values randomly while trying the find the best segmentation. The amplitude of the randomness is inversely proportional to the current number of trials, therefore starting with the maximum level of randomness and ending with almost no weight modification. This option can be useful for escaping from local minima.