Now showing items 1-2 of 2
Clustering Using Optimized Gaussian Kernel Function
Clustering and segmentation algorithms that depend on Gaussian kernel function as a way for constructing affinity matrix, these algorithms like spectral clustering algorithms suffer from the poor estimation of parzen window ...
BH-centroids: A New Efficient Clustering Algorithm
The k-means algorithm is one of most widely used method for discovering clusters in data; however one of the main disadvantages to k-means is the fact that you must specify the number of clusters as an input to the algorithm. ...