Downloads: 122 | Views: 296
Research Paper | Mathematics | Korea, North | Volume 5 Issue 12, December 2016 | Popularity: 6.4 / 10
Study on a Smoothing and Relaxation Method of Optimization Problem for Clustering of Bibliometric Networks
Myong-Hyok Jang, Yong Kim
Abstract: Optimization problems for clustering of bibliometric networks are discrete optimization ones with discontinuous objective functions. Therefore, we can not apply the traditional optimization methods to solve in these problems. In this paper, we studied smoothing and relaxation method of optimization problems for clustering bibliometric networks.
Keywords: discrete discontinuous optimization problem, clustering, smoothing method, relaxation method
Edition: Volume 5 Issue 12, December 2016
Pages: 593 - 597
Make Sure to Disable the Pop-Up Blocker of Web Browser
Similar Articles
Downloads: 127
Research Paper, Mathematics, India, Volume 2 Issue 2, February 2013
Pages: 348 - 358A Survey on Image Segmentation through Clustering Algorithm
M. Lalitha, M. Kiruthiga, C. Loganathan
Downloads: 133
Research Paper, Mathematics, India, Volume 3 Issue 4, April 2014
Pages: 246 - 252Kernel-Based Clustering: A Comparative Study
Man Singh, Sham Bansal, Ashish Kumar Garg, Mohammad Amir, Jarrar Ahmed