CN113204739A - Frequency response function quality line optimization method based on K-means clustering - Google Patents

Frequency response function quality line optimization method based on K-means clustering Download PDF

Info

Publication number
CN113204739A
CN113204739A CN202110564382.0A CN202110564382A CN113204739A CN 113204739 A CN113204739 A CN 113204739A CN 202110564382 A CN202110564382 A CN 202110564382A CN 113204739 A CN113204739 A CN 113204739A
Authority
CN
China
Prior art keywords
class
calculating
frequency response
response function
bzi
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
CN202110564382.0A
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.)
Guilin University of Electronic Technology
Dongfeng Liuzhou Motor Co Ltd
Original Assignee
Guilin University of Electronic Technology
Dongfeng Liuzhou Motor Co Ltd
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 Guilin University of Electronic Technology, Dongfeng Liuzhou Motor Co Ltd filed Critical Guilin University of Electronic Technology
Priority to CN202110564382.0A priority Critical patent/CN113204739A/en
Publication of CN113204739A publication Critical patent/CN113204739A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/15Correlation function computation including computation of convolution operations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/11Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10Complex mathematical operations
    • G06F17/18Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/23Clustering techniques
    • G06F18/232Non-hierarchical techniques
    • G06F18/2321Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions
    • G06F18/23213Non-hierarchical techniques using statistics or function optimisation, e.g. modelling of probability density functions with fixed number of clusters, e.g. K-means clustering
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F18/00Pattern recognition
    • G06F18/20Analysing
    • G06F18/24Classification techniques

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Pure & Applied Mathematics (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Optimization (AREA)
  • Mathematical Analysis (AREA)
  • General Engineering & Computer Science (AREA)
  • Algebra (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Software Systems (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Databases & Information Systems (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Evolutionary Biology (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Computer Vision & Pattern Recognition (AREA)
  • Probability & Statistics with Applications (AREA)
  • Operations Research (AREA)
  • Computing Systems (AREA)
  • Complex Calculations (AREA)

Abstract

The invention discloses a frequency response function quality line optimization method based on K-means clustering, which is characterized in that a frequency response function frequency band measured by a test mode is divided into corresponding data sets and standardized; determining an initial clustering center and a clustering number of each data set; defining an iteration index and an iteration formula of the algorithm, and repeatedly iterating a clustering center and a clustering number until the index is optimal; defining weight coefficients, and calculating the mean value of the selected frequency response function quality line according to different clusters and the corresponding weight coefficients. The method combines the advantages of a mass line mean value calculation formula and a K-mean value clustering algorithm, mainly determines the initial clustering number and clustering center method, a K-mean value iteration index and the weight coefficient of the class, proves that the calculation precision is obviously optimized by compiling program simulation, and simultaneously greatly improves the efficiency of a mass line inertia parameter identification method based on test modes.

Description

Frequency response function quality line optimization method based on K-means clustering
Technical Field
The invention relates to the field of inertia parameter identification of complex components such as electromechanical manufacturing, vehicles and ships, aerospace, navigation, military industry and the like, in particular to a frequency response function quality line optimization method based on K-means clustering.
Background
The method for identifying the inertia parameters by the mass line based on the test mode has very important significance in engineering technology and scientific research of electromechanical manufacturing, vehicles and ships, aerospace, navigation, military industry and the like. The processing of the frequency response function mass line data is a very important link for accurately identifying the inertial parameters. However, in the process of calculating the inertia parameters by using the method based on the frequency response function mass line, the arithmetic mean value is generally directly adopted for calculating the mean value, the influence of fluctuation and the most value of data in a frequency band is ignored, the frequency response function mass line of an actual test result is not ideal and smooth, and errors are accumulated more in the test process, so that the test result needs to be refined, and the efficiency and the precision of the test technology can be improved better.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a frequency response function quality line optimization method based on K-means clustering.
The technical scheme for realizing the purpose of the invention is as follows:
a frequency response function quality line optimization method based on K-means clustering comprises the following steps:
1) m frequency response function frequency bands S determined by test modenPartitioning into m datasets T ═ S1...SmAnd (4) standardizing, wherein the specific steps are as follows:
1-1) frequency response function SmIs a two-dimensional array, and the amplitude H (omega) of the ordinate is ═ H1H2…HnAnd angular frequency ω ═ ω of abscissa1 ω2…ωnThe values of two variables are established in a one-to-one mapping relation;
1-2) data normalization
1-2-1) optionally a number set SmCalculating SmArithmetic mean of amplitude H (omega)
Figure BDA0003080362150000011
1-2-2) calculating the residual absolute value of the amplitude H (omega)
Figure BDA0003080362150000012
Determining a set of residual absolute values as Ure={μ1,μ2,…,μn};
1-2-3) calculating the amplitude H (omega) standard deviation
Figure BDA0003080362150000013
1-2-4) to reduce the effect of the fluctuating peak of the initial data on solving the overall mean, a normalization process is performed on each sample of the amplitude H (ω), where any sample is represented as
Figure BDA0003080362150000021
The amplitude set is HBZi={hBZ1,hBZ2,…,hBZnThe corresponding abscissa angular frequency ω ═ ω1 ω2…ωnThe method is not changed;
2) determining the number of clusters K for each frequency response function data set0And an initial clustering center C0The method comprises the following steps:
2-1) set H of normalized amplitudes H (omega)BZiDetermining an initial clustering number K0
2-1-1) computing the set HBZiExtreme difference Ra ofO=max(HBZi)-min(HBZi);
2-1-2) computing the set HBZiArithmetic mean of
Figure BDA0003080362150000022
2-1-3) computing the set HBZiResidual error of
Figure BDA0003080362150000023
Determining a set of residual absolute values as UBZn={μBZ1,μBZ2,…,μBZn};
2-1-4) computing the set HBZiResidual mean of
Figure BDA0003080362150000024
2-1-5) calculating the number of initial classifications K0Adding 1 to the integer of the residual error of the polar difference division, i.e.
Figure BDA0003080362150000025
2-2) set H of normalized amplitudes H (omega)BZiDetermining an initial clustering center C0
2-2-1) A set HBZiN samples divided into K0Class i, i
Figure BDA00030803621500000212
Figure BDA00030803621500000213
And the corresponding abscissa angular frequency ω ═ ω1 ω2…ωn};
2-2-2) Each subset A1,A2,…Aj
Figure BDA00030803621500000214
The number of samples in is
Figure BDA0003080362150000026
2-2-3) dividing the subset if
Figure BDA0003080362150000027
Then
Figure BDA00030803621500000215
2-2-4) calculating the center of the initial cluster, the value of the cluster center being the mean of each class subset, i.e.
Figure BDA0003080362150000028
3) Defining iteration index, determining iteration formula, and repeatedly iterating and clustering center CnAnd the number of clusters KnUntil the index is optimal, the specific steps are as follows:
3-1) defining an iteration index, K0Number of classes
3-1-1) defining an iteration index
Figure BDA0003080362150000029
Where Sd is the internal standard deviation of class
Figure BDA00030803621500000210
Rn is like internal pole difference Rn ═ max (A)j)-min(Aj),
Figure BDA00030803621500000211
Is the difference in the mean values between the classes,
Figure BDA0003080362150000031
p,
Figure BDA00030803621500000311
Figure BDA0003080362150000032
is the arithmetic mean value of the interior of the class,
Figure BDA0003080362150000033
the mean value of the minimum value of the difference between the intra-class element and the mean value between the classes is
Figure BDA0003080362150000034
3-1-2) calculating the sum of absolute values of various internal slopes
Figure BDA0003080362150000035
Wherein the slope inside each subclass is k, and setting the linear function inside the subclass by minimum multiplication
Figure BDA0003080362150000036
Then
Figure BDA0003080362150000037
The difference between the minimum and maximum values of the mean value of the class RN ═ max (A)j)-min(Aj);
3-2) determining an iterative equation and an iterative algorithm
3-2-1) iterative equation as ordinate HBZiDistance between, i.e. Yd ═ hBZn-C0|;
3-2-2) calculating each amplitude h in turnBZnTo respectively K0The distance Yd of the initial clustering center is the h corresponding to the minimum YdBZnAttributing to the initial class corresponding to the corresponding initial clustering center, and repeating the steps until each amplitude value h is assignedBZnAfter all the classes are classified, determining the clustering center of the new class according to the new number set class, calculating indexes of the new class, comparing the indexes of the new class, and stopping iteration until the minimum index is found;
3-2-3) pairs of other S within the data set TmRepeating step 1-2-1) to step 3-2-2) until the index of each number set is minimumDetermining a clustering center, a clustering number and a point set of each class;
3-2-4) mapping to original amplitude according to the abscissa corresponding to the optimal class to form a new set H (omega)finally={B1B2…BK0}={(H1...Ha)(Hd...He)...(Hg...Hn)},d<e<g<n
4) Defining a weight coefficient, and calculating the average value of the frequency band selected by the frequency response function quality line, wherein the specific steps are as follows:
4-1) calculating the SmSmoothing coefficient ph of frequency response function number setall=Armall×kall×sdallWherein
Figure BDA0003080362150000038
kall、sdallAre respectively SmArithmetic mean, slope, standard deviation of the frequency response function number set;
4-2) calculation of removal of SmCalculating the amplitude of the J-th class in the frequency response function number set, and calculating the arithmetic mean value of the remaining K-1 classes
Figure BDA0003080362150000039
Slope kK-1And standard deviation sdK-1Smoothing coefficient of (d):
phK-1=ArmK-1×kK-1×sdK-1
4-3) defining the weight as according to steps 4-1), 4-2)
Figure BDA00030803621500000310
4-4) calculating SmThe weight coefficients of K classes in the frequency response function number set are normalized,
Figure BDA0003080362150000041
5) calculating an average value: the class formed by the original amplitude value H (omega) corresponding to the class classified according to each frequency response function and the class corresponding to the normalized classWeight, calculating Average value B1δ1 gy+B2δ2 gy...BK0δr gy
According to the method for optimizing the frequency response function mass line based on the K-means clustering, the identification precision of the frequency response function mass line inertial parameters based on the test mode is optimized, and the identification efficiency of the frequency response function mass line inertial parameters based on the test mode is improved.
Drawings
FIG. 1 is a flow chart of a frequency response function quality line optimization method based on K-means clustering;
FIG. 2 is a diagram showing the method for dividing the initial frequency band of the mean value of the single frequency response function data of the test;
FIG. 3 is a diagram showing the result of the method dividing the mean value of a single frequency response function;
Detailed Description
The invention will be further elucidated with reference to the drawings and examples, without however being limited thereto.
Example (b):
a frequency response function quality line optimization method based on K-means clustering is disclosed, as shown in figure 1, and comprises the following steps:
1) m frequency response function frequency bands S determined by test mode testnPartitioning into m datasets T ═ S1...SmAnd (4) standardizing, wherein the specific steps are as follows:
1-1) frequency response function SmIs a two-dimensional array, and the amplitude H (omega) of the ordinate is ═ H1 H2…HnAnd angular frequency ω ═ ω of abscissa1 ω2…ωnThe values of two variables are established in a one-to-one mapping relation;
1-2) data normalization
1-2-1) optionally a number set SmCalculating SmArithmetic mean of amplitude H (omega)
Figure BDA0003080362150000042
1-2-2) calculating amplitudeResidual absolute value of value H (omega)
Figure BDA0003080362150000043
Determining a set of residual absolute values as Ure={μ1,μ2,…,μn};
1-2-3) calculating the amplitude H (omega) standard deviation
Figure BDA0003080362150000044
1-2-4) to reduce the effect of the fluctuating peak of the initial data on solving the overall mean, a normalization process is performed on each sample of the amplitude H (ω), where any sample is represented as
Figure BDA0003080362150000045
The amplitude set is HBZi={hBZ1,hBZ2,…,hBZnThe corresponding abscissa angular frequency ω ═ ω1 ω2…ωnThe method is not changed;
2) determining the number of clusters K for each frequency response function data set0And an initial clustering center C0The method comprises the following steps:
2-1) set H of normalized amplitudes H (omega)BZiDetermining an initial clustering number K0
2-1-1) computing the set HBZiExtreme difference Ra ofO=max(HBZi)-min(HBZi);
2-1-2) computing the set HBZiArithmetic mean of
Figure BDA0003080362150000051
2-1-3) computing the set HBZiResidual error of
Figure BDA0003080362150000052
Determining a set of residual absolute values as UBZn={μBZ1,μBZ2,…,μBZn};
2-1-4) computing the set HBZiResidual mean of
Figure BDA0003080362150000053
2-1-5) calculating the number of initial classifications K0Adding 1 to the integer of the residual error of the polar difference division, i.e.
Figure BDA0003080362150000054
2-2) set H of normalized amplitudes H (omega)BZiDetermining an initial clustering center C0
2-2-1) A set HBZiN samples divided into K0Class i, i
Figure BDA00030803621500000513
Figure BDA00030803621500000514
And the corresponding abscissa angular frequency ω ═ ω1 ω2…ωn};
2-2-2) Each subset A1,A2,…Aj
Figure BDA00030803621500000515
The number of samples in is
Figure BDA0003080362150000055
2-2-3) dividing the subset if
Figure BDA0003080362150000056
Then h isBZj∈Aj
Figure BDA00030803621500000516
2-2-4) calculating the center of the initial cluster, the value of the cluster center being the mean of each class subset, i.e.
Figure BDA0003080362150000057
3) Defining iteration index, determining iteration formula, and repeatingGeneration clustering center CnAnd the number of clusters KnUntil the index is optimal, the specific steps are as follows:
3-1) defining an iteration index, K0Number of classes
3-1-1) defining an iteration index
Figure BDA0003080362150000058
Where Sd is the internal standard deviation of class
Figure BDA0003080362150000059
Rn is like internal pole difference Rn ═ max (A)j)-min(Aj),
Figure BDA00030803621500000510
Is the difference in the mean values between the classes,
Figure BDA00030803621500000511
p,
Figure BDA00030803621500000517
Figure BDA00030803621500000512
is the arithmetic mean value of the interior of the class,
Figure BDA0003080362150000061
the mean value of the minimum value of the difference between the intra-class element and the mean value between the classes is
Figure BDA0003080362150000062
3-1-2) calculating the sum of absolute values of various internal slopes
Figure BDA0003080362150000063
Wherein the slope inside each subclass is k, and setting the linear function inside the subclass by minimum multiplication
Figure BDA0003080362150000064
Then
Figure BDA0003080362150000065
The difference between the minimum and maximum values of the mean value of the class RN ═ max (A)j)-min(Aj);
3-2) determining an iterative equation and an iterative algorithm
3-2-1) iterative equation as ordinate HBZiDistance between, i.e. Yd ═ hBZn-C0|;
3-2-2) calculating each amplitude h in turnBZnTo respectively K0The distance Yd of the initial clustering center is the h corresponding to the minimum YdBZnAttributing to the initial class corresponding to the corresponding initial clustering center, and repeating the steps until each amplitude value h is assignedBZnAnd after classification, determining the clustering center of the new class according to the new number set class, calculating indexes of the new class, comparing the indexes of the new class, and stopping iteration until the minimum index is found.
3-2-3) pairs of other S within the data set TmRepeating the step 1-2-1) and the step 3-2-2) until the index of each number set is minimum, and determining a clustering center, a clustering number and a point set of each class;
3-2-4) mapping to original amplitude according to the abscissa corresponding to the optimal class to form a new set H (omega)finally={B1B2…BK0}={(H1...Hd)(Hd...He)...(Hg…Hn)},d<e<g<n
4) Defining a weight coefficient, and calculating the average value of the frequency band selected by the frequency response function quality line, wherein the specific steps are as follows:
4-1) calculating the SmSmoothing coefficient ph of frequency response function number setall=Armall×kall×sdallWherein
Figure BDA0003080362150000066
kall、sdallAre respectively SmArithmetic mean, slope, standard deviation of the frequency response function number set;
4-2) calculation of removal of SmCalculating the amplitude of the J-th class in the frequency response function number set, and calculating the arithmetic mean value of the remaining K-1 classes
Figure BDA0003080362150000067
Slope kK-1And standard deviation sdK-1Smoothing coefficient of (d):
phK-1=ArmK-1×kK-1×sdK-1
4-3) defining the weight as according to steps 4-1), 4-2)
Figure BDA0003080362150000068
4-4) calculating SmThe weight coefficients of K classes in the frequency response function number set are normalized,
Figure BDA0003080362150000071
5) calculating an average value: calculating Average value B according to the class formed by the original amplitude value H (omega) corresponding to the class of each frequency response function and the weight corresponding to the class after standardization1δ1 gy+B2δ2 gy...BK0δr gy
The matlab programming is performed on the method, the average value initial frequency band processing is performed on the single frequency response function data acquired in the test, and the result is shown in fig. 2. The final mean value calculation frequency band division result for the experimental data is shown in fig. 3.

Claims (1)

1. A frequency response function quality line optimization method based on K-means clustering is characterized by comprising the following steps:
1) m frequency response function frequency bands S determined by test modenPartitioning into m datasets T ═ S1 ... SmAnd (4) standardizing, wherein the specific steps are as follows:
1-1) frequency response function SmIs a two-dimensional array, and the amplitude H (omega) of the ordinate is ═ H1 H2 … HnAnd angular frequency ω ═ ω of abscissa1 ω2 … ωnThe values of two variables are established in a one-to-one mapping relation;
1-2) data normalization
1-2-1) optionally a number set SmCalculating SmArithmetic mean of amplitude H (omega)
Figure FDA0003080362140000011
1-2-2) calculating the residual absolute value of the amplitude H (omega)
Figure FDA0003080362140000012
Determining a set of residual absolute values as Ure={μ1,μ2,…,μn};
1-2-3) calculating the amplitude H (omega) standard deviation
Figure FDA0003080362140000013
1-2-4) normalizing each sample of the amplitude H (ω), where any sample is represented as
Figure FDA0003080362140000014
The amplitude set is HBZi={hBZ1,hBZ2,…,hBZnThe corresponding abscissa angular frequency ω ═ ω1 ω2 … ωnThe method is not changed;
2) determining the number of clusters K for each frequency response function data set0And an initial clustering center C0The method comprises the following steps:
2-1) set H of normalized amplitudes H (omega)BZiDetermining an initial clustering number K0
2-1-1) computing the set HBZiExtreme difference Ra ofO=max(HBZi)-min(HBZi);
2-1-2) computing the set HBZiArithmetic mean of
Figure FDA0003080362140000015
2-1-3) computing the set HBZiResidual error of
Figure FDA0003080362140000016
Determining a set of residual absolute values as UBZn={μBZ1,μBZ2,…,μBZn};
2-1-4) computing the set HBZiResidual mean of
Figure FDA0003080362140000017
2-1-5) calculating the number of initial classifications K0Adding 1 to the integer of the residual error of the polar difference division, i.e.
Figure FDA0003080362140000018
2-2) set H of normalized amplitudes H (omega)BZiDetermining an initial clustering center C0
2-2-1) A set HBZiN samples divided into K0Class i, i.e. HBZj={A1,A2,…Aj
Figure FDA00030803621400000110
Figure FDA0003080362140000019
And the corresponding abscissa angular frequency ω ═ ω1 ω2 … ωn};
2-2-2) Each subset A1,A2,…Aj
Figure FDA00030803621400000214
The number of samples in is
Figure FDA0003080362140000021
2-2-3) dividing the subset if
Figure FDA0003080362140000022
Then h isBZj∈Aj
Figure FDA00030803621400000215
2-2-4) calculating the center of the initial cluster, the value of the cluster center being the mean of each class subset, i.e.
Figure FDA0003080362140000023
3) Defining iteration index, determining iteration formula, and repeatedly iterating and clustering center CnAnd the number of clusters KnUntil the index is optimal, the specific steps are as follows:
3-1) defining an iteration index, K0Number of classes
3-1-1) defining an iteration index
Figure FDA0003080362140000024
Where Sd is the internal standard deviation of class
Figure FDA0003080362140000025
Rn is like internal pole difference Rn ═ max (A)j)-min(Aj),
Figure FDA0003080362140000026
Is the difference in the mean values between the classes,
Figure FDA0003080362140000027
Figure FDA0003080362140000028
is the arithmetic mean value of the interior of the class,
Figure FDA0003080362140000029
the mean value of the minimum value of the difference between the intra-class element and the mean value between the classes is
Figure FDA00030803621400000210
3-1-2) calculating various internal slopesSum of absolute values of rates
Figure FDA00030803621400000211
Wherein the slope inside each subclass is k, and setting the linear function inside the subclass by minimum multiplication
Figure FDA00030803621400000212
Then
Figure FDA00030803621400000213
The difference between the minimum and maximum values of the mean value of the class RN ═ max (A)j)-min(Aj);
3-2) determining an iterative equation and an iterative algorithm
3-2-1) iterative equation as ordinate HBZiDistance between, i.e. Yd ═ hBZn-C0|;
3-2-2) calculating each amplitude h in turnBZnTo respectively K0The distance Yd of the initial clustering center is the h corresponding to the minimum YdBZnAttributing to the initial class corresponding to the corresponding initial clustering center, and repeating the steps until each amplitude value h is assignedBZnAfter all the classes are classified, determining the clustering center of the new class according to the new number set class, calculating indexes of the new class, comparing the indexes of the new class, and stopping iteration until the minimum index is found;
3-2-3) pairs of other S within the data set TmRepeating the step 1-2-1) and the step 3-2-2) until the index of each number set is minimum, and determining a clustering center, a clustering number and a point set of each class;
3-2-4) mapping to original amplitude according to the abscissa corresponding to the optimal class to form a new set H (omega)fin ly={B1 B2 … BK0}={(H1 ... Hd) (Hd ... He) ... (Hg ... Hn)},d<e<g<n
4) Defining a weight coefficient, and calculating the average value of the frequency band selected by the frequency response function quality line, wherein the specific steps are as follows:
4-1) calculating the SmSmoothing coefficient ph of frequency response function number setall=Armall×kall×sdallWherein
Figure FDA0003080362140000031
kall、sdallAre respectively SmArithmetic mean, slope, standard deviation of the frequency response function number set;
4-2) calculation of removal of SmCalculating the amplitude of the J-th class in the frequency response function number set, and calculating the arithmetic mean value of the remaining K-1 classes
Figure FDA0003080362140000032
Slope kK-1And standard deviation sdK-1Smoothing coefficient of (d):
phK-1=ArmK-1×kK-1×sdK-1
4-3) defining the weight as according to steps 4-1), 4-2)
Figure FDA0003080362140000033
4-4) calculating SmThe weight coefficients of K classes in the frequency response function number set are normalized,
Figure FDA0003080362140000034
5) calculating an average value: calculating Average value B according to the class formed by the original amplitude value H (omega) corresponding to the class of each frequency response function and the weight corresponding to the class after standardization1δ1 gy+B2δ2 gy...BK0δr gy
CN202110564382.0A 2021-05-24 2021-05-24 Frequency response function quality line optimization method based on K-means clustering Pending CN113204739A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110564382.0A CN113204739A (en) 2021-05-24 2021-05-24 Frequency response function quality line optimization method based on K-means clustering

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110564382.0A CN113204739A (en) 2021-05-24 2021-05-24 Frequency response function quality line optimization method based on K-means clustering

Publications (1)

Publication Number Publication Date
CN113204739A true CN113204739A (en) 2021-08-03

Family

ID=77022921

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110564382.0A Pending CN113204739A (en) 2021-05-24 2021-05-24 Frequency response function quality line optimization method based on K-means clustering

Country Status (1)

Country Link
CN (1) CN113204739A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102928514A (en) * 2012-10-14 2013-02-13 浙江农林大学 Frequency characteristic-based nondestructive detection method of stress waves of wood
CN107357992A (en) * 2017-07-13 2017-11-17 东南大学 Composite structure correction method for finite element model based on cluster analysis
CN107729845A (en) * 2017-10-20 2018-02-23 开沃新能源汽车集团有限公司 A kind of frequency respond noise-reduction method decomposed based on sub-space feature value
CN108416141A (en) * 2017-08-31 2018-08-17 北京理工大学 A kind of linear time-varying structural modal vibration shape discrimination method

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102928514A (en) * 2012-10-14 2013-02-13 浙江农林大学 Frequency characteristic-based nondestructive detection method of stress waves of wood
CN107357992A (en) * 2017-07-13 2017-11-17 东南大学 Composite structure correction method for finite element model based on cluster analysis
CN108416141A (en) * 2017-08-31 2018-08-17 北京理工大学 A kind of linear time-varying structural modal vibration shape discrimination method
CN107729845A (en) * 2017-10-20 2018-02-23 开沃新能源汽车集团有限公司 A kind of frequency respond noise-reduction method decomposed based on sub-space feature value

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
陈英杰: "基于聚类方法的机床变位置模态分析研究", 《中国优秀博硕士学位论文全文数据库(硕士)工程科技Ⅰ辑》 *

Similar Documents

Publication Publication Date Title
CN111259979B (en) Deep semi-supervised image clustering method based on label self-adaptive strategy
CN108875933B (en) Over-limit learning machine classification method and system for unsupervised sparse parameter learning
CN112907735A (en) Flexible cable identification and three-dimensional reconstruction method based on point cloud
CN111028238B (en) Robot vision-based three-dimensional segmentation method and system for complex special-shaped curved surface
CN111738303B (en) Long-tail distribution image recognition method based on hierarchical learning
CN111008504B (en) Wind power prediction error modeling method based on meteorological pattern recognition
CN114743259A (en) Pose estimation method, pose estimation system, terminal, storage medium and application
CN109558873A (en) A kind of mode identification method based on this stack autoencoder network that changes
CN111178427B (en) Method for performing image dimensionality reduction and embedded clustering based on depth self-coding of Sliced-Wasserstein distance
WO2021062050A1 (en) Icospherical gauge convolutional neural network
Liu et al. Scene recognition mechanism for service robot adapting various families: A cnn-based approach using multi-type cameras
EP3881225A1 (en) Coordinate estimation on n-spheres with spherical regression
CN106469318A (en) A kind of characteristic weighing k means clustering method based on the sparse restriction of L2
CN114863151B (en) Image dimension reduction clustering method based on fuzzy theory
CN110598243B (en) Virtual sample capacity expansion method based on historical data of mechanical product
CN106250918A (en) A kind of mixed Gauss model matching process based on the soil-shifting distance improved
CN113204739A (en) Frequency response function quality line optimization method based on K-means clustering
CN114565861A (en) Airborne downward-looking target image positioning method based on probability statistic differential homoembryo set matching
CN114240687A (en) Energy hosting efficiency analysis method suitable for comprehensive energy system
CN113657029A (en) Efficient approximate optimization method for aircraft driven by heterogeneous data
CN109670538B (en) Method for identifying assembly contact state of non-rigid part
CN117033686A (en) Mechanical part three-dimensional model retrieval method based on feature extraction
CN116343016A (en) Multi-angle sonar image target classification method based on lightweight convolution network
CN113269235B (en) Assembly body change detection method and device based on unsupervised learning
CN114492665A (en) Fault diagnosis model performance evaluation method based on image structure similarity

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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20210803