
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hanan Samet, "KNearest Neighbor Finding Using MaxNearestDist," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 2, pp. 243252, February, 2008.  
BibTex  x  
@article{ 10.1109/TPAMI.2007.1182, author = {Hanan Samet}, title = {KNearest Neighbor Finding Using MaxNearestDist}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {30}, number = {2}, issn = {01628828}, year = {2008}, pages = {243252}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2007.1182}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  KNearest Neighbor Finding Using MaxNearestDist IS  2 SN  01628828 SP243 EP252 EPD  243252 A1  Hanan Samet, PY  2008 KW  knearest neighbors KW  similarity searching KW  metric spaces KW  depthfirst nearest neighbor finding KW  bestfirst nearest neighbor finding VL  30 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] S. Arya, D.M. Mount, N.S. Netanyahu, R. Silverman, and A.Y. Wu, “An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions,” J. ACM, vol. 45, no. 6, pp. 891923, Nov. 1998.
[2] N. Beckmann, H.P. Kriegel, R. Schneider, and B. Seeger, “The ${\rm R}^{\ast}$ Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf., pp. 322331, June 1990.
[3] R.E. Bellman, Adaptive Control Processes. Princeton Univ. Press, 1961.
[4] S. Berchtold, C. Böhm, D.A. Keim, and H.P. Kriegel, “A Cost Model for Nearest Neighbor Search in HighDimensional Data Space,” Proc. 16th ACM SIGACTSIGMODSIGART Symp. Principles of Database Systems, pp. 7886, May 1997.
[5] S. Berchtold, C. Böhm, and H.P. Kriegel, “Improving the Query Performance of HighDimensional Index Structures by BulkLoad Operations,” Advances in Database TechnologyProc. First Int'l Conf. Extending Database Technology, H.J Schek, F. Saltor, I. Ramos, and G. Alonso, eds., SpringerVerlag, Lecture Notes in Computer Science, vol. 1377, pp. 216230, Mar. 1998.
[6] K.S. Beyer, J. Goldstein, R. Ramakrishnan, and U. Shaft, “When Is ‘Nearest Neighbor’ Meaningful?” Proc. Seventh Int'l Conf. Database Theory, C. Beeri and P. Buneman, eds., SpringerVerlag, Lecture Notes in Computer Science, vol. 1540, pp.217235, Jan. 1999.
[7] C. Böhm, S. Berchtold, and D.A. Keim, “Searching in HighDimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases,” ACM Computing Surveys, vol. 33, no. 3, pp. 322373, Sept. 2001.
[8] A.J. Broder, “Strategies for Efficient Incremental Nearest Neighbor Search,” Pattern Recognition, vol. 23, nos. 12, pp. 171178, Jan. 1990.
[9] B. Bustos and G. Navarro, “Probabilistic Proximity Searching Algorithms Based on Compact Partitions,” J. Discrete Algorithms, vol. 2, no. 1, pp. 115134, Mar. 2004.
[10] E. Chávez, G. Navarro, R. BaezaYates, and J. Marroquín, “Searching in Metric Spaces,” ACM Computing Surveys, vol. 33, no. 3, pp. 273322, Sept. 2001.
[11] P. Ciaccia and M. Patella, “PAC Nearest Neighbor Queries: Approximate and Controlled Search in HighDimensional and Metric Spaces,” Proc. 16th IEEE Int'l Conf. Data Eng., pp. 244255, Feb. 2000.
[12] P. Ciaccia, M. Patella, and P. Zezula, “MTree: An Efficient Access Method for Similarity Search in Metric Spaces,” Proc. 23rd Int'l Conf. Very Large Data Bases, M. Jarke, M.J. Carey, K.R. Dittrich, F.H. Lochovsky, P. Loucopoulos, and M.A. Jeusfeld, eds., pp. 426435, Aug. 1997.
[13] H. Ferhatosmanoglu, I. Stanoi, D. Agrawal, and A. El Abbadi, “Constrained Nearest Neighbor Queries,” Advances in Spatial and Temporal DatabasesProc. Seventh Int'l Symp., C.S. Jensen, M.Schneider, B. Seeger, and V.J. Tsotras, eds., SpringerVerlag, Lecture Notes in Computer Science, vol. 2121, pp.257278, July 2001.
[14] K. Fukunaga and P.M. Narendra, “A Branch and Bound Algorithm for Computing $k$ Nearest Neighbors,” IEEE Trans. Computers, vol. 24, no. 7, pp. 750753, July 1975.
[15] V. Gaede and O. Günther, “Multidimensional Access Methods,” ACM Computing Surveys, vol. 20, no. 2, pp. 170231, June 1998.
[16] A. Henrich, “A DistanceScan Algorithm for Spatial Access Structures,” Proc. Second ACM Workshop Geographic Information Systems, N. Pissinou and K. Makki, eds., pp. 136143, Dec. 1994.
[17] G.R. Hjaltason and H. Samet, “Ranking in Spatial Databases,” Advances in Spatial Databases—Proc. Fourth Int'l Symp., M.J.Egenhofer and J.R. Herring, eds., SpringerVerlag, Lecture Notes in Computer Science, vol. 951, pp. 8395, Aug. 1995.
[18] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265318, June 1999.
[19] G.R. Hjaltason and H. Samet, “Incremental Similarity Search in Multimedia Databases,” Computer Science Technical Report TR4199, Univ. of Maryland, Nov. 2000.
[20] G.R. Hjaltason and H. Samet, “IndexDriven Similarity Search in Metric Spaces,” ACM Trans. Database Systems, vol. 28, no. 4, pp.517580, Dec. 2003.
[21] B. KamgarParsi and L.N. Kanal, “An Improved Branch and Bound Algorithm for Computing $k$ Nearest Neighbors,” Pattern Recognition Letters, vol. 3, no. 1, pp. 712, Jan. 1985.
[22] S. Larsen and L.N. Kanal, “Analysis of kNearest Neighbor Branch and Bound Rules,” Pattern Recognition Letters, vol. 4, no. 2, pp. 7177, Apr. 1986.
[23] C. Merkwirth, U. Parlitz, and W. Lauterborn, “Fast Exact and Approximate Nearest Neighbor Searching for Nonlinear Signal Processing,” Physical Rev. E (Statistical Physics, Plasmas, Fluids, and Related Interdisciplinary Topics), vol. 62, no. 2, pp. 20892097, Aug. 2000.
[24] G. Navarro, “Searching in Metric Spaces by Spatial Approximation,” VLDB J., vol. 11, no. 1, pp. 2846, Aug. 2002.
[25] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM Sigmod Conf., pp. 7179, May 1995.
[26] H. Samet, Foundations of Multidimensional and Metric Data Structures. MorganKaufmann, 2006.
[27] H. Samet and R.E. Webber, “Storing a Collection of Polygons Using Quadtrees,” ACM Trans. Graphics, vol. 4, no. 3, pp. 182222, July 1985.
[28] M. Stonebraker, T. Sellis, and E. Hanson, “An Analysis of Rule Indexing Implementations in Data Base Systems,” Proc. First Int'l Conf. Expert Database Systems, pp. 353364, Apr. 1986.
[29] D.A. White and R. Jain, “Similarity Indexing with the SSTree,” Proc. 12th IEEE Int'l Conf. Data Eng., S.Y.W. Su, ed., pp. 516523, Feb. 1996.
[30] P. Zezula, G. Amato, V. Dohnal, and M. Batko, Similarity Search: The Metric Space Approach. Springer, 2006.