@inproceedings{inner,
 author = {E\u{g}ecio\u{g}lu, \"{O}. and Ferhatosmano\u{g}lu, H.},
 title = {Dimensionality reduction and similarity computation by inner product approximations},
 booktitle = {Proceedings of the ninth international conference on Information and knowledge management},
 series = {CIKM '00},
 year = {2000},
 isbn = {1-58113-320-0},
 location = {McLean, Virginia, United States},
 pages = {219--226},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/354756.354822},
 doi = {http://doi.acm.org/10.1145/354756.354822},
 acmid = {354822},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {dimensionality reduction, distance approximation, document databases, inner-product, p-norm, similarity search},
} 

@inproceedings{vafile,
  address = {San Francisco, CA, USA},
  author = {R. Weber and H. J. Schek and S. Blott},
  booktitle = {Proceedings of the 24rd International Conference on Very Large Data Bases},
 series = {VLDB '98},
  interhash = {25728ee7cb5e65344f6e060bf401daec},
  intrahash = {10c2598de4606079618d20ebbf2476fb},
  pages = {194--205},
  publisher = {Morgan Kaufmann Publishers Inc.},
  title = {A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces},
  url = {http://portal.acm.org/citation.cfm?id=671192&dl=GUIDE&coll=Portal&CFID=14011845&CFTOKEN=50916781#citedby},
  year = 1998,
  timestamp = {2008-12-10T05:20:23.000+0100},
  keywords = {similarity},
  added-at = {2008-12-10T05:20:23.000+0100},
  description = {A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces},
  isbn = {1-55860-566-5},
  biburl = {http://www.bibsonomy.org/bibtex/210c2598de4606079618d20ebbf2476fb/jamesh}
}

@article{idist,
 author = {Jagadish, H. V. and Ooi, B. C. and Tan, K.L. and Yu, C. and Zhang, R.},
 title = {iDistance: An adaptive B+-tree based indexing method for nearest neighbor search},
 journal = {ACM Transactions on Database Systems},
 volume = {30},
 issue = {2},
 month = {June},
 year = {2005},
 issn = {0362-5915},
 pages = {364--397},
 numpages = {34},
 url = {http://doi.acm.org/10.1145/1071610.1071612},
 doi = {http://doi.acm.org/10.1145/1071610.1071612},
 acmid = {1071612},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {Indexing, KNN, nearest neighbor queries},
} 

@inproceedings{kmeans,
  author = {J. B. MacQueen},
  booktitle = {Proceedings of the fifth Berkeley Symposium on Mathematical Statistics and Probability},
  editor = {L. M. Le Cam and J. Neyman},
  interhash = {8d7d4dfe7d3a06b8c9c3c2bb7aa91e28},
  intrahash = {5dcdb8cd9fba78e0e791af619d61d66d},
  pages = {281-297},
  publisher = {University of California Press},
  title = {Some Methods for Classification and Analysis of MultiVariate Observations},
  volume = 1,
  year = 1967,
  timestamp = {2007-08-23T16:58:27.000+0200},
  keywords = {kmeans},
  added-at = {2007-08-23T16:58:27.000+0200},
  file = {},
  biburl = {http://www.bibsonomy.org/bibtex/25dcdb8cd9fba78e0e791af619d61d66d/gromgull}
}

@article{pca,
  author = {K. Pearson},
  interhash = {c2a88da8d5068eb09941df30fa3b0f23},
  intrahash = {e3cae747969ec5a442f434a00d9d4f61},
  journal = {Philosophical Magazine},
  pages = {559-572},
  title = {On Lines and Planes of Closest Fit to Systems of Points in Space},
  volume = 2,
  year = 1901,
  timestamp = {2009-04-04T18:01:35.000+0200},
  keywords = {imported},
  added-at = {2009-04-04T18:01:35.000+0200},
  issue = {6},
  biburl = {http://www.bibsonomy.org/bibtex/2e3cae747969ec5a442f434a00d9d4f61/dieudonnew}
}

@book{svm,
  address = {New York, NY, USA},
  author = {V. N. Vapnik},
  interhash = {98898576dfede7a15fcbf60cad98f9c0},
  intrahash = {47ebbab65bd999205dbe30b610ff96d8},
  publisher = {Springer},
  title = {The Nature of Statistical Learning Theory},
  year = 1995,
  timestamp = {2011-04-06T15:00:29.000+0200},
  keywords = {learning svm},
  added-at = {2011-04-06T15:00:29.000+0200},
  description = {final},
  isbn = {0-387-94559-8},
  biburl = {http://www.bibsonomy.org/bibtex/247ebbab65bd999205dbe30b610ff96d8/utahell}
}

@inproceedings{covertree,
 author = {Beygelzimer, A. and Kakade, S. and Langford, J.},
 title = {Cover trees for nearest neighbor},
 booktitle = {Proceedings of the 23rd international conference on Machine learning},
 series = {ICML '06},
 year = {2006},
 isbn = {1-59593-383-2},
 location = {Pittsburgh, Pennsylvania},
 pages = {97--104},
 numpages = {8},
 url = {http://doi.acm.org/10.1145/1143844.1143857},
 doi = {http://doi.acm.org/10.1145/1143844.1143857},
 acmid = {1143857},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@inproceedings{intrinsic,
 author = {Karger, D. R. and Ruhl, M.},
 title = {Finding nearest neighbors in growth-restricted metrics},
 booktitle = {Proceedings of the 34th annual ACM symposium on Theory of computing},
 series = {STOC '02},
 year = {2002},
 isbn = {1-58113-495-9},
 location = {Montreal, Quebec, Canada},
 pages = {741--750},
 numpages = {10},
 url = {http://doi.acm.org/10.1145/509907.510013},
 doi = {http://doi.acm.org/10.1145/509907.510013},
 acmid = {510013},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@misc{uci,
author={UCI machine learning archive},
title={http://archive.ics.uci.edu/ml/},
}

@misc{feature,
author={NIPS 2003 challenge on feature selection},
title={http://clopinet.com/isabelle/Projects/NIPS2003/},
}

@inproceedings{rtree,
  author    = {A. Guttman},
  editor    = {Beatrice Yormark},
  title     = {R-Trees: A Dynamic Index Structure for Spatial Searching},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data},
  series    = {SIGMOD '84},
  publisher = {ACM},
  year      = {1984},
  pages     = {47-57},
}

@article{kdtree,
 author = {Bentley, J. L.},
 title = {Multidimensional binary search trees used for associative searching},
 journal = {Communications of ACM},
 volume = {18},
 issue = {9},
 month = {September},
 year = {1975},
 issn = {0001-0782},
 pages = {509--517},
 numpages = {9},
 url = {http://doi.acm.org/10.1145/361002.361007},
 doi = {http://doi.acm.org/10.1145/361002.361007},
 acmid = {361007},
 publisher = {ACM},
 address = {New York, NY, USA},
 keywords = {associative retrieval, attribute, binary search trees, binary tree insertion, information retrieval system, intersection queries, key, nearest neighbor queries, partial match queries},
} 

@inproceedings{meaningful,
 author = {Beyer, K. S. and Goldstein, J. and Ramakrishnan, R. and Shaft, U.},
 title = {When Is ''Nearest Neighbor'' Meaningful?},
 booktitle = {Proceedings of the 7th International Conference on Database Theory},
 series = {ICDT '99},
 year = {1999},
 isbn = {3-540-65452-6},
 pages = {217--235},
 numpages = {19},
 url = {http://portal.acm.org/citation.cfm?id=645503.656271},
 acmid = {656271},
 publisher = {Springer},
 address = {London, UK},
} 

