/
radius_neighbor.js
266 lines (251 loc) · 5.69 KB
/
radius_neighbor.js
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
263
264
265
266
/**
* Bsae class for radius neighbor models
*/
class RadiusNeighborBase {
// https://scikit-learn.org/stable/modules/generated/sklearn.neighbors.RadiusNeighborsClassifier.html
/**
* @param {number} [r] Radius to determine neighborhood
* @param {'euclid' | 'manhattan' | 'chebyshev' | 'minkowski' | function (number[], number[]): number} [metric] Metric name
*/
constructor(r = 1, metric = 'euclid') {
this._p = []
this._c = []
this._r = r
this._metric = metric
if (typeof this._metric === 'function') {
this._d = this._metric
} else {
switch (this._metric) {
case 'euclid':
this._d = (a, b) => Math.sqrt(a.reduce((s, v, i) => s + (v - b[i]) ** 2, 0))
break
case 'manhattan':
this._d = (a, b) => a.reduce((s, v, i) => s + Math.abs(v - b[i]), 0)
break
case 'chebyshev':
this._d = (a, b) => Math.max(...a.map((v, i) => Math.abs(v - b[i])))
break
case 'minkowski':
this._dp = 2
this._d = (a, b) =>
Math.pow(
a.reduce((s, v, i) => s + (v - b[i]) ** this._dp, 0),
1 / this._dp
)
break
}
}
}
_near_points(data) {
const ps = []
this._p.forEach((p, i) => {
const d = this._d(data, p)
if (d < this._r) {
ps.push({
d: d,
category: this._c[i],
idx: i,
})
}
})
return ps
}
/**
* Add a data.
*
* @param {number[]} point Training data
* @param {*} [category] Target value
*/
_add(point, category) {
this._p.push(point)
this._c.push(category)
}
}
/**
* radius neighbor
*/
export class RadiusNeighbor extends RadiusNeighborBase {
/**
* @param {number} [r] Radius to determine neighborhood
* @param {'euclid' | 'manhattan' | 'chebyshev' | 'minkowski' | function (number[], number[]): number} [metric] Metric name
*/
constructor(r = 1, metric = 'euclid') {
super(r, metric)
}
/**
* Add a data.
*
* @param {number[]} point Training data
* @param {*} category Target value
*/
add(point, category) {
super._add(point, category)
}
/**
* Add datas.
*
* @param {Array<Array<number>>} datas Training data
* @param {*[]} targets Target values
*/
fit(datas, targets) {
for (let i = 0; i < datas.length; i++) {
this.add(datas[i], targets[i])
}
}
/**
* Returns predicted categories.
*
* @param {Array<Array<number>>} datas Sample data
* @returns {*[]} Predicted values
*/
predict(datas) {
return datas.map(data => {
const ps = this._near_points(data)
const clss = {}
ps.forEach(p => {
let cat = p.category
if (!clss[cat]) {
clss[cat] = {
category: cat,
count: 1,
min_d: p.d,
}
} else {
clss[cat].count += 1
clss[cat].min_d = Math.min(clss[cat].min_d, p.d)
}
})
let max_count = 0
let min_dist = -1
let target_cat = null
for (let k of Object.keys(clss)) {
if (max_count < clss[k].count || (max_count === clss[k].count && clss[k].min_d < min_dist)) {
max_count = clss[k].count
min_dist = clss[k].min_d
target_cat = clss[k].category
}
}
return target_cat
})
}
}
/**
* radius neighbor regression
*/
export class RadiusNeighborRegression extends RadiusNeighborBase {
/**
* @param {number} [r] Radius to determine neighborhood
* @param {'euclid' | 'manhattan' | 'chebyshev' | 'minkowski' | function (number[], number[]): number} [metric] Metric name
*/
constructor(r = 1, metric = 'euclid') {
super(r, metric)
}
/**
* Add a data.
*
* @param {number[]} point Training data
* @param {number} category Target value
*/
add(point, category) {
super._add(point, category)
}
/**
* Add datas.
*
* @param {Array<Array<number>>} datas Training data
* @param {number[]} targets Target values
*/
fit(datas, targets) {
for (let i = 0; i < datas.length; i++) {
this.add(datas[i], targets[i])
}
}
/**
* Returns predicted values.
*
* @param {Array<Array<number>>} datas Sample data
* @returns {(number | null)[]} Predicted values
*/
predict(datas) {
return datas.map(data => {
const ps = this._near_points(data)
if (ps.length === 0) {
return null
}
return ps.reduce((acc, v) => acc + v.category, 0) / ps.length
})
}
}
/**
* Semi-supervised radius neighbor
*/
export class SemiSupervisedRadiusNeighbor extends RadiusNeighborBase {
// https://products.sint.co.jp/aisia/blog/vol1-20
/**
* @param {number} [k] Radius to determine neighborhood
* @param {'euclid' | 'manhattan' | 'chebyshev' | 'minkowski' | function (number[], number[]): number} [metric] Metric name
*/
constructor(k = 5, metric = 'euclid') {
super(k, metric)
this._k = Infinity
this._orgk = k
}
/**
* Add a data.
*
* @param {number[]} point Training data
* @param {* | null} category Target value
*/
add(point, category) {
super._add(point, category)
}
/**
* Add datas.
*
* @param {Array<Array<number>>} datas Training data
* @param {(* | null)[]} targets Target values
*/
fit(datas, targets) {
for (let i = 0; i < datas.length; i++) {
this.add(datas[i], targets[i])
}
}
/**
* Returns predicted values.
*
* @returns {*[]} Predicted values
*/
predict() {
while (true) {
const tmpnear = []
for (let i = 0; i < this._p.length; i++) {
if (this._c[i] != null) {
let cnt = 0
const ps = this._near_points(this._p[i])
for (const p of ps) {
if (p.category == null) {
if (p.d < (tmpnear[p.idx]?.d ?? Infinity)) {
tmpnear[p.idx] = {
d: p.d,
category: this._c[i],
}
}
if (++cnt >= this._orgk) {
break
}
}
}
}
}
if (tmpnear.length === 0) {
break
}
for (let i = 0; i < this._p.length; i++) {
if (tmpnear[i]) {
this._c[i] = tmpnear[i].category
}
}
}
return this._c
}
}