This repository has been archived by the owner on Nov 19, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2k
/
Dissimilarity.cs
262 lines (233 loc) · 7.89 KB
/
Dissimilarity.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
// Accord Math Library
// The Accord.NET Framework
// http://accord-framework.net
//
// Copyright © Diego Catalano, 2014
// diego.catalano at live.com
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
//
namespace Accord.Math
{
/// <summary>
/// Static class Dissimilarity. Provides extension methods defining dissimilarity measures.
/// </summary>
///
public static class Dissimilarity
{
/// <summary>
/// Computes the Dice dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Dice dissimilarity between x and y.</returns>
///
public static double Dice(int[] x, int[] y)
{
int tf = 0;
int ft = 0;
int tt = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 0) tf++;
if (x[i] == 0 && y[i] == 1) ft++;
if (x[i] == 1 && y[i] == 1) tt++;
}
return (tf + ft) / (double)(2 * tt + ft + tf);
}
/// <summary>
/// Computes the Jaccard dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Jaccard dissimilarity between x and y.</returns>
///
public static double Jaccard(int[] x, int[] y)
{
int tf = 0;
int ft = 0;
int tt = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 0) tf++;
if (x[i] == 0 && y[i] == 1) ft++;
if (x[i] == 1 && y[i] == 1) tt++;
}
return (tf + ft) / (double)(tt + ft + tf);
}
/// <summary>
/// Computes the Kulsinsk dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Kulsinsk dissimilarity between x and y.</returns>
///
public static double Kulsinsk(int[] x, int[] y)
{
int tf = 0;
int ft = 0;
int tt = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 0) tf++;
if (x[i] == 0 && y[i] == 1) ft++;
if (x[i] == 1 && y[i] == 1) tt++;
}
return (tf + ft - tt + x.Length) / (double)(ft + tf + x.Length);
}
/// <summary>
/// Computes the Matching dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Matching dissimilarity between x and y.</returns>
///
public static double Matching(int[] x, int[] y)
{
int tf = 0;
int ft = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 0) tf++;
if (x[i] == 0 && y[i] == 1) ft++;
}
return (tf + ft) / (double)(x.Length);
}
/// <summary>
/// Computes the Rogers-Tanimoto dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Rogers Tanimoto dissimilarity between x and y.</returns>
///
public static double RogersTanimoto(int[] x, int[] y)
{
int tf = 0;
int ft = 0;
int tt = 0;
int ff = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 0) tf++;
if (x[i] == 0 && y[i] == 1) ft++;
if (x[i] == 1 && y[i] == 1) tt++;
if (x[i] == 0 && y[i] == 0) ff++;
}
int r = 2 * (tf + ft);
return r / (double)(tt + ff + r);
}
/// <summary>
/// Computes the Russel Rao dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Russel Rao dissimilarity between x and y.</returns>
///
public static double RusselRao(int[] x, int[] y)
{
int tt = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 1) tt++;
}
return (x.Length - tt) / (double)(x.Length);
}
/// <summary>
/// Computes the Sokal-Michener dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Sokal-Michener dissimilarity between x and y.</returns>
///
public static double SokalMichener(int[] x, int[] y)
{
int tf = 0;
int ft = 0;
int tt = 0;
int ff = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 0) tf++;
if (x[i] == 0 && y[i] == 1) ft++;
if (x[i] == 1 && y[i] == 1) tt++;
if (x[i] == 0 && y[i] == 0) ff++;
}
int r = 2 * (tf + ft);
return r / (double)(ff + tt + r);
}
/// <summary>
/// Computes the Sokal Sneath dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Sokal Sneath dissimilarity between x and y.</returns>
///
public static double SokalSneath(int[] x, int[] y)
{
int tf = 0;
int ft = 0;
int tt = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 0) tf++;
if (x[i] == 0 && y[i] == 1) ft++;
if (x[i] == 1 && y[i] == 1) tt++;
}
int r = 2 * (tf + ft);
return r / (double)(tt + r);
}
/// <summary>
/// Computes the Yule dissimilarity between two vectors.
/// </summary>
///
/// <param name="x">A vector.</param>
/// <param name="y">A vector.</param>
///
/// <returns>The Yule dissimilarity between x and y.</returns>
///
public static double Yule(int[] x, int[] y)
{
int tf = 0;
int ft = 0;
int tt = 0;
int ff = 0;
for (int i = 0; i < x.Length; i++)
{
if (x[i] == 1 && y[i] == 0) tf++;
if (x[i] == 0 && y[i] == 1) ft++;
if (x[i] == 1 && y[i] == 1) tt++;
if (x[i] == 0 && y[i] == 0) ff++;
}
double r = 2 * (tf + ft);
return r / (tt + ff + r / 2);
}
}
}