I have a weighted undirected graph, where weight is the similarity and range from 0 to 1. I applied a density-based clustering method and get some clusters, with overlapping nodes (node can belong to more than one cluster), and with noise or outlier nodes ( node don't belong to any cluster).
Now, are there quality measures that works fine with this clustering result?
For example, one of measures I think about is Modularity Q, but I don't sure if it suitable for my graph or not. Also if other measures such as internal density, node betweeness, converge and entropy can be used here ?
Thank in advance.