@ai-on-browser/data-analysis-models/lib/model/isodata.js

Data analysis model package without any dependencies

import Matrix from '../util/matrix.js'

/**
 * Iterative Self-Organizing Data Analysis Technique
 */
export default class ISODATA {
	// http://web.pdx.edu/~jduh/courses/Archive/geog481w07/Students/Vassilaros_ISODATA.pdf
	// http://rs.aoyaman.com/img_pro/b8.html
	/**
	 * @param {number} init_k Initial cluster count
	 * @param {number} min_k Minimum cluster count
	 * @param {number} max_k Maximum cluster count
	 * @param {number} min_n Minimum cluster size
	 * @param {number} split_std Standard deviation as splid threshold
	 * @param {number} merge_dist Merge distance
	 */
	constructor(init_k, min_k, max_k, min_n, split_std, merge_dist) {
		this._init_k = init_k
		this._min_k = min_k
		this._max_k = max_k
		this._min_n = min_n
		this._split_sd = split_std
		this._merge_distance = merge_dist

		this._centroids = []
	}

	/**
	 * Centroids
	 * @type {Array<Array<number>>}
	 */
	get centroids() {
		return this._centroids
	}

	/**
	 * Number of clusters
	 * @type {number}
	 */
	get size() {
		return this._centroids.length
	}

	_distance(a, b) {
		return Math.sqrt(a.reduce((s, v, i) => s + (v - b[i]) ** 2, 0))
	}

	/**
	 * Initialize model.
	 * @param {Array<Array<number>>} data Training data
	 */
	init(data) {
		const n = data.length
		const cidx = []
		for (let i = 0; i < this._init_k; i++) {
			cidx.push(Math.floor(Math.random() * (n - i)))
		}
		for (let i = this._init_k - 1; i >= 0; i--) {
			for (let j = this._init_k - 1; j > i; j--) {
				if (cidx[i] <= cidx[j]) {
					cidx[j]++
				}
			}
		}

		this._centroids = []
		for (let i = 0; i < this._init_k; i++) {
			this._centroids[i] = data[cidx[i]]
		}
	}

	_fit_centers(data) {
		while (true) {
			const p = this.predict(data)
			const new_c = []
			for (let i = 0; i < this._centroids.length; i++) {
				const cx = data.filter((v, k) => p[k] === i)
				const m = Array(data[0].length).fill(0)
				for (let k = 0; k < cx.length; k++) {
					for (let d = 0; d < cx[k].length; d++) {
						m[d] += cx[k][d]
					}
				}
				new_c[i] = m.map(v => v / cx.length)
			}
			let e = 0
			for (let i = 0; i < this._centroids.length; i++) {
				e += this._centroids[i].reduce((s, v, d) => s + (v - new_c[i][d]) ** 2, 0)
			}
			if (isNaN(e) || e < 1.0e-8) {
				break
			}
			this._centroids = new_c
		}
	}

	/**
	 * Fit model.
	 * @param {Array<Array<number>>} data Training data
	 */
	fit(data) {
		this._fit_centers(data)

		if (this._centroids.length < this._max_k) {
			this._split_centroids(data)
		}
		if (this._centroids.length > this._min_k) {
			this._delete_centroids(data)
		}
		if (this._centroids.length > this._min_k) {
			this._merge_centroids(data)
		}
	}

	_merge_centroids(datas) {
		for (let i = 0; i < this._centroids.length; i++) {
			for (let j = 0; j < i; j++) {
				const d = this._distance(this._centroids[i], this._centroids[j])
				if (d < this._merge_distance) {
					this._centroids[j] = this._centroids[j].map((v, k) => (v + this._centroids[i][k]) / 2)
					this._centroids.splice(i, 1)
					this._fit_centers(datas)
					return
				}
			}
		}
	}

	_split_centroids(datas) {
		const p = this.predict(datas)
		for (let i = 0; i < this._centroids.length; i++) {
			const cx = Matrix.fromArray(datas.filter((v, k) => p[k] === i))
			const s = cx.std(0).value
			for (let d = 0; d < s.length; d++) {
				if (d > this._split_sd) {
					const c = this._centroids[i].concat()
					c[d] += s[d] / 100
					this._centroids.splice(i, 0, c)
					this._fit_centers(datas)
					return
				}
			}
		}
	}

	_delete_centroids(datas) {
		const p = this.predict(datas)
		for (let i = this._centroids.length - 1; i >= 0; i--) {
			if (p.every(v => v !== i)) {
				this._centroids.splice(i, 1)
			}
		}
		for (let i = this._centroids.length - 1; i >= 0; i--) {
			if (p.reduce((s, v) => s + (v === i ? 1 : 0), 0) < this._min_n) {
				this._centroids.splice(i, 1)
				this._fit_centers(datas)
				return
			}
		}
	}

	/**
	 * Returns predicted categories.
	 * @param {Array<Array<number>>} datas Sample data
	 * @returns {number[]} Predicted values
	 */
	predict(datas) {
		if (this._centroids.length === 0) {
			throw new Error('Call fit before predict.')
		}
		return datas.map(v => {
			let min_d = Infinity
			let min_c = -1
			for (let i = 0; i < this._centroids.length; i++) {
				const d = this._distance(v, this._centroids[i])
				if (d < min_d) {
					min_d = d
					min_c = i
				}
			}
			return min_c
		})
	}
}