Sciweavers

349 search results - page 7 / 70
» Online Data Mining for Co-Evolving Time Sequences
Sort
View
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
13 years 11 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh
BMCBI
2010
155views more  BMCBI 2010»
13 years 7 months ago
BISMA - Fast and accurate bisulfite sequencing data analysis of individual clones from unique and repetitive sequences
Background: Bisulfite sequencing is a popular method to analyze DNA methylation patterns at high resolution. A region of interest is targeted by PCR and about 20-50 subcloned DNA ...
Christian Rohde, Yingying Zhang, Richard Reinhardt...
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 7 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
DAWAK
2004
Springer
14 years 23 days ago
Mining Maximal Frequently Changing Subtree Patterns from XML Documents
Abstract. Due to the dynamic nature of online information, XML documents typically evolve over time. The change of the data values or structures of an XML document may exhibit some...
Ling Chen 0002, Sourav S. Bhowmick, Liang-Tien Chi...
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
13 years 11 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda