DocumentCode
3013470
Title
Density based clustering technique for efficient data mining
Author
Rahman, Md Asikur ; Chowdhury, A. K M Rasheduzzaman ; Rahman, Daud Md Jamilur ; Kamal, Abu Raihan Mostofa
Author_Institution
Comput. Sci. & Inf. Technol. (CIT), Islamic Univ. of Technol. (IUT), Gazipur
fYear
2008
fDate
24-27 Dec. 2008
Firstpage
248
Lastpage
252
Abstract
Clustering analysis is an important function of data mining. There are various clustering methods in data mining. Based on these methods various clustering algorithms are developed. A recent approach for clustering analysis is based on ldquoswarm intelligencerdquo. Based on this ldquoswarm intelligencerdquo an algorithm was proposed named ldquoant-cluster algorithmrdquo. However, existing ldquoant clusteringrdquo algorithm has a limitation in finding the value of two constant K1 and K2, which is user defined., for computing the value of the picking up probability Pp and dropping probability Pd. In this paper our approach is to gain the value of Pp and Pd without giving the user defined value of K1 and K2. We also intend to retain the Pp and Pd in between 0 to 1 in order to get optimized result.
Keywords
computational complexity; data mining; pattern clustering; probability; ant-cluster algorithm; data mining; density based clustering technique; swarm intelligence; Clustering algorithms; Clustering methods; Computer science; Credit cards; Data mining; Image databases; Information technology; Particle swarm optimization; Partitioning algorithms; Signal processing algorithms; Ant Clustering methods; Data Mining; Density; Swarm Intelligence;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Information Technology, 2008. ICCIT 2008. 11th International Conference on
Conference_Location
Khulna
Print_ISBN
978-1-4244-2135-0
Electronic_ISBN
978-1-4244-2136-7
Type
conf
DOI
10.1109/ICCITECHN.2008.4803050
Filename
4803050
Link To Document