| Trees | Indices | Help |
|
|---|
|
|
|
|||
|
pySparseIntVect this class is pretty much obsolete (it's in C++ now) |
|||
|
|||
|
|||
|
|||
|
|||
|
|||
C++ signature:
DiceSimilarity(SparseBitVect bv1, SparseBitVect bv2, bool returnDistance=0) -> double
2*B(bv1&bv2) / (B(bv1) + B(bv2))
C++ signature:
DiceSimilarity(ExplicitBitVect bv1, ExplicitBitVect bv2, bool returnDistance=0) -> double
C++ signature:
DiceSimilarity(SparseBitVect bv1, std::string pkl, bool returnDistance=0) -> double
2*B(bv1&bv2) / (B(bv1) + B(bv2))
C++ signature:
DiceSimilarity(ExplicitBitVect bv1, std::string pkl, bool returnDistance=0) -> double
return the Dice similarity between two vectors
C++ signature:
DiceSimilarity(RDKit::SparseIntVect<int> siv1, RDKit::SparseIntVect<int> siv2, bool returnDistance=False, double bounds=0.0) -> double
return the Dice similarity between two vectors
C++ signature:
DiceSimilarity(RDKit::SparseIntVect<long long> siv1, RDKit::SparseIntVect<long long> siv2, bool returnDistance=False, double bounds=0.0) -> double
|
Implements the DICE similarity metric. >>> v1 = DataStructs.IntSparseIntVect(10) >>> v2 = DataStructs.IntSparseIntVect(10) >>> v1.UpdateFromSequence((1,2,3)) >>> v2.UpdateFromSequence((1,2,3)) >>> DiceSimilarity(v1,v2) 1.0 >>> v2 = DataStructs.IntSparseIntVect(10) >>> v2.UpdateFromSequence((5,6)) >>> DiceSimilarity(v1,v2) 0.0 >>> v1 = DataStructs.IntSparseIntVect(10) >>> v2 = DataStructs.IntSparseIntVect(10) >>> v1.UpdateFromSequence((1,2,3,4)) >>> v2.UpdateFromSequence((1,3,5,7)) >>> DiceSimilarity(v1,v2) 0.5 >>> v1 = DataStructs.IntSparseIntVect(10) >>> v2 = DataStructs.IntSparseIntVect(10) >>> v1.UpdateFromSequence((1,2,3,4,5,6)) >>> v2.UpdateFromSequence((1,3)) >>> DiceSimilarity(v1,v2) 0.5 |
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0beta1 on Sat May 24 08:37:02 2008 | http://epydoc.sourceforge.net |