iMass: an approximate adaptive clustering algorithm for dynamic data using probability based dissimilarity

Panthadeep BHATTACHARJEE; Pinaki MITRA

doi:10.1007/s11704-019-9116-y

Front. Comput. Sci. ›› 2021, Vol. 15 ›› Issue (2) : 152314 DOI: 10.1007/s11704-019-9116-y

LETTER

iMass: an approximate adaptive clustering algorithm for dynamic data using probability based dissimilarity

Panthadeep BHATTACHARJEE ^†
, Pinaki MITRA

Author information +

History +

PDF (505KB)

Cite this article

Download citation ▾

Panthadeep BHATTACHARJEE, Pinaki MITRA. iMass: an approximate adaptive clustering algorithm for dynamic data using probability based dissimilarity. Front. Comput. Sci., 2021, 15(2): 152314 DOI:10.1007/s11704-019-9116-y

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	Ting K M, Zhu Y, Carman M, Zhu Y, Zhou Z H. Overcoming key weaknesses of distance-based neighbourhood methods using a data dependent dissimilarity measure. In: Proceedings of the 22nd ACM International Conference on Knowledge Discovery and DataMining. 2016, 1205–1214

[2]	Ester M, Kriegel H P, Sander J, Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining. 1996, 226–231

[3]	Aryal S, Ting K M, Haffari G, Washio T. Mp-dissimilarity: a data dependent dissimilarity measure. In: Proceedings of the IEEE International Conference on Data Mining. 2014, 707–712