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
L. Zhang, Q. Liu, J. Zhang, H. Wang, Y. Pan, und Y. Yu. Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea, Volume 4825 von LNCS, Seite 645--658. Berlin, Heidelberg, Springer Verlag, (November 2007)
A. Hotho, R. Jäschke, C. Schmitz, und G. Stumme. The Semantic Web: Research and Applications, Volume 4011 von LNAI, Seite 411-426. Heidelberg, Springer, (2006)
A. Hotho, R. Jäschke, C. Schmitz, und G. Stumme. The Semantic Web: Research and Applications, Volume 4011 von LNAI, Seite 411-426. Heidelberg, Springer, (2006)
Y. Chen, F. Tsai, und K. Chan. DDDM '07: Proceedings of the 2007 international workshop on Domain driven data mining, Seite 55--60. New York, NY, USA, ACM Press, (2007)
M. Strohmaier, M. Lux, M. Granitzer, P. Scheir, S. Liaskos, und E. Yu. We Know'07 International Workshop on Collaborative Knowledge Management for Web Information Systems, in conjunction with WISE'07, Nancy, France, (2007)
K. Sugiyama, K. Hatano, und M. Yoshikawa. WWW '04: Proceedings of the 13th international conference on World Wide Web, Seite 675--684. New York, NY, USA, ACM Press, (2004)
Q. Zhao, S. Hoi, T. Liu, S. Bhowmick, M. Lyu, und W. Ma. WWW '06: Proceedings of the 15th international conference on World Wide Web, Seite 543--552. New York, NY, USA, ACM Press, (2006)
K. Lang. Proceedings of the 12th International Conference on Machine Learning, Seite 331--339. Morgan Kaufmann publishers Inc.: San Mateo, CA, USA, (1995)
K. Lang. Proceedings of the 12th International Conference on Machine Learning, Seite 331--339. Morgan Kaufmann publishers Inc.: San Mateo, CA, USA, (1995)