SMART: Unique splitting-while-merging framework for gene clustering

Copyright @ 2014 Fa et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.Successful clustering algorithms are highly dependent on parameter settings. The clustering performance degrades significantly unless parameters are properly set, and yet, it is difficult to set these parameters a priori. To address this issue, in this paper, we propose a unique splitting-while-merging clustering framework, named “splitting merging awareness tactics” (SMART), which does not require any a priori knowledge of either the number of clusters or even the possible range of this number. Unlike existing self-splitting algorithms, which over-cluster the dataset to a large number of clusters and then merge some similar clusters, our framework has the ability to split and merge clusters automatically during the process and produces the the most reliable clustering results, by intrinsically integrating many clustering techniques and tasks. The SMART framework is implemented with two distinct clustering paradigms in two algorithms: competitive learning and finite mixture model. Nevertheless, within the proposed SMART framework, many other algorithms can be derived for different clustering paradigms. The minimum message length algorithm is integrated into the framework as the clustering selection criterion. The usefulness of the SMART framework and its algorithms is tested in demonstration datasets and simulated gene expression datasets. Moreover, two real microarray gene expression datasets are studied using this approach. Based on the performance of many metrics, all numerical results show that SMART is superior to compared existing self-splitting algorithms and traditional algorithms. Three main properties of the proposed SMART framework are summarized as: (1) needing no parameters dependent on the respective dataset or a priori knowledge about the datasets, (2) extendible to many different applications, (3) offering superior performance compared with counterpart algorithms.National Institute for Health Researc

Model selection by normalized maximum likelihood

Abstract not availableJay I. Myung, Daniel J. Navarro, and Mark A. Pitthttp://www.elsevier.com/wps/find/journaldescription.cws_home/622887/description#descriptio

The Princeton Protein Orthology Database (P-POD): A Comparative Genomics Analysis Tool for Biologists

Many biological databases that provide comparative genomics information and tools are now available on the internet. While certainly quite useful, to our knowledge none of the existing databases combine results from multiple comparative genomics methods with manually curated information from the literature. Here we describe the Princeton Protein Orthology Database (P-POD, http://ortholog.princeton.edu), a user-friendly database system that allows users to find and visualize the phylogenetic relationships among predicted orthologs (based on the OrthoMCL method) to a query gene from any of eight eukaryotic organisms, and to see the orthologs in a wider evolutionary context (based on the Jaccard clustering method). In addition to the phylogenetic information, the database contains experimental results manually collected from the literature that can be compared to the computational analyses, as well as links to relevant human disease and gene information via the OMIM, model organism, and sequence databases. Our aim is for the P-POD resource to be extremely useful to typical experimental biologists wanting to learn more about the evolutionary context of their favorite genes. P-POD is based on the commonly used Generic Model Organism Database (GMOD) schema and can be downloaded in its entirety for installation on one's own system. Thus, bioinformaticians and software developers may also find P-POD useful because they can use the P-POD database infrastructure when developing their own comparative genomics resources and database tools

Kullback-Leibler Distances for Quantifying Clutter and Models

This paper examines metrics for measuring clutter effectiveness on model-based automatic target recognition systems with FLIR sensors. The measure for clutter effectiveness proposed is the difference of two Kullback-Leibler distances between the idealized approximate probabilistic models without clutter and the real model containing clutter. We establish that occluding objects and clutter, when manipulated, do not present a fundamental challenge to model-based ATR system if the model manipulated is an accurate representation of the obscuring clutter. However, if the obscurer is not manipulated, performance degrades in cases where the obscurer is an "effective clutterer." To quantify the effect of clutter in ATR, estimation and detection problems are considered for rigid ground-based targets. For estimating the orientation of a vehicle, the Hilbert-Schmidt distance is employed. Aaron D. Lanterman, Univ. of Illinois, Coordinated Science Laboratory, 1308 W. Main, Urbana, IL 61801, E-mai..