Mixture modelling for cluster analysis

Cluster analysis via a finite mixture model approach is considered. With this approach to clustering, the data can be partitioned into a specified number of clusters g by first fitting a mixture model with g components. An outright clustering of the data is then obtained by assigning an observation to the component to which it has the highest estimated posterior probability of belonging; that is, the ith cluster consists of those observations assigned to the ith component (i = 1,..., g). The focus is on the use of mixtures of normal components for the cluster analysis of data that can be regarded as being continuous. But attention is also given to the case of mixed data, where the observations consist of both continuous and discrete variables.

A new algorithm for the detection of intercluster galaxy filaments using galaxy orientation alignments

We present a new algorithm for detecting intercluster galaxy filaments based upon the assumption that the orientations of constituent galaxies along such filaments are non-isotropic. We apply the algorithm to the 2dF Galaxy Redshift Survey catalogue and find that it readily detects many straight filaments between close cluster pairs. At large intercluster separations (> 15 h(-1) Mpc), we find that the detection efficiency falls quickly, as it also does with more complex filament morphologies. We explore the underlying assumptions and suggest that it is only in the case of close cluster pairs that we can expect galaxy orientations to be significantly correlated with filament direction.

Cluster analysis of the p53 genetic regulatory network: topology and biology

We describe a network module detection approach which combines a rapid and robust clustering algorithm with an objective measure of the coherence of the modules identified. The approach is applied to the network of genetic regulatory interactions surrounding the tumor suppressor gene p53. This algorithm identifies ten clusters in the p53 network, which are visually coherent and biologically plausible.

Efficient spatial clustering algorithm using binary tree

In this paper we present an efficient k-Means clustering algorithm for two dimensional data. The proposed algorithm re-organizes dataset into a form of nested binary tree*. Data items are compared at each node with only two nearest means with respect to each dimension and assigned to the one that has the closer mean. The main intuition of our research is as follows: We build the nested binary tree. Then we scan the data in raster order by in-order traversal of the tree. Lastly we compare data item at each node to the only two nearest means to assign the value to the intendant cluster. In this way we are able to save the computational cost significantly by reducing the number of comparisons with means and also by the least use to Euclidian distance formula. Our results showed that our method can perform clustering operation much faster than the classical ones. © Springer-Verlag Berlin Heidelberg 2005

Fault-tolerant quantum computation with cluster states

The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86, 5188 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive single-qubit measurements. This model is the basis for several practical proposals for quantum computation, including a promising proposal for optical quantum computation based on cluster states [M. A. Nielsen, Phys. Rev. Lett. (to be published), quant-ph/0402005]. A significant open question is whether such proposals are scalable in the presence of physically realistic noise. In this paper we prove two threshold theorems which show that scalable fault-tolerant quantum computation may be achieved in implementations based on cluster states, provided the noise in the implementations is below some constant threshold value. Our first threshold theorem applies to a class of implementations in which entangling gates are applied deterministically, but with a small amount of noise. We expect this threshold to be applicable in a wide variety of physical systems. Our second threshold theorem is specifically adapted to proposals such as the optical cluster-state proposal, in which nondeterministic entangling gates are used. A critical technical component of our proofs is two powerful theorems which relate the properties of noisy unitary operations restricted to act on a subspace of state space to extensions of those operations acting on the entire state space. We expect these theorems to have a variety of applications in other areas of quantum-information science.

Substructure and Dynamics of the Fornax Cluster

We present the first dynamical analysis of a galaxy cluster to include a large fraction of dwarf galaxies. Our sample of 108 Fornax Cluster members measured with the UK Schmidt Telescope FLAIR-II spectrograph contains 55 dwarf galaxies (15.5 > b(j) > 18.0 or -16 > M-B > -13.5). H alpha emission shows that of the dwarfs are star forming, twice the fraction implied by morphological classifications. The total sample has a mean velocity of 1493 +/- 36 kms s(-1) and a velocity dispersion of 374 +/- 26 km s(-1). The dwarf galaxies form a distinct population: their velocity dispersion (429 +/- 41 km s(-1)) is larger than that of the giants () at the 98% confidence level. This suggests that the dwarf population is dominated by infalling objects whereas the giants are virialized. The Fornax system has two components, the main Fornax Cluster centered on NGC 1399 with cz = 1478 km s(-1) and sigma (cz) = 370 km s(-1) and a subcluster centered 3 degrees to the southwest including NGC 1316 with cz = 1583 km s(-1) and sigma (cz) = 377 km s(-1). This partition is preferred over a single cluster at the 99% confidence level. The subcluster, a site of intense star formation, is bound to Fornax and probably infalling toward the cluster core for the first time. We discuss the implications of this substructure for distance estimates of the Fornax Cluster. We determine the cluster mass profile using the method of Diaferio, which does not assume a virialized sample. The mass within a projected radius of 1.4 Mpc is (7 +/- 2) x 10(13) M-., and the mass-to-light ratio is 300 +/- 100 M-./L-.. The mass is consistent with values derived from the projected mass virial estimator and X-ray measurements at smaller radii.

The Anglo Cluster: Legacy of the British Empire

The Anglo cluster comprises Australia, Canada, England, Ireland, New Zealand, South Africa (White sample), and the United States of America. These countries are all developed nations, predominantly English speaking, and were all once British colonies. Today, they are amongst the wealthiest countries in the world. The GLOBE results show that the Anglo cluster is characterized by an individualistic performance orientation. Further, although they value gender equality, the Anglo cluster countries tend to be male-dominated in practice. Effective leadership in the Anglo cultures is affected by a combination of charismatic inspiration and a articipative style.

An improved seeded region growing algorithm

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

High surface brightness dwarf galaxies in the Fornax cluster

We describe a search for compact dwarf galaxies in the Fornax cluster using the FLAIR spectrograph on the UK Schmidt Telescope. We measured radial velocities of 453 compact galaxies brighter than B-T approximate to 17.3 and found seven new compact dwarf cluster members that were not classified in previous surveys as members of the cluster. These are amongst the most compact, high surface brightness dwarf galaxies known. The inclusion of these galaxies in the cluster does not change the total luminosity function significantly, but they are important because of their extreme nature; one in particular appears to be a dwarf spiral. Three of the new dwarfs have strong emission lines and we identify them as blue compact dwarfs (BCDs), doubling the number of confirmed BCDs in the cluster. We also determined that none of the compact dwarf elliptical (M32-like) candidates is in the cluster, down to an absolute magnitude M-B = -13.2. We have investigated the claim of Irwin et al. that there is no strong relation between surface brightness and magnitude for the cluster members and find some support for this for the brighter galaxies (B-T < 17.3), but fainter galaxies still need to be measured.

Prediction of MHC class II-binding peptides using an evolutionary algorithm and artificial neural network

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

Cluster analysis of self-awareness levels in adults with traumatic brain injury and relationship to outcome

The purpose of this study was to investigate the relationship between self-awareness, emotional distress, motivation, and outcome in adults with severe traumatic brain injury. A sample of 55 patients were selected from 120 consecutive patients with severe traumatic brain injury admitted to the rehabilitation unit of a large metropolitan public hospital. Subjects received multidisciplinary inpatient rehabilitation and different types of outpatient rehabilitation and community-based services according to availability and need, Measures used in the cluster analysis were the Patient Competency Rating Scale, Self-Awareness of Deficits Interview, Head Injury Behavior Scale, Change Assessment Questionnaire, the Beck Depression Inventory, and Beck Anxiety Inventory; outcome measures were the Disability Rating Scale, Community Integration Questionnaire, and Sickness Impact Profile. A three-cluster solution was selected, with groups labeled as high self-awareness (n = 23), low self-awareness (n = 23), and good recovery (n = 8). The high self-awareness cluster had significantly higher levels of self-awareness, motivation, and emotional distress than the low self-awareness cluster but did not differ significantly in outcome. Self-awareness after brain injury is associated with greater motivation to change behavior and higher levels of depression and anxiety; however, it was not clear that this heightened motivation actually led to any improvement in outcome. Rehabilitation timing and approach may need to be tailored to match the individual's level of self-awareness, motivation, and emotional distress.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Trial-of-antibiotic algorithm for the diagnosis of tuberculosis in a district hospital in a developing country with high HIV prevalence

OBJECTIVE: To evaluate a diagnostic algorithm for pulmonary tuberculosis based on smear microscopy and objective response to trial of antibiotics. SETTING: Adult medical wards, Hlabisa Hospital, South Africa, 1996-1997. METHODS: Adults with chronic chest symptoms and abnormal chest X-ray had sputum examined for Ziehl-Neelsen stained acid-fast bacilli by light microscopy. Those with negative smears were treated with amoxycillin for 5 days and assessed. Those who had not improved were treated with erythromycin for 5 days and reassessed. Response was compared with mycobacterial culture. RESULTS: Of 280 suspects who completed the diagnostic pathway, 160 (57%) had a positive smear, 46 (17%) responded to amoxycillin, 34 (12%) responded to erythromycin and 40 (14%) were treated as smear-negative tuberculosis. The sensitivity (89%) and specificity (84%) of the full algorithm for culture-positive tuberculosis were high. However, 11 patients (positive predictive value [PPV] 95%) were incorrectly diagnosed with tuberculosis, and 24 cases of tuberculosis (negative predictive value [NPV] 70%) were not identified. NPV improved to 75% when anaemia was included as a predictor. Algorithm performance was independent of human immunodeficiency virus status. CONCLUSION: Sputum smear microscopy plus trial of antibiotic algorithm among a selected group of tuberculosis suspects may increase diagnostic accuracy in district hospitals in developing countries.

Robust Mixture Modelling Using the t Distribution

Normal mixture models are being increasingly used to model the distributions of a wide variety of random phenomena and to cluster sets of continuous multivariate data. However, for a set of data containing a group or groups of observations with longer than normal tails or atypical observations, the use of normal components may unduly affect the fit of the mixture model. In this paper, we consider a more robust approach by modelling the data by a mixture of t distributions. The use of the ECM algorithm to fit this t mixture model is described and examples of its use are given in the context of clustering multivariate data in the presence of atypical observations in the form of background noise.

Minimum-order stable recursive filter design via the genetic algorithm approach

In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.