Nonparametric variational learning of multivariate beta mixture models in medical applications

Clustering as an essential technique has matured into a capable solution to address the gap between the growing availability of data and deriving the knowledge from them. In this paper, we propose a novel clustering method “variational learning of infinite multivariate Beta mixture models.” The motivation behind proposing this technique is the flexibility of mixture models to fit the data. This approach has the capability to infer the model complexity and estimate model parameters from the observed data automatically. Moreover, as a label‐free method, it could also address the problem of high costs of medical data labeling, which can be undertaken just by medical experts. The performance of the model is evaluated on real medical applications and compared with other similar alternatives. We demonstrate the ability of our proposed method to outperform widely used methods in the field as it has been shown in experimental results.     

On multivariate binary data clustering and feature weighting

This paper presents an approach that partitions data sets of unlabeled binary vectors without a priori information about the number of clusters or the saliency of the features. The unsupervised binary feature selection problem is approached using finite mixture models of multivariate Bernoulli distributions. Using stochastic complexity, the proposed model determines simultaneously the number of clusters in a given data set composed of binary vectors and the saliency of the features used. We conduct different applications involving real data, document classification and images categorization to show the merits of the proposed approach.     

Infinite Liouville mixture models with application to text and texture categorization

This paper addresses the problem of proportional data modeling and clustering using mixture models, a problem of great interest and of importance for many practical pattern recognition, image processing, data mining and computer vision applications. Finite mixture models are broadly applicable to clustering problems. But, they involve the challenging problem of the selection of the number of clusters which requires a certain trade-off. The number of clusters must be sufficient to provide the discriminating capability between clusters required for a given application. Indeed, if too many clusters are employed overfitting problems may occur and if few are used we have a problem of underfitting. Here we approach the problem of modeling and clustering proportional data using infinite mixtures which have been shown to be an efficient alternative to finite mixtures by overcoming the concern regarding the selection of the optimal number of mixture components. In particular, we propose and discuss the consideration of infinite Liouville mixture model whose parameter values are fitted to the data through a principled Bayesian algorithm that we have developed and which allows uncertainty in the number of mixture components. Our experimental evaluation involves two challenging applications namely text classification and texture discrimination, and suggests that the proposed approach can be an excellent choice for proportional data modeling.     

A countably infinite mixture model for clustering and feature selection

Mixture modeling is one of the most useful tools in machine learning and data mining applications. An important challenge when applying finite mixture models is the selection of the number of clusters which best describes the data. Recent developments have shown that this problem can be handled by the application of non-parametric Bayesian techniques to mixture modeling. Another important crucial preprocessing step to mixture learning is the selection of the most relevant features. The main approach in this paper, to tackle these problems, consists on storing the knowledge in a generalized Dirichlet mixture model by applying non-parametric Bayesian estimation and inference techniques. Specifically, we extend finite generalized Dirichlet mixture models to the infinite case in which the number of components and relevant features do not need to be known a priori. This extension provides a natural representation of uncertainty regarding the challenging problem of model selection. We propose a Markov Chain Monte Carlo algorithm to learn the resulted infinite mixture. Through applications involving text and image categorization, we show that infinite mixture models offer a more powerful and robust performance than classic finite mixtures for both clustering and feature selection.     

Improved Arabic-to-English statistical machine translation by reordering post-verbal subjects for word alignment

We study challenges raised by the order of Arabic verbs and their subjects in statistical machine translation (SMT). We show that the boundaries of post-verbal subjects (VS) are hard to detect accurately, even with a state-of-the-art Arabic dependency parser. In addition, VS constructions have highly ambiguous reordering patterns when translated to English, and these patterns are very different for matrix (main clause) VS and non-matrix (subordinate clause) VS. Based on this analysis, we propose a novel method for leveraging VS information in SMT: we reorder VS constructions into pre-verbal (SV) order for word alignment. Unlike previous approaches to source-side reordering, phrase extraction and decoding are performed using the original Arabic word order. This strategy significantly improves BLEU and TER scores, even on a strong large-scale baseline. Limiting reordering to matrix VS yields further improvements.     

The actuation efficiency,a measure of acceleration capability for nonredundant robotic manipulators

This article presents a performance measure, the actuation efficiency, which describes the imbalance between the end‐effector accelerations achievable in different directions of nonredundant robotic manipulators. A key feature of the proposed measure is that in its development the differences in units between translational and rotational accelerations are treated in a physically meaningful manner. The measure also indicates oversized actuators, since this contributes to the imbalance in achievable accelerations. The development of this measure is based on the formulation of the dynamic capability equations. The shape of the dynamic capability hypersurface, which is defined by the dynamic capability equations, is a weak indicator of the level of imbalance in achievable end‐effector accelerations. © 2005 Wiley Periodicals, Inc.     

An Approach to the Synthesis of the Manzamine Alkaloids Via the Vinylogous Amide PHotocycloAddition/Retro-Mannich Fragmentation/Mannich Closure Cascade (pharM)

The application of the vinylogous amide [2+2] photocycloaddition/retro-Mannich fragmentation/ M annich closure cascade ( pharM ) to the synthesis of the pentacyclic ring system of the anti-leukemic marine alkaloid manzamine A is presented. Two approaches to the synthesis of the requisite pentacycle are described: (a) the transannular photocycloaddition of an 18-membered vinylogous amide; and (b) photocycloaddition of an acyclic vinylogous amide, followed by macrolactamization of the derived pharM closure product to generate the pentacyclic ring system.     

Representation and Reasoning with Multi-Point Events

Allen's Interval Algebra (IA) and Vilain & Kautz's Point Algebra (PA) consider an interval and a point as basic temporal entities (i.e., events) respectively. However, in many situations we need to deal with recurring events that include multiple points, multiple intervals or combinations of points and intervals. In this paper, we present a framework to model recurring events as multi-point events (MPEs) by extending point algebra. The reasoning tasks are formulated as binary constraint satisfaction problems. We propose a polynomial time algorithm (based on van Beek's algorithm) for finding all feasible relations. For the problem of finding a consistent scenario, we propose a backtracking method with a local search heuristic. We also describe an implementation and a detail empirical evaluation of the proposed algorithms. Our empirical results indicate that the MPE-based approach performs better than the existing approaches.