The M-tree is an index structure that can be used for the efficient resolution of similarity queries on complex objects to be compared using an arbitrary metric, i.e. a distance function d that satisfies the positivity, symmetry, and triangle inequality p
X. Wei, und B. Croft. SIGIR '06: Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, Seite 178--185. New York, NY, USA, ACM Press, (2006)
G. Weikum. SIGMOD '07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, Seite 25--30. New York, NY, USA, ACM Press, (2007)
S. Wong, W. Ziarko, und P. Wong. SIGIR '85: Proceedings of the 8th annual international ACM SIGIR conference on Research and development in information retrieval, Seite 18--25. New York, NY, USA, ACM Press, (1985)
F. Xia, T. Liu, J. Wang, W. Zhang, und H. Li. Proceedings of the 25th international conference on Machine learning, Seite 1192--1199. New York, NY, USA, ACM, (2008)
E. Yilmaz, und J. Aslam. CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge management, Seite 102--111. New York, NY, USA, ACM, (2006)
M. Zacher. Information technologies and global politics: The changing scope of power and governance, State University of New York Press, Albany, (2002)