1,PCA
2,Feature extration
3,Feature dimension reduction
【*】https://dyn4j.org/2021/06/2021-06-10-simple-polygon-simplification/
【*】https://www.codeproject.com/Articles/114797/Polyline-Simplification
4,KD-Tree
https://en.wikipedia.org/wiki/K-d_tree
construction of a KD-tree
function kdtree (list of points pointList, int depth) { // Select axis based on depth so that axis cycles through all valid values var int axis := depth mod k; // Sort point list and choose median as pivot element select median by axis from pointList; // Create node and construct subtree node.location := median; node.leftChild := kdtree(points in pointList before median, depth+1); node.rightChild := kdtree(points in pointList after median, depth+1); return node; }
kd-tree range search
http://www.cs.utah.edu/~lifeifei/cis5930/kdtree.pdf
time-series search
【best-match algo】
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.79.5842&rep=rep1&type=pdf
feature selection
https://machinelearningmastery.com/feature-selection-with-categorical-data/