Sciweavers

337 search results - page 38 / 68
» Data Compression and Harmonic Analysis
Sort
View
MP
2010
162views more  MP 2010»
13 years 7 months ago
Approximation accuracy, gradient methods, and error bound for structured convex optimization
Convex optimization problems arising in applications, possibly as approximations of intractable problems, are often structured and large scale. When the data are noisy, it is of i...
Paul Tseng
RAID
1999
Springer
14 years 28 days ago
Audit logs: to keep or not to keep?
We approached this line of inquiry by questioning the conventional wisdom that audit logs are too large to be analyzed and must be reduced and filtered before the data can be anal...
Christopher Wee
SIGMOD
2004
ACM
140views Database» more  SIGMOD 2004»
14 years 8 months ago
Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering
Mining informative patterns from very large, dynamically changing databases poses numerous interesting challenges. Data summarizations (e.g., data bubbles) have been proposed to c...
Corrine Cheng, Jörg Sander, Samer Nassar
DATAMINE
2008
137views more  DATAMINE 2008»
13 years 8 months ago
Two heads better than one: pattern discovery in time-evolving multi-aspect data
Abstract. Data stream values are often associated with multiple aspects. For example, each value observed at a given time-stamp from environmental sensors may have an associated ty...
Jimeng Sun, Charalampos E. Tsourakakis, Evan Hoke,...
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 8 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,...