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
A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme. The Semantic Web: Research and Applications, volume 4011 of LNAI, page 411-426. Heidelberg, Springer, (2006)
Q. Zhao, S. Hoi, T. Liu, S. Bhowmick, M. Lyu, and W. Ma. WWW '06: Proceedings of the 15th international conference on World Wide Web, page 543--552. New York, NY, USA, ACM Press, (2006)
K. Sugiyama, K. Hatano, and M. Yoshikawa. WWW '04: Proceedings of the 13th international conference on World Wide Web, page 675--684. New York, NY, USA, ACM Press, (2004)
Y. Chen, F. Tsai, and K. Chan. DDDM '07: Proceedings of the 2007 international workshop on Domain driven data mining, page 55--60. New York, NY, USA, ACM Press, (2007)
L. Zhang, Q. Liu, J. Zhang, H. Wang, Y. Pan, and Y. Yu. Proceedings of the 6th International Semantic Web Conference and 2nd Asian Semantic Web Conference (ISWC/ASWC2007), Busan, South Korea, volume 4825 of LNCS, page 645--658. Berlin, Heidelberg, Springer Verlag, (November 2007)
A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme. The Semantic Web: Research and Applications, volume 4011 of LNAI, page 411-426. Heidelberg, Springer, (2006)
A. Hotho, R. Jäschke, C. Schmitz, and G. Stumme. The Semantic Web: Research and Applications, volume 4011 of LNAI, page 411-426. Heidelberg, Springer, (2006)