Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Near Neighbors Retrieval: Efficient Techniques
Graph Chatbot
Related lectures (31)
Previous
Page 1 of 4
Next
Nearest Neighbor Search: Johnson-Lindenstrauss Lemma
Covers the Nearest Neighbor search algorithm and the Johnson-Lindenstrauss lemma for dimensionality reduction, exploring preprocessing techniques and locality-sensitive hashing.
Locality Sensitive Hashing
Explores Locality Sensitive Hashing for nearest neighbor search and submodularity in hash functions.
Implementation of Sets: Hashing
Covers the implementation of sets using hashing and set operations.
Introduction to Renku
Introduces Renku, a platform for collaborative data science, emphasizing reproducibility, shareability, reusability, and security.
Project Management: Portfolio Management
Focuses on project planning, execution, and key user involvement for effective project management.
Introduction to R Programming for Genetics & Genomics
Introduces a course on Genetics & Genomics, focusing on R programming with interactive exercises.
Comparing Objects: Comparable vs Comparator
Covers the concepts of Comparable and Comparator interfaces in Java, explaining how classes implement these interfaces to enable object comparison.
Principal Component Analysis: Dimension Reduction
Covers Principal Component Analysis for dimension reduction in biological data, focusing on visualization and pattern identification.
Data Cleaning Challenges: Optimizing Error Detection
Addresses challenges in data cleaning for analysis, proposing optimizations to reduce processing time.
Gaussian Naive Bayes & K-NN
Covers Gaussian Naive Bayes, K-nearest neighbors, and hyperparameter tuning in machine learning.