Sciweavers

541 search results - page 10 / 109
» An Efficient Algorithm for the Longest Pattern Subsequence P...
Sort
View
ICDM
2005
IEEE
271views Data Mining» more  ICDM 2005»
14 years 2 months ago
HOT SAX: Efficiently Finding the Most Unusual Time Series Subsequence
In this work, we introduce the new problem of finding time series discords. Time series discords are subsequences of a longer time series that are maximally different to all the r...
Eamonn J. Keogh, Jessica Lin, Ada Wai-Chee Fu
PAKDD
2010
ACM
208views Data Mining» more  PAKDD 2010»
13 years 10 months ago
Efficient Pattern Mining of Uncertain Data with Sampling
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
Toon Calders, Calin Garboni, Bart Goethals
KDD
1999
ACM
117views Data Mining» more  KDD 1999»
14 years 1 months ago
Identifying Distinctive Subsequences in Multivariate Time Series by Clustering
Most time series comparison algorithms attempt to discover what the members of a set of time series have in common. We investigate a di erent problem, determining what distinguish...
Tim Oates
HICSS
2006
IEEE
138views Biometrics» more  HICSS 2006»
14 years 2 months ago
An Efficient Algorithm for Real-Time Frequent Pattern Mining for Real-Time Business Intelligence Analytics
Finding frequent patterns from databases has been the most time consuming process in data mining tasks, like association rule mining. Frequent pattern mining in real-time is of in...
Rajanish Dass, Ambuj Mahanti
CSB
2003
IEEE
108views Bioinformatics» more  CSB 2003»
14 years 2 months ago
A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide mo...
Ravi Vijaya Satya, Amar Mukherjee, Udaykumar Ranga