Author:
Januzaj Eshref,Kriegel Hans-Peter,Pfeifle Martin
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Ankerst, M., Breunig, M.M., Kriegel, H.-P., Sander, J.: OPTICS: Ordering Points To Identify the Clustering Structure. In: Proc. ACM SIGMOD, Philadelphia, PA, pp. 49–60 (1999)
2. Agrawal, R., Shafer, J.C.: Parallel mining of association rules: Design, implementation, and experience. IEEE Trans. Knowledge and Data Eng. 8, 962–969 (1996)
3. Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. ACM SIGMOD Int. Conf. on Management of Data (SIGMOD 1990), Atlantic City, NJ, pp. 322–331. ACM Press, New York (1990)
4. Ciaccia, P., Patella, M., Zezula, P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In: Proc. 23rd Int. VLDB, Athens, Greece, pp. 426–435 (1997)
5. Dhillon, I.S., Modh, D.S.: A Data-Clustering Algorithm On Distributed Memory Multiprocessors. In: SIGKDD 1999 (1999)
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献