Sciweavers

CIKM
2006
Springer
13 years 5 months ago
Efficient range-constrained similarity search on wavelet synopses over multiple streams
Due to the resource limitation in the data stream environment, it has been reported that answering user queries according to the wavelet synopsis of a stream is an essential abili...
Hao-Ping Hung, Ming-Syan Chen
VLDB
2000
ACM
121views Database» more  VLDB 2000»
13 years 7 months ago
Fast Time Sequence Indexing for Arbitrary Lp Norms
Fast indexing in time sequence databases for similarity searching has attracted a lot of research recently. Most of the proposals, however, typically centered around the Euclidean...
Byoung-Kee Yi, Christos Faloutsos
KDD
2000
ACM
168views Data Mining» more  KDD 2000»
13 years 7 months ago
Scaling up dynamic time warping for datamining applications
There has been much recent interest in adapting data mining algorithms to time series databases. Most of these algorithms need to compare time series. Typically some variation of ...
Eamonn J. Keogh, Michael J. Pazzani
IPPS
1996
IEEE
13 years 7 months ago
The Chessboard Distance Transform and the Medial Axis Transform are Interchangeable
The distance transform (DT) and the medial axis transform (MAT) are two image computation tools used to extract the information about the shape and the position of the foreground ...
Yu-Hua Lee, Shi-Jinn Horng
SIGIR
1999
ACM
13 years 8 months ago
Relevance Feedback Retrieval of Time Series Data
There has been much recent interest in retrieval of time series data. Earlier work has used a fixed similarity metric (e.g., Euclidean distance) to determine the similarity betwee...
Eamonn J. Keogh, Michael J. Pazzani
IDA
2009
Springer
13 years 8 months ago
Compensation of Translational Displacement in Time Series Clustering Using Cross Correlation
Although k-means clustering is often applied to time series clustering, the underlying Euclidean distance measure is very restrictive in comparison to the human perception of time ...
Frank Höppner, Frank Klawonn
COMPGEOM
2003
ACM
13 years 9 months ago
High-dimensional shape fitting in linear time
Let P be a set of n points in Rd. The radius of a k-dimensional flat F with respect to P, denoted by RD(F, P), is defined to be maxp∈P dist(F, p), where dist(F, p) denotes the...
Sariel Har-Peled, Kasturi R. Varadarajan
VLDB
2004
ACM
186views Database» more  VLDB 2004»
13 years 9 months ago
Indexing Large Human-Motion Databases
Data-driven animation has become the industry standard for computer games and many animated movies and special effects. In particular, motion capture data recorded from live actor...
Eamonn J. Keogh, Themis Palpanas, Victor B. Zordan...
PKDD
2005
Springer
131views Data Mining» more  PKDD 2005»
13 years 9 months ago
ISOLLE: Locally Linear Embedding with Geodesic Distance
Locally Linear Embedding (LLE) has recently been proposed as a method for dimensional reduction of high-dimensional nonlinear data sets. In LLE each data point is reconstructed fro...
Claudio Varini, Andreas Degenhard, Tim W. Nattkemp...
SIGMOD
2005
ACM
113views Database» more  SIGMOD 2005»
13 years 9 months ago
Robust and Fast Similarity Search for Moving Object Trajectories
An important consideration in similarity-based retrieval of moving object trajectories is the definition of a distance function. The existing distance functions are usually sensi...
Lei Chen 0002, M. Tamer Özsu, Vincent Oria