Author:
M. Bagirov Adil,Karmitsa Napsu,Taheri Sona
Publisher
Springer International Publishing
Reference66 articles.
1. Aarts, E., Korst, J.: Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Wiley Interscience Series in Discrete Mathematics and Optimization. Wiley, New York, NY (1989)
2. Al-Sultan, K.S.: A tabu search approach to the clustering problem. Pattern Recogn. 28(9), 1443–1451 (1995)
3. Al-Sultan, K.S., Fedjki, C.A.: A tabu search-based algorithm for the fuzzy clustering problem. Pattern Recogn. 30(12), 2023–2030 (1997)
4. Al-Sultan, K.S., Khan, M.M.: Computational experience on four algorithms for the hard clustering problem. Pattern Recogn. Lett. 17, 295–308 (1996)
5. Babu, G.P., Murty, M.N.: A near optimal initial seed value selection in the k-meanws algorithm using a genetic algorithm. Pattern Recogn. Lett. 14(10), 763–769 (1993)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献