Sciweavers

662 search results - page 1 / 133
» Approximate Queries and Representations for Large Data Seque...
Sort
View
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
14 years 6 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 4 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,...
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 4 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
DBVIS
1993
101views Database» more  DBVIS 1993»
13 years 8 months ago
Using Visualization to Support Data Mining of Large Existing Databases
In this paper, we present ideas how visualization technology can be used to improve the difficult process of querying very large databases. With our VisDB system, we try to provid...
Daniel A. Keim, Hans-Peter Kriegel
KDD
1999
ACM
206views Data Mining» more  KDD 1999»
13 years 9 months ago
Compressed Data Cubes for OLAP Aggregate Query Approximation on Continuous Dimensions
Efficiently answering decision support queries is an important problem. Most of the work in this direction has been in the context of the data cube. Queries are efficiently answer...
Jayavel Shanmugasundaram, Usama M. Fayyad, Paul S....