메뉴 건너뛰기




Volumn 30, Issue 9, 2008, Pages 1647-1658

Effective proximity retrieval by ordering permutations

Author keywords

Indexing methods; Information search and retrieval; Metric spaces; Pattern recognition; Similarity searching

Indexed keywords

EXPERIMENTS; FEATURE EXTRACTION; LEARNING ALGORITHMS; PATTERN RECOGNITION; SET THEORY; TOPOLOGY;

EID: 48049111835     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2007.70815     Document Type: Article
Times cited : (171)

References (44)
  • 1
    • 0040154165 scopus 로고    scopus 로고
    • Re-Designing Distance Functions and Distance-Based Applications for High Dimensional Data
    • C. Aggarwal, "Re-Designing Distance Functions and Distance-Based Applications for High Dimensional Data," ACM SIGMOD, vol. 30, no. 1, pp. 13-18, 2001.
    • (2001) ACM SIGMOD , vol.30 , Issue.1 , pp. 13-18
    • Aggarwal, C.1
  • 3
    • 0004931376 scopus 로고    scopus 로고
    • Efficient Algorithms for Normalized Edit Distance
    • A. Arslan and O. Egecioglu, "Efficient Algorithms for Normalized Edit Distance," J. Discrete Algorithms, vol. 1, no. 1, pp. 3-20, 2000.
    • (2000) J. Discrete Algorithms , vol.1 , Issue.1 , pp. 3-20
    • Arslan, A.1    Egecioglu, O.2
  • 7
    • 0016557674 scopus 로고
    • Moltidimensional Binary Search Trees Used for Associative Searching
    • J. Bentley, "Moltidimensional Binary Search Trees Used for Associative Searching," Comm. ACM, vol. 18, no. 9, pp. 509-517, 1975.
    • (1975) Comm. ACM , vol.18 , Issue.9 , pp. 509-517
    • Bentley, J.1
  • 8
    • 0002162263 scopus 로고
    • Near Neighbor Search in Large Metric Spaces
    • S. Brin, "Near Neighbor Search in Large Metric Spaces," Proc. 21st Very Large Databases, pp. 574-584, 1995.
    • (1995) Proc. 21st Very Large Databases , pp. 574-584
    • Brin, S.1
  • 9
    • 0015531930 scopus 로고
    • Some Approaches to Best-Match File Searching
    • W. Burkhard and R. Keller, "Some Approaches to Best-Match File Searching," Comm. ACM, vol. 16, no. 4, pp. 230-236, 1973.
    • (1973) Comm. ACM , vol.16 , Issue.4 , pp. 230-236
    • Burkhard, W.1    Keller, R.2
  • 10
    • 10644227003 scopus 로고    scopus 로고
    • Probabilistic Proximity Search Algorithms Based on Compact Partitions
    • B. Bustos and G. Navarro, "Probabilistic Proximity Search Algorithms Based on Compact Partitions," J. Discrete Algorithms, Vol. 2, no. 1, pp. 115-134, 2003.
    • (2003) J. Discrete Algorithms , vol.2 , Issue.1 , pp. 115-134
    • Bustos, B.1    Navarro, G.2
  • 13
    • 0035366856 scopus 로고    scopus 로고
    • Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching
    • E. Chávez, J.L. Marroquin, and G. Navarro, "Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching," Multimedia Tools and Applications, vol. 14, no. 2, pp. 113-135, 2001.
    • (2001) Multimedia Tools and Applications , vol.14 , Issue.2 , pp. 113-135
    • Chávez, E.1    Marroquin, J.L.2    Navarro, G.3
  • 14
    • 0037448286 scopus 로고    scopus 로고
    • Probabilistic Proximity Search: Fighting the Curse of Dimensionality in Metric Spaces
    • F. Chávez and G. Navarro, "Probabilistic Proximity Search: Fighting the Curse of Dimensionality in Metric Spaces," Information Processing Letters, vol. 85, no. 1, pp. 39-46, 2003.
    • (2003) Information Processing Letters , vol.85 , Issue.1 , pp. 39-46
    • Chávez, F.1    Navarro, G.2
  • 15
    • 18444400570 scopus 로고    scopus 로고
    • A Compact Space Decomposition for Effective Metric Indexing
    • E. Chávez and G. Navarro, "A Compact Space Decomposition for Effective Metric Indexing," Pattern Recognition Letters, vol. 26, no. 9, pp. 1363-1376, 2005.
    • (2005) Pattern Recognition Letters , vol.26 , Issue.9 , pp. 1363-1376
    • Chávez, E.1    Navarro, G.2
  • 17
    • 0033906160 scopus 로고    scopus 로고
    • PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces
    • P. Ciaccia and M. Patella, "PAC Nearest Neighbor Queries: Approximate and Controlled Search in High-Dimensional and Metric Spaces," Proc. 16th Int'l Conf. Data Eng., pp. 244-255, 2000.
    • (2000) Proc. 16th Int'l Conf. Data Eng , pp. 244-255
    • Ciaccia, P.1    Patella, M.2
  • 18
    • 33745602932 scopus 로고    scopus 로고
    • Searching in Metric Spaces with User-Defined and Approximate Distances
    • P. Ciaccia and M. Patella, "Searching in Metric Spaces with User-Defined and Approximate Distances," ACM Trans. Database Systems vol. 27, no. 4, pp. 398-437, 2002.
    • (2002) ACM Trans. Database Systems , vol.27 , Issue.4 , pp. 398-437
    • Ciaccia, P.1    Patella, M.2
  • 19
    • 84993661659 scopus 로고    scopus 로고
    • M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces
    • P. Ciaccia, M. Patella, and P. Zezula, "M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces," Proc. 23rd Conf. Very Large Databases, pp. 426-435, 1997.
    • (1997) Proc. 23rd Conf. Very Large Databases , pp. 426-435
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 20
    • 0033453107 scopus 로고    scopus 로고
    • Nearest Neighbor Queries in Metric Spaces
    • K. Clarkson, "Nearest Neighbor Queries in Metric Spaces," Discrete Computational Geometry, vol. 22, no. 1, pp. 63-93, 1999.
    • (1999) Discrete Computational Geometry , vol.22 , Issue.1 , pp. 63-93
    • Clarkson, K.1
  • 26
    • 48049123405 scopus 로고    scopus 로고
    • D. Harman, Overview of the Third Text REtrieval Conf., Proc. Third Text REtrieval Conf., NIST Special Publication 500-2, pp. 1-19, 1995.
    • D. Harman, "Overview of the Third Text REtrieval Conf.," Proc. Third Text REtrieval Conf., NIST Special Publication 500-2, pp. 1-19, 1995.
  • 27
    • 0041664272 scopus 로고    scopus 로고
    • Index-Driven Similarity Search in Metric Spaces
    • G. Hjaltason and H. Samet, "Index-Driven Similarity Search in Metric Spaces," ACM Trans. Database Systems, vol. 28, no. 4, pp. 517-580, 2003.
    • (2003) ACM Trans. Database Systems , vol.28 , Issue.4 , pp. 517-580
    • Hjaltason, G.1    Samet, H.2
  • 28
    • 24644475201 scopus 로고    scopus 로고
    • Fractional Distance Measures for Content-Based Image Retrieval
    • P. Howarth and S. Rüger, "Fractional Distance Measures for Content-Based Image Retrieval," Proc. 27th European Conf. IR Research, pp. 447-456, 2005.
    • (2005) Proc. 27th European Conf. IR Research , pp. 447-456
    • Howarth, P.1    Rüger, S.2
  • 29
    • 0020428412 scopus 로고
    • Computational Geometric Problems in Pattern Recognition
    • Pattern Recognition Theory and Applications, O.J. Kittler, ed
    • G.T. Toussaint, "Computational Geometric Problems in Pattern Recognition," Pattern Recognition Theory and Applications, O.J. Kittler, ed., NATO ASTI series, 1981.
    • (1981) NATO ASTI series
    • Toussaint, G.T.1
  • 30
    • 0020824191 scopus 로고
    • A Data Structure and an Algorithm for the Nearest Point Problen
    • I. Kalantari and G. McDonald, "A Data Structure and an Algorithm for the Nearest Point Problen" IEEE Trans. Software Eng., vol. 9, no. 5, 1983.
    • (1983) IEEE Trans. Software Eng , vol.9 , Issue.5
    • Kalantari, I.1    McDonald, G.2
  • 31
    • 0027657540 scopus 로고
    • Computation of Normalized Edit Distance and Applications
    • Sept
    • A. Marzal and E. Vidal, "Computation of Normalized Edit Distance and Applications," IEEE Trans. Pattern Analysis and Machine Intelligence vol. 15, no. 9. pp. 926-932, Sept. 1993.
    • (1993) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.15 , Issue.9 , pp. 926-932
    • Marzal, A.1    Vidal, E.2
  • 32
    • 0003159276 scopus 로고
    • A New Version of the Nearest-Neighbor Approximating and Eliminating Search (AESA) with Linear Preprocessing-Time and Memory Requirements
    • L. Micó, J. Oncina, and E. Vidal, "A New Version of the Nearest-Neighbor Approximating and Eliminating Search (AESA) with Linear Preprocessing-Time and Memory Requirements," Pattern Recognition Letters, vol. 15, pp. 9-17, 1994.
    • (1994) Pattern Recognition Letters , vol.15 , pp. 9-17
    • Micó, L.1    Oncina, J.2    Vidal, E.3
  • 33
    • 0036706560 scopus 로고    scopus 로고
    • Searching in Metric Spaces by Spatial Approximation
    • G. Navarro, "Searching in Metric Spaces by Spatial Approximation," Very Large Databases J., vol. 11, no. 1, pp. 28-46, 2002.
    • (2002) Very Large Databases J , vol.11 , Issue.1 , pp. 28-46
    • Navarro, G.1
  • 37
    • 0032045780 scopus 로고    scopus 로고
    • The FERET Database and Evaluation Procedure for Face Recognition Algorithms
    • P. Phillips, H. Wechsler, J. Huang, and P. Rauss, "The FERET Database and Evaluation Procedure for Face Recognition Algorithms," Image and Vision Computing J., vol. 16, no. 5, pp. 295-306, 1998.
    • (1998) Image and Vision Computing J , vol.16 , Issue.5 , pp. 295-306
    • Phillips, P.1    Wechsler, H.2    Huang, J.3    Rauss, P.4
  • 39
    • 33745601374 scopus 로고    scopus 로고
    • On Fast Non-Metric Similarity Search by Metric Access Methods
    • T. Skopal, "On Fast Non-Metric Similarity Search by Metric Access Methods," Proc. Int'l Conf. Extending Database Technology, pp. 718-736, 2006.
    • (2006) Proc. Int'l Conf. Extending Database Technology , pp. 718-736
    • Skopal, T.1
  • 40
    • 0022858293 scopus 로고
    • An Algorithm for Finding Nearest Neighbors in (Approximately) Constant Average Time
    • E. Vidal, "An Algorithm for Finding Nearest Neighbors in (Approximately) Constant Average Time," Pattern Recognition Letters vol. 4. pp. 145-157, 1986.
    • (1986) Pattern Recognition Letters , vol.4 , pp. 145-157
    • Vidal, E.1
  • 41
    • 0003981696 scopus 로고    scopus 로고
    • Algorithms and Strategies for Similarity Retrieval,
    • Technical Report VCL-96-101, Visual Computing Laboratory, Univ. of California San Diego, July
    • D. White and R. Jain, "Algorithms and Strategies for Similarity Retrieval," Technical Report VCL-96-101, Visual Computing Laboratory, Univ. of California San Diego, July 1996.
    • (1996)
    • White, D.1    Jain, R.2
  • 42
    • 48049111935 scopus 로고    scopus 로고
    • P. Yianilos, Excluded Middle Vantage Point Forests for Nearest Neighbor Search, DIMACS Implementation Challenge, Proc. Int'l Workshop Algorithm Eng. and Experimentation, 1999.
    • P. Yianilos, "Excluded Middle Vantage Point Forests for Nearest Neighbor Search," DIMACS Implementation Challenge, Proc. Int'l Workshop Algorithm Eng. and Experimentation, 1999.
  • 43
    • 4243289916 scopus 로고    scopus 로고
    • Locally Lifting the Curse of Dimensionality for Nearest Neighbor Search,
    • NEC Research Inst, June
    • P.N. Yianilos, "Locally Lifting the Curse of Dimensionality for Nearest Neighbor Search," technical report, NEC Research Inst., June 1999.
    • (1999) technical report
    • Yianilos, P.N.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.