Nothing Special   »   [go: up one dir, main page]

CN109711636A - River water level prediction method based on chaotic firefly and gradient lifting tree model - Google Patents

River water level prediction method based on chaotic firefly and gradient lifting tree model Download PDF

Info

Publication number
CN109711636A
CN109711636A CN201910018633.8A CN201910018633A CN109711636A CN 109711636 A CN109711636 A CN 109711636A CN 201910018633 A CN201910018633 A CN 201910018633A CN 109711636 A CN109711636 A CN 109711636A
Authority
CN
China
Prior art keywords
firefly
data
algorithm
model
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201910018633.8A
Other languages
Chinese (zh)
Inventor
梁雪春
苏佳佩
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Tech University
Original Assignee
Nanjing Tech University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Tech University filed Critical Nanjing Tech University
Priority to CN201910018633.8A priority Critical patent/CN109711636A/en
Publication of CN109711636A publication Critical patent/CN109711636A/en
Pending legal-status Critical Current

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention provides a river water level prediction method based on a chaos firefly and gradient lifting tree model, and relates to the technical field of information and the technical field of hydrologic condition prediction. First, data is collected and the required data is divided into five categories in total. And then carrying out data preprocessing, including elimination of abnormal values, processing of missing values and data normalization. The improved chaotic firefly algorithm is used for optimizing the training parameters of the gradient lifting tree model, and the improved gradient lifting tree model is applied to the river level prediction research of the structured data. And finally, constructing a training sample set, randomly adopting a part of the 5 types of data obtained after processing for model training, optimizing by using a GSO algorithm, carrying out parameter tuning to obtain a GBDT model under optimal parameters, having better generalization capability, improving the accuracy of the model for water level prediction, finally carrying out model inspection by combining a test set, and carrying out comparative analysis on the obtained actual value and the error of a calculated value to verify the excellence of the model.

Description

River water level prediction method based on chaotic firefly and gradient lifting tree model
Technical Field
The invention discloses a river water level prediction method based on a chaos firefly and gradient lifting tree model, and relates to the technical field of information and the technical field of hydrologic condition prediction.
Background
In the early 70 s, the swedish hydrographic and weather bureau developed a hydrographic forecasting model for flood forecasting of hydropower plants, and performed flood forecasting by inputting reasonable forecasting parameters and verifying forecasting results. In recent years, China has rapidly developed water conservancy informatization, and has achieved some successful applications in water resource allocation and management, but China starts late in the field of hydrological forecasting, the mining degree of a large amount of water conservancy data is low, and means for finding valuable information from a large amount of hydrological data are few.
The significance of the explanation is mainly to reasonably and accurately predict the river water level through an information technology means.
At present, the hydrological condition prediction technology system is still in a development stage in China, and compared with developed countries, the hydrological condition prediction technology system still faces many problems which need to be solved urgently. There are mainly the following problems:
1. in the case of large amount of data, how to combine the method of machine learning effectively and accurately solves the practical problem of water level prediction.
2. Data analysis and pretreatment: the accuracy of the water level prediction model performance depends on the integrity, validity and timeliness of the data. Data samples which are not suitable for being input as a model are inevitably in original data, so that processing of missing values and abnormal values is necessary, and how to process the missing values and the abnormal values of different data types becomes a difficulty.
3. Index selection under multidimensional data: the evaluation data index attributes obtained by the conventional water level monitoring are not uniform, and the method has the characteristics of multiple data indexes, high data dimension, and non-linearity and redundancy of data, so that the method is particularly important for screening important characteristic indexes.
4. And (3) establishing a water level prediction model, namely establishing a water level prediction model suitable for the national conditions of China by referring to the research results of the river water level prediction model of the predecessors.
The invention aims to quantitatively analyze the river water level so as to effectively predict the future river water level through historical data. The water level is also the primary sign for the water conservancy department to know the water flow change, dynamic information of the water level is monitored, important basis is provided for the decision of the water conservancy department, and the water level change is closely related to the daily life and production construction of people.
Disclosure of Invention
The invention provides a machine learning method for river water level prediction based on data mining and data analysis aiming at the characteristics of complicated river water level change and the like. The change of the water level is the result of the comprehensive action under various influence factors, so the selected data comprises historical data such as a time stamp, instantaneous flow, accumulated water quantity, flow rate, water level and the like, and the accurate prediction of the river water level is completed through the selected structured data.
In order to solve the technical problem, the invention provides a river water level prediction method based on a chaotic firefly and gradient lifting tree model, which comprises the following steps:
s101: in order to extract effective information from a large amount of data, a data acquisition scheme is provided. The required data are divided into five types in total, the time stamp can represent that a piece of data exists completely and can be verified at a specific time point, the accumulated water quantity represents the sum of river flow in the current time period, the instantaneous flow represents the amount of fluid flowing through the effective section of a closed pipeline or an open channel in unit time, the flow rate river represents the displacement data in unit time, and the water level represents the water regime of the water body which is most intuitively reflected in the current time period. The method aims to extract information from the structured data to provide a decision for accurate prediction of river water level.
The concrete contents of the five types of data are S1011, S1012, S1013, S1014 and S1015. The timestamp data can represent that a complete verifiable exists at a particular point in time; the accumulated water quantity data reflects the total river running water in the current time period; the instantaneous flow data reflects the amount of fluid flowing through the effective section of a closed pipeline or an open channel in unit time, a flow meter is mainly adopted to measure the flow of a river at present, and the error between the measured value and the actual value of the flow is large due to instability of the flow; the flow velocity data reflects the displacement of the river in unit time, the flow velocities of various points of water flow in the channel and the river channel are different, the flow velocities near the bottom and the edge of the river (channel) are smaller, and the flow velocity near the water surface in the center of the river is the largest; the water level data can reflect the most intuitive water regime of the water body in the current time period, the observation content of the water level generally comprises the influence of changes such as the flow, the waves and the ice regime, and the observation time and times are changed along with the change process of the water level in one day.
S102: and acquiring data, processing the acquired data, wherein the data preprocessing in the structured data comprises elimination of abnormal values, processing of missing values and data normalization.
S103: the invention provides an improved chaotic firefly algorithm (GSO) for optimizing training parameters of a Gradient Boosted Decision Tree (GBDT), and the improved Gradient Boosted Tree model is applied to river water level prediction research of structured data, so that classification and regression tasks can be better realized.
S1031: gradient boosting decision tree: the method is an iterative decision Tree algorithm, the algorithm is composed of a plurality of decision trees, the conclusion of all the trees is accumulated to be used as a final classifier, the algorithm is an algorithm with strong generalization capability (generalization), the result of the model is a set of regression classification Tree combinations (CART Tree Ensemble), and the model can be expressed as the following model:
in the formula (1) fk(xi) The k-th decision tree is represented,representing a strong classifier that is linearly summed up by n weak classifiers. Namely, adding a new decision tree function f to the last round of predicted valuek(xi) So that the residual error from the true value is reduced to the maximum extent. The objective function of GBDT is as follows:
formula (2) wherein l is a differentiable loss function representing a predicted valueAnd true value yiThe difference value of (a) to (b),regularization for addition [9]Ω represents the complexity of the decision tree, and may constrain the number of nodes of the decision tree, the depth of the tree, or the L of the score corresponding to the leaf node2And (4) norm. Over-fitting of the model is prevented.
The target function of the t iteration is shown in the formula (3), wherein C is a constant, the formula is expanded according to the Taylor formula, and a second-order form is used as an approximate value of the target function, and the formula is as follows:
in the formula (4), the reaction mixture is,respectively, a loss function pairFirst and second derivatives of (a). The objective function of t iterations with the constant term removed can be simplified as equation (5), and the tree complexity function used herein is as follows:
in the formula (6), γ represents a leaf node coefficient, and T represents the number of leaf nodes. λ is L2The square mode coefficients also act to prevent overfitting, ω representing the leaf weight. Redefining the decision tree function ft(x)=ωq(x)[10]I.e. splitting the tree into a structure function q and a leaf weight part ω, where q maps the input to the index of the leaf, i.e. q: rd→ {1, 2, 3, L, T }, define the sample set of each leaf as Ij={i|q(xi) And j, solving by using a minimum value of a quadratic equation to obtain an optimal solution of the optimal solution objective function.
From the above, when the structure function q of the decision tree is obtained, the objective function can be obtained by calculation according to the above formula, and the final problem is converted into finding the optimal tree structure q*So that the objective function has a minimum value.
S1032: the firefly search algorithm is a heuristic search algorithm proposed based on bionics, the brightness of the firefly is related to a target value at the position of the firefly, and the brighter firefly indicates that the position of the firefly is better, namely the firefly has a better target function value. The brighter the firefly, the better the location it is, i.e., the better the objective function value, and most fireflies will gather at multiple locations, i.e., reach the extreme points.
1. Setting initial state, setting firefly number n and maximum attraction β0The light intensity absorption coefficient γ, the step factor α, the maximum number of iterations MaxGeneration or the search precision ε.
2. Randomly initializing the position of the firefly, and calculating the target function value of the firefly as the respective maximum fluorescence brightness I0
3. The relative brightness I and attraction β of the fireflies in the population are calculated, and the direction of movement of the fireflies is determined based on the relative brightness.
4. And updating the position of the firefly, randomly moving the firefly at the optimal position, and recalculating the brightness of the firefly.
5. And (4) updating the optimal solution and the optimal solution position of the objective function, judging whether the optimal solution meets the set condition and whether the maximum iteration number is reached, and if not, turning to the step (3) to iterate.
6. And outputting the global extreme point.
S1033: the improved firefly algorithm optimizes the GBDT model training parameters and is improved through the following two aspects:
1. introducing inertial weight: in the process of solving the problem, it is generally expected that the optimization algorithm exhibits good global search capability at the early stage and has fine local development capability at the later stage, the position update of the firefly algorithm has randomness, and in order to improve the performance of the algorithm, the update weight formula introduces inertia weight:
xi(t+1)=ωxi(t)+β(xj(t)-xi(t))+α(rand-1/2) (9)
2. adding a chaotic variation system: in order to improve the characteristic of poor optimization precision of the algorithm, when most points are in an iteration stop state, the characteristic of traversal of the chaotic system is utilized, so that the particles jump out of a local optimal solution. Is a chaotic system mapped by Logistic:
Xn+1=uXn(1-Xn) n=0,1,2L (10)
the invention mainly utilizes an improved firefly algorithm to carry out parameter optimization on three parameter step lengths (learning _ rate), the maximum depth (max _ depth) of a decision tree and the maximum leaf node number (max _ leaf _ nodes) of the GBDT model. And (3) taking the error between the training set and the actual value as a fitness function f (x), and searching a GBDT model under the optimal parameters to improve the accuracy of the model.
Drawings
FIG. 1 is a general flow diagram of the present invention;
FIG. 2 is a schematic diagram of the GBDT algorithm;
Detailed Description
With reference to fig. 1, the river water level prediction based on the chaotic firefly and gradient-boosted tree model of the present invention includes the following steps:
A. the data acquisition and the required data are divided into five types in total, and the five types of data respectively comprise complete verifiable timestamp data which can represent that one piece of data exists at a specific time point, cumulative water quantity data of the sum of river flow in the current time period, instantaneous flow data of fluid quantity flowing through the effective section of a closed pipeline or an open channel in unit time, flow speed data of displacement of the river in unit time, and water level data which most visually reflects the water regime of the water body in the current time period.
B. The Decision Tree model trained with the strategy of Gradient Boosting, the result of which is a set of regression classification Tree combinations (CART Tree Ensemble), can be expressed as the following model:
in the formula (1), fk(xi) The k-th decision tree is represented,representing a strong classifier that is linearly summed up by n weak classifiers. Namely, adding a new decision tree function f to the last round of predicted valuek(xi) So that the residual error from the true value is reduced to the maximum extent. The objective function of GBDT is as follows:
in the formula (2), l is a differentiable loss function representing a predicted valueAnd true value yiThe difference value of (a) to (b),for added regularization, Ω represents the decisionThe complexity of the tree can be restricted by the number of nodes of the decision tree, the depth of the tree or the L of the scores corresponding to the leaf nodes2And (4) norm. Over-fitting of the model is prevented.
The formula is an objective function of the t iteration, wherein C is a constant, the formula is expanded according to a Taylor formula, and a second-order form is taken as an approximate value of the objective function, and the formula is as follows:
solving by using the minimum value of a quadratic equation to obtain an optimal solutionOptimal solution L of objective function*
When the structure function q of the decision tree is obtained, the objective function can be obtained by calculation according to the formula. The final problem is converted into finding the optimal tree structure q*So that the objective function has a minimum value.
The improved firefly algorithm optimizes the GBDT model training parameters, and is characterized in that:
1. by introducing inertial weight, in the process of solving problems, the optimization algorithm is generally expected to show good global search capability at the early stage and have fine local development capability at the later stage. The position updating of the firefly algorithm has randomness, and in order to improve the performance of the algorithm, an updating weight formula introduces inertia weight:
xi(t+1)=ωxi(t)+β(xj(t)-xi(t))+α(rand-1/2) (6)
omega is reduced along with the increase of the iteration times t, so that a firefly algorithm is ensured to have a good search space, and the value of omega in the early period is larger, so that the local optimal solution can be skipped, and the global search capability of the algorithm is ensured. And the later omega value is small, so that the later searching capability of the algorithm is accelerated while the local searching capability of the algorithm is ensured.
2. And a chaotic variation system is added, so that in order to improve the characteristic of poor optimization precision of the algorithm, when a plurality of points are in an iteration stop state, the local optimal solution is skipped by utilizing the traversal characteristic of the chaotic system. Is a chaotic system mapped by Logistic:
Xn+1=uXn(1-Xn) n=0,1,2L (7)
wherein u is a control parameter, generally, u is 4, and the system is completely in a chaotic state. Giving any one of the initial values X0∈[0,1]And the Logistic is completely in a chaotic state, so that the global property and the uniformity of the dispersion are ensured. When the optimal solution isAnd if the iteration process is unchanged for h times, triggering a mapping condition, performing Logistic mapping on the position, and scattering the position in the space again for optimizing, so that the algorithm is not easy to fall into local optimization, and the later accuracy of the algorithm is ensured.
The invention mainly utilizes an improved firefly algorithm to carry out parameter optimization on three parameter step lengths (learning _ rate), the maximum depth (max _ depth) of a decision tree and the maximum leaf node number (max _ leaf _ nodes) of the GBDT model. And (3) taking the error between the training set and the actual value as a fitness function f (x), and searching a GBDT model under the optimal parameters to improve the accuracy of the model.
C. And performing model inspection on the test set, randomly selecting a part of processed data as the test set, using the rest data as a training set, performing optimization by using a GSO algorithm, performing parameter tuning to obtain a GBDT model under optimal parameters, performing model inspection by combining the test set, and analyzing and comparing the error of the obtained actual value and the error of the calculated value.

Claims (6)

1. A river water level prediction method based on a chaos firefly and gradient lifting tree model is characterized by comprising the following steps:
s101: the data acquisition and the required data are divided into five types in total, and the five types of data respectively comprise complete verifiable timestamp data which can represent that one piece of data exists at a specific time point, cumulative water quantity data of the sum of river flow in the current time period, instantaneous flow data of the amount of fluid flowing through the effective section of a closed pipeline or an open channel in unit time, flow speed data of displacement of the river in unit time, and water level data which most visually reflects the water regime of the water body in the current time period.
S102: the method comprises the steps of collecting data preprocessing, wherein the collected data are all structured data, and the data preprocessing in the structured data comprises the elimination of abnormal values, the processing of missing values and data normalization.
S103: training parameters of a Gradient Boosted Decision Tree (GBDT) model are optimized based on an improved chaotic firefly algorithm (GSO), and the improved Gradient Boosted Tree model is applied to river water level prediction research.
S104: constructing a training sample set, randomly adopting a part of the 5 types of data obtained after processing for model training, optimizing by using a GSO algorithm, carrying out parameter tuning to obtain a GBDT model under optimal parameters, carrying out model inspection by combining a test set, calculating the error with an actual value, and verifying the excellence of the model.
2. The five types of data according to claim 1, wherein:
the data acquisition of the predicted water level comprises the following steps:
s1011: the timestamp can represent the complete verifiable data that already exists at a particular point in time;
s1012: the accumulated water amount reflects the total river water flow in the current time period;
s1013: the instantaneous flow reflects the data of the fluid volume flowing through the closed pipeline or the effective section of the open channel in unit time, the flow meter is mainly adopted to measure the flow of the river at present, and the error between the measured value and the actual value of the flow is large due to the instability of the flow;
s1014: the flow velocity reflects the displacement of the river in unit time, the flow velocities of various points of water flow in the channel and the river channel are different, the flow velocities near the bottom and the edge of the river (channel) are smaller, and the flow velocity near the water surface in the center of the river is the largest;
s1015: the water level can reflect the most intuitive water regime of the water body in the current time period, the observation content of the water level generally comprises the influence of changes such as the flow, the waves and the ice regime, and the observation time and the observation times are changed along with the change process of the water level in one day.
3. The structured data preprocessing of claim 1, wherein:
s1021: when the data is preprocessed, three methods for processing missing values are as follows: directly using features containing missing values; deleting features that contain missing values (the method is valid when an attribute that contains a missing value contains a large number of missing values but only a very small number of valid values); completing missing values; common types of feature selection fall into three categories: filter, wrapper, and embedding.
4. The GBDT model of S103, according to claim 1, wherein:
s1031: the invention provides a GBDT model which can better realize classification and regression tasks to predict the water level.
GBDT is a new model trained in the gradient direction of residual error reduction for each training in order to reduce the residual error of the previous time, and finally, the accumulation of all trees is used as a final classifier, so that classification and regression tasks can be well realized, and the overfitting phenomenon is not easy to occur. GBDT principle: a Decision Tree model trained with the strategy of Gradient Boosting. The result of the model is a set of regression classification Tree combinations (CART Tree ensembles) that can be represented as the following model:
in the formula (1), fk(xi) The k-th decision tree is represented,representing a strong classifier that is linearly summed up by n weak classifiers. Namely, adding a new decision tree function f to the last round of predicted valuek(xi) So that the residual error from the true value is reduced to the maximum extent. The objective function of GBDT is as follows:
in the formula (2), l is a differentiable loss function representing a predicted valueAnd true value yiThe difference value of (a) to (b),for added regularization, Ω represents the complexity of the decision tree, and may constrain the number of nodes of the decision tree, the depth of the tree, or the L of the scores corresponding to the leaf nodes2Norm, overfitting of the stop model:
the target function of the t iteration is shown in the formula (3), wherein C is a constant, the formula is expanded according to the Taylor formula, and a second-order form is used as an approximate value of the target function, and the formula is as follows:
in the formula (4), the reaction mixture is,respectively, a loss function pairThe objective function of t iterations, minus the constant term, can be simplified as equation (5), and the tree complexity function used herein is as follows:
in the formula (6), γ represents a leaf node coefficient, and T represents the number of leaf nodes. λ is L2The square mode coefficients also act to prevent overfitting, ω representing the leaf weight. Redefining the decision tree function ft(x)=ωq(x)I.e. splitting the tree into a structure function q and a leaf weight part ω, where q maps the input to the index of the leaf, i.e. q: rd→ {1, 2, 3, L, T }, define the sample set of each leaf as Ij={i|q(xi) J, so that the objective function is rewritten:
wherein,solving by using the minimum value of a quadratic equation to obtain an optimal solutionOptimal solution L of objective function*
From the above, when the structure function q of the decision tree is obtained, the objective function can be obtained by calculation according to the above formula. The final problem is converted into finding the optimal tree structure q*So that the objective function has a minimum value.
5. The firefly algorithm of S103, as set forth in claim 1, wherein:
s1032: the firefly search algorithm is a heuristic search algorithm proposed based on bionics, the brightness of the firefly is related to a target value at the position of the firefly, and the brighter firefly indicates that the position of the firefly is better, namely the firefly has a better target function value. The brighter the firefly, the better the position where the firefly is located, i.e. the better objective function value, most of the firefly will gather at multiple positions, i.e. the extreme point is reached, the relative fluorescence brightness of the firefly:
in the formula (10), I0Denotes the brightness of the brightest firefly, gamma denotes the light absorption coefficient, rijDistance between firefly i and firefly j, degree of mutual attraction β:
in formula (11), β0Represents the maximum attraction, i.e. the attraction at the light source, optimal target iteration:
xi(t+1)=xi(t)+β(xj(t)-xi(t))+α(rand-1/2) (12)
x in formula (12)iAnd xjRepresenting the spatial positions of two fireflies, i and j, α is a step factor with rand of [0, 1]Obeying a uniformly distributed random factor.
The firefly algorithm is specifically realized as follows:
(1) setting initial state, setting firefly number n and maximum attraction β0The light intensity absorption coefficient γ, the step factor α, the maximum number of iterations MaxGeneration or the search precision ε.
(2) Randomly initializing the position of the firefly, and calculating the target function value of the firefly as the respective maximum fluorescence brightness I0
(3) The relative brightness I and attraction β of the fireflies in the population are calculated, and the direction of movement of the fireflies is determined based on the relative brightness.
(4) Updating the position of the firefly, randomly moving the firefly at the optimal position, and recalculating the brightness of the firefly
(5) And (4) updating the optimal solution and the optimal solution position of the objective function, judging whether the optimal solution meets the set conditions and reaches the maximum iteration times, and if not, turning to the step (3) to iterate.
(6) And outputting the global extreme point.
6. The improved firefly algorithm for optimizing GBDT model training parameters of claim 1, wherein:
s1033: the firefly algorithm has the characteristics of simplicity, easy understanding, few parameters and the like, and when the problem is solved, excessive parameters do not need to be configured, so that the firefly algorithm is easy to realize. Studies have shown that this algorithm may be more efficient than genetic algorithms, PSOs, and other algorithms. However, the firefly algorithm has the disadvantages of low finding rate in local search, low search speed, low precision and the like. The present description is improved by the following two aspects:
(1) introducing inertial weights
In the process of solving the problem, the optimization algorithm is generally expected to show good global search capability at the early stage and have fine local development capability at the later stage. The position updating of the firefly algorithm has randomness, and in order to improve the performance of the algorithm, an inertia weight is introduced into an updating weight formula:
xi(t+1)=ωxi(t)+β(xj(t)-xi(t))+α(rand-1/2) (13)
omega is reduced along with the increase of the iteration times t, so that a firefly algorithm is ensured to have a good search space, the value of omega in the early period is larger, the local optimal solution can be skipped, and the global search capability of the algorithm is ensured. And the later omega value is small, so that the later searching capability of the algorithm is accelerated while the local searching capability of the algorithm is ensured.
(2) Adding chaotic variant system
In order to improve the characteristic of poor optimization precision of the algorithm, when most points are in an iteration stop state, a local optimal solution is jumped out by utilizing the traversal characteristic of the chaotic system. Is a chaotic system mapped by Logistic:
Xn+1=uXn(1-Xn)n=0,1,2L (14)
wherein u is a control parameter, generally, u is 4, and the system is completely in a chaotic state. Giving any one of the initial values X0∈[0,1]And the Logistic is completely in a chaotic state, so that the global property and the uniformity of the dispersion are ensured. The algorithm is not easy to fall into local optimization, and the later accuracy of the algorithm is ensured.
CN201910018633.8A 2019-01-09 2019-01-09 River water level prediction method based on chaotic firefly and gradient lifting tree model Pending CN109711636A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910018633.8A CN109711636A (en) 2019-01-09 2019-01-09 River water level prediction method based on chaotic firefly and gradient lifting tree model

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910018633.8A CN109711636A (en) 2019-01-09 2019-01-09 River water level prediction method based on chaotic firefly and gradient lifting tree model

Publications (1)

Publication Number Publication Date
CN109711636A true CN109711636A (en) 2019-05-03

Family

ID=66261020

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910018633.8A Pending CN109711636A (en) 2019-01-09 2019-01-09 River water level prediction method based on chaotic firefly and gradient lifting tree model

Country Status (1)

Country Link
CN (1) CN109711636A (en)

Cited By (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110361963A (en) * 2019-06-10 2019-10-22 岭南师范学院 A kind of permanent magnetism blower PI parameter optimization method and device
CN110399587A (en) * 2019-06-21 2019-11-01 武汉大学 The method of amplitude is influenced on water level using anomaly residual error identification adjustment of river channel
CN110490366A (en) * 2019-07-15 2019-11-22 西安理工大学 Runoff forestry method based on variation mode decomposition and iteration decision tree
CN110765110A (en) * 2019-10-24 2020-02-07 深圳前海微众银行股份有限公司 Generalization capability processing method, device, equipment and storage medium
CN110852475A (en) * 2019-09-24 2020-02-28 广州地理研究所 Extreme gradient lifting algorithm-based vegetation index prediction method, system and equipment
CN110909158A (en) * 2019-07-05 2020-03-24 重庆信科设计有限公司 Text classification method based on improved firefly algorithm and K nearest neighbor
CN110926524A (en) * 2019-10-29 2020-03-27 中国电子科技集团公司第七研究所 Method for predicting coupling relation between network resources and environment
CN111159896A (en) * 2019-12-30 2020-05-15 天津大学 Firefly algorithm-based error self-adaptive correction river flow calculation method
CN111539587A (en) * 2020-03-06 2020-08-14 李�杰 Hydrological forecasting method
CN111639842A (en) * 2020-05-20 2020-09-08 湖北博华自动化系统工程有限公司 Equipment health evaluation method, evaluation system and equipment health prediction method
CN113888202A (en) * 2021-09-03 2022-01-04 西安峰频能源科技有限公司 Training method and application method of electricity price prediction model
CN114782740A (en) * 2022-03-31 2022-07-22 安徽大学 Remote sensing water quality monitoring method combining genetic optimization and extreme gradient promotion
CN115271186A (en) * 2022-07-18 2022-11-01 福建中锐网络股份有限公司 Reservoir water level prediction early warning method based on delay factor and PSO RNN Attention model
CN116202575A (en) * 2023-05-04 2023-06-02 山东汇杰地理信息科技有限公司 Soil erosion rate monitoring system and method for soil conservation
CN116524349A (en) * 2023-03-22 2023-08-01 广东工业大学 Rice yield prediction method and system based on improved firefly algorithm
CN117649001A (en) * 2024-01-29 2024-03-05 南京信息工程大学 Method for optimizing GBDT (generic basic variable transformation) to correct air temperature deviation based on improved tuna swarm algorithm
CN118674493A (en) * 2024-08-26 2024-09-20 南通君科网络技术服务有限公司 Sales data real-time monitoring method and system based on data analysis

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103234575A (en) * 2013-03-26 2013-08-07 安徽理工大学 Method for improving and detecting safety of mine shaft on basis of firefly algorithm
CN107578121A (en) * 2017-08-18 2018-01-12 华北电力大学 Based on the power transformation engineering cost forecasting method for improving glowworm swarm algorithm optimization SVM
CN107609683A (en) * 2017-08-24 2018-01-19 西安理工大学 A kind of Cascade Reservoirs method for optimizing scheduling based on glowworm swarm algorithm
CN108876029A (en) * 2018-06-11 2018-11-23 南京航空航天大学 A kind of passenger flow forecasting based on the adaptive chaos firefly of double populations

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103234575A (en) * 2013-03-26 2013-08-07 安徽理工大学 Method for improving and detecting safety of mine shaft on basis of firefly algorithm
CN107578121A (en) * 2017-08-18 2018-01-12 华北电力大学 Based on the power transformation engineering cost forecasting method for improving glowworm swarm algorithm optimization SVM
CN107609683A (en) * 2017-08-24 2018-01-19 西安理工大学 A kind of Cascade Reservoirs method for optimizing scheduling based on glowworm swarm algorithm
CN108876029A (en) * 2018-06-11 2018-11-23 南京航空航天大学 A kind of passenger flow forecasting based on the adaptive chaos firefly of double populations

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110361963A (en) * 2019-06-10 2019-10-22 岭南师范学院 A kind of permanent magnetism blower PI parameter optimization method and device
CN110399587A (en) * 2019-06-21 2019-11-01 武汉大学 The method of amplitude is influenced on water level using anomaly residual error identification adjustment of river channel
CN110909158A (en) * 2019-07-05 2020-03-24 重庆信科设计有限公司 Text classification method based on improved firefly algorithm and K nearest neighbor
CN110909158B (en) * 2019-07-05 2022-10-18 重庆信科设计有限公司 Text classification method based on improved firefly algorithm and K nearest neighbor
CN110490366A (en) * 2019-07-15 2019-11-22 西安理工大学 Runoff forestry method based on variation mode decomposition and iteration decision tree
CN110852475A (en) * 2019-09-24 2020-02-28 广州地理研究所 Extreme gradient lifting algorithm-based vegetation index prediction method, system and equipment
CN110765110A (en) * 2019-10-24 2020-02-07 深圳前海微众银行股份有限公司 Generalization capability processing method, device, equipment and storage medium
CN110926524B (en) * 2019-10-29 2022-01-04 中国电子科技集团公司第七研究所 Method for predicting coupling relation between network resources and environment
CN110926524A (en) * 2019-10-29 2020-03-27 中国电子科技集团公司第七研究所 Method for predicting coupling relation between network resources and environment
CN111159896B (en) * 2019-12-30 2021-02-09 天津大学 Firefly algorithm-based error self-adaptive correction river flow calculation method
CN111159896A (en) * 2019-12-30 2020-05-15 天津大学 Firefly algorithm-based error self-adaptive correction river flow calculation method
CN111539587B (en) * 2020-03-06 2023-11-24 武汉极善信息技术有限公司 Hydrologic forecasting method
CN111539587A (en) * 2020-03-06 2020-08-14 李�杰 Hydrological forecasting method
CN111639842A (en) * 2020-05-20 2020-09-08 湖北博华自动化系统工程有限公司 Equipment health evaluation method, evaluation system and equipment health prediction method
CN113888202A (en) * 2021-09-03 2022-01-04 西安峰频能源科技有限公司 Training method and application method of electricity price prediction model
CN114782740A (en) * 2022-03-31 2022-07-22 安徽大学 Remote sensing water quality monitoring method combining genetic optimization and extreme gradient promotion
CN115271186B (en) * 2022-07-18 2024-03-15 福建中锐网络股份有限公司 Reservoir water level prediction and early warning method based on delay factor and PSO RNN Attention model
CN115271186A (en) * 2022-07-18 2022-11-01 福建中锐网络股份有限公司 Reservoir water level prediction early warning method based on delay factor and PSO RNN Attention model
CN116524349A (en) * 2023-03-22 2023-08-01 广东工业大学 Rice yield prediction method and system based on improved firefly algorithm
CN116524349B (en) * 2023-03-22 2024-03-29 广东工业大学 Rice yield prediction method and system based on improved firefly algorithm
CN116202575A (en) * 2023-05-04 2023-06-02 山东汇杰地理信息科技有限公司 Soil erosion rate monitoring system and method for soil conservation
CN117649001A (en) * 2024-01-29 2024-03-05 南京信息工程大学 Method for optimizing GBDT (generic basic variable transformation) to correct air temperature deviation based on improved tuna swarm algorithm
CN117649001B (en) * 2024-01-29 2024-04-16 南京信息工程大学 Method for optimizing GBDT (generic basic variable transformation) to correct air temperature deviation based on improved tuna swarm algorithm
CN118674493A (en) * 2024-08-26 2024-09-20 南通君科网络技术服务有限公司 Sales data real-time monitoring method and system based on data analysis

Similar Documents

Publication Publication Date Title
CN109711636A (en) River water level prediction method based on chaotic firefly and gradient lifting tree model
CN109800863B (en) Logging phase identification method based on fuzzy theory and neural network
Barzegar et al. An ensemble tree-based machine learning model for predicting the uniaxial compressive strength of travertine rocks
CN111127246A (en) Intelligent prediction method for transmission line engineering cost
CN106529667A (en) Logging facies identification and analysis method based on fuzzy depth learning in big data environment
Bai et al. A forecasting method of forest pests based on the rough set and PSO-BP neural network
CN116205310B (en) Soil water content influence factor sensitive interval judging method based on interpretable integrated learning model
CN112948932A (en) Surrounding rock grade prediction method based on TSP forecast data and XGboost algorithm
CN109002927A (en) Oil field prospecting reserve forecasting method based on recurrent neural network
CN114648170A (en) Reservoir water level prediction early warning method and system based on hybrid deep learning model
CN107729555A (en) A kind of magnanimity big data Distributed Predictive method and system
Elayidom et al. A generalized data mining framework for placement chance prediction problems
CN115618987A (en) Production well production data prediction method, device, equipment and storage medium
CN112990530B (en) Regional population quantity prediction method, regional population quantity prediction device, electronic equipment and storage medium
CN116933946A (en) Rail transit OD passenger flow prediction method and system based on passenger flow destination structure
CN116756825A (en) Group structural performance prediction system for middle-small span bridge
CN106446514A (en) Fuzzy theory and neural network-based well-log facies recognition method
CN118829990A (en) Large-scale architectural searching in a graph neural network via synthetic data
CN116303626B (en) Well cementation pump pressure prediction method based on feature optimization and online learning
Wang et al. Precipitation prediction in several Chinese regions using machine learning methods
CN117408167A (en) Debris flow disaster vulnerability prediction method based on deep neural network
CN118095834A (en) Traffic accident risk studying and judging method based on interpretable random forest
CN111160715A (en) BP neural network based new and old kinetic energy conversion performance evaluation method and device
CN114239937B (en) Reservoir oil-gas-containing property prediction method, device, computer equipment and storage medium
CN116308579A (en) Particle swarm-SVM-based engineering cost determination method, system and product

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20190503

WD01 Invention patent application deemed withdrawn after publication