-
Notifications
You must be signed in to change notification settings - Fork 335
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #15 from Kanaries/feat_subspace_new_alg
Feat: subspace new algorithm
- Loading branch information
Showing
12 changed files
with
203 additions
and
57 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,45 +1,109 @@ | ||
| import { DataSource } from "../commonTypes"; | ||
|
|
||
| export function chiSquared(matrix: number[][] = [[]]): number { | ||
| let rowSums = matrix.map(m => 0); | ||
| let colSums = matrix[0].map(m => 0); | ||
| type nestTree = Map<string, Map<string, number>>; | ||
| export function chiSquared(nestTree: nestTree, xSet: Set<string>, ySet: Set<string>): number { | ||
| if (typeof nestTree === 'undefined' || typeof xSet === 'undefined' || typeof ySet === 'undefined') { | ||
| return 0; | ||
| } | ||
| let rowSums = new Map<string, number>(); | ||
| let colSums = new Map<string, number>(); | ||
| let totalSum = 0; | ||
| for (let i = 0; i < matrix.length; i++) { | ||
| for (let j = 0; j < matrix[i].length; j++) { | ||
| rowSums[i] += matrix[i][j]; | ||
| colSums[j] += matrix[i][j]; | ||
| totalSum += matrix[i][j]; | ||
| for (let x of xSet) { | ||
| rowSums.set(x, 0); | ||
| } | ||
| for (let y of ySet) { | ||
| colSums.set(y, 0); | ||
| } | ||
| for (let [x, node] of nestTree) { | ||
| for (let [y, counter] of node) { | ||
| rowSums.set(x, rowSums.get(x) + counter); | ||
| colSums.set(y, colSums.get(y) + counter); | ||
| totalSum += counter; | ||
| } | ||
| } | ||
|
|
||
| let chis = 0; | ||
| for (let i = 0; i < matrix.length; i++) { | ||
| for (let j = 0; j < matrix[i].length; j++) { | ||
| let observed = matrix[i][j]; | ||
| let expected = rowSums[i] * colSums[j] / totalSum; | ||
| for (let [x, node] of nestTree) { | ||
| for (let [y, observed] of node) { | ||
| let expected = rowSums.get(x) * colSums.get(y) / totalSum; | ||
| chis += (observed - expected) ** 2 / expected; | ||
| } | ||
| } | ||
| return chis; | ||
| } | ||
|
|
||
| export function crammersV(dataSource: DataSource, fieldX: string, fieldY: string) { | ||
| const xSet = new Set(dataSource.map(d => d[fieldX])) | ||
| const ySet = new Set(dataSource.map(d => d[fieldY])) | ||
| const xMembers = [...xSet]; | ||
| const yMembers = [...ySet]; | ||
| let xDict = {}; | ||
| let yDict = {}; | ||
| for (let i = 0; i < xMembers.length; i++) { | ||
| xDict[xMembers[i]] = i; | ||
| } | ||
| for (let i = 0; i < yMembers.length; i++) { | ||
| yDict[yMembers[i]] = i; | ||
| } | ||
| let matrix: number[][] = xMembers.map(x => yMembers.map(y => 0)); | ||
| for (let record of dataSource) { | ||
| matrix[xDict[record[fieldX]]][yDict[record[fieldY]]]++; | ||
|
|
||
| export function crammersV(dataSource: DataSource, fieldX: string, fieldY: string): number { | ||
| const xSet = new Set<string>() | ||
| const ySet = new Set<string>() | ||
| const nestTree = new Map<string, Map<string, number>>(); | ||
| let len = dataSource.length; | ||
| for (let i = 0; i < len; i++) { | ||
| let record = dataSource[i]; | ||
| xSet.add(record[fieldX]) | ||
| ySet.add(record[fieldY]); | ||
| if (!nestTree.has(record[fieldX])) { | ||
| nestTree.set(record[fieldX], new Map()); | ||
| } | ||
| let node = nestTree.get(record[fieldX]); | ||
| if (!node.has(record[fieldY])) { | ||
| node.set(record[fieldY], 0); | ||
| } | ||
| node.set(record[fieldY], node.get(record[fieldY]) + 1); | ||
| } | ||
| const chis = chiSquared(matrix); | ||
| const V = Math.sqrt(chis / (dataSource.length * Math.min(xMembers.length - 1, yMembers.length - 1))) | ||
| const chis = chiSquared(nestTree, xSet, ySet); | ||
| const V = Math.sqrt(chis / (dataSource.length * Math.min(xSet.size - 1, ySet.size - 1))) | ||
| return V; | ||
| } | ||
| } | ||
|
|
||
|
|
||
| // can be used for test | ||
| // export function crammersV(dataSource: DataSource, fieldX: string, fieldY: string): number { | ||
| // const xSet = new Set(dataSource.map(d => d[fieldX])) | ||
| // const ySet = new Set(dataSource.map(d => d[fieldY])) | ||
| // const xMembers = [...xSet]; | ||
| // const yMembers = [...ySet]; | ||
| // let xDict = {}; | ||
| // let yDict = {}; | ||
| // for (let i = 0; i < xMembers.length; i++) { | ||
| // xDict[xMembers[i]] = i; | ||
| // } | ||
| // for (let i = 0; i < yMembers.length; i++) { | ||
| // yDict[yMembers[i]] = i; | ||
| // } | ||
| // // let matrix: number[][] = xMembers.map(x => yMembers.map(y => 0)); | ||
| // let matrix: number[][] = []; | ||
| // for (let i = 0; i < xMembers.length; i++) { | ||
| // matrix.push([]); | ||
| // for (let j = 0; j < yMembers.length; j++) { | ||
| // matrix[i].push(0); | ||
| // } | ||
| // } | ||
| // for (let record of dataSource) { | ||
| // matrix[xDict[record[fieldX]]][yDict[record[fieldY]]]++; | ||
| // } | ||
| // const chis = chiSquared(matrix); | ||
| // const V = Math.sqrt(chis / (dataSource.length * Math.min(xMembers.length - 1, yMembers.length - 1))) | ||
| // return V; | ||
| // } | ||
|
|
||
| // export function chiSquared(matrix: number[][] = [[]]): number { | ||
| // let rowSums = matrix.map(m => 0); | ||
| // let colSums = matrix[0].map(m => 0); | ||
| // let totalSum = 0; | ||
| // for (let i = 0; i < matrix.length; i++) { | ||
| // for (let j = 0; j < matrix[i].length; j++) { | ||
| // rowSums[i] += matrix[i][j]; | ||
| // colSums[j] += matrix[i][j]; | ||
| // totalSum += matrix[i][j]; | ||
| // } | ||
| // } | ||
| // let chis = 0; | ||
| // for (let i = 0; i < matrix.length; i++) { | ||
| // for (let j = 0; j < matrix[i].length; j++) { | ||
| // let observed = matrix[i][j]; | ||
| // let expected = rowSums[i] * colSums[j] / totalSum; | ||
| // chis += (observed - expected) ** 2 / expected; | ||
| // } | ||
| // } | ||
| // return chis; | ||
| // } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.