Programmer Group

Least square (OLS) is a method to directly solve the parameters of linear regression equation with mathematical formula. Taking the simplest univariate linear regression as an example, formula 6-4 shows that a series of X values can calculate a series of predicted values y ', in order to minimize the error (Y- Y') between Y 'and y' of each pair ...

KNN(K-Nearest Neighbors) generally refers to K-nearest neighbor algorithm, which is a common classification algorithm in machine learning The purpose of this paper is to quickly teach you an intuitive understanding of KNN algorithm. At the same time, in order to facilitate you to implement the algorithm, the model involved in this paper is deve ...

Problem background Given a connection graph corresponding to x and y, it is required that each xi and yi can only be matched once at most, and the maximum matching times can be calculated Solution idea  ( 1) Convert the connection of x and y into a matrix, which can be connected to each other, marked as 1, and the rest as 0 y1y2y3y4y ...

1, Introduction 1 origin and development of ant colony algorithm (ACA) In the process of studying the new algorithm, Marco Dorigo and others found that when ant colony is looking for food, they can exchange foraging information by secreting a biological hormone called pheromone, so they can quickly find the target. Therefore, in their doctoral ...

  1, Introduction to particle swarm optimization Particle swarm optimization algorithm was proposed by Dr. Eberhart and Dr. Kennedy in 1995. It comes from the study of bird predation behavior. Its basic core is to make use of the information sharing of individuals in the group, so as to make the movement of the whole group produce an evol ...

 1. Introduction to Particle Swarm Optimization Particle swarm optimization (PSO) was proposed by Dr. Eberhart and Dr. Kennedy in 1995. It originated from the study of bird predation behavior.Its basic core is to make use of the sharing of information by individuals in the group so that the movement of the whole group can evolve from diso ...

1. faiss role The general solution to the problem of similarity retrieval for TopK is violent retrieval, which iterates through all vectors to compute similarity and derive TopK. However, when the number of vectors is large, this method and its time-consuming, Faiss's appearance solves this problem well. 2. Introduction to faiss The full nam ...

Decision tree algorithm type Decision tree is a series of algorithms, not an algorithm. The decision tree includes ID3 classification algorithm, C4.5 Classification Algorithm, Cart classification tree algorithm and Cart regression tree algorithm. Decision tree can be used as both classification algorithm and regression algorithm. Therefore, de ...