Qurak

MatchingDissimilarity

利用可能

Matching dissimilarity between binary vectors.

MatchingDissimilarity[u, v]
MatchingDissimilarity[{1, 0, 1, 1, 0}, {1, 1, 0, 1, 1}] → 3/5MatchingDissimilarity[{True, False, True}, {True, True, False}] → 2/3FindClusters[{{0, 1}, {1, 1}, {0, 0}, {1, 0}}, DistanceFunction -> MatchingDissimilarity] → {{{1, 0}}, {{0, 0}}, {{1, 1}}, {{0, 1}}}

トピック

関連

全 6300 関数 · MCPクライアントから使う