TITLE

Multicore Processing for Clustering Algorithms

AUTHOR(S)
Rao, Rekhansh; Nagwanshi, Kapil Kumar; Dubey, Sipi
PUB. DATE
April 2012
SOURCE
International Journal of Computer Technology & Applications;2012, Vol. 3 Issue 2, p555
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Data Mining algorithms such as classification and clustering are the future of computation, though multidimensional data-processing is required. People are using multicore processors with GPU's. Most of the programming languages doesn't provide multiprocessing facilities and hence wastage of processing resources. Clustering and classification algorithms are more resource consuming. In this paper we have shown strategies to overcome such deficiencies using multicore processing platform OpelCL.
ACCESSION #
79277835

 

Related Articles

  • A New Text Clustering Method Based on KGA. ZhanGang Hao // Journal of Software (1796217X);May2012, Vol. 7 Issue 5, p1094 

    Text clustering is one of the key research areas in data mining. K-medoids is a classical partitioning algorithm, which can better solve the isolated point problem, but it often converges to local optimization. In this paper, we put forward a new genetic algorithm called KGA algorithm by putting...

  • Study of Clustering Algorithm based on Fuzzy C-Means and Immunological Partheno Genetic. Hongfen Jiang; Yijun Liu; Feiyue Ye; Haixu Xi; Mingfang Zhu; Junfeng Gu // Journal of Software (1796217X);Jan2013, Vol. 8 Issue 1, p134 

    Clustering algorithm is very important for data mining. Fuzzy c-means clustering algorithm is one of the earliest goal-function clustering algorithms, which has achieved much attention. This paper analyzes the lack of fuzzy C-means (FCM) algorithm and genetic clustering algorithm. Propose a...

  • A new hybrid imperialist competitive algorithm on data clustering. NIKNAM, TAHER; FARD, ELAHE; EHRAMPOOSH, SHERVIN; ROUSTA, ALIREZA // Sadhana;Jun2011, Vol. 36 Issue 3, p293 

    Clustering is a process for partitioning datasets. This technique is very useful for optimum solution. k-means is one of the simplest and the most famous methods that is based on square error criterion. This algorithm depends on initial states and converges to local optima. Some recent...

  • Multi-objective genetic algorithms based automated clustering for fuzzy association rules mining. Alhajj, Reda; Kaya, Mehmet // Journal of Intelligent Information Systems;Dec2008, Vol. 31 Issue 3, p243 

    Researchers realized the importance of integrating fuzziness into association rules mining in databases with binary and quantitative attributes. However, most of the earlier algorithms proposed for fuzzy association rules mining either assume that fuzzy sets are given or employ a clustering...

  • A New-Fangled FES-k -Means Clustering Algorithm for Disease Discovery and Visual Analytics. Oyana, Tonny J. // EURASIP Journal on Bioinformatics & Systems Biology;2010, p1 

    The central purpose of this study is to further evaluate the quality of the performance of a new algorithm. The study provides additional evidence on this algorithm that was designed to increase the overall efficiency of the original k-means clustering technique--the Fast, Efficient, and...

  • Novel Hybrid Clustering Optimization Algorithms Based on Plant Growth Simulation Algorithm. Tavakolian, Rozita; Charkari, Nasroollah Moghaddam // Journal of Advanced Computer Science & Technology Research;2011, Vol. 1 Issue 2, p84 

    Data clustering as one of the important data mining techniques is a fundamental and widely used method to achieve useful information about data. In face of the clustering problem, clustering methods still suffer from trapping in a local optimum and cannot often find global clusters. In general,...

  • Role of Rough Sets in Data Analysis. Anitha, K. // Annual International Conference on Optoelectronics, Photonics & ;2016, p155 

    Data Clustering is the process of dividing a data set into groups of similar items. This paper describes the data analysis technique based on Rough sets. The main objective of data analysis using Rough Set theory is it discovers hidden patterns of data from high dimensional data base. Moreover...

  • Editorial.  // Journal of Classification;Apr2013, Vol. 30 Issue 1, p1 

    An introduction is presented in which the editor discusses various reports within the issue on topics including projection pursuit technique for clustering multivariate data, multiple item selection technique for clustering data with the use of genetic algorithm, and cluster continuous predictor...

  • Initializing K-Means using Genetic Algorithms. Al-Shboul, Bashar; Sung-Hyon Myaeng // World Academy of Science, Engineering & Technology;Jun2009, Issue 30, p114 

    K-Means (KM) is considered one of the major algorithms widely used in clustering. However, it still has some problems, and one of them is in its initialization step where it is normally done randomly. Another problem for KM is that it converges to local minima. Genetic algorithms are one of the...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics