Publisher
Springer International Publishing
Reference14 articles.
1. Ageev, A.A., Kel’manov, A.V., Pyatkin, A.V., Khamidullin, S.A., Shenmaier, V.V.: Approximation polynomial algorithm for the data editing and data cleaning problem. Pattern Recogn. Image Anal. 27(3), 365–370 (2017). https://doi.org/10.1134/S1054661817030038
2. Aggarwal, C.C.: Data Mining: The Textbook. Springer, Switzerland (2015)
3. Aloise, D., Deshpande, A., Hansen, P., Popat, P.: NP-hardness of Euclidean sum-of-squares clustering. Mach. Learn. 75(2), 245–248 (2009). https://doi.org/10.1007/s10994-009-5103-0
4. Bishop, C.M.: Pattern Recognition and Machine Learning. ISS, Springer, New York (2006)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献