<--- Back to Details
First PageDocument Content
Machine learning / Mathematical analysis / Learning / Artificial intelligence / Search algorithms / Dimension reduction / Statistical classification / MinHash / Nearest neighbor search / Random projection / K-nearest neighbors algorithm / Dimensionality reduction
Date: 2015-05-11 19:23:32
Machine learning
Mathematical analysis
Learning
Artificial intelligence
Search algorithms
Dimension reduction
Statistical classification
MinHash
Nearest neighbor search
Random projection
K-nearest neighbors algorithm
Dimensionality reduction

Add to Reading List

Source URL: web.stanford.edu

Download Document from Source Website

File Size: 190,72 KB

Share Document on Facebook

Similar Documents

Fault Detection and Prognosis of Time Series Data with Random Projection Filter Bank Sepideh Pourazarm, Amir-massoud Farahmand, and Daniel Nikovski Mitsubishi Electric Research Laboratories (MERL), Cambridge, MA, 02139,

DocID: 1vezA - View Document

MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Random Projection Filter Bank for Time Series Data Pourazarm, S.; Farahmand, A.-M.; Nikovski, D.N. TR2017-179

DocID: 1uQyz - View Document

Machine learning / Learning / Statistical classification / Artificial intelligence / Dimension reduction / Support vector machine / Random projection

Ping Li Probabilistic Hashing for Efficient Search and Learning July 12, 2012

DocID: 1q8hV - View Document

Knot theory / Topology / Knot invariants / Knot / Prime knot / Crossing number / Virtual knot / Dowker notation

Random Knots By: Shil B., Alex E., Dongming L. Advisor: Nathan Dunfield, Graduate student: Nathan Fieldsteel Introduction: A knot is a non-intersecting closed curved in 3-space. The projection of a knot onto the plane yi

DocID: 1pNLu - View Document

Linear algebra / Projection / Matrix / Multivariate random variable / Linear combination / Basis / Vector space / Euclidean algorithm / Polynomial greatest common divisor

JMLR: Workshop and Conference Proceedings vol 40:1–14, 2015 Variable Selection is Hard Dean P. Foster DEAN @ FOSTER . NET

DocID: 1pEs6 - View Document