louisway Goto Github PK

207

aima-python

Python implementation of algorithms from Russell And Norvig's "Artificial Intelligence - A Modern Approach"

autoencoding_vi_for_topic_models

Tensorflow implementation for prodLDA and NVLDA.

betterrecommendationproject

algorithms and experiment for recommendation

compiler_design

coursera-test

coursera test repository

cpp-primer

C++ Primer 5 answers

cs530-assembly-compiler

SIC/XE Compiler in C++

depth_rec_pose

useful code

dragonfruitproject

dynet

Dynamic neural network library

eluvio_ds_challenge

fullstack-course4

Example code for HTML, CSS, and Javascript for Web Developers Coursera Course

gcc

gibbsldaplusplus

C/C++ implementation of Latent Dirichlet Allocation (LDA) using Gibbs Sampling technique for parameter estimation and inference.

gorila

gru4rec

GRU4Rec is the original Theano implementation of the algorithm in "Session-based Recommendations with Recurrent Neural Networks" paper, published at ICLR 2016 and its follow-up "Recurrent Neural Networks with Top-k Gains for Session-based Recommendations". The code is optimized for execution on the GPU.

hdp

Hierarchical Dirichlet processes. Topic models where the data determine the number of topics. This implements Gibbs sampling.

html-css-js

html,css,js

instademo

kerasgru4rec

Keras implementation of GRU4Rec session-based recommender system

machine-learning-algorithm

for my practice to implement variety of ml algorithm

machinelearning-c---code

using c++ code to show the example of machine learning

praself

for test

sic-xe-assembler

stanford_dl_ex

Programming exercises for the Stanford Unsupervised Feature Learning and Deep Learning Tutorial

tensorflow

Computation using data flow graphs for scalable machine learning

topic_model

word2vec

This tool provides an efficient implementation of the continuous bag-of-words and skip-gram architectures for computing vector representations of words. These representations can be subsequently used in many natural language processing applications and for further research.