Machine learning: RFormula for feature selection (RFormula in SparkMLlib)
catalogue
0. Links to related articles
1. General
2. Spark code
0. Links to related articles
Algorithm article summary
1. General
Use RFormula to select features listed in spark2 Version 1.0 only supports some R operations, including: ~ ','. ',': ',' + ', and ‘-‘.
~ separate target and terms Split labels and features
+ con ...
Added by xangelo on Tue, 08 Feb 2022 18:14:21 +0200
[Leetcode] game 71 biweekly
preface
In the second week of the competition, a got the first two questions. The third question was not done because he ordered to eat. It's not difficult to look back. But whether it can be done in the official competition is not necessarily ha ha.
come on.
5984. Minimum sum of the last four digits after splitting
Topic display
Inte ...
Added by thecard on Tue, 08 Feb 2022 13:49:00 +0200
Game 36 of 2021 freshman individual training competition
Question A: gifts
Title Description In an n × On the grid graph of N, there are m gifts. Each gift has a value vi(1 ≤ i ≤ m). You can choose a gift and then choose: (1) Take all the gifts listed with it, or (2) take all the gifts with it What is the sum of the maximum value of the gifts you can get? input The first line has two pos ...
Added by Sturm on Tue, 08 Feb 2022 13:29:50 +0200
Sword finger offer 26.27.28 search and backtracking algorithm (simple) DFS of binary tree
26.
Title:
Sword finger Offer 26 Substructure of treehttps://leetcode-cn.com/problems/shu-de-zi-jie-gou-lcof/
Idea: first, find the root node of B in A. if it is found, compare AB from now on. Otherwise, return false
Note that when B==null, it is not a substructure of any tree and can be judged first
Two recursions are involved:
Recur ...
Added by nuxy on Tue, 08 Feb 2022 10:24:45 +0200
[leetcode SQL daily practice] - 595 Big country
🎈 Write in front
🙋♂️ Hello everyone, I'm super dream. You can call me Xiaomeng~
We all know that we have to deal with the database almost every day, whether in study or daily work. In order to better operate the database, our SQL knowledge reserve is essential. If you want to master SQL well, you must practice and stu ...
Added by Slippy on Tue, 08 Feb 2022 08:20:18 +0200
Year end bonus, maze problem
Title: * ~ year end bonus
Title Description Xiaodong's company will give a year-end bonus, and Xiaodong happens to get the highest welfare. He will participate in a lucky draw game at the company's annual meeting. The game is played on a 6 * 6 chessboard with 36 gifts of different values on it. There is a gift on each small chessboard. He n ...
Added by zone16 on Tue, 08 Feb 2022 06:45:33 +0200
Chimerge algorithm and matlab code implementation (data discretization)
Chimerge algorithm and matlab code implementation (data discretization)
1. Algorithm analysis
(chi square test)
Is the deviation degree between the actual observation value and the theoretical inference value of the statistical sample. The deviation degree between the actual observation value and the theoretical inference value determines th ...
Added by mendoz on Tue, 08 Feb 2022 04:11:58 +0200
[OpenCV complete routine] 93 Histogram of noise model
[OpenCV complete routine] 93 Histogram of noise model
Welcome to pay attention "100 complete OpenCV routines" Series, continuously updating Welcome to pay attention "Python Xiaobai's OpenCV learning course" Series, continuously updating
2. Noise model
The noise source in digital image mainly comes from the process ...
Added by renu on Tue, 08 Feb 2022 03:38:49 +0200
Explanation of Gauss elimination method
The essence of Gauss elimination is to simplify it into a stepped determinant. Firstly, the solutions of linear equations are as follows:
unsolvableThere are infinite solutionsUnique solution
The steps of Gaussian elimination are divided into the following four steps:
Enumerate each row to find the maximum absolute value of the current colu ...
Added by slashpine on Tue, 08 Feb 2022 03:29:04 +0200
Prim algorithm based on adjacency list
Prim algorithm
Prim algorithm is an algorithm to find the minimum spanning tree (mst) through the connected network Process: 1. Firstly, select any vertex as the root of the tree 2. Traverse other vertices (not in the tree). For each vertex, find an edge with the shortest path to mst. In this way, each vertex has an edge to mst (if it is not a ...
Added by Gestahr on Tue, 08 Feb 2022 01:47:12 +0200