-
3
-
-
85026780237
-
Proximity matching using fi xed-queries trees
-
R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fi xed-queries trees. In Proc. of the 5th Symposium on Combinatorial Pattern Matching, pages 198-212, 1994.
-
(1994)
Proc. of the 5th Symposium on Combinatorial Pattern Matching
, pp. 198-212
-
-
Baeza-Yates, R.1
Cunto, W.2
Manber, U.3
Wu, S.4
-
5
-
-
84947205653
-
When is 'nearest neighbor meaningful?
-
K. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft. When is 'nearest neighbor" meaningful? In Proc. of the 7th Intl. Conf. on Database Theory, volume 1540, pages 217-235, 1999.
-
(1999)
Proc. of the 7th Intl. Conf. on Database Theory
, vol.1540
, pp. 217-235
-
-
Beyer, K.1
Goldstein, J.2
Ramakrishnan, R.3
Shaft, U.4
-
7
-
-
0035044660
-
Multiple similarity queries: A basic DBMS operation for mining in metric databases
-
B. Braunmuller, M. Ester, H.-P. Kriegel, and J. Sander. Multiple similarity queries: A basic DBMS operation for mining in metric databases. IEEE Transactions on Knowledge and Data Engineering, 13(1):79-95, 2001.
-
(2001)
IEEE Transactions on Knowledge and Data Engineering
, vol.13
, Issue.1
, pp. 79-95
-
-
Braunmuller, B.1
Ester, M.2
Kriegel, H.-P.3
Sander, J.4
-
8
-
-
0015531930
-
Some approaches to best-match fi le searching
-
W. A. Burkhard and R. M. Keller. Some approaches to best-match fi le searching. Communications of the ACM, 16(4):230-236, 1973.
-
(1973)
Communications of the ACM
, vol.16
, Issue.4
, pp. 230-236
-
-
Burkhard, W.A.1
Keller, R.M.2
-
9
-
-
0041339760
-
Pivot selection techniques for proximity searching in metric spaces
-
B. Bustos, G. Navarro, and E. Chavez. Pivot selection techniques for proximity searching in metric spaces. In Pattern Recognition Letters, volume 24, pages 2357-2366, 2003.
-
(2003)
Pattern Recognition Letters
, vol.24
, pp. 2357-2366
-
-
Bustos, B.1
Navarro, G.2
Chavez, E.3
-
10
-
-
0345043999
-
Searching in metric spaces
-
E. Chvez, G. Navarro, R. Baeza-Yates, and J. L. Marroqun. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, 2001.
-
(2001)
ACM Computing Surveys
, vol.33
, Issue.3
, pp. 273-321
-
-
Chvez, E.1
Navarro, G.2
Baeza-Yates, R.3
Marroqun, J.L.4
-
12
-
-
85170282443
-
A density-based algorithm for discovering clusters in large spatial databases with noise
-
M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proc. of the 2nd Intl. Conf. on Knowledge Discovery and Data Mining, pages 226-231, 1996.
-
(1996)
Proc. of the 2nd Intl. Conf. on Knowledge Discovery and Data Mining
, pp. 226-231
-
-
Ester, M.1
Kriegel, H.-P.2
Sander, J.3
Xu, X.4
-
13
-
-
0034998378
-
-
R. S. Filho, A. Traina, C. T. Jr., and C. Faloutsos. Similarity search without tears: The OMNI family of all-purpose access methods. In Proc. of the 17th IEEE Intl. Conf. on Data Engineering, pages 623-630, 2001.
-
R. S. Filho, A. Traina, C. T. Jr., and C. Faloutsos. Similarity search without tears: The OMNI family of all-purpose access methods. In Proc. of the 17th IEEE Intl. Conf. on Data Engineering, pages 623-630, 2001.
-
-
-
-
16
-
-
0036509731
-
-
C. T. Jr., A. Traina, C. Faloutsos, and B. Seeger. Fast indexing and visualization for metric data sets using slim-trees. IEEE Transactions on Knowledge and Data Engineering, 14(2):244-260, 2002.
-
C. T. Jr., A. Traina, C. Faloutsos, and B. Seeger. Fast indexing and visualization for metric data sets using slim-trees. IEEE Transactions on Knowledge and Data Engineering, 14(2):244-260, 2002.
-
-
-
-
18
-
-
0036649291
-
Clindex: Approximate similarity queries in high-dimensional spaces
-
C. Li, E. Chang, H. Garcia-Molina, and G. Wiederhold. Clindex: Approximate similarity queries in high-dimensional spaces. IEEE Transactions on Knowledge and Data Engineering, 14(4):792-808, 2002.
-
(2002)
IEEE Transactions on Knowledge and Data Engineering
, vol.14
, Issue.4
, pp. 792-808
-
-
Li, C.1
Chang, E.2
Garcia-Molina, H.3
Wiederhold, G.4
-
21
-
-
0344775426
-
The A-tree: An index structure for high-dimensional spaces using relative approximation
-
Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In Proc. of the 26th Intl. Conf. on Very Large Data Bases, pages 516-526, 2000.
-
(2000)
Proc. of the 26th Intl. Conf. on Very Large Data Bases
, pp. 516-526
-
-
Sakurai, Y.1
Yoshikawa, M.2
Uemura, S.3
Kojima, H.4
-
23
-
-
0000681228
-
A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
-
R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In Proc. of the 24th Intl. Conf. on Very Large Databases, pages 194-205, 1998.
-
(1998)
Proc. of the 24th Intl. Conf. on Very Large Databases
, pp. 194-205
-
-
Weber, R.1
Schek, H.-J.2
Blott, S.3
|