Author:
Bagirov Adil M.,Mohebi Ehsan
Publisher
Springer International Publishing
Reference56 articles.
1. Aggarwal C, Hinneburg A, Keim D (2001) On the surprising behavior of distance metrics in high dimensional space. In: ICDT ’01 Proceedings of the 8th international conference on database theory, pp 420–434
2. Al-Sultan K (1995) A tabu search approach to the clustering problem. Pattern Recogn 28(9):1443–1451
3. Arthur D, Vassilvitskii S (2007) k-means + +: the advantages of careful seeding. In: Bansal N, Pruhs K, Stein C (eds) SODA ’07 Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms. SIAM, Miami, pp 1027–1035
4. Astorino A, Fuduli A (2007) Nonsmooth optimization techniques for semi-supervised classification. IEEE Trans Pattern Anal Mach Intell 29:2135–2142
5. Astorino A, Fuduli A, Gorgone E (2008) Non-smoothness in classification problems. Optim Methods Software 23:675–688
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献