1. Barioni, M.C.N., Razente, H., Traina, A.J.M., Traina Jr., C. 2006. An efficient approach to scale up k-medoid-based algorithms in large databases. In: Brazilian Symposium on Databases (SBBD), Florianópolis, SC, Brazil. SBC, pp. 265–279.
2. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B. 1990. The R∗-tree: An efficient and robust access method for points and rectangles. In: ACM SIGMOD International Conference on Management of Data, Atlantic City, NJ. ACM, pp. 322–331.
3. An efficient k-medoids-based algorithm using previous medoid index, triangular inequality elimination criteria, and partial distance search;Chu,2002
4. M-tree: an efficient access method for similarity search in metric spaces;Ciaccia,1997
5. Knowledge discovery in large spatial databases: focusing techniques for efficient class identification;Ester,1995