Efficient similarity search: arbitrary similarity measures, arbitrary composition.
| Anthology ID: | DBLP:conf/cikm/LangeN11a |
|---|---|
| Volume: | Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24-28, 2011 |
| Year: | 2011 |
| Venue: | International Conference on Information and Knowledge Management (CIKM) |
| Publisher: | ACM |
| Pages: | 1679-1688 |
| URL: | https://doi.org/10.1145/2063576.2063819 |
| DOI: | https://doi.org/10.1145/2063576.2063819 |
| DBLP: | conf/cikm/LangeN11a |
| BibTeX: |
@inproceedings{lange-2011-efficient,
author = {Dustin Lange and
Felix Naumann},
editor = {Craig Macdonald and
Iadh Ounis and
Ian Ruthven},
title = {{Efficient similarity search: arbitrary similarity measures, arbitrary composition}},
booktitle = {{Proceedings of the 20th ACM Conference on Information and Knowledge Management, CIKM 2011, Glasgow, United Kingdom, October 24-28, 2011}},
pages = {1679--1688},
publisher = {ACM},
year = {2011},
url = {https://doi.org/10.1145/2063576.2063819},
doi = {https://doi.org/10.1145/2063576.2063819}
}