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.

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.

Methylenetetrahydrofolate reductase CpG islands: Epigenotyping

Background Determination of the differential DNA methylation patterns of methylenetetrahydrofolate reductase (MTHFR) that are associated with differential MTHFR activity is important to understand the pathogenesis of ischemic stroke. However, to date, no data are available on the differential DNA methylation profiles of Kelantanese Malays. Therefore, we developed a rapid and efficient serial pyrosequencing assay to determine differential DNA methylation profiles of MTHFR, which help to further our understanding of the pathogenesis of ischemic stroke. The developed assay also served as the validation platform for our previous computational epigenetic research on MTHFR. Methods Polymerase chain reaction primers were designed and validated to specifically amplify the cytosine that is followed by guanine residues (CpGs) A and B regions. Prior epigenotyping on 110 Kelantanese Malays, the serial pyrosequencing assays for the CpGs A and B regions were validated using five validation controls. The mean values of the DNA methylation profiles of CpGs A and B were calculated. Results The mean DNA methylation levels for CpGs A and B were 0.984 ± 0.582 and 2.456 ± 1.406, respectively. The CpGs 8 and 20 showed the highest (5.581 ± 4.497) and the lowest (0.414 ± 2.814) levels of DNA methylation at a single-base resolution. Conclusion We have successfully developed and validated a pyrosequencing assay that is fast and can yield high-quality pyrograms for DNA methylation analysis and is therefore applicable to high throughput study. Using this newly developed pyrosequencing assay, the MTHFR DNA methylation profiles of 110 Kelantanese Malays were successfully determined. It also validated our computational epigenetic research on MTHFR.

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.