machine learning in action machine learning algorithm learning notes support vector machine

Support Vector Machine Mathematical proof Pre knowledge: Lagrange number multiplication, dual problem, kernel technique Lagrange number multiplication For constrained optimization problems: Example: Known x>0,y>0,x+2y+2xy=8,be x+2y Minimum value of__. Solution: Introduction parameters λ ...

Added by arctushar on Sun, 06 Feb 2022 03:05:46 +0200

Formula string problem and Joseph Ring problem

catalogue 1. Formula string problem  2. Joseph Ring problem 1. Formula string problem First, let's look at a prototype: Corresponding letecode link: Interview question 16.26 Calculator - LeetCode (LeetCode CN. Com) Title Description: Given an arithmetic expression (except parentheses) containing positive integers, p ...

Added by slibob on Sat, 05 Feb 2022 20:41:04 +0200

Infix expression to suffix expression and evaluation

Because in the school is really too idle, so wrote an expression evaluation of the C language program, hope big guys can correct. Basic idea: Just like putting an elephant in a refrigerator, we need to evaluate the expression in three steps. Enter an infix expression (the expression we usually see)Convert infix expression to suffix express ...

Added by neo926 on Sat, 05 Feb 2022 13:47:10 +0200

Necessary exercises for College Students - 50 classic examples of Java language

I'm Chen PI. I'm an ITer of Internet Coding. I search "Chen Pi's JavaLib" on wechat. I can read the latest article at the first time and reply to [data], so I can get my carefully sorted technical data, e-books, interview data of front-line large factories and excellent resume template. introduction During college, Java la ...

Added by jyushinx on Sat, 05 Feb 2022 12:36:38 +0200

Queue of data structure

What is a queue A queue is a linear data structure. Different from the stack with the same linear data structure, the elements in the queue follow the First In First Out rule. Like queuing in reality, it pays attention to the principle of first come, first served. The exit end of the queue is called the front, and the entrance end of the queue ...

Added by boinnk on Sat, 05 Feb 2022 12:24:08 +0200

[algorithm problem inductive set] graph theory - typical application of minimum spanning tree

1, AcWing 1140 Shortest network [Title Description] Farmer John was elected mayor of his town! One of his campaign promises is to build an Internet in the town and connect to all farms. John has arranged a high-speed network line for his farm. He wants to share this line with other farms. What's the number of John's farm ...

Added by dgny06 on Sat, 05 Feb 2022 05:35:11 +0200

Leetcode-D43-array-40 Combined sum II&47 Full arrangement II

1, Review First review the retrospective question written yesterday, and start with the simple one of full arrangement. 46. Full arrangement In fact, this kind of backtracking is quite fun. Unlike dynamic programming, it can remember the details of answer, and all of them are on the path (we use continuous recursive path to record this value, ...

Added by X.Cyclop on Sat, 05 Feb 2022 03:41:55 +0200

"Force buckle algorithm set"

Tip: A list of questions to answer in this blog post 6. Hamming Distance 7. Numbers that disappear 8. Number of 1 in binary Numbers missing in 9.0-n-1 10.Number of 1 of the first n digit binaries 11. Number I appears only once 12. Number II appears only once 13. Number III appears only once 14. Number IV appears only once Preface T ...

Added by wenquxing on Fri, 04 Feb 2022 19:59:40 +0200

Section 3.3 of algorithm notes - Introduction simulation - > Graphic Output

A output ladder Title Description h is the height of the upper input side of the ladder, and h is the height of the upper input side. input An integer H (1 < = h < = 1000). output Trapezoid corresponding to h. sample input 5 sample output ***** ******* ********* *********** ************* Code submissi ...

Added by private_guy on Fri, 04 Feb 2022 16:55:45 +0200

Total solution of bipartite graph

Algorithmic thought Definition of bipartite graph: if all vertices of a graph can be divided into X X X and Y Y Y two sets, and for all edges, the two points of the edge do not belo ...

Added by CaptainStarbuck on Fri, 04 Feb 2022 16:55:24 +0200