擅长:python、mysql、java
<p>您可以利用Python对集合的本机支持来计算Jaccard索引</p>
<pre class="lang-py prettyprint-override"><code>unix_converted = [['00:00:00', '00:00:03'], ['00:00:03', '00:00:06'], ['00:00:12', '00:00:15']]
input_timestamps = [['00:00:00', '00:00:03'], ['00:00:03', '00:00:06'], ['00:00:06', '00:00:09']]
def jaccard_index(s1, s2):
s1 = set({'-'.join(each) for each in s1})
s2 = set({'-'.join(each) for each in s2})
return len(s1.intersection(s2))/len(s1.union(s2))
print(jaccard_index(unix_converted, input_timestamps)) #outputs 0.5
</code></pre>
<p>编辑:我假设Jaccard索引指的是Jaccard相似性,即给定列表的并集的交集</p>