Discovery & effective use of quality association rules in multi-level datasets

In today’s electronic world vast amounts of knowledge is stored within many datasets and databases. Often the default format of this data means that the knowledge within is not immediately accessible, but rather has to be mined and extracted. This requires automated tools and they need to be effective and efficient. Association rule mining is one approach to obtaining knowledge stored with datasets / databases which includes frequent patterns and association rules between the items / attributes of a dataset with varying levels of strength. However, this is also association rule mining’s downside; the number of rules that can be found is usually very big. In order to effectively use the association rules (and the knowledge within) the number of rules needs to be kept manageable, thus it is necessary to have a method to reduce the number of association rules. However, we do not want to lose knowledge through this process. Thus the idea of non-redundant association rule mining was born. A second issue with association rule mining is determining which ones are interesting. The standard approach has been to use support and confidence. But they have their limitations. Approaches which use information about the dataset’s structure to measure association rules are limited, but could yield useful association rules if tapped. Finally, while it is important to be able to get interesting association rules from a dataset in a manageable size, it is equally as important to be able to apply them in a practical way, where the knowledge they contain can be taken advantage of. Association rules show items / attributes that appear together frequently. Recommendation systems also look at patterns and items / attributes that occur together frequently in order to make a recommendation to a person. It should therefore be possible to bring the two together. In this thesis we look at these three issues and propose approaches to help. For discovering non-redundant rules we propose enhanced approaches to rule mining in multi-level datasets that will allow hierarchically redundant association rules to be identified and removed, without information loss. When it comes to discovering interesting association rules based on the dataset’s structure we propose three measures for use in multi-level datasets. Lastly, we propose and demonstrate an approach that allows for association rules to be practically and effectively used in a recommender system, while at the same time improving the recommender system’s performance. This especially becomes evident when looking at the user cold-start problem for a recommender system. In fact our proposal helps to solve this serious problem facing recommender systems.

Development and characterisation of tri- and tetra-nucleotide polymorphic microsatellite markers for skipjack tuna (Katsuwonus pelamis)

Skipjack tuna (katsuwonus pelamis) (SJT) is the largest tuna fishery in all the major oceans around the world, and the largest marine fishery in Sri Lanka. Knowledge of genetic population structure and effective population size of SJT in the Indian Ocean and other major oceans, however, is still lacking for better management practices and conservation strategies. We developed microsatellite genetic markers using SJT around Sri Lanka in the Indian Ocean, and characterise one tri- and seven tetra-nucleotide microsatellite loci isolated from enriched genomic libraries from SJT, to provide tools for addressing both conservation and fisheries management questions. An analysis of these eight microsatellite markers in two populations of SJT from eastern Sri Lanka (n = 44) and the Maldives Islands (n = 53) showed that all eight microsatellites were polymorphic with an average number of alleles per locus of 11.80 (range 5-27). Expected heterozygosities at marker loci ranged from 0.450 to 0.961. These markers are being used currently to characterise population structure and extent of natural gene flow in SJT populations from the eastern and western Indian Ocean. No significant linkage disequilibrium was detected among any loci pairs.

Independent, marked associations of alleles of the insulin receptor and dipeptidyl carboxypeptidase-I genes with essential hypertension

1. There is evidence to suggest that essential hypertension is a polygenic disorder and that it arises from yet-to-be-identified predisposing variants of certain genes that influence blood pressure. The cloning of various hormone, enzyme, adrenoceptor and hormone receptor genes whose products are involved in blood pressure control and the identification of polymorphisms of these has permitted us to test their genetic association with hypertension. 2. Cross-sectional analyses of a number of candidate gene markers were performed in hypertensive and normotensive subjects who were selected on the basis of both parents being either hypertensive or normotensive, respectively, and the difference in total alleles on all chromosomes for each polymorphism between the hypertensive and normotensive groups was test by χ analysis with one degree of freedom. 3. A marked association was observed between hypertension and insertion alleles of polymorphisms of the insulin receptor gene (INSR) (P<0.0040) and the dipeptidyl carboxypeptidase-1 (angiotensin I-converting enzyme; kininase II) gene (DCP1) (P<0.0018). No association with hypertension was evident, however, for polymorphisms of the growth hormone, low-density lipoprotein receptor, renal kallikrein, α2- and β1-adrenoreceptor, atrial natriuretic factor and insulin genes. 4. All but one of the hypertensive subjects had at least one of the hypertension-associated alleles, and although subjects homozygous for both were three times more frequent in the hypertensive group, examination of the nine possible genotypes suggested that the INSR and DCP1 alleles are independent markers for hypertension. 5. The present results suggest that genetic variant(s) in close linkage disequilibrium with polymorphisms at INSR and DCP1 may be involved in part in the aetiology of essential hypertension.

Mice selectively bred for High and Low fear behavior show differences in the number of pMAPK (p44/42 ERK) expressing neurons in lateral amygdala following Pavlovian fear conditioning

Individual variability in the acquisition, consolidation and extinction of conditioned fear potentially contributes to the development of fear pathology including posttraumatic stress disorder (PTSD). Pavlovian fear conditioning is a key tool for the study of fundamental aspects of fear learning. Here, we used a selected mouse line of High and Low Pavlovian conditioned fear created from an advanced intercrossed line (AIL) in order to begin to identify the cellular basis of phenotypic divergence in Pavlovian fear conditioning. We investigated whether phosphorylated MAPK (p44/42 ERK/MAPK), a protein kinase required in the amygdala for the acquisition and consolidation of Pavlovian fear memory, is differentially expressed following Pavlovian fear learning in the High and Low fear lines. We found that following Pavlovian auditory fear conditioning, High and Low line mice differ in the number of pMAPK-expressing neurons in the dorsal sub nucleus of the lateral amygdala (LAd). In contrast, this difference was not detected in the ventral medial (LAvm) or ventral lateral (LAvl) amygdala sub nuclei or in control animals. We propose that this apparent increase in plasticity at a known locus of fear memory acquisition and consolidation relates to intrinsic differences between the two fear phenotypes. These data provide important insights into the micronetwork mechanisms encoding phenotypic differences in fear. Understanding the circuit level cellular and molecular mechanisms that underlie individual variability in fear learning is critical for the development of effective treatment of fear-related illnesses such as PTSD.

Smoothing a Discrete Hazard Function for the Number of Patients Colonized with Methicillin-Resistance Staphylococcus Aureus in an Intensive Care Unit

A new method for estimating the time to colonization of Methicillin-resistant Staphylococcus Aureus (MRSA) patients is developed in this paper. The time to colonization of MRSA is modelled using a Bayesian smoothing approach for the hazard function. There are two prior models discussed in this paper: the first difference prior and the second difference prior. The second difference prior model gives smoother estimates of the hazard functions and, when applied to data from an intensive care unit (ICU), clearly shows increasing hazard up to day 13, then a decreasing hazard. The results clearly demonstrate that the hazard is not constant and provide a useful quantification of the effect of length of stay on the risk of MRSA colonization which provides useful insight.

Effective models of employment-based training

Australia needs highly skilled workers to sustain a healthy economy. Current employment-based training models have limitations in meeting the demands for highly skilled labour supply. The research explored current and emerging models of employment-based training to propose more effective models at higher VET qualifications that can maintain a balance between institution and work-based learning.

Measuring episodic memory: A novel approach with an indefinite number of alternative forms

Both clinical practice and clinical research settings can require successive administrations of a memory test, particularly when following the trajectory of suspected memory decline in older adults. However, relatively few verbal episodic memory tests have alternative forms. We set out to create a broad based memory test to allow for the use of an essentially unlimited number of alternative forms. Four tasks for inclusion in such a test were developed. These tasks varied the requirement for recall as opposed to recognition, the need to form an association between unrelated words, and the need to discriminate the most recent list from earlier lists, all of which proved useful. A total of 115 participants completed the battery of tests and were used to show that the test could differentiate between older and younger adults; a sub-sample of 73 participants completed alternative forms of the tests to determine test-retest reliability and the amount of learning to learn.

An effective model of using negative relevance feedback for information filtering

Over the years, people have often held the hypothesis that negative feedback should be very useful for largely improving the performance of information filtering systems; however, we have not obtained very effective models to support this hypothesis. This paper, proposes an effective model that use negative relevance feedback based on a pattern mining approach to improve extracted features. This study focuses on two main issues of using negative relevance feedback: the selection of constructive negative examples to reduce the space of negative examples; and the revision of existing features based on the selected negative examples. The former selects some offender documents, where offender documents are negative documents that are most likely to be classified in the positive group. The later groups the extracted features into three groups: the positive specific category, general category and negative specific category to easily update the weight. An iterative algorithm is also proposed to implement this approach on RCV1 data collections, and substantial experiments show that the proposed approach achieves encouraging performance.

Cyber bullying in schools and the law : is there an effective means of addressing the power imbalance?

Cyber bullying – or bullying through the use of technology – is a growing phenomenon which is currently most commonly experienced by young people and the consequences manifested in schools. Cyber bullying shares many of the same attributes as face-to-face bullying such as a power imbalance and a sense of helplessness on the part of the target. Not surprisingly, targets of face-to-face bullying are increasingly turning to the law, and it is likely that targets of cyber bullying may also do so in an appropriate case. This article examines the various criminal, civil and vilification laws that may apply to cases of cyber bullying and assesses the likely effectiveness of these laws as a means of redressing that power imbalance between perpetrator and target.

Analysis of linear relationships in block ciphers

This thesis is devoted to the study of linear relationships in symmetric block ciphers. A block cipher is designed so that the ciphertext is produced as a nonlinear function of the plaintext and secret master key. However, linear relationships within the cipher can still exist if the texts and components of the cipher are manipulated in a number of ways, as shown in this thesis. There are four main contributions of this thesis. The first contribution is the extension of the applicability of integral attacks from word-based to bitbased block ciphers. Integral attacks exploit the linear relationship between texts at intermediate stages of encryption. This relationship can be used to recover subkey bits in a key recovery attack. In principle, integral attacks can be applied to bit-based block ciphers. However, specific tools to define the attack on these ciphers are not available. This problem is addressed in this thesis by introducing a refined set of notations to describe the attack. The bit patternbased integral attack is successfully demonstrated on reduced-round variants of the block ciphers Noekeon, Present and Serpent. The second contribution is the discovery of a very small system of equations that describe the LEX-AES stream cipher. LEX-AES is based heavily on the 128-bit-key (16-byte) Advanced Encryption Standard (AES) block cipher. In one instance, the system contains 21 equations and 17 unknown bytes. This is very close to the upper limit for an exhaustive key search, which is 16 bytes. One only needs to acquire 36 bytes of keystream to generate the equations. Therefore, the security of this cipher depends on the difficulty of solving this small system of equations. The third contribution is the proposal of an alternative method to measure diffusion in the linear transformation of Substitution-Permutation-Network (SPN) block ciphers. Currently, the branch number is widely used for this purpose. It is useful for estimating the possible success of differential and linear attacks on a particular SPN cipher. However, the measure does not give information on the number of input bits that are left unchanged by the transformation when producing the output bits. The new measure introduced in this thesis is intended to complement the current branch number technique. The measure is based on fixed points and simple linear relationships between the input and output words of the linear transformation. The measure represents the average fraction of input words to a linear diffusion transformation that are not effectively changed by the transformation. This measure is applied to the block ciphers AES, ARIA, Serpent and Present. It is shown that except for Serpent, the linear transformations used in the block ciphers examined do not behave as expected for a random linear transformation. The fourth contribution is the identification of linear paths in the nonlinear round function of the SMS4 block cipher. The SMS4 block cipher is used as a standard in the Chinese Wireless LAN Wired Authentication and Privacy Infrastructure (WAPI) and hence, the round function should exhibit a high level of nonlinearity. However, the findings in this thesis on the existence of linear relationships show that this is not the case. It is shown that in some exceptional cases, the first four rounds of SMS4 are effectively linear. In these cases, the effective number of rounds for SMS4 is reduced by four, from 32 to 28. The findings raise questions about the security provided by SMS4, and might provide clues on the existence of a flaw in the design of the cipher.