fage2016 Goto Github PK

leetcodeanimation

Demonstrate all the questions on LeetCode in the form of animation.（用动画的形式呈现解LeetCode题目的思路）

leetcodebook

leetcode 1~400知识点&题型总结&leetcode对应题表

leetcode_category

Leetcode solutions organized by the problem categories

lightgbm

LightGBM is a fast, distributed, high performance gradient boosting (GBDT, GBRT, GBM or MART) framework based on decision tree algorithms, used for ranking, classification and many other machine learning tasks. It is under the umbrella of the DMTK(http://github.com/microsoft/dmtk) project of Microsoft.

lihang-code

《统计学习方法》的代码实现

lihang_book_algorithm

致力于将李航博士《统计学习方法》一书中所有算法实现一遍

lingvo

Lingvo

machine-learning-tutorials

machine learning and deep learning tutorials, articles and other resources

machinelearning

This project contain some machine learning algrithm demo.Maybe the code is also useful to you.

machinelearning-1

Machine learning resources，including algorithm, paper, dataset, example and so on.

mask_rcnn_pytorch

Mask RCNN in PyTorch

math-with-python

Various math-related things in Python code

microarray-datasets

ix most widely used

miles-deep

Deep Learning Porn Video Classifier/Editor with Caffe

mingpt

A minimal PyTorch re-implementation of the OpenAI GPT (Generative Pretrained Transformer) training

minigpt-4

MiniGPT-4: Enhancing Vision-language Understanding with Advanced Large Language Models

mlalgorithms

Minimal and clean examples of machine learning algorithms

mlcpp

Set of examples of ML approaches implemented in C++

mlxtend

A library of extension and helper modules for Python's data analysis and machine learning libraries.

modern-cpp-tutorial

📚 Modern C++ Tutorial: C++11/14/17/20 On the Fly

msmarco-passage-ranking

MS MARCO(Microsoft Machine Reading Comprehension) is a large scale dataset focused on machine reading comprehension, question answering, and passage ranking. A variant of this task will be the part of TREC and AFIRM 2019. For Updates about TREC 2019 please follow This Repository Passage Reranking task Task Given a query q and a the 1000 most relevant passages P = p1, p2, p3,... p1000, as retrieved by BM25 a succeful system is expected to rerank the most relevant passage as high as possible. For this task not all 1000 relevant items have a human labeled relevant passage. Evaluation will be done using MRR

muct

Landmarked face database (3755 faces, 76 landmarks)

mxnet-notebooks

mxnet-seq2seq

Sequence to sequence learning with MXNET

mypro

nanogpt

The simplest, fastest repository for training/finetuning medium-sized GPTs.

neural-doodle

Turn your two-bit doodles into fine artworks with deep neural networks, generate seamless textures from photos, transfer style from one image to another, perform example-based upscaling, but wait... there's more! (An implementation of Semantic Style Transfer.)

neural-network-with-financial-time-series-data

This solution presents an accessible, non-trivial example of machine learning (Deep learning) with financial time series using Keras on top of Tensor Flow

neuralnlp-neuralclassifier

An Open-source Neural Hierarchical Multi-label Text Classification Toolkit

nlp-tutorial

Natural Language Processing Tutorial for Deep Learning Researchers