Click for new scientific resources and news about Corona[COVID-19]

Paper Information

Journal:   SIGNAL AND DATA PROCESSING   2019 , Volume 16 , Number 2 (40) ; Page(s) 105 To 120.
 
Paper: 

Improvement Of Density-Based Clustering Algorithm Using Modifying The Density Definitions And Input Parameter

 
 
Author(s):  Pahlevanzadeh Alireza*, Niknafs Aliakbar
 
* department of computer engineering, shahid bahonar university of kerman, kerman, iran
 
Abstract: 
Clustering is one of the main tasks in data mining, which means grouping similar samples. In general, there is a wide variety of clustering algorithms. One of these categories is density-based clustering. Various algorithms have been proposed for this method; one of the most widely used algorithms called DBSCAN. DBSCAN can identify clusters of different shapes in the dataset and automatically identify the number of clusters. There are advantages and disadvantages in this algorithm. It is difficult to determine the input parameters of this algorithm by the user. Also, this algorithm is unable to detect clusters with different densities in the data set. ISB-DBSCAN algorithm is another example of density-based algorithms that eliminates the disadvantages of the DBSCAN algorithm. ISB-DBSCAN algorithm reduces the input parameters of DBSCAN algorithm and uses an input parameter k as the nearest neighbor's number. This method is also able to identify different density clusters, but according to the definition of the new core point, It is not able to identify some clusters in a different data set. This paper presents a method for improving ISB-DBSCAN algorithm. A proposed approach, such as ISB-DBSCAN, uses an input parameter k as the number of nearest neighbors and provides a new definition for core point. This method performs clustering in three steps, with the difference that, unlike ISB-DBSCAN algorithm, it can create a new cluster in the final stage. In the proposed method, a new criterion, such as the number of dataset dimensions used to detect noise in the used data set. Since the determination of the k parameter in the proposed method may be difficult for the user, a new method with genetic algorithm is also proposed for the automatic estimation of the k parameter. To evaluate the proposed methods, tests were carried out on 11 standard data sets and the accuracy of clustering in the methods was evaluated. The results showe that the proposed method is able to achieve better results in different data sets compare to other available methods. In the proposed method, the automatic determination of k parameter also obtained acceptable results.
 
Keyword(s): Density-based clustering,neighborhood parameter,clustering with different density
 
 
International related papers: 
  • No item.
 
Most related Highly related Moderately related Least related
 
References: 
  • Not Registered.
  •  
  •  
 
Citations: 
  • Not Registered.
 
+ Click to Cite.
APA: Copy

Pahlevanzadeh, A., & Niknafs, A. (2019). Improvement of density-based clustering algorithm using modifying the density definitions and input parameter. SIGNAL AND DATA PROCESSING, 16(2 (40) ), 105-120. https://www.sid.ir/en/journal/ViewPaper.aspx?id=693487



Vancouver: Copy

Pahlevanzadeh Alireza, Niknafs Aliakbar. Improvement of density-based clustering algorithm using modifying the density definitions and input parameter. SIGNAL AND DATA PROCESSING. 2019 [cited 2022January28];16(2 (40) ):105-120. Available from: https://www.sid.ir/en/journal/ViewPaper.aspx?id=693487



IEEE: Copy

Pahlevanzadeh, A., Niknafs, A., 2019. Improvement of density-based clustering algorithm using modifying the density definitions and input parameter. SIGNAL AND DATA PROCESSING, [online] 16(2 (40) ), pp.105-120. Available: https://www.sid.ir/en/journal/ViewPaper.aspx?id=693487.



 
 
Persian Abstract Yearly Visit 47
 
 
Latest on Blog
Enter SID Blog