MatchingDissimilarity [u,v]
gives the matching dissimilarity between Boolean vectors u and v.
MatchingDissimilarity
MatchingDissimilarity [u,v]
gives the matching dissimilarity between Boolean vectors u and v.
Details
- MatchingDissimilarity works for both True , False vectors and 0, 1 vectors.
- MatchingDissimilarity [u,v] is equivalent to (n10+n01)/Length [u], where nij is the number of corresponding pairs of elements in u and v respectively equal to i and j.
Examples
open all close allBasic Examples (2)
Scope (2)
Applications (2)
Properties & Relations (5)
Matching dissimilarity is bounded by 0 and 1:
MatchingDissimilarity is less than or equal to JaccardDissimilarity :
MatchingDissimilarity is less than or equal to RogersTanimotoDissimilarity :
MatchingDissimilarity is less than or equal to SokalSneathDissimilarity :
MatchingDissimilarity is less than or equal to RussellRaoDissimilarity :
Tech Notes
Related Guides
History
Text
Wolfram Research (2007), MatchingDissimilarity, Wolfram Language function, https://reference.wolfram.com/language/ref/MatchingDissimilarity.html.
CMS
Wolfram Language. 2007. "MatchingDissimilarity." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/ref/MatchingDissimilarity.html.
APA
Wolfram Language. (2007). MatchingDissimilarity. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/MatchingDissimilarity.html
BibTeX
@misc{reference.wolfram_2025_matchingdissimilarity, author="Wolfram Research", title="{MatchingDissimilarity}", year="2007", howpublished="\url{https://reference.wolfram.com/language/ref/MatchingDissimilarity.html}", note=[Accessed: 05-December-2025]}
BibLaTeX
@online{reference.wolfram_2025_matchingdissimilarity, organization={Wolfram Research}, title={MatchingDissimilarity}, year={2007}, url={https://reference.wolfram.com/language/ref/MatchingDissimilarity.html}, note=[Accessed: 05-December-2025]}