Algorithms of the Intelligent Web

References

C.C. Aggarwal "Towards Meaningful High-Dimensional Nearest Neighbor Search by Human-Computer Interaction." ICDE, 2002. http://citeseer.ist.psu.edu/aggarwal02towards.html.

D. Arthur and S. Vassilvitskii. "k-Means++: The advantages of careful seeding." Symposium on Discrete Algorithms (SODA), 2007. http://www.stanford.edu/~darthur/kMeansPlus-Plus.pdf.

K. Beyer, R. Ramakrishnan, U. Shaft, J. Goldstein."When is nearest neighbor meaningful?" ICDT Conference 1999.

P.S. Bradley, U. Fayyad, and C. Reina. "Scaling clustering algorithms to large databases." Proc. 4th International Conference on Knowledge Discovery and Data Mining (KDD-98). AAAI Press, pp. 9 – 15.

I.S. Dhillon, J. Fan, and Y. Guan. "Efficient clustering of very large document ...