weka machine learning

Project applicability analysis of main machine learning algorithmsSome time ago Alphago with the Li Shishi of the war and related deep study of the news brush over and over the circle of friends. Just this thing, but also in the depth of machine learning to further expand, and the breadth of

1. Overview:The first step in learning a subject is to understand what this knowledge is and what it can be used for.This article lists some of the more well-written articles in the process of learning machine learning and the initial impressions of machines learning after r

one, factor decomposition machineFMthe Modelfactor decomposition Machine (factorization machine, FM) is bySteffen Rendlea machine learning algorithm based on matrix decomposition is proposed. 1, Factor decomposition machineFMThe advantagesfor factor decomposition machinesFM, the most important feature is that the spars

This article is part of the third chapter of "Neural networks and deep learning", which describes how to select the value of the initial hyper-parameter in the machine learning algorithm. (This article will continue to add)Learning Rate (learning rate,η)When using the gradie

TensorFlow integrates and implements a variety of machine learning-based algorithms that can be called directly.Supervised learning1) Decision Trees (decision tree)Decision tree is a tree structure, providing people with decision-making basis, decision tree can be used to answer yes and no problem, it through the tree structure of the various situations are represented, each branch represents a choice (sele

Hello everyone, I am mac Jiang. See everyone's support for my blog, very touched. Today I am sharing my handwritten notes while learning the cornerstone of machine learning. When I was studying, I wrote down something that I thought was important, one for the sake of deepening the impression, and the other for the later review.Online

neighbor point, and then can establish a neighbor map, so calculate the distance between two points of the problem, The transition becomes the shortest path problem (Dijkstra algorithm) between two points on the nearest neighbor graph.So what is the ISOMAP algorithm? In fact, it is a variant of the MDS algorithm, the same idea as the MDS, but in the calculation of the distance of the high-dimensional space is the geodesic distance, rather than the real expression of the European distance betwee