Author:
Şeref Onur,Fan Ya-Ju,Borenstein Elan,Chaovalitwongse Wanpracha A.
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference33 articles.
1. Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998). Automatic subspace clustering of high dimensional data for data mining applications. SIGMOD Record, 27(2), 94–105.
2. Aloise, D., Deshpande, A., Hansen, P., & Popat, P. (May 2009). NP-hardness of euclidean sum-of-squares clustering. Machine Learning, 75, 245–248.
3. Asuncion, A., & Newman, D. J. (2007). UCI machine learning repository. Irvine, CA: University of California.
4. Bennett, K. P., & Mangasarian, O. L. (1993). Bilinear separation of two sets in n-space. Computational Optimization and Applications, 2, 207–227.
5. Boutsidis C., Mahoney M. W., Drineas P. (2009). Unsupervised feature selection for the k-means clustering problem. In Conference on Neural Information Processing Systems.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献