Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for ...
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
The ranking problem appears in many areas of study such as customer rating, social science, economics, and information retrieval. Ranking can be formulated as a classification pro...
Flip zooming is a novel focus+context technique for visualizing large data sets. It offers an overview of the data, and gives users instant access to any part. Originally develope...
Background: Processing raw DNA sequence data is an especially challenging task for relatively small laboratories and core facilities that produce as many as 5000 or more DNA seque...
Chun Liang, Feng Sun, Haiming Wang, Junfeng Qu, Ro...