octave machine learning

First, the visualization method Bar chart Pie chart Box-line Diagram (box chart) Bubble chart Histogram Kernel density estimation (KDE) diagram Line Surface Chart Network Diagram Scatter chart Tree Chart Violin chart Square Chart Three-dimensional diagram Second, interactive tools Ipython, Ipython Notebook plotly Iii. Python IDE Type Pycharm, specifying a Java swing-based user interface PyDev, SWT-based

After tossing the crawler and some interesting content, I recently in the R language for simple machine learning knowledge, the main reference is "machine learning-Practical Case Analysis" this book.This book is a rare, purely r language-based machine

Learning notes of machine learning practice: Implementation of decision trees, Decision tree is an extremely easy-to-understand algorithm and the most commonly used data mining algorithm. It allows machines to create rules based on datasets. This is actually the process of machine

Brief introductionMachine learning algorithms are algorithms that can be learned from data and improved from experience without the need for human intervention. Learning tasks include learning about functions that map input to output, learning about hidden structures in unlabeled data, or "instance-based

converge or even diverge. .One thing worth noting:As we approach the local minimum, the guide values will automatically become smaller, so the gradient drop will automatically take a smaller amplitude, which is the practice of gradient descent. So there's actually no need to reduce the alpha in addition, we need a fixed (constant) learning rate α. 4. Gradient Descent linear regression (Gradient descent for Linear Regression) This is the method of us

: Random initialization Loop until convergence { Each State transfer count in the sample is used to update and R Use the estimated parameters to update V (using the value iteration method of the previous section) According to the updated V to re-draw } In step (b) We are going to do a value update, which is also a loop iteration, in the previous section we solved v by initializing v t

1. Nearest Neighbor Component analysis (NCA) algorithmAbove content reproduced from: http://blog.csdn.net/chlele0105/article/details/130064432. Metric LearningIn machine learning, the main purpose of dimensionality reduction of high dimensional data is to find a suitable low-dimensional space, in which the learning can be better than the original space performanc

meaningless.Thus, further, the following derivation is made:As for why we use the 2 norm here, I understand mainly for the sake of presentation convenience.The meaning of such a big paragraph after each round of algorithm strategy iteration, we require the length of the W to increase the growth rate is capped. (Of course, it is not necessarily the growth of each round, if the middle of the expansion of the equation is relatively large negative, it may also decrease)The above two ppt together to

)/m; at End - End - -%size (J,1) -%size (J,2) - ind3 = A3-Ty; -D2 = (D3 * THETA2 (:,2: End)). *sigmoidgradient (z2); toTheta1_grad = Theta1_grad + d2'*a1/m; +Theta2_grad = Theta2_grad + d3'*a2/m; - the% ------------------------------------------------------------- *jj=0; $ Panax Notoginseng forI=1: Size (Theta1,1) - forj=2: Size (Theta1,2) theJJ = JJ + Theta1 (i,j) *theta1 (i,j) *lambda/(m*2); + End A End theSize (Theta1,1); +Size (Theta1,2); - $ forI=1: Size (THETA2,1) $