CN103745079A - Curve fitting method based on abstract convex estimations - Google Patents
Curve fitting method based on abstract convex estimations Download PDFInfo
- Publication number
- CN103745079A CN103745079A CN201310600939.7A CN201310600939A CN103745079A CN 103745079 A CN103745079 A CN 103745079A CN 201310600939 A CN201310600939 A CN 201310600939A CN 103745079 A CN103745079 A CN 103745079A
- Authority
- CN
- China
- Prior art keywords
- formula
- curve
- lower bound
- leaf node
- matrix
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 239000013598 vector Substances 0.000 claims abstract description 64
- 239000011159 matrix material Substances 0.000 claims abstract description 54
- 238000005070 sampling Methods 0.000 claims abstract description 16
- 230000009466 transformation Effects 0.000 claims description 24
- NAWXUBYGYWOOIX-SFHVURJKSA-N (2s)-2-[[4-[2-(2,4-diaminoquinazolin-6-yl)ethyl]benzoyl]amino]-4-methylidenepentanedioic acid Chemical compound C1=CC2=NC(N)=NC(N)=C2C=C1CCC1=CC=C(C(=O)N[C@@H](CC(=C)C(O)=O)C(O)=O)C=C1 NAWXUBYGYWOOIX-SFHVURJKSA-N 0.000 claims description 9
- 238000006243 chemical reaction Methods 0.000 claims description 8
- 238000004364 calculation method Methods 0.000 claims description 4
- 238000012935 Averaging Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 6
- 238000011960 computer-aided design Methods 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 239000008280 blood Substances 0.000 description 1
- 210000004369 blood Anatomy 0.000 description 1
- 210000005252 bulbus oculi Anatomy 0.000 description 1
- 238000004883 computer application Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000002474 experimental method Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000000717 retained effect Effects 0.000 description 1
Images
Landscapes
- Complex Calculations (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
A curve fitting method based on abstract convex estimations includes the following steps that supporting vectors begin to be built from two boundary points to form an initial supporting matrix, and the initial supporting matrix is used as a root to built a binary tree; supporting vectors are built for known data points, and the binary tress is updated according to a certain condition; a sampling step length is set, sampling is conducted within a definitional domain range of x, tree leaf child nodes to which sampling points belong are found out, and lower bound low estimators of a tree leaf child node zone to which the sampling points belong are calculated; all the sampling points are connected, and then lower bound saw tooth estimations of a curve to be fitted can be obtained; upper bound saw tooth estimations of the curve to be fitted can be obtained through the same method, and the curve which is obtained by averaging the upper bound saw tooth estimations and the lower bound saw tooth estimations is used as the curve to be fitted. The curve fitting method based on the abstract convex estimations has the advantages that calculated amount is small, the original data points can be reserved, and fitting efficiency and the accuracy rate are high.
Description
Technical field
The present invention relates to a kind of mathematical modeling, computer application field, in particular, a kind of curve-fitting method of estimating based on abstract convex.
Background technology
Science and engineering problem can obtain some discrete data by methods such as sampling, experiment, and according to these data, we often wish to obtain a continuous curve and given data matches, and this process is just called curve.Curve application is very extensive, occupies very consequence in computational science.For example, the field of people to a certain the unknown, in order to explore its inherent rule, holds its developing direction, will use curve.Therefore, comprehensive research of curve-fitting method is had to positive realistic meaning.At present, curve fitting technique has all obtained wide application in the fields such as processes and displays of image processing, reverse-engineering, computer-aided design (CAD) and test data.The method of curve has a lot, and conventional method has least square method and method of interpolation etc.
The least square method of curve is according to known data (x
k, y
k) (k=1,2 ..., K) (x wherein
kfor measured quantity, y
kfor its corresponding functional value, the quantity size size that K is data point) choose an approximate function f (x), make E
2(f) (root-mean-square error) minimum; Least square fitting great advantage is that fitting precision can regulate and control, can select different fitting precisions according to actual service condition, but in actual applications, some occasion need to retain former data point, at this moment use the common methods such as least square method just improper.The method of interpolation of curve is according to interpolation principle structure polynomial of degree n P
n(x), make P
n(x) in the data of each test point, just in time pass through eyeball; Although method of interpolation can retain former data point,, in the ordinary course of things, we have gathered a lot of sampling points in order to reflect actual conditions as far as possible, have caused interpolation polynomial P
n(x) number of times is very high, and this has not only increased calculated amount, and has affected fitting precision.
Therefore, existing technology exists defect aspect curve, needs to improve.
Summary of the invention
In order to overcome existing method, can not retain former data point, calculated amount is large, fitting precision is lower deficiency, the invention provides a kind of when guaranteeing fitting precision, can retain former data point, calculated amount is little, fitting precision the is higher curve-fitting method based on abstract convex estimation.
The technical solution adopted for the present invention to solve the technical problems is:
A curve-fitting method of estimating based on abstract convex, described curve-fitting method comprises the following steps:
1) parameter initialization: constant M is set, input data (x
k, y
k), k=1,2 ..., K, the quantity size size that wherein K is data point;
2) boundary condition initialization, process is as follows;
2.1) according to existing data point, determine the field of definition [a, b] of variable x, wherein a is the lower bound of variable x, and b is the upper bound;
2.2) model conversion: former variable x is done to following linear transformation:
X wherein
1', x
2' be linear transformation variable;
Formula (1) is converted, obtains:
x=x
1′(b-a)+a (2)
2.2.1) establish
wherein,
the linear transformation variable 1 that represents the 1st data,
the linear transformation variable 1 of the 2nd data;
2.2.2) right according to formula (2)
be converted to former variable x
1, x
2, x wherein
1=b, x
2=a;
2.3) calculate initial support vector sum proppant matrix, and set up tree:
2.3.1) according to formula (4) respectively calculation level (x '
1, y
b) and (x '
2, y
a) support vector,
Wherein, y
brepresent functional value corresponding to upper bound b, y
arepresent functional value corresponding to lower bound a, the x in formula
kwith x ' replacement, f () replaces with y;
2.3.2) two support vectors of gained are formed to proppant matrix L, as shown in Equation (7):
2.3.3) take proppant matrix L as root foundation tree;
3) calculate the support vector of each data point and upgrade tree, each data point is handled as follows:
3.1) according to formula (1) to x
kas linear transformation, be
3.2) according to formula (4) calculate point (x '
k, y
k) support vector l
k, the x in formula
kwith x '
kreplace, f () uses y
kreplace;
3.3) according to conditional relationship formula (5) and (6), upgrade tree:
3.3.1) find for step 3.2) the support vector l that produces
kthe leaf node of (6), i.e. v do not satisfy condition
i=l
k;
3.3.2) use l
kreplacement step 3.3.1) i support vector in the leaf node matrix finding in
thereby form new leaf node;
3.3.3) the new leaf node producing the determining step 3.3.2) relational expression (5) that whether satisfies condition, if met, retains, otherwise deletes;
4) calculate Lower Bound Estimation value;
4.1) sampling step length is set, and sampling in field of definition [a, b] scope;
4.2) to step 4.1) each sampled point x
cbe handled as follows:
4.2.1) according to formula (1), do linear transformation, obtain new vector x
c'=(x
c1', x
c2');
4.2.2) according to formula (10) from step 3.3) tree find and comprise vector x
c' leaf node, in formula
use x
c' replace, if leaf node meets formula (10), comprise, otherwise do not comprise;
4.2.3) according to formula (3), obtain vector x
cthe Lower Bound Estimation value y of the leaf node corresponding region at ' place
l';
4.2.5) due in step 2.3) in added a constant M while being converted into IPH, in the hope of Lower Bound Estimation value should deduct M, i.e. y
l=y
l'-M;
4.2.6) output Lower Bound Estimation value y
land corresponding sampled point x
c;
5) calculate Estimation of Upper-Bound value, process is as follows:
5.1) the y in data point
kget negative;
5.2) by step 2) to 4) calculating Lower Bound Estimation value;
5.3) to step 5.2) the Lower Bound Estimation value of gained gets negatively, is Estimation of Upper-Bound value y
u;
5.4) output Estimation of Upper-Bound value y
uand corresponding sampled point x
c;
6) curve, process is as follows:
6.1) connect each point (x
c, y
l) obtain treating the Lower Bound Estimation of matched curve;
6.2) connect each point (x
c, y
u) obtain treating the Estimation of Upper-Bound of matched curve;
6.3) Estimation of Upper-Bound and Lower Bound Estimation being averaged to the curve obtaining is and treats matched curve.
Further, the constant M in step 1), if function f meets following two conditions:
Add one enough large constant M can will treat that function corresponding to matched curve is converted to IPH function, adds M to each y in data.
Further, the method for calculating support vector and proppant matrix step 2.3) is:
Suppose that the field of definition of N dimension objective function utilized model conversion formula (1) unit's of being mapped to simplex space
suppose that it has K support function, the point (x based on given
k, f (x
k)) (k=1,2 ..., K), the Lower Bound Estimation of objective function f is provided by following formula:
Wherein max represents maximum, and min represents minimum, x
ifor the vector in unit simplex space;
K support function is:
Wherein, l
kbe called support vector, as the formula (4).Consider a set that contains K support vector
make I={1,2 ..., N+1}, N+1 the support vector of satisfy condition (5) and (6)
be called an effective proppant matrix;
Suppose an effective proppant matrix as the formula (7):
According to this proppant matrix, can calculate corresponding lower bound support function extreme value x
minthe Lower Bound Estimation value d corresponding with it:
x
min(L)=diag(L)/Trace(L) (8)
d(L)=H
k(x
min)=1/Trace(L)
-1 (9)
Wherein, diag is the positive diagonal entry of matrix, and Trace is matrix trace, i.e. the positive diagonal entry sum of matrix.
Further again, step 4.2.2) in, find out and comprise vector x
c' the method for leaf node be:
Suppose
for H
k(x) r local minimum, the relational expression that satisfies condition (5) of its correspondence and the proppant matrix of (6) are L
r, by formula (9), had
lower Bound Estimation value
Above formula is equivalent to (10), if institute the leaf node of looking for for
meet formula 10), this leaf node district inclusion is vectorial
Technical conceive of the present invention is: with two frontier points, start to set up support vector, form initial support matrix, take this initial matrix to set up binary tree as root; Then known data point is set up to support vector, and upgrade this binary tree according to condition; A sampling step length is set again, within the scope of the field of definition of x, samples, find out the affiliated leaf node of sampled point, calculate the low valuation of lower bound of the affiliated leaf node region of sampled point; Connect the lower bound sawtooth estimation that all sampled points just can obtain treating matched curve; With same method, try to achieve the upper bound sawtooth estimation for the treatment of matched curve, the curve on average obtaining of getting the upper bound and the estimation of lower bound sawtooth is treats matched curve.The abstract convex estimation curve matching of application based on tree, has not only improved efficiency and the accuracy rate of matching, and has retained raw data points, has reduced calculated amount.
Accompanying drawing explanation
Fig. 1 is the unit's of being converted to simplex space, common definition territory schematic diagram, and wherein, left side subgraph is common definition territory, and the right subgraph is unit simplex space.
Fig. 2 is the schematic diagram that the lower bound sawtooth of one dimension Shubert function is estimated.
Fig. 3 is the schematic diagram that one dimension Shubert function upper bound sawtooth is estimated.
Fig. 4 is the schematic diagram of the matched curve of one dimension Shubert function.
Embodiment
Below in conjunction with accompanying drawing, the invention will be further described.
With reference to Fig. 1~Fig. 4, a kind of curve-fitting method of estimating based on abstract convex, comprises the following steps:
1) parameter initialization: constant M is set, input data (x
k, y
k) (k=1,2 ..., K), the quantity size size that wherein K is data point.
2) boundary condition initialization.
2.1) according to existing data point, determine the field of definition [a, b] of variable x, wherein a is the lower bound of variable x, and b is the upper bound;
2.2) model conversion;
If x is ∈ [a, b], wherein, x is the variable on boundary constraint feasible zone [a, b], and former variable x is done to following linear transformation:
X wherein
1', x
2' be linear transformation variable.
Obviously, (b-a) > 0, and x is easily known in (x-a)>=0
1'>=0, x
2'>=0,
Wherein
S representation unit simplex region; Fig. 1 has provided the schematic diagram in the unit's of being converted to simplex space, common definition territory.
Formula (1) is converted, can obtain:
x=x
1′(b-a)+a (2)
2.2.1) establish
wherein,
the linear transformation variable 1 that represents the 1st data,
the linear transformation variable 1 of the 2nd data;
2.2.2) right according to formula (2)
be converted to former variable x
1, x
2, x wherein
1=b, x
2=a;
2.3) calculate initial support vector sum proppant matrix, and set up tree;
Definition 1: if function f meets following two conditions
Wherein,
represent arbitrarily,
claim function f for just homogeneous increasing function (Increasing Positively Homogeneous of degree one, IPH).
Objective function also can by add one enough large constant M be converted to IPH function.Suppose that the field of definition of N dimension objective function utilized model conversion formula (1) unit's of being mapped to simplex space
suppose that it has K support function, the point (x based on given
k, f (x
k)) (k=1,2 ..., K), the Lower Bound Estimation of objective function f can be provided by following formula:
Wherein max represents maximum, and min represents minimum, x
ifor the vector in unit simplex space;
K support function is:
Wherein
Be called support vector.Consider a set that contains K support vector
make I={1,2 ..., N+1}, N+1 support vector of two conditions (5) and (6) below meeting
be called an effective proppant matrix;
Explain for convenience principle, suppose an effective proppant matrix as the formula (7):
According to this proppant matrix, can calculate corresponding lower bound support function extreme value x
minthe Lower Bound Estimation value d corresponding with it:
x
min(L)=diag(L)/Trace(L) (8)
d(L)=H
k(x
min)=1/Trace(L)
-1 (9)
Wherein, diag is the positive diagonal entry of matrix, and Trace is matrix trace, i.e. the positive diagonal entry sum of matrix.
2.3.1) according to formula (4) respectively calculation level (x '
1, y
b) and (x '
2, y
a) support vector, wherein, y
brepresent functional value corresponding to upper bound b, y
arepresent functional value corresponding to lower bound a, the x in formula
kwith x ' replacement, f () replaces with y;
2.3.2) 2 support vectors of gained are formed to proppant matrix L, as shown in Equation (7);
2.3.3) take proppant matrix L as root foundation tree;
3) calculate the support vector of each data point and upgrade tree, each data point is handled as follows:
3.1) according to formula (1) to x
kas linear transformation, be
3.2) according to formula (4) calculate point (x '
k, y
k) support vector l
k, the x in formula
kwith x '
kreplace, f () uses y
kreplace;
3.3) according to conditional relationship formula (5) and (6), upgrade tree;
3.3.1) find for step 3.2) the support vector l that produces
k(be v
i=l
k) leaf node of do not satisfy condition (6);
3.3.2) use l
kreplacement step 3.3.1) i support vector in the leaf node matrix finding in
thereby form new leaf node;
3.3.3) the new leaf node producing the determining step 3.3.2) relational expression (5) that whether satisfies condition, if met, retains, otherwise deletes;
4) calculate Lower Bound Estimation value.
Suppose
for H
k(x) r local minimum, the relational expression that satisfies condition (5) of its correspondence and the proppant matrix of (6) are L
r.By formula (9), had
lower Bound Estimation value
i element be
Be multiplied by simultaneously on above formula both sides
divided by Trace (L
r):
Above formula is equivalent to:
4.1) sampling step length is set, and sampling in field of definition [a, b] scope;
4.2) to step 4.1) each sampled point x
cbe handled as follows:
4.2.1) according to formula (1), do linear transformation, obtain new vector x
c'=(x
c1', x
c2');
4.2.2) according to formula (10) from step 3.3) tree find and comprise vector x
c' leaf node, in formula
use x
c' replace, if leaf node meets formula (10), comprise, otherwise do not comprise;
4.2.3) according to formula (3), obtain vector x
cthe Lower Bound Estimation value y of the corresponding subregion of leaf node at ' place
l';
4.2.5) due in step 2.3) in added a constant M while being converted into IPH, in the hope of Lower Bound Estimation value should deduct M, i.e. y
l=y
l'-M;
4.2.6) output Lower Bound Estimation value y
land corresponding sampled point x
c;
5) calculate Estimation of Upper-Bound value.
5.1) the y in data point
kget negative;
5.2) by step 2) to 4) calculating Lower Bound Estimation value;
5.3) to step 5.2) the Lower Bound Estimation value of gained gets negatively, is Estimation of Upper-Bound value y
u;
5.4) output Estimation of Upper-Bound value y
uand corresponding sampled point x
c;
6) curve.
6.1) connect each point (x
c, y
l) obtain treating the Lower Bound Estimation of matched curve;
6.2) connect each point (x
c, y
u) obtain treating the Estimation of Upper-Bound of matched curve;
6.3) Estimation of Upper-Bound and Lower Bound Estimation being averaged to the curve obtaining is and treats matched curve.
It is embodiment that the present embodiment be take one dimension Shubert function, and a kind of curve-fitting method of estimating based on abstract convex, wherein comprises following steps:
1) parameter initialization: constant M=300 is set, 100 data point (x of random generation in field of definition [0,5]
k, y
k), k=1,2 ..., 100.
2) boundary condition initialization.
2.1) field of definition of determining variable x is [0,5];
2.2) model conversion;
If x is ∈ [a, b], wherein, x is the variable on boundary constraint feasible zone [a, b], and former variable x is done to following linear transformation:
X wherein
1', x
2' be linear transformation variable.
Obviously, (b-a) > 0, and x is easily known in (x-a)>=0
1'>=0, x
2'>=0,
Wherein
S representation unit simplex region; Fig. 1 has provided the schematic diagram in the unit's of being converted to simplex space, common definition territory.
Formula (1) is converted, can obtain:
x=x
1′(b-a)+a (2)
2.2.1) establish
wherein,
the linear transformation variable 1 that represents the 1st data,
the linear transformation variable 1 of the 2nd data;
2.2.2) right according to formula (2)
be converted to former variable x
1, x
2, x wherein
1=5, x
2=0;
2.3) calculate initial support vector sum proppant matrix, and set up tree;
Definition 1: if function f meets following two conditions
Wherein,
represent arbitrarily,
claim function f for just homogeneous increasing function (Increasing Positively Homogeneous of degree one, IPH).
Objective function also can add one enough large constant M be converted to IPH function.Suppose that the field of definition of N dimension objective function utilized model conversion formula (1) unit's of being mapped to simplex space
suppose that it has K support function, the point (x based on given
k, f (x
k)) (k=1,2 ..., K), the Lower Bound Estimation of objective function f can be provided by following formula:
Wherein max represents maximum, and min represents minimum, x
ifor the vector in unit simplex space;
K support function is:
Wherein
Be called support vector.Consider a set that contains K support vector
make I={1,2 ..., N+1}, N+1 support vector of two conditions (5) and (6) below meeting
be called an effective proppant matrix.
Explain for convenience principle, suppose an effective proppant matrix as the formula (7):
According to this proppant matrix, can calculate corresponding lower bound support function extreme value x
minthe Lower Bound Estimation value d corresponding with it:
x
min(L)=diag(L)/Trace(L) (8)
d(L)=H
k(x
min)=1/Trace(L)
-1 (9)
Wherein, diag is the positive diagonal entry of matrix, and Trace is matrix trace, i.e. the positive diagonal entry sum of matrix.
2.3.1) according to formula (4) respectively calculation level (x '
1, y
5) and (x '
2, y
0) support vector, wherein, y
5the functional value that represents the upper bound 5 correspondences, y
0the functional value that represents lower bound 0 correspondence, the x in formula
kwith x ' replacement, f () replaces with y;
2.3.2) 2 support vectors of gained are formed to proppant matrix L, as shown in Equation (7);
2.3.3) take proppant matrix L as root foundation tree;
3) calculate the support vector of each data point and upgrade tree, each data point is handled as follows:
3.2) according to formula (4) calculate point (x '
k, y
k) support vector l
k, the x in formula
kwith x '
kreplace, f () uses y
kreplace;
3.3) according to conditional relationship formula (5) and (6), upgrade tree;
3.3.1) find for step 3.2) the support vector l that produces
k(be v
i=l
k) leaf node of do not satisfy condition (6);
3.3.2) use l
kreplacement step 3.3.1) i support vector in the leaf node matrix finding in
thereby form new leaf node;
3.3.3) the new leaf node producing the determining step 3.3.2) relational expression (5) that whether satisfies condition, if met, retains, otherwise deletes;
4) calculate Lower Bound Estimation value.
Suppose
for H
k(x) r local minimum, the relational expression that satisfies condition (5) of its correspondence and the proppant matrix of (6) are L
r.By formula (9), had
lower Bound Estimation value
By conditional relationship formula (5):
and formula (4) has
Above formula is equivalent to:
4.1) sampling step length being set is 0.001, and sampling in field of definition [0,5] scope;
4.2) to step 4.1) each sampled point x
cbe handled as follows:
4.2.1) according to formula (1), do linear transformation, obtain new vector x
c'=(x
c1', x
c2');
4.2.2) according to formula (10) from step 3.3) tree find and comprise vector x
c' leaf node, in formula
use x
c' replace, if leaf node meets formula (10), comprise, otherwise do not comprise;
4.2.3) according to formula (3), obtain vector x
cthe Lower Bound Estimation value y of the leaf node corresponding region at ' place
l';
4.2.5) due in step 2.3) in added a constant M while being converted into IPH, in the hope of Lower Bound Estimation value should deduct M, i.e. y
l=y
l'-M;
4.2.6) output Lower Bound Estimation value y
land corresponding sampled point x
c;
5) calculate Estimation of Upper-Bound value.
5.1) the y in data point
kget negative;
5.2) by step 2) to 4) calculating Lower Bound Estimation value;
5.3) to step 5.2) the Lower Bound Estimation value of gained gets negatively, is Estimation of Upper-Bound value y
u;
5.4) output Estimation of Upper-Bound value y
uand corresponding sampled point x
c;
6) curve.
6.1) connect each point (x
c, y
l) the lower bound sawtooth that obtains one dimension Shubert function curve estimates, as shown in Figure 2;
6.2) connect each point (x
c, y
u) upper bound sawtooth that obtains one dimension Shubert function curve estimates, as shown in Figure 3;
6.3) Estimation of Upper-Bound and Lower Bound Estimation are averaged to the matched curve that the curve obtaining is one dimension Shubert function, as shown in Figure 4.
The one dimension Shubert function of take is embodiment, uses above method to obtain its matched curve as shown in Figure 4, and in figure, " * " point is known data point, and sawtooth curve is the matched curve of one dimension Shubert function.As shown in Figure 2, in figure, " * " point is known data point in the lower bound sawtooth estimation of one dimension Shubert function, and jagged equity curve is that the lower bound sawtooth of one dimension Shubert function is estimated.As shown in Figure 3, in figure, " * " point is known data point in upper bound sawtooth estimation, and jagged equity curve is that the upper bound sawtooth of one dimension Shubert function is estimated.
What more than set forth is the excellent results that embodiment shows that the present invention provides, obviously the present invention is not only applicable to above-described embodiment, can do many variations to it and is implemented not departing from essence spirit of the present invention and do not exceed under the prerequisite of the related content of flesh and blood of the present invention.
Claims (4)
1. a curve-fitting method of estimating based on abstract convex, is characterized in that: described curve-fitting method comprises the following steps:
1) parameter initialization: constant M is set, input data (x
k, y
k), k=1,2 ..., K, the quantity size size that wherein K is data point;
2) boundary condition initialization, process is as follows;
2.1) according to existing data point, determine the field of definition [a, b] of variable x, wherein a is the lower bound of variable x, and b is the upper bound;
2.2) model conversion: former variable x is done to following linear transformation:
X wherein
1', x
2' be linear transformation variable;
Formula (1) is converted, obtains:
x=x
1′(b-a)+a (2)
2.2.1) establish
wherein,
the linear transformation variable 1 that represents the 1st data,
the linear transformation variable 1 of the 2nd data;
2.2.2) right according to formula (2)
be converted to former variable x
1, x
2, x wherein
1=b, x
2=a;
2.3) calculate initial support vector sum proppant matrix, and set up tree:
2.3.1) according to formula (4) respectively calculation level (x '
1, y
b) and (x '
2, y
a) support vector,
Wherein, y
brepresent functional value corresponding to upper bound b, y
arepresent functional value corresponding to lower bound a, the x in formula
kwith x ' replacement, f () replaces with y;
2.3.2) two support vectors of gained are formed to proppant matrix L, as shown in Equation (7):
2.3.3) take proppant matrix L as root foundation tree;
3) calculate the support vector of each data point and upgrade tree, each data point is handled as follows:
3.2) according to formula (4) calculate point (x '
k, y
k) support vector l
k, the x in formula
kwith x '
kreplace, f () uses y
kreplace;
3.3) according to conditional relationship formula (5) and (6), upgrade tree:
V ∈ Λ wherein
kl represent that v belongs to Λ
kbut do not belong to L,
represent to exist;
3.3.1) find for step 3.2) the support vector l that produces
kthe leaf node of (6), i.e. v do not satisfy condition
i=l
k;
3.3.2) use l
kreplacement step 3.3.1) i support vector in the leaf node matrix finding in
thereby form new leaf node;
3.3.3) the new leaf node producing the determining step 3.3.2) relational expression (5) that whether satisfies condition, if met, retains, otherwise deletes;
4) calculate Lower Bound Estimation value;
4.1) sampling step length is set, and sampling in field of definition [a, b] scope;
4.2) to step 4.1) each sampled point x
cbe handled as follows:
4.2.1) according to formula (1), do linear transformation, obtain new vector x
c'=(x
c'
1, x
c'
2);
4.2.2) according to formula (10) from step 3.3) tree find and comprise vector x
c' leaf node, in formula
use x
c' replace, if leaf node meets formula (10), comprise, otherwise do not comprise;
Wherein,
for the element in looked for leaf node matrix;
4.2.3) according to formula (3), obtain vector x
cthe Lower Bound Estimation value y of the leaf node corresponding region at ' place
l';
4.2.4) due in step 2.3) in added a constant M while being converted into IPH, in the hope of Lower Bound Estimation value should deduct M, i.e. y
l=y
l'-M;
4.2.5) output Lower Bound Estimation value y
land corresponding sampled point x
c;
5) calculate Estimation of Upper-Bound value, process is as follows:
5.1) the y in data point
kget negative;
5.2) by step 2) to 4) calculating Lower Bound Estimation value;
5.3) to step 5.2) the Lower Bound Estimation value of gained gets negatively, is Estimation of Upper-Bound value y
u;
5.4) output Estimation of Upper-Bound value y
uand corresponding sampled point x
c;
6) curve, process is as follows:
6.1) connect each point (x
c, y
l) obtain treating the Lower Bound Estimation of matched curve;
6.2) connect each point (x
c, y
u) obtain treating the Estimation of Upper-Bound of matched curve;
6.3) Estimation of Upper-Bound and Lower Bound Estimation being averaged to the curve obtaining is and treats matched curve.
2. a kind of curve-fitting method of estimating based on abstract convex as claimed in claim 1, is characterized in that: the constant M in step 1), if function f meets following two conditions:
Add one enough large constant M can will treat that function corresponding to matched curve is converted to IPH function, adds M to each y in data.
3. a kind of curve-fitting method of estimating based on abstract convex as claimed in claim 1 or 2, is characterized in that: step 2.3) in calculate support vector and proppant matrix method be:
Suppose that the field of definition of N dimension objective function utilized model conversion formula (1) unit's of being mapped to simplex space
suppose that it has K support function, the point (x based on given
k, f (x
k)) (k=1,2 ..., K), the Lower Bound Estimation of objective function f is provided by following formula:
Wherein max represents maximum, and min represents minimum, x
ifor the vector in unit simplex space;
K support function is:
Wherein, l
kbe called support vector, as the formula (4), consider a set that contains K support vector
make I={1,2 ..., N+1}, N+1 the support vector of satisfy condition (5) and (6)
be called an effective proppant matrix;
Suppose an effective proppant matrix as the formula (7):
According to this proppant matrix, can calculate corresponding lower bound support function extreme value x
minthe Lower Bound Estimation value d corresponding with it:
x
min(L)=diag(L)/Trace(L) (8)
d(L)=H
k(x
min)=1/Trace(L)
-1 (9)
Wherein, diag is the positive diagonal entry of matrix, and Trace is matrix trace, i.e. the positive diagonal entry sum of matrix.
4. a kind of curve-fitting method of estimating based on abstract convex as claimed in claim 3, is characterized in that: step 4.2.2), find out and comprise vector x
c' the method for leaf node be:
Suppose
for H
k(x) r local minimum, the relational expression that satisfies condition (5) of its correspondence and the proppant matrix of (6) are L
r, by formula (9), had
lower Bound Estimation value
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310600939.7A CN103745079A (en) | 2013-11-22 | 2013-11-22 | Curve fitting method based on abstract convex estimations |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201310600939.7A CN103745079A (en) | 2013-11-22 | 2013-11-22 | Curve fitting method based on abstract convex estimations |
Publications (1)
Publication Number | Publication Date |
---|---|
CN103745079A true CN103745079A (en) | 2014-04-23 |
Family
ID=50502096
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201310600939.7A Pending CN103745079A (en) | 2013-11-22 | 2013-11-22 | Curve fitting method based on abstract convex estimations |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN103745079A (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104182653A (en) * | 2014-08-25 | 2014-12-03 | 浙江工业大学 | Group conformation space optimizing method on basis of local abstract convexity underestimated support surface |
WO2018076211A1 (en) * | 2016-10-26 | 2018-05-03 | 中国科学院自动化研究所 | Method for quadratic curve fitting in image based on geometric error optimization |
WO2023165268A1 (en) * | 2022-03-04 | 2023-09-07 | 支付宝(杭州)信息技术有限公司 | Data processing |
-
2013
- 2013-11-22 CN CN201310600939.7A patent/CN103745079A/en active Pending
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN104182653A (en) * | 2014-08-25 | 2014-12-03 | 浙江工业大学 | Group conformation space optimizing method on basis of local abstract convexity underestimated support surface |
WO2018076211A1 (en) * | 2016-10-26 | 2018-05-03 | 中国科学院自动化研究所 | Method for quadratic curve fitting in image based on geometric error optimization |
WO2023165268A1 (en) * | 2022-03-04 | 2023-09-07 | 支付宝(杭州)信息技术有限公司 | Data processing |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Kisi | Pan evaporation modeling using least square support vector machine, multivariate adaptive regression splines and M5 model tree | |
GB2547816B (en) | Actually-measured marine environment data assimilation method based on sequence recursive filtering three-dimensional variation | |
Gálvez et al. | Firefly Algorithm for Explicit B‐Spline Curve Fitting to Data Points | |
CN103412872B (en) | Micro-blog social network information recommendation method based on limited node drive | |
CN110659693B (en) | K-nearest neighbor classification-based power distribution network rapid topology identification method, system and medium | |
Naing et al. | Forecasting of monthly temperature variations using random forests | |
Ji et al. | Predicting dynamic deformation of retaining structure by LSSVR-based time series method | |
CN105760952A (en) | Load prediction method based on Kalman filtering and self-adaptive fuzzy neural network | |
Afshar et al. | Optimizing water supply and hydropower reservoir operation rule curves: an imperialist competitive algorithm approach | |
CN105225000B (en) | A kind of wind power probability model nonparametric probability method based on Fuzzy Ordered optimization | |
CN103020709B (en) | Based on the one-dimensional water quality model parameter calibration method of artificial bee colony and quanta particle swarm optimization | |
CN107274028A (en) | A kind of many wind fields based on mixing Copula functions are exerted oneself Forecasting Methodology | |
Liu et al. | Generalized Cauchy difference iterative forecasting model for wind speed based on fractal time series | |
CN109558968B (en) | Wind farm output correlation analysis method and device | |
Li et al. | Graphfit: Learning multi-scale graph-convolutional representation for point cloud normal estimation | |
CN103745079A (en) | Curve fitting method based on abstract convex estimations | |
CN104156768A (en) | Small data size chaos identifying method through fuzzy C-means cluster | |
Zhu et al. | Risk assessment of agricultural irrigation water under interval functions | |
Wu et al. | Coupling forecast methods of multiple rainfall–runoff models for improving the precision of hydrological forecasting | |
Sayyaadi et al. | Stability and iterative convergence of water cycle algorithm for computationally expensive and combinatorial Internet shopping optimisation problems | |
CN105138527A (en) | Data classification regression method and data classification regression device | |
Akbari et al. | Similarity-based error prediction approach for real-time inflow forecasting | |
Li et al. | Solving the maximum internal spanning tree problem on interval graphs in polynomial time | |
Li et al. | Uncertain and multi-objective programming models for crop planting structure optimization | |
Kiani-Moghaddam et al. | Probabilistic multi-objective framework for multiple active power filters planning |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
RJ01 | Rejection of invention patent application after publication |
Application publication date: 20140423 |
|
RJ01 | Rejection of invention patent application after publication |