Author:
Kel’manov A. V.,Pyatkin A. V.
Subject
Computational Mathematics
Reference6 articles.
1. A. V. Eremeev, A. V. Kel’manov, and A. V. Pyatkin, “On the complexity of some Euclidean optimal summing problems,” Dokl. Math. 93 (3), 286–288 (2016).
2. A. V. Kel’manov and A. V. Pyatkin, “Complexity of certain problems of searching for subsets of vectors and cluster analysis,” Comput. Math. Math. Phys. 49 (11), 1966–1971 (2009).
3. C. C. Aggarwal, Data Mining (Springer International, Berlin, 2015).
4. M. C. Bishop, Pattern Recognition and Machine Learning (Springer Science + Business Media, New York, 2006).
5. T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning: Data Mining, Inference, and Prediction (Springer-Verlag, New York, 2001).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献