summary

Neural Networks and Learning Machines. 3rd Ed. Simon O. Haykins. Pearson. 2008

Chapter 8. Principal-Components Analysis 8.1 Introduction 8.2 Principles of Self-Organization Principle 1. Self-Amplification Principle 2. Competition Principle 3. Cooperation Principle 4. Structural Information 8.3 Self-Organized Feature Analysis 8.4 Principal-Components Analysis: Perturbation Theory 8.5 Hebbian-Based maximum Eigenfilter 8.6 Hebbian-Based Principal Components Analysis 8.7 Case Study: Image Coding 8.8 Kernel Principal-Components Analysis 8.9 Basic Issues Involved in […]

Sequence to Sequence Learning with Neural Networks | Summary

References Ilya Sutskever, Oriol Vinyals, Quoc V. Le (2014). “Sequence to Sequence Learning with Neural Networks”. NIPS 2014: 3104-3112. [PDF] Sequence-to-Sequence Models. TensorFlow [LINK] The official tutorial for sequence-to-sequence models. Seq2seq Library (contrib). Tensorflow [LINK] Translation with a Sequence to Sequence Network and Attention. PyTorch. [LINK]

How to Install Caffe

Install Caffe on?Linux Ubuntu 16.04 My Configurations Linux: Ubuntu 16.04 LTS Anaconda: Anaconda 2 (64-bit),?Anaconda2-4.3.0-Linux-x86_64.sh CPU or GPU: CPU Install Caffe 1. Install CUDA 8 (Optional. I failed this installation.) Go to the CUDA download page(https://developer.nvidia.com/cuda-downloads). ‘ Go to the directory where the downloaded file cuda_8.0.44_linux.run?is located.

I got an error. http://askubuntu.com/questions/149206/how-to-install-nvidia-run Hit CTRL+ALT+F1 […]

Kruskal’s Algorithm

Kruskal’s Algorithm Approach: greedy approach Purpose: to find a minimum spanning tree in a weighted graph Example   References Kruskal’s Algorithm | Essay Assignment | Seminar on Advanced Mathematics Spanning Tree | tutorialspoint Kruskal’s Spanning Tree Algorithm | tutorialspoint Prim’s Spanning Tree Algorithm | tutorialspoint

Quicksort

In practice, quicksort outperforms merge sort, and it significantly outperforms selection sort and insertion sort. The average-case running time of quicksort is as good as mergesort’s. That’s because?the constant factor hidden in the big-Θ notation for quicksort makes mergesort quite faster?than mergesort. Not using additional storage. pivot, split point Example References Overview of quicksort | […]

Understanding Modern Mathematics | MA

Brief Information Name : Understanding Modern Mathematics 현대수학의이해 Lecturer : 허민?Min Her Semester : 2016 Fall Major?: BS, Mathematics Textbook Howard Eves (2003) 『수학의 위대한 순간들』경문사 Korean translated version of the following two books. The two books is merged into this Korean edition. Howard Eves (1980)?Great Moments in Mathematics Before?1650. Mathematical Assn of Amer Howard […]