Author:
Huang Jinlong,Zhu Qingsheng,Yang Lijun,Cheng Dongdong,Wu Quanwang
Funder
National Nature Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference38 articles.
1. Agrawal, R., et al. (1998). Automatic subspace clustering of high dimensional data for data mining applications. In ACM (Vol. 27).
2. Ankerst, M., et al. (1999). OPTICS: Ordering points to identify the clustering structure. In ACM Sigmod record. ACM.
3. Cassisi, C., et al. (2013). Enhancing density-based clustering: Parameter reduction and outlier detection. Information Systems, 38(3), 317–330.
4. Donath, W. E., & Hoffman, A. J. (1973). Lower bounds for the partitioning of graphs. IBM Journal of Research and Development, 17(5), 420–425.
5. Ester, M., et al. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise. In Kdd.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献