Can MCL work for lattices / directed acyclic graphs / DAGs?

0
Posted

Can MCL work for lattices / directed acyclic graphs / DAGs?

0

Such graphs [term] can surely exhibit clear cluster structure. If they do, there is only one way for mcl to find out. You have to change all arcs to edges, i.e. if there is an arc from i to j with similarity s(i,j) − by the DAG property this implies s(j,i) = 0 − then make s(j,i) equal to s(i,j). This may feel like throwing away valuable information, but in truth the information that is thrown away (direction) is not informative with respect to the presence of cluster structure. This may well deserve a longer discussion than would be justified here.

Related Questions