fasladodo Goto Github PK

ke_ae

Reinforcement Learning- Watkins Q Learning(Eligibility Traces) for Maze Solving Agent

kernel_trick-and_denclue_and_decison_tree-

Data mining homework(2018.05.07)

kernelized-logistic-regression

Three flavors of gradient descent learning using a Kernel Function on high dimensional dataset...

keystroke-anomaly-detection

kfold_cv

k-Fold Cross-Validation in Matlab

klt-tracker

construction

kmeanscluster

kmm_svdd

kmodes

Python implementations of the k-modes and k-prototypes clustering algorithms, for clustering categorical data

knfst

Kernel Null Foley-Sammon Transform for Novelty Detection

knn-graphs

MATLAB functions for creating k-nearest neighbor graphs

kohonen-maps

Implementation of SOM and GSOM

kornia

Open Source Differentiable Computer Vision Library for PyTorch

ksvd_reg

Regularized K-SVD Algorithm

l2c

Learning to Cluster. A deep clustering strategy.

label-studio

Label Studio is a multi-type data labeling and annotation tool with standardized output format

labelme

Image Polygonal Annotation with Python (polygon, rectangle, circle, line, point and image-level flag annotation).

lambda-packs

Precompiled packages for AWS Lambda

lanczosnetwork

Lanczos Network, Graph Neural Networks, Deep Graph Convolutional Networks, Deep Learning on Graph Structured Data, QM8 Quantum Chemistry Benchmark, ICLR 2019

laneatt

Code for the paper entitled "Keep your Eyes on the Lane: Real-time Attention-guided Lane Detection" (CVPR 2021)

lapirn

Large Deformation Diffeomorphic Image Registration with Laplacian Pyramid Networks

larnet

Code repository for BMVC paper LARNet: Latent Action Representation for Human Action Synthesis

lasso-solver-omp-cpp

This package implements Orthonogal Matching Pursuit algorithm (OMP) approach as a famous LASSO solver, and this program is written in C++ assisted by LAPACK.

lcssalgorithm

This project enables to study the problem of finding similarity between trajectories (trajectory similarity problem) which is a known problem in the field of Data Mining. The algorithm called to deploy and solves the above problem is the LCSS(Longest Common Subsequence). Each orbit is described by a sequence geographical points (latidute, longitude). Each record dataset that we are given represents a path of a taxi that has taken place in the city of Beijing. Each line of the file contains the following separated by commas: taxi id, timestamp, latitude, longitude.

lda

Topic modeling with latent Dirichlet allocation

lda-c

This is a C implementation of variational EM for latent Dirichlet allocation (LDA), a topic model for text or other discrete data.

lda-topic-modeling

A PureScript, browser-based implementation of LDA topic modeling.

leader-identification

A learning approach to pagerank members of social groups to detect their leaders

learn-python-the-hard-way

My answer for the book Learn Python The Hard Way

learning-based-methods-in-computer-vision

CS838/BMI 826 UW Madison - Graduate Course