Adding learning to cellular genetic algorithms for training recurrent neural networks

Version of RecordPublishe

A study of the Lamarckian evolution of recurrent neural networks

Version of RecordPublishe

Articulatory-feature based sequence kernel for high-level speaker verification

Research has shown that articulatory feature-based phonetic-class pronunciation models (AFCPMs) can capture the pronunciation characteristics of speakers. However, the scoring method used in AFCPMs does not explicitly use the discriminative information available in the training data. To harness this information, this paper proposes converting speaker models to supervectors by stacking the discrete densities in AFCPMs. An AF-kernel is constructed from the supervectors of target speakers, background speakers, and claimants. An AF-kernel based SVM is then trained to classify the super-vectors. Results show that AF-kernel scoring is complementary to likelihood-ratio scoring, leading to better performance when the two scoring methods are combined.Department of Electronic and Information EngineeringRefereed conference pape

Speaker verification with a priori threshold determination using kernel-based probabilistic neural networks

Department of Electronic and Information EngineeringRefereed conference pape

mGOASVM : multi-label protein subcellular localization based on gene ontology and support vector machines

2012-2013 > Academic research: refereed > Publication in refereed journalVersion of RecordPublishe

Speeding up subcellular localization by extracting informative regions of protein sequences for profile alignment

The functions of proteins are closely related to their subcellular locations. In the post-proteomics era, the amount of gene and protein data grows exponentially, which necessitates the prediction of subcellular localization by computational means. This paper proposes mitigating the computation burden of alignment-based approaches to subcellular localization prediction by using the information provided by the N-terminal sorting signals. To this end, a cascaded fusion of cleavage site prediction and profile alignment is proposed. Specifically, the informative segments of protein sequences are identified by a cleavage site predictor. Then, only the informative segments are applied to a homology-based classifier for predicting the subcellular locations. Experimental results on a newly constructed dataset show that the method can make use of the best property of both approaches and can attain an accuracy higher than using the full-length sequences. Moreover, the method can reduce the computation time by 20 folds. We advocate that the method will be important for biologists to conduct large-scale protein annotation or for bioinformaticians to perform preliminary investigations on new algorithms that involve pairwise alignments.Department of Electronic and Information EngineeringRefereed conference pape

On Being Negative

This paper investigates the pragmatic expressions of negative evaluation (negativity) in two corpora: (i) comments posted online in response to newspaper opinion articles; and (ii) online reviews of movies, books and consumer products. We propose a taxonomy of linguistic resources that are deployed in the expression of negativity, with two broad groups at the top level of the taxonomy: resources from the lexicogrammar or from discourse semantics. We propose that rhetorical figures can be considered part of the discourse semantic resources used in the expression of negativity. Using our taxonomy as starting point, we carry out a corpus analysis, and focus on three phenomena: adverb + adjective combinations; rhetorical questions; and rhetorical figures. Although the analysis in this paper is corpus-assisted rather than corpus-driven, the final goal of our research is to make it quantitative, in extracting patterns and resources that can be detected automatically

Constraints on Nucleon Decay via "Invisible" Modes from the Sudbury Neutrino Observatory

Data from the Sudbury Neutrino Observatory have been used to constrain the lifetime for nucleon decay to ``invisible'' modes, such as n -> 3 nu. The analysis was based on a search for gamma-rays from the de-excitation of the residual nucleus that would result from the disappearance of either a proton or neutron from O16. A limit of tau_inv > 2 x 10^{29} years is obtained at 90% confidence for either neutron or proton decay modes. This is about an order of magnitude more stringent than previous constraints on invisible proton decay modes and 400 times more stringent than similar neutron modes.Comment: Update includes missing efficiency factor (limits change by factor of 2) Submitted to Physical Review Letter