8256320
Fast computation with neural oscillators
This paper studies new spike-based models for winner-take-all computation and coincidence detection. In both cases, fast convergence is achieved independent of initial conditions, and network complexity is linear in the number of inputs. Fully distributed versions can be modelled based on groups of interneurons connected through electrical synapses.
2815507
On partial contraction analysis for coupled nonlinear oscillators
We describe a simple yet general method to analyze networks of coupled identical nonlinear oscillators and study applications to fast synchronization, locomotion, and schooling. Specifically, we use nonlinear contraction theory to derive exact and global (rather than linearized) results on synchronization, antisynchronization, and oscillator death. The method can be applied to coupled networks of various structures and arbitrary size. For oscillators with positive definite diffusion coupling, it can be shown that synchronization always occurs globally for strong enough coupling strengths, and an explicit upper bound on the corresponding threshold can be computed through eigenvalue analysis. The discussion also extends to the case when network structure varies abruptly and asynchronously, as in “flocks” of oscillators or dynamic elements.
8724139
News Content Highlight via Fast Caption Text Detection on Compressed Video
Captions present in video frames play an important role in understanding video content. This paper presents a fast algorithm to automatically detect captions in MPEG compressed video. It is based on statistics features of caption text's chrominance components. The paper also discusses its principle and speed-up mechanism in detail. We have successfully exploited the technique to automatically construct the pictorial catalogue, a new content representation. Experiment results show the proposed caption detection algorithm has not only the ideal accuracy 96.6% and recall 100%, but also a detection speed of faster than real time.
36057715
Guest Editors' Introduction: Special Issue on Mining Biological Data
MINING biological data is an emerging area of intersection between data mining and bioinformatics. Bioinformaticians have been working on the research and development of computational methodologies and tools for expanding the use of biological, medical, behavioral, or health-related data. Data mining researchers have been making substantial contribution to the development of models and algorithms to meet challenges posed by the bioinformatics research. Some successful examples are frequent pattern discovery on biological molecules, text mining in biomedical literature, information integration, probabilistic modeling of genome sequences, etc. This special issue of the IEEE Transactions on Knowledge and Data Engineering features a collection of 11 papers, selected from 54 submissions, representing recent advances at the frontier of mining biological data. Mining frequent trees is very useful in bioinformatics applications. The first paper, “Efficiently Mining Frequent Trees in a Forest: Algorithms and Applications” by Mohammed J. Zaki, formulates the problem of mining (embedded) subtrees in a forest of rooted, labeled, and ordered trees. The author presents TreeMiner, a novel algorithm to discover all frequent subtrees in a forest, using a new data structure called scope-list. TreeMiner has been proven to be superior to previous methods such as PatternMatcher and has shown promising results in analyzing RNA structure and phylogenetics data sets. In the second paper, “Frequent Substructure-Based Approaches for Classifying Chemical Compounds” by Mukund Deshpande, Michihiro Kuramochi, Nikil Wale, and George Karypis, the authors devise a substructurebased classification algorithm that decouples the substructure discovery process from the classification model construction and uses frequent subgraph discovery algorithms to find all topological and geometric substructures present in the data set. The advantage of this approach is that, during classification model construction, all relevant substructures are available and thus allow the classifier to intelligently select the most discriminating ones. This approach is employed to build models to correctly assign chemical compounds to various classes of interests, which have many applications in pharmaceutical research and are used extensively at various phases during the drug development process. Glycans, or carbohydrate sugar chains, are regarded as the third class of biological molecules, subsequent to DNA and proteins, and the recent advent of glycome informatics has generated an increasing number of glycan structures and annotation data. Glycans play important roles in the development and functioning of multicellular organisms and their structures can be represented by labeled ordered trees. The third paper, “A Probabilistic Model for Mining Labeled Ordered Trees: Capturing Patterns in Carbohydrate Sugar Chains” byNobuhisaUeda, Kiyoko F. Aoki-Kinoshita, Atsuko Yamaguchi, Tatsuya Akustu, and Hiroshi Mamitsuka, proposes a probabilistic model for mining labeled ordered trees and an EM algorithm for efficient learning. Proteins are the machinery of life. A number of techniques have been developed to classify proteins according to important features in their sequences, secondary structures, or three-dimensional structures. The fourth paper, “Finding Patterns on Protein Surfaces: Algorithms and Applications to Protein Classification” by Xiong Wang, introduces a novel approach to protein classification based on significant geometric patterns on the surface of a protein. The binding in protein-protein interactions exhibits a kind of biochemical stability in cells, which can be described by the mathematical notion of the fixed points. In the fifth paper, “Using Fixed Point Theorems to Model the Binding in Protein-Protein Interactions” by Jinyan Li and Haiquan Li, the authors define a point as a protein motif pair consisting of two traditional protein motifs. They propose a method to discover stable motif pairs of a given function from a large protein interaction sequence data set. With the rapid growth of articles on genomics research, it has become a challenge for biomedical researchers to access this ever-increasing quantity of information to understand the newest discovery of functions of proteins they are studying. To facilitate functional annotation of proteins by utilizing the huge amounts of biomedical literature and transforming the knowledge into easily accessible database formats, the text mining technique thus becomes essential. The sixth paper, “Literature Extraction of Protein Functions Using Sentence Pattern Mining” by Jung-Hsien Chiang and Hsu-Chun Yu, proposes the method of sentence pattern mining to extract protein functions from biomedical literature. Identifying concepts that have already been patented is essential for undertaking new biomedical research. Traditional keyword-based search on patent databases may not be sufficient enough to retrieve all the relevant information, especially for the biomedical domain. The seventh paper, “Information Retrieval and Knowledge Discovery Utilizing a BioMedical Patent Semantic Web” by Sougata Mukherjea, Bhuvan Bamba, and Pankaj Kankar, presents BioPatentMiner, a system that facilitates information retrieval and knowledge discovery from biomedical patents. BioPatentMiner first identifies biological terms IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 17, NO. 8, AUGUST 2005 1019
14240267
Multimedia-Based Interactive Advising Technology for Online Consumer Decision Support
This paper proposes a new method for online consumer decision support: Multimedia-based Interactive Advising (MIA). The method is based on current internet technologies, particularly multimedia, intelligent agent and advising technology. The discussion of the benefits and design of MIA will illuminate particular areas of research and development, with the goal of improving consumers’ choices in e-commerce environments.
3126850
Recent innovations in speech-to-text transcription at SRI-ICSI-UW
We summarize recent progress in automatic speech-to-text transcription at SRI, ICSI, and the University of Washington. The work encompasses all components of speech modeling found in a state-of-the-art recognition system, from acoustic features, to acoustic modeling and adaptation, to language modeling. In the front end, we experimented with nonstandard features, including various measures of voicing, discriminative phone posterior features estimated by multilayer perceptrons, and a novel phone-level macro-averaging for cepstral normalization. Acoustic modeling was improved with combinations of front ends operating at multiple frame rates, as well as by modifications to the standard methods for discriminative Gaussian estimation. We show that acoustic adaptation can be improved by predicting the optimal regression class complexity for a given speaker. Language modeling innovations include the use of a syntax-motivated almost-parsing language model, as well as principled vocabulary-selection techniques. Finally, we address portability issues, such as the use of imperfect training transcripts, and language-specific adjustments required for recognition of Arabic and Mandarin
5167032
AGILE: a general approach to detect transitions in evolving data streams
In many applications such as e-commerce, system diagnosis and telecommunication services, data arrives in streams at a high speed. It is common that the underlying process generating the stream may change over time, either as a result of the fundamental evolution or in response to some external stimulus. Detecting these changes is a very challenging problem of great practical importance. The overall volume of the stream usually far exceeds the available main memory and access to the data stream is typically performed via a linear scan in ascending order of the indices of the records. In this paper, we propose a novel approach, AGILE, to monitor streaming data and to detect distinguishable transitions of the underlying processes. AGILE has many advantages over the traditional Hidden Markov Model, e.g., AGILE only requires one scan of the data.