Francesco
|
Unregistered User
|
|
|
Feb 4 |
comment |
Similarity measure between 2 bi-partite graph. Just another thing, i've used the measure you gave me and worked nicely,by the way can you give me some reference to this measure? |
|
Dec 21 |
comment |
Similarity measure between 2 bi-partite graph. Yes, i thought that the euclidean distance between matrices could be a solution. By the way in both matrix A and B we should have the union of the vertex contained in both matrices. Fortunately my graphs are all labeled. |
|
Dec 21 |
awarded | ● Scholar |
|
Dec 20 |
comment |
Similarity measure between 2 bi-partite graph. The two sets of objects in my problem are gene and microRNA sections. They have just told me to consider them as "two different entities", no more information were provided. By the way, if two graph doesn't share vertices, their distance should be 1, as highest as possible. In other hand if 2 graph share the same vertices and edges, with the same weights, their distance should be 0. 2 graphs with same vertices,edges but with different weights shouldn't have distance equal to 0. At the moment i'm considering the graph edit distance as a possible solution.Ideas and thoughts are welcome. |
|
Dec 20 |
comment |
Similarity measure between 2 bi-partite graph. I would consider similar bipartite graph which share same vertex and edges with same weights. Thank you all |
|
Dec 20 |
comment |
Similarity measure between 2 bi-partite graph. The similarity measure should have values between 0 and 1. I image it could be calculated like 1 - some_distance_measure d(g1,g2) where d(g1 , g2) = 0 if g1 = g2, d(g1,g2) = d(g2,g1). I hope I made myself clear. |
|
Dec 19 |
asked | Similarity measure between 2 bi-partite graph. |
