Robust clustering of multi-type relational data via a heterogeneous manifold ensemble

High-Order Co-Clustering (HOCC) methods have attracted high attention in recent years because of their ability to cluster multiple types of objects simultaneously using all available information. During the clustering process, HOCC methods exploit object co-occurrence information, i.e., inter-type relationships amongst different types of objects as well as object affinity information, i.e., intra-type relationships amongst the same types of objects. However, it is difficult to learn accurate intra-type relationships in the presence of noise and outliers. Existing HOCC methods consider the p nearest neighbours based on Euclidean distance for the intra-type relationships, which leads to incomplete and inaccurate intra-type relationships. In this paper, we propose a novel HOCC method that incorporates multiple subspace learning with a heterogeneous manifold ensemble to learn complete and accurate intra-type relationships. Multiple subspace learning reconstructs the similarity between any pair of objects that belong to the same subspace. The heterogeneous manifold ensemble is created based on two-types of intra-type relationships learnt using p-nearest-neighbour graph and multiple subspaces learning. Moreover, in order to make sure the robustness of clustering process, we introduce a sparse error matrix into matrix decomposition and develop a novel iterative algorithm. Empirical experiments show that the proposed method achieves improved results over the state-of-art HOCC methods for FScore and NMI.

An observation about circular shortest paths: Dealing with additional constraints using branch and bound

Circular shortest paths represent a powerful methodology for image segmentation. The circularity condition ensures that the contour found by the algorithm is closed, a natural requirement for regular objects. Several implementations have been proposed in the past that either promise closure with high probability or ensure closure strictly, but with a mild computational efficiency handicap. Circularity can be viewed as a priori information that helps recover the correct object contour. Our "observation" is that circularity is only one among many possible constraints that can be imposed on shortest paths to guide them to a desirable solution. In this contribution, we illustrate this opportunity under a volume constraint but the concept is generally applicable. We also describe several adornments to the circular shortest path algorithm that proved useful in applications. © 2011 IEEE.

Tubule detection in testis images using boundary weighting and circular shortest path

In studies of germ cell transplantation, measureing tubule diameters and counting cells from different populations using antibodies as markers are very important. Manual measurement of tubule sizes and cell counts is a tedious and sanity grinding work. In this paper, we propose a new boundary weighting based tubule detection method. We first enhance the linear features of the input image and detect the approximate centers of tubules. Next, a boundary weighting transform is applied to the polar transformed image of each tubule region and a circular shortest path is used for the boundary detection. Then, ellipse fitting is carried out for tubule selection and measurement. The algorithm has been tested on a dataset consisting of 20 images, each having about 20 tubules. Experiments show that the detection results of our algorithm are very close to the results obtained manually. © 2013 IEEE.

A data mining based method for discovery of web services and their compositions

Due to the availability of huge number of web services, finding an appropriate Web service according to the requirements of a service consumer is still a challenge. Moreover, sometimes a single web service is unable to fully satisfy the requirements of the service consumer. In such cases, combinations of multiple inter-related web services can be utilised. This paper proposes a method that first utilises a semantic kernel model to find related services and then models these related Web services as nodes of a graph. An all-pair shortest-path algorithm is applied to find the best compositions of Web services that are semantically related to the service consumer requirement. The recommendation of individual and composite Web services composition for a service request is finally made. Empirical evaluation confirms that the proposed method significantly improves the accuracy of service discovery in comparison to traditional keyword-based discovery methods.

A conceptual approach to track design changes within a multi-disciplinary BIM environment

Successful management of design changes is critical for the efficient delivery of construction projects. Building Information Modeling (BIM) is envisioned to play an important role in integrating design, construction and facility management processes through coordinated changes throughout the project life-cycle. BIM currently provides significant benefits in coordinating changes across different views in a single model, and identifying conflicts between different discipline-specific models. However, current BIM tools provide limited support in managing changes across several discipline-specific models. This paper describes an approach to represent, coordinate, and track changes within a collaborative multi-disciplinary BIM environment. This approach was informed by a detailed case study of a large, complex, fast-tracked BIM project where we investigated numerous design changes, analyzed change management processes, and evaluated existing BIM tools. Our approach characterises design changes in an ontology to represent changed component attributes, dependencies between components, and change impacts. It explores different types of dependencies amongst different design changes and describes how a graph based approach and dependency matrix could assist with automating the propagation and impact of changes in a BIM-based project delivery process.

Supervised latent dirichlet allocation models for efficient activity representation

Local spatio-temporal features with a Bag-of-visual words model is a popular approach used in human action recognition. Bag-of-features methods suffer from several challenges such as extracting appropriate appearance and motion features from videos, converting extracted features appropriate for classification and designing a suitable classification framework. In this paper we address the problem of efficiently representing the extracted features for classification to improve the overall performance. We introduce two generative supervised topic models, maximum entropy discrimination LDA (MedLDA) and class- specific simplex LDA (css-LDA), to encode the raw features suitable for discriminative SVM based classification. Unsupervised LDA models disconnect topic discovery from the classification task, hence yield poor results compared to the baseline Bag-of-words framework. On the other hand supervised LDA techniques learn the topic structure by considering the class labels and improve the recognition accuracy significantly. MedLDA maximizes likelihood and within class margins using max-margin techniques and yields a sparse highly discriminative topic structure; while in css-LDA separate class specific topics are learned instead of common set of topics across the entire dataset. In our representation first topics are learned and then each video is represented as a topic proportion vector, i.e. it can be comparable to a histogram of topics. Finally SVM classification is done on the learned topic proportion vector. We demonstrate the efficiency of the above two representation techniques through the experiments carried out in two popular datasets. Experimental results demonstrate significantly improved performance compared to the baseline Bag-of-features framework which uses kmeans to construct histogram of words from the feature vectors.

Histogram matching and global initialization for laser-only SLAM in large unstructured environments

This paper presents an enhanced algorithm for matching laser scan maps using histogram correlations. The histogram representation effectively summarizes a map's salient features such that pairs of maps can be matched efficiently without any prior guess as to their alignment. The histogram matching algorithm has been enhanced in order to work well in outdoor unstructured environments by using entropy metrics, weighted histograms and proper thresholding of quality metrics. Thus our large-scale scan-matching SLAM implementation has a vastly improved ability to close large loops in real-time even when odometry is not available. Our experimental results have demonstrated a successful mapping of the largest area ever mapped to date using only a single laser scanner. We also demonstrate our ability to solve the lost robot problem by localizing a robot to a previously built map without any prior initialization.

Edge-weighting of gene expression graphs

In recent years, considerable research efforts have been directed to micro-array technologies and their role in providing simultaneous information on expression profiles for thousands of genes. These data, when subjected to clustering and classification procedures, can assist in identifying patterns and providing insight on biological processes. To understand the properties of complex gene expression datasets, graphical representations can be used. Intuitively, the data can be represented in terms of a bipartite graph, with weighted edges corresponding to gene-sample node couples in the dataset. Biologically meaningful subgraphs can be sought, but performance can be influenced both by the search algorithm, and, by the graph-weighting scheme and both merit rigorous investigation. In this paper, we focus on edge-weighting schemes for bipartite graphical representation of gene expression. Two novel methods are presented: the first is based on empirical evidence; the second on a geometric distribution. The schemes are compared for several real datasets, assessing efficiency of performance based on four essential properties: robustness to noise and missing values, discrimination, parameter influence on scheme efficiency and reusability. Recommendations and limitations are briefly discussed. Keywords: Edge-weighting; weighted graphs; gene expression; bi-clustering

A Mammalian Circadian Clock Model Incorporating Daytime Expression Elements

Models of the mammalian clock have traditionally been based around two feedback loops-the self-repression of Per/Cry by interfering with activation by BMAL/CLOCK, and the repression of Bmal/Clock by the REV-ERB proteins. Recent experimental evidence suggests that the D-box, a transcription factor binding site associated with daytime expression, plays a larger role in clock function than has previously been understood. We present a simplified clock model that highlights the role of the D-box and illustrate an approach for finding maximum-entropy ensembles of model parameters, given experimentally imposed constraints. Parameter variability can be mitigated using prior probability distributions derived from genome-wide studies of cellular kinetics. Our model reproduces predictions concerning the dual regulation of Cry1 by the D-box and Rev-ErbA/ROR response element (RRE) promoter elements and allows for ensemble-based predictions of phase response curves (PRCs). Nonphotic signals such as Neuropeptide Y (NPY) may act by promoting Cry1 expression, whereas photic signals likely act by stimulating expression from the E/E' box. Ensemble generation with parameter probability restraints reveals more about a model's behavior than a single optimal parameter set.

Crystal structures and hydrogen-bonding in the co-crystalline adducts of 3,5-dinitrobenzoic acid with 4-aminosalicylic acid and 2-hydroxy-3-(1H-indol-3-yl)propenoic acid

The structures of the cocrystalline adducts of 3,5-dinitrobenzoic acid (3,5-DNBA) with 4-aminosalicylic acid (PASA), the 1:1 partial hydrate, C7H4N2O6 .C7H7NO3 . 2H2O, (I) and 2-hydroxy-3-(1H-indol-3-yl)propenoic acid (HIPA) and the 1:1:1 d6-dimethylsulfoxide solvate, C7H4N2O6 . C11H9NO3 . C2D6OS, (II) are reported. The crystal substructure of (I) comprises two centrosymmetric hydrogen-bonded R2/2(8) homodimers, one with 3,5-DNBA, the other with PASA, and an R2/2(8) 3,5-DNBA-PASA heterodimer. In the crystal, inter-unit amine N-H...O and water O-H...O hydrogen bonds generate a three-dimensional supramolecular structure. In (II), the asymmetric unit consists of the three constituent molecules which form an essentially planar cyclic hydrogen-bonded heterotrimer unit [graph set R2/3(17)] through carboxyl, hydroxy and amino groups. These units associate across a crystallographic inversion centre through the HIPA carboxylic acid group in an R2/2~(8) hydrogen-bonding association, giving a zero-dimensional structure lying parallel to (100). In both structures, pi--pi interactions are present [minimum ring centroid separations: 3.6471(18)A in (I) and 3.5819(10)A in (II)].

How everyday language can and will boost effective information retrieval

Typing 2 or 3 keywords into a browser has become an easy and efficient way to find information. Yet, typing even short queries becomes tedious on ever shrinking (virtual) keyboards. Meanwhile, speech processing is maturing rapidly, facilitating everyday language input. Also, wearable technology can inform users proactively by listening in on their conversations or processing their social media interactions. Given these developments, everyday language may soon become the new input of choice. We present an information retrieval (IR) algorithm specifically designed to accept everyday language. It integrates two paradigms of information retrieval, previously studied in isolation; one directed mainly at the surface structure of language, the other primarily at the underlying meaning. The integration was achieved by a Markov machine that encodes meaning by its transition graph, and surface structure by the language it generates. A rigorous evaluation of the approach showed, first, that it can compete with the quality of existing language models, second, that it is more effective the more verbose the input, and third, as a consequence, that it is promising for an imminent transition from keyword input, where the onus is on the user to formulate concise queries, to a modality where users can express more freely, more informal, and more natural their need for information in everyday language.

Reliable fault diagnosis for incipient low-speed bearings using fault feature analysis based on a binary bat algorithm

In this paper, we propose a highly reliable fault diagnosis scheme for incipient low-speed rolling element bearing failures. The scheme consists of fault feature calculation, discriminative fault feature analysis, and fault classification. The proposed approach first computes wavelet-based fault features, including the respective relative wavelet packet node energy and entropy, by applying a wavelet packet transform to an incoming acoustic emission signal. The most discriminative fault features are then filtered from the originally produced feature vector by using discriminative fault feature analysis based on a binary bat algorithm (BBA). Finally, the proposed approach employs one-against-all multiclass support vector machines to identify multiple low-speed rolling element bearing defects. This study compares the proposed BBA-based dimensionality reduction scheme with four other dimensionality reduction methodologies in terms of classification performance. Experimental results show that the proposed methodology is superior to other dimensionality reduction approaches, yielding an average classification accuracy of 94.9%, 95.8%, and 98.4% under bearing rotational speeds at 20 revolutions-per-minute (RPM), 80 RPM, and 140 RPM, respectively.

Crystal structures and hydrogen bonding in the anhydrous tryptaminium salts of the isomeric (2,4-dichlorophenoxy)acetic and (3,5-dichlorophenoxy)acetic acids

The anhydrous salts of 1H-indole-3-ethanamine (tryptamine) with isomeric (2,4-dichlorophenoxy)acetic acid (2,4-D) and (3,5-dichlorophenoxy)acetic (3,5-D), C10H13N2+ (C8H5Cl2O3)-, [(I) and (II), respectively] have been determined and their one-dimensional hydrogen-bonded polymeric structures are described. In the crystal of (I),the aminium H-atoms are involved in three separate inter-species N-H...O hydrogen-bonding interactions, two with carboxyl O-atom acceptors and the third in an asymmetric three-centre bidentate carboxyl O,O' chelate [graph set R2/1(4)]. The indole H-atom forms an N-H...O~carboxyl~ hydrogen bond, extending the chain structure along the b axial direction. In (II), two of the three aminium H-atoms are also involved in N-H...O(carboxyl) hydrogen bonds similar to (I) but with the third, a three-centre asymmetric interaction with carboxyl and phenoxy O-atoms is found [graph set R2/1(5)]. The chain polymeric extension is also along b. There are no pi--pi ring interactions in either of the structures. The aminium side chain conformations differ significantly between the two structures, reflecting the conformational ambivalence of the tryptaminium cation, as found also in the benzoate salts.

Development of brain structural connectivity between ages 12 and 30: A 4-Tesla diffusion imaging study in 439 adolescents and adults

Understanding how the brain matures in healthy individuals is critical for evaluating deviations from normal development in psychiatric and neurodevelopmental disorders. The brain's anatomical networks are profoundly re-modeled between childhood and adulthood, and diffusion tractography offers unprecedented power to reconstruct these networks and neural pathways in vivo. Here we tracked changes in structural connectivity and network efficiency in 439 right-handed individuals aged 12 to 30 (211 female/126 male adults, mean age=23.6, SD=2.19; 31 female/24 male 12 year olds, mean age=12.3, SD=0.18; and 25 female/22 male 16 year olds, mean age=16.2, SD=0.37). All participants were scanned with high angular resolution diffusion imaging (HARDI) at 4 T. After we performed whole brain tractography, 70 cortical gyral-based regions of interest were extracted from each participant's co-registered anatomical scans. The proportion of fiber connections between all pairs of cortical regions, or nodes, was found to create symmetric fiber density matrices, reflecting the structural brain network. From those 70 × 70 matrices we computed graph theory metrics characterizing structural connectivity. Several key global and nodal metrics changed across development, showing increased network integration, with some connections pruned and others strengthened. The increases and decreases in fiber density, however, were not distributed proportionally across the brain. The frontal cortex had a disproportionate number of decreases in fiber density while the temporal cortex had a disproportionate number of increases in fiber density. This large-scale analysis of the developing structural connectome offers a foundation to develop statistical criteria for aberrant brain connectivity as the human brain matures.

Changes in anatomical brain connectivity between ages 12 and 30: A HARDI study of 467 adolescents and adults

Graph theory can be applied to matrices that represent the brain's anatomical connections, to better understand global properties of anatomical networks, such as their clustering, efficiency and "small-world" topology. Network analysis is popular in adult studies of connectivity, but only one study - in just 30 subjects - has examined how network measures change as the brain develops over this period. Here we assessed the developmental trajectory of graph theory metrics of structural brain connectivity in a cross-sectional study of 467 subjects, aged 12 to 30. We computed network measures from 70×70 connectivity matrices of fiber density generated using whole-brain tractography in 4-Tesla 105-gradient high angular resolution diffusion images (HARDI). We assessed global efficiency and modularity, and both age and age 2 effects were identified. HARDI-based connectivity maps are sensitive to the remodeling and refinement of structural brain connections as the human brain develops.