Genome-wide association studies of quantitative traits with related individuals: Little (power) lost but much to be gained

For complex disease genetics research in human populations, remarkable progress has been made in recent times with the publication of a number of genome-wide association scans (GWAS) and subsequent statistical replications. These studies have identified new genes and pathways implicated in disease, many of which were not known before. Given these early successes, more GWAS are being conducted and planned, both for disease and quantitative phenotypes. Many researchers and clinicians have DNA samples available on collections of families, including both cases and controls. Twin registries around the world have facilitated the collection of large numbers of families, with DNA and multiple quantitative phenotypes collected on twin pairs and their relatives. In the design of a new GWAS with a fixed budget for the number of chips, the question arises whether to include or exclude related individuals. It is commonly believed to be preferable to use unrelated individuals in the first stage of a GWAS because relatives are 'over-matched' for genotypes. In this study, we quantify that for GWAS of a quantitative phenotype, relative to a sample of unrelated individuals surprisingly little power is lost when using relatives. The advantages of using relatives are manifold, including the ability to perform more quality control, the choice to perform within-family tests of association that are robust to population stratification, and the ability to perform joint linkage and association analysis. Therefore, the advantages of using relatives in GWAS for quantitative traits may well outweigh the small disadvantage in terms of statistical power.

Knowledge discovery from tree databases using balanced optimal search

This research is a step forward in discovering knowledge from databases of complex structure like tree or graph. Several data mining algorithms are developed based on a novel representation called Balanced Optimal Search for extracting implicit, unknown and potentially useful information like patterns, similarities and various relationships from tree data, which are also proved to be advantageous in analysing big data. This thesis focuses on analysing unordered tree data, which is robust to data inconsistency, irregularity and swift information changes, hence, in the era of big data it becomes a popular and widely used data model.

Career adaptability predicts subjective career success above and beyond personality traits and core self-evaluations

The Career Adapt-Abilities Scale (CAAS) measures career adaptability as a higher-order construct that integrates four psychosocial resources of employees for managing their career development: concern, control, curiosity, and confidence. The goal of the present study was to investigate the validity of the CAAS with regard to its effects on two indicators of subjective career success (career satisfaction and self-rated career performance) above and beyond the effects of employees' Big Five personality traits and core self-evaluations. Data came from a large and heterogeneous sample of employees in Australia (N=1723). Results showed that overall career adaptability positively predicted career satisfaction and self-rated career performance above and beyond the Big Five personality traits and core self-evaluations. In addition, concern and confidence positively predicted the two indicators of subjective career success. The findings provide further support for the incremental validity of the CAAS.

Activity recognition using binary tree SVM

This paper presents an effective classification method based on Support Vector Machines (SVM) in the context of activity recognition. Local features that capture both spatial and temporal information in activity videos have made significant progress recently. Efficient and effective features, feature representation and classification plays a crucial role in activity recognition. For classification, SVMs are popularly used because of their simplicity and efficiency; however the common multi-class SVM approaches applied suffer from limitations including having easily confused classes and been computationally inefficient. We propose using a binary tree SVM to address the shortcomings of multi-class SVMs in activity recognition. We proposed constructing a binary tree using Gaussian Mixture Models (GMM), where activities are repeatedly allocated to subnodes until every new created node contains only one activity. Then, for each internal node a separate SVM is learned to classify activities, which significantly reduces the training time and increases the speed of testing compared to popular the `one-against-the-rest' multi-class SVM classifier. Experiments carried out on the challenging and complex Hollywood dataset demonstrates comparable performance over the baseline bag-of-features method.

Comment on “Whole-genome analyses resolve early branches in the tree of life of modern birds”

Jarvis et al. (Research Articles, 12 December 2014, p. 1320) presented molecular clock analyses that suggested that most modern bird orders diverged just after the mass extinction event at the Cretaceous-Paleogene boundary (about 66 million years ago). We demonstrate that this conclusion results from the use of a single inappropriate maximum bound, which effectively precludes the Cretaceous diversification overwhelmingly supported by previous molecular studies.