gaozhangyang / git Goto Github PK

Apologize for contacting you through git-issues.

Gao et al.,

I am reading your 2020 paper - 'clustering based on graph of density'. My sense is that the GDT method is similar to the DENCLUE 2.0 technique that also uses KDE, graphs, and a hill-climbing method. I didn't see any reference to DENCLUE in your paper.

This DENCLUE code was buggy and I was able to fix it to get it work; even thought the results were not very promising.

I am experimenting clustering methods to find k-regular graphs that represent clusters of IoTs for applying a certain algorithm. The algorithm requires that the IoTs are within an epsilon distance and have a certain minimal node degree.

Looking forward to hearing from you. If you wish to email your response; pls email to nuwan [at] lirneasia [dot] net.

Thank you in advance!
Nuwan