Automatic rule induction in Arabic to English machine translation framework

This chapter addresses the exploitation of a supervised machine learning technique to automatically induce Arabic-to-English transfer rules from chunks of parallel aligned linguistic resources. The induced structural transfer rules encode the linguistic translation knowledge for converting an Arabic syntactic structure into a target English syntactic structure. These rules are going to be an integral part of an Arabic-English transfer-based machine translation. Nevertheless, a novel morphological rule induction method is employed for learning Arabic morphological rules that are applied in our Arabic morphological analyzer. To demonstrate the capability of the automated rule induction technique, we conducted rule-based translation experiments that use induced rules from a relatively small data set. The translation quality of the hybrid translation experiments achieved good results in terms of WER.

Fault detection and diagnosis of induction motors using motor current signature analysis and a hybrid FMM-CART model

In this paper, a novel approach to detect and classify comprehensive fault conditions of induction motors using a hybrid fuzzy min-max (FMM) neural network and classification and regression tree (CART) is proposed. The hybrid model, known as FMM-CART, exploits the advantages of both FMM and CART for undertaking data classification and rule extraction problems. A series of real experiments is conducted, whereby the motor current signature analysis method is applied to form a database comprising stator current signatures under different motor conditions. The signal harmonics from the power spectral density are extracted as discriminative input features for fault detection and classification with FMM-CART. A comprehensive list of induction motor fault conditions, viz., broken rotor bars, unbalanced voltages, stator winding faults, and eccentricity problems, has been successfully classified using FMM-CART with good accuracy rates. The results are comparable, if not better, than those reported in the literature. Useful explanatory rules in the form of a decision tree are also elicited from FMM-CART to analyze and understand different fault conditions of induction motors.

Yet another induction algorithm

Inducing general functions from specific training examples is a central problem in the machine learning. Using sets of If-then rules is the most expressive and readable manner. To find If-then rules, many induction algorithms such as ID3, AQ, CN2 and their variants, were proposed. Sequential covering is the kernel technique of them. To avoid testing all possible selectors, Entropy gain is used to select the best attribute in ID3. Constraint of the size of star was introduced in AQ and beam search was adopted in CN2. These methods speed up their induction algorithms but many good selectors are filtered out. In this work, we introduce a new induction algorithm that is based on enumeration of all possible selectors. Contrary to the previous works, we use pruning power to reduce irrelative selectors. But we can guarantee that no good selectors are filtered out. Comparing with other techniques, the experiment results demonstrate
that the rules produced by our induction algorithm have high consistency and simplicity.

Analyzing security protocols using association rule mining

Current studies to analyzing security protocols using formal methods require users to predefine authentication goals. Besides, they are unable to discover potential correlations between secure messages. This research attempts to analyze security protocols using data mining. This is done by extending the idea of association rule mining and converting the verification of protocols into computing the frequency and confidence of inconsistent secure messages. It provides a novel and efficient way to analyze security protocols and find out potential correlations between secure messages. The conducted experiments demonstrate our approaches.

Depth first rule heneration for text categorization

Classification methods are usually used to categorize text documents, such as, Rocchio method, Naïve bayes based method, and SVM based text classification method. These methods learn labeled text documents and then construct classifiers. The generated classifiers can predict which category is located for a new coming text document. The keywords in the document are often used to form rules to categorize text documents, for example “kw = computer” can be a rule for the IT documents category. However, the number of keywords is very large. To select keywords from the large number of keywords is a challenging work. Recently, a rule generation method based on enumeration of all possible keywords combinations has been proposed [2]. In this method, there remains a crucial problem: how to prune irrelevant combinations at the early stages of the rule generation procedure. In this paper, we propose a method than can effectively prune irrelative keywords at an early stage.

Further pruning for efficient association rule discovery

The Apriori algorithm’s frequent itemset approach has become the standard approach to discovering association rules. However, the computation requirements of the frequent itemset approach are infeasible for dense data and the approach is unable to discover infrequent associations. OPUS AR is an efficient algorithm for association rule discovery that does not utilize frequent itemsets and hence avoids these problems. It can reduce search time by using additional constraints on the search space as well as constraints on itemset frequency. However, the effectiveness of the pruning rules used during search will determine the efficiency of its search. This paper presents and analyses pruning rules for use with OPUS AR. We demonstrate that application of OPUS AR is feasible for a number of datasets for which application of the frequent itemset approach is infeasible and that the new pruning rules can reduce compute time by more than 40%.

An examination on the performance of MML causal induction

This paper presents an examination report on the performance of the improved MML based causal model discovery algorithm. In this paper, We firstly describe our improvement to the causal discovery algorithm which introduces a new encoding scheme for measuring the cost of describing the causal structure. Stiring function is also applied to further simplify the computational complexity and thus works more efficiently. It is followed by a detailed examination report on the performance of our improved discovery algorithm. The experimental results of the current version of the discovery system show that: (l) the current version is capable of discovering what discovered by previous system; (2) current system is capable of discovering more complicated causal networks with large number of variables; (3) the new version works more efficiently compared with the previous version in terms of time complexity.

Positivism: one ring to rule them all? A tale of information systems research methodology

The tale of research methodology in information systems is told through the fantasy of Tolkien’s Lord of the Rings. The tale is intended to be at once a piece of light hearted fun in its placement of the struggles of research methodology as an epic story but, in the tradition of the court jester, attempts to provide a new perspective on Information Systems (IS) research methodology and our struggles with positivism in particular. Our tale is one of developing a greater maturity and confidence in IS methodology and introduces postmodern methodologies to Information Systems. Our tale, our pastiche, is itself postmodern.

Finding rule groups to classify high dimensional gene expression datasets

Microarray data provides quantitative information about the transcription profile of cells. To analyze microarray datasets, methodology of machine learning has increasingly attracted bioinformatics researchers. Some approaches of machine learning are widely used to classify and mine biological datasets. However, many gene expression datasets are extremely high dimensionality, traditional machine learning methods can not be applied effectively and efficiently. This paper proposes a robust algorithm to find out rule groups to classify gene expression datasets. Unlike the most classification algorithms, which select dimensions (genes) heuristically to form rules groups to identify classes such as cancerous and normal tissues, our algorithm guarantees finding out best-k dimensions (genes), which are most discriminative to classify samples in different classes, to form rule groups for the classification of expression datasets. Our experiments show that the rule groups obtained by our algorithm have higher accuracy than that of other classification approaches

Measuring moral judgement and the implications of cooperative education and rule-based learning

The Defining Issues Test (DIT), developed by Rest (1986), measures a person's level of moral development using hypothetical social dilemmas. Although the DIT is useful for measuring moral development in social settings, it might not adequately capture an individual's moral judgement abilities in solving work-related problems (Weber, 1990; Trevino, 1992; Welton et al., 1994). In the present study, the moral judgement levels of 97 accounting students were measured over a 1 year period using two separate test instruments, the DIT and a context-specific instrument developed by Welton et al. (1994). The test scores are significantly higher on the DIT than the Welton instrument (between the instruments and over time), suggesting that accounting students use higher levels of moral reasoning in resolving hypothetical social dilemmas and lower levels of moral reasoning in resolving context-specific dilemmas. The difference in test scores was highest during cooperative education (work placement programme), implying that the environment is a significant determinant on students' test scores.

Induction of epithelial to mesenchymal transition in PMC42-LA human breast carcinoma cells by carcinoma-associated fibroblast secreted factors

Background
Breast carcinoma is accompanied by changes in the acellular and cellular components of the microenvironment, the latter typified by a switch from fibroblasts to myofibroblasts.


Methods
We utilised conditioned media cultures, Western blot analysis and immunocytochemistry to investigate the differential effects of normal mammary fibroblasts (NMFs) and mammary cancer-associated fibroblasts (CAFs) on the phenotype and behaviour of PMC42-LA breast cancer cells. NMFs were obtained from a mammary gland at reduction mammoplasty, and CAFs from a mammary carcinoma after resection.


Results
We found greater expression of myofibroblastic markers in CAFs than in NMFs. Medium from both CAFs and NMFs induced novel expression of α-smooth muscle actin and cytokeratin-14 in PMC42-LA organoids. However, although conditioned media from NMFs resulted in distribution of vimentin-positive cells to the periphery of PMC42-LA organoids, this was not seen with CAF-conditioned medium. Upregulation of vimentin was accompanied by a mis-localization of E-cadherin, suggesting a loss of adhesive function. This was confirmed by visualizing the change in active β-catenin, localized to the cell junctions in control cells/cells in NMF-conditioned medium, to inactive β-catenin, localized to nuclei and cytoplasm in cells in CAF-conditioned medium.


Conclusion
We found no significant difference between the influences of NMFs and CAFs on PMC42-LA cell proliferation, viability, or apoptosis; significantly, we demonstrated a role for CAFs, but not for NMFs, in increasing the migratory ability of PMC42-LA cells. By concentrating NMF-conditioned media, we demonstrated the presence of factor(s) that induce epithelial-mesenchymal transition in NMF-conditioned media that are present at higher levels in CAF-conditioned media. Our in vitro results are consistent with observations in vivo showing that alterations in stroma influence the phenotype and behaviour of surrounding cells and provide evidence for a role for CAFs in stimulating cancer progression via an epithelial-mesenchymal transition. These findings have implications for our understanding of the roles of signalling between epithelial and stromal cells in the development and progression of mammary carcinoma.