You may know about the MySQL Cluster, which is a complex architecture to achieve high availability and performance. One of the advantages of MySQL Cluster is that each node is a peer to the others, whereas in a normal replicating system you have a master
In this first of five articles, learn what it means for software to be highly available and how to install and set up heartbeat software from the High-Availability Linux project on a two-node system. You'll also learn how to configure the Apache Web serve
The MCL algorithm is short for the Markov Cluster Algorithm, a fast and scalable unsupervised cluster algorithm for graphs based on simulation of (stochastic) flow in graphs.
Anna Szymkowiak Have, Mark A. Girolami, Jan Larsen
Abstract: Methods for spectral clustering have been proposed
recently which rely on the eigenvalue decomposition of an affinity
matrix. In this work it is proposed that the affinity matrix
is created based on the elements of a non-parametric density
estimator. This matrix is then decomposed to obtain posterior
probabilities of class membership using an appropriate form of
nonnegative matrix factorization. The troublesome selection of
hyperparameters such as kernel width and number of clusters
can be obtained using standard cross-validation methods as is
demonstrated on a number of diverse data sets.
Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results
Ian Davidson1 and S.S. Ravi1
(1) Department of Computer Science, University at Albany - State University of New York, Albany, NY 12222,