Sciweavers

24 search results - page 1 / 5
» Similarity Search in Arbitrary Subspaces Under Lp-Norm
Sort
View
ICDE
2008
IEEE
117views Database» more  ICDE 2008»
14 years 5 months ago
Similarity Search in Arbitrary Subspaces Under Lp-Norm
Similarity search has been widely used in many applications such as information retrieval, image data analysis, and time-series matching. Specifically, a similarity query retrieves...
Xiang Lian, Lei Chen 0002
VLDB
2000
ACM
121views Database» more  VLDB 2000»
13 years 8 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
2005
ACM
137views Data Mining» more  KDD 2005»
14 years 5 months ago
Pattern-based similarity search for microarray data
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
Haixun Wang, Jian Pei, Philip S. Yu
SSDBM
2010
IEEE
117views Database» more  SSDBM 2010»
13 years 9 months ago
Subspace Similarity Search: Efficient k-NN Queries in Arbitrary Subspaces
There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, only. Wh...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
ICDE
2010
IEEE
157views Database» more  ICDE 2010»
13 years 4 months ago
Subspace similarity search using the ideas of ranking and top-k retrieval
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...