Exponentiated gradient algorithms for conditional random fields and max-margin Markov Networks

Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of parameters in these models is therefore an important problem, and becomes a key factor when learning from very large data sets. This paper describes exponentiated gradient (EG) algorithms for training such models, where EG updates are applied to the convex dual of either the log-linear or max-margin objective function; the dual in both the log-linear and max-margin cases corresponds to minimizing a convex function with simplex constraints. We study both batch and online variants of the algorithm, and provide rates of convergence for both cases. In the max-margin case, O(1/ε) EG updates are required to reach a given accuracy ε in the dual; in contrast, for log-linear models only O(log(1/ε)) updates are required. For both the max-margin and log-linear cases, our bounds suggest that the online EG algorithm requires a factor of n less computation to reach a desired accuracy than the batch EG algorithm, where n is the number of training examples. Our experiments confirm that the online algorithms are much faster than the batch algorithms in practice. We describe how the EG updates factor in a convenient way for structured prediction problems, allowing the algorithms to be efficiently applied to problems such as sequence learning or natural language parsing. We perform extensive evaluation of the algorithms, comparing them to L-BFGS and stochastic gradient descent for log-linear models, and to SVM-Struct for max-margin models. The algorithms are applied to a multi-class problem as well as to a more complex large-scale parsing task. In all these settings, the EG algorithms presented here outperform the other methods.

Optimal strategies and minimax lower bounds for online convex games

A number of learning problems can be cast as an Online Convex Game: on each round, a learner makes a prediction x from a convex set, the environment plays a loss function f, and the learner’s long-term goal is to minimize regret. Algorithms have been proposed by Zinkevich, when f is assumed to be convex, and Hazan et al., when f is assumed to be strongly convex, that have provably low regret. We consider these two settings and analyze such games from a minimax perspective, proving minimax strategies and lower bounds in each case. These results prove that the existing algorithms are essentially optimal.

Non-redundant sequential association rule mining based on closed sequential patterns

In many applications, e.g., bioinformatics, web access traces, system utilisation logs, etc., the data is naturally in the form of sequences. People have taken great interest in analysing the sequential data and finding the inherent characteristics or relationships within the data. Sequential association rule mining is one of the possible methods used to analyse this data. As conventional sequential association rule mining very often generates a huge number of association rules, of which many are redundant, it is desirable to find a solution to get rid of those unnecessary association rules. Because of the complexity and temporal ordered characteristics of sequential data, current research on sequential association rule mining is limited. Although several sequential association rule prediction models using either sequence constraints or temporal constraints have been proposed, none of them considered the redundancy problem in rule mining. The main contribution of this research is to propose a non-redundant association rule mining method based on closed frequent sequences and minimal sequential generators. We also give a definition for the non-redundant sequential rules, which are sequential rules with minimal antecedents but maximal consequents. A new algorithm called CSGM (closed sequential and generator mining) for generating closed sequences and minimal sequential generators is also introduced. A further experiment has been done to compare the performance of generating non-redundant sequential rules and full sequential rules, meanwhile, performance evaluation of our CSGM and other closed sequential pattern mining or generator mining algorithms has also been conducted. We also use generated non-redundant sequential rules for query expansion in order to improve recommendations for infrequently purchased products.

The borders that law sets on entertainment

It is natural for those involved in entertainment to focus on the art. However, like any activity in even a free society, those involved in entertainment industries must operate within borders set by the law. This article examines the main areas of law that impact entertainment in an Australian context. It contrasts the position in relation to freedom of expression in Australia with that in the United States, which also promotes freedom of expression in a free society. It then briefly canvases the main limits on entertainment productions under Australian law.

Demonstration of closed-­loop airborne sense-­and-­avoid using machine vision

This paper describes a vision-based airborne collision avoidance system developed by the Australian Research Centre for Aerospace Automation (ARCAA) under its Dynamic Sense-and-Act (DSA) program. We outline the system architecture and the flight testing undertaken to validate the system performance under realistic collision course scenarios. The proposed system could be implemented in either manned or unmanned aircraft, and represents a step forward in the development of a “sense-and-avoid” capability equivalent to human “see-and-avoid”.

Heterogeneity in auditory alarm sets makes them easier to learn

The primary objective of the experiments reported here was to demonstrate the effects of opening up the design envelope for auditory alarms on the ability of people to learn the meanings of a set of alarms. Two sets of alarms were tested, one already extant and one newly-designed set for the same set of functions, designed according to a rationale set out by the authors aimed at increasing the heterogeneity of the alarm set and incorporating some well-established principles of alarm design. For both sets of alarms, a similarity-rating experiment was followed by a learning experiment. The results showed that the newly-designed set was judged to be more internally dissimilar, and easier to learn, than the extant set. The design rationale outlined in the paper is useful for design purposes in a variety of practical domains and shows how alarm designers, even at a relatively late stage in the design process, can improve the efficacy of an alarm set.

Integrated approach for HP-LNG pump diagnosis and prognostics based on health state probability estimation

This paper presents an innovative prognostics model based on health state probability estimation embedded in the closed loop diagnostic and prognostic system. To employ an appropriate classifier for health state probability estimation in the proposed prognostic model, the comparative intelligent diagnostic tests were conducted using five different classifiers applied to the progressive fault levels of three faults in HP-LNG pump. Two sets of impeller-rubbing data were employed for the prediction of pump remnant life based on estimation of discrete health state probability using an outstanding capability of SVM and a feature selection technique. The results obtained were very encouraging and showed that the proposed prognosis system has the potential to be used as an estimation tool for machine remnant life prediction in real life industrial applications.

Probabilistic matching of image sets for video-based face recognition

We address the problem of face recognition on video by employing the recently proposed probabilistic linear discrimi-nant analysis (PLDA). The PLDA has been shown to be robust against pose and expression in image-based face recognition. In this research, the method is extended and applied to video where image set to image set matching is performed. We investigate two approaches of computing similarities between image sets using the PLDA: the closest pair approach and the holistic sets approach. To better model face appearances in video, we also propose the heteroscedastic version of the PLDA which learns the within-class covariance of each individual separately. Our experi-ments on the VidTIMIT and Honda datasets show that the combination of the heteroscedastic PLDA and the closest pair approach achieves the best performance.

Phylogeography of Echinocladius martini Cranston (Diptera: Chironomidae) in closed forest streams of eastern Australia

The eastern Australian rainforests have experienced several cycles of range contraction and expansion since the late Miocene that are closely correlated with global glaciation events. Together with ongoing aridification of the continent, this has resulted in current distributions of native closed forest that are highly fragmented along the east coast. Several closed forest endemic taxa exhibit patterns of population genetic structure that are congruent with historical isolation of populations in discrete refugia and reflect evolutionary histories dramatically affected by vicariance. Currently, limited data are available regarding the impact of these past climatic fluctuations on freshwater invertebrate taxa. The non-biting midge species Echinocladius martini Cranston is distributed along the east coast and inhabits predominantly montane streams in closed forest habitat. Phylogeographic structure in E. martini was resolved here at a continental scale by incorporating data from a previous pilot study and expanding the sampling design to encompass populations in the Wet Tropics of north-eastern Queensland, south-east Queensland, New South Wales and Victoria. Patterns of phylogeographic structure revealed several deeply divergent mitochondrial lineages from central and south-eastern Australia that were previously unrecognised and were geographically endemic to closed forest refugia. Estimated divergence times were congruent with late Miocene onset of rainforest contractions across the east coast of Australia. This suggested that dispersal and gene flow among E. martini populations isolated in refugia has been highly restricted historically. Moreover, these data imply, in contrast to existing preconceptions about freshwater invertebrates, that this taxon may be acutely susceptible to habitat fragmentation.

Closed system isolation and scalable expansion of human placental mesenchymal stem cells

Mesenchymal stem cells (MSC) are emerging as a leading cellular therapy for a number of diseases. However, for such treatments to become available as a routine therapeutic option, efficient and cost-effective means for industrial manufacture of MSC are required. At present, clinical grade MSC are manufactured through a process of manual cell culture in specialized cGMP facilities. This process is open, extremely labor intensive, costly, and impractical for anything more than a small number of patients. While it has been shown that MSC can be cultivated in stirred bioreactor systems using microcarriers, providing a route to process scale-up, the degree of numerical expansion achieved has generally been limited. Furthermore, little attention has been given to the issue of primary cell isolation from complex tissues such as placenta. In this article we describe the initial development of a closed process for bulk isolation of MSC from human placenta, and subsequent cultivation on microcarriers in scalable single-use bioreactor systems. Based on our initial data, we estimate that a single placenta may be sufficient to produce over 7,000 doses of therapeutic MSC using a large-scale process.

End-expiratory lung volume recovers more slowly after closed endotracheal suctioning than after open suctioning : a randomized crossover study

Purpose Endotracheal suctioning causes significant lung derecruitment. Closed suction (CS) minimizes lung volume loss during suction, and therefore, volumes are presumed to recover more quickly postsuctioning. Conflicting evidence exists regarding this. We examined the effects of open suction (OS) and CS on lung volume loss during suctioning, and recovery of end-expiratory lung volume (EELV) up to 30 minutes postsuction. Material and Methods Randomized crossover study examining 20 patients postcardiac surgery. CS and OS were performed in random order, 30 minutes apart. Lung impedance was measured during suction, and end-expiratory lung impedance was measured at baseline and postsuctioning using electrical impedance tomography. Oximetry, partial pressure of oxygen in the alveoli/fraction of inspired oxygen ratio and compliance were collected. Results Reductions in lung impedance during suctioning were less for CS than for OS (mean difference, − 905 impedance units; 95% confidence interval [CI], − 1234 to –587; P < .001). However, at all points postsuctioning, EELV recovered more slowly after CS than after OS. There were no statistically significant differences in the other respiratory parameters. Conclusions Closed suctioning minimized lung volume loss during suctioning but, counterintuitively, resulted in slower recovery of EELV postsuction compared with OS. Therefore, the use of CS cannot be assumed to be protective of lung volumes postsuctioning. Consideration should be given to restoring EELV after either suction method via a recruitment maneuver.