Buscar
Mostrando ítems 1-10 de 1847
Combining K-Means and K-Harmonic with Fish School Search Algorithm for data clustering task on graphics processing units
(2016-04-01)
Data clustering is related to the split of a set of objects into smaller groups with common features. Several optimization techniques have been proposed to increase the performance of clustering algorithms. Swarm Intelligence ...
QK-Means: A clustering technique based on community detection and K-Means for deployment of cluster head nodes
(2012-08-22)
Wireless Sensor Networks (WSN) are a special kind of ad-hoc networks that is usually deployed in a monitoring field in order to detect some physical phenomenon. Due to the low dependability of individual nodes, small radio ...
QK-Means: A clustering technique based on community detection and K-Means for deployment of cluster head nodes
(2012-08-22)
Wireless Sensor Networks (WSN) are a special kind of ad-hoc networks that is usually deployed in a monitoring field in order to detect some physical phenomenon. Due to the low dependability of individual nodes, small radio ...
Parallelization of the Algorithm K-means Applied in Image Segmentation
(International Journal of Computer Applications, 2014-01-01)
Algorithm k-means is useful for grouping operations; however, when is applied to large amounts of data, its computational cost is high. This research propose an optimization of k-means algorithm by using parallelization ...
Soft clustering - fuzzy and rough approaches and their extensions and derivatives
(Elsevier, 2013)
Clustering is one of the most widely used approaches in data mining with real life
applications in virtually any domain. The huge interest in clustering has led to a possibly
three-digit number of algorithms with the ...
Kernel Penalized K-means: A feature selection method based on Kernel K-means
(Elsevier, 2015)
We present an unsupervised method that selects the most relevant features using an embedded strategy while maintaining the cluster structure found with the initial feature set. It is based on the idea of simultaneously ...
Dynamic texture segmentation based on deterministic partially self-avoiding walks
(ElsevierAmsterdam, 2013-09)
Recently there has been a considerable interest in dynamic textures due to the explosive growth of multimedia databases. In addition, dynamic texture appears in a wide range of videos, which makes it very important in ...