A Triangle Inequality for Cosine Similarity

Schubert, E., Zimek, A.: ELKI: A large open-source library for data analysis - ELKI release 0.7.5 ”heidelberg”. CoRR abs/1902.03616

Original

1902

Earlier work this paper cites.

Omohundro, S.M.: Five balltree construction algorithms. Tech. Rep. TR-89-063, International Computer Science Institute (ICSI) (1989)

1989

Earlier work this paper cites.

Uhlmann, J.K.: Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett. 40

1991

Earlier work this paper cites.

Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: ACM/SIGACT-SIAM Symposium on Discrete Algorithms, SODA. pp. 311–321 (1993)

1993

Earlier work this paper cites.

Micó, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements. Pattern Recognit. Lett. 15

1994

Earlier work this paper cites.

Brin, S.: Near neighbor search in large metric spaces. In: Dayal, U., Gray, P.M.D., Nishio, S. (eds.) Int. Conf. Very Large Data Bases, VLDB. pp. 574–584. Morgan Kaufmann (1995)

1995

Earlier work this paper cites.

Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: Int. Conf. Very Large Data Bases, VLDB. pp. 426–435 (1997)

1997

Earlier work this paper cites.

Bozkaya, T., Özsoyoglu, Z.M.: Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst. 24

1999

Cited alongside, same era.

Navarro, G.: Searching in metric spaces by spatial approximation. VLDB J. 11

2002

Cited alongside, same era.

Jagadish, H.V., Ooi, B.C., Tan, K., Yu, C., Zhang, R.: idistance: An adaptive b + {}^{\mbox{+}} -tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30

2005

Cited alongside, same era.

Beygelzimer, A., Kakade, S.M., Langford, J.: Cover trees for nearest neighbor. In: Int. Conf. Machine Learning, ICML. pp. 97–104 (2006). https://doi.org/10.1145/1143844.1143857

2006

Cited alongside, same era.

Nanopoulos, A., Radovanovic, M., Ivanovic, M.: How does high dimensionality affect collaborative filtering? In: ACM Conf. Recommender Systems, RecSys. pp. 293–296 (2009). https://doi.org/10.1145/1639714.1639771

Zimek, A., Schubert, E., Kriegel, H.: A survey on unsupervised outlier detection in high-dimensional numerical data. Stat. Anal. Data Min. 5

2012

Later among the works it cites.

Ruiz, G., Santoyo, F., Chávez, E., Figueroa, K., Tellez, E.S.: Extreme pivots for faster metric indexes. In: Int. Conf. Similarity Search and Applications, SISAP. pp. 115–126 (2013). https://doi.org/10.1007/978-3-642-41062-8_12

2013

Later among the works it cites.

Chávez, E., Ludueña, V., Reyes, N., Roggero, P.: Faster proximity searching with the distal SAT. In: Int. Conf. Similarity Search and Applications, SISAP. pp. 58–69 (2014). https://doi.org/10.1007/978-3-319-11988-5_6

2014

Later among the works it cites.

Kriegel, H., Schubert, E., Zimek, A.: The (black) art of runtime evaluation: Are we comparing algorithms or implementations? Knowl. Inf. Syst. 52

2017

Later among the works it cites.