PCA-based branch and bound search algorithms for computing K nearest neighbors

Wim D haes, Dirk Van Dyck, Xavier Rodet. PCA-based branch and bound search algorithms for computing K nearest neighbors. Pattern Recognition Letters, 24(9-10):1437-1451, 2003. [doi]

@article{DhaesDR03,
  title = {PCA-based branch and bound search algorithms for computing K nearest neighbors},
  author = {Wim D haes and Dirk Van Dyck and Xavier Rodet},
  year = {2003},
  doi = {10.1016/S0167-8655(02)00384-7},
  url = {http://dx.doi.org/10.1016/S0167-8655(02)00384-7},
  tags = {rule-based, search},
  researchr = {https://researchr.org/publication/DhaesDR03},
  cites = {0},
  citedby = {0},
  journal = {Pattern Recognition Letters},
  volume = {24},
  number = {9-10},
  pages = {1437-1451},
}