期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A survey of density based clustering algorithms 被引量:4
1
作者 Panthadeep BHATTACHARJEE pinaki mitra 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第1期139-165,共27页
Density based clustering algorithms(DBCLAs)rely on the notion of density to identify clusters of arbitrary shapes,sizes with varying densities.Existing surveys on DB-CLAs cover only a selected set of algorithms.These ... Density based clustering algorithms(DBCLAs)rely on the notion of density to identify clusters of arbitrary shapes,sizes with varying densities.Existing surveys on DB-CLAs cover only a selected set of algorithms.These surveys fail to provide an extensive information about a variety of DBCLAs proposed till date including a taxonomy of the algorithms.In this paper we present a comprehensive survey of various DB-CLAS over last two decades along with their classification.We group the DBCLAs in each of the four categories:density definition,parameter sensitivity,execution mode and nature of*data and further divide them into various classes under each of these categories.In addition,we compare the DBCLAs through their common features and variations in citation and conceptual dependencies.We identify various application areas of DBCLAS in domains such as astronomy,earth sciences,molecular biology,geography,multimedia.Our survey also identifies probable future directions of DBCLAs where involvement of density based methods may lead to favorable results. 展开更多
关键词 CLUSTERING density based clustering SURVEY CLASSIFICATION common properties applications
原文传递
iMass:an approximate adaptive clustering algorithm for dynamic data using probability based dissimilarity
2
作者 Panthadeep BHATTACHARJEE pinaki mitra 《Frontiers of Computer Science》 SCIE EI CSCD 2021年第2期189-191,共3页
1 Research goals The primary goal of this work is to propose an approximate incremental solution to MBSCAN[1]known as the iMass clustering algorithm for processing point wise insertions dynamically(Table 1,Fig.1).MBSC... 1 Research goals The primary goal of this work is to propose an approximate incremental solution to MBSCAN[1]known as the iMass clustering algorithm for processing point wise insertions dynamically(Table 1,Fig.1).MBSCAN acts as a robust baseline because it replaces distance based density measure of DBSCAN[2]by a mass-based[3,4]approach. 展开更多
关键词 DBSCAN CAN APPROXIMATE
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部