Disclosure of Invention
In order to solve the problems, the invention aims to provide a tumor fine classification system based on cloud computing and artificial intelligence and fusing multi-dimensional medical data.
The purpose of the invention is realized by the following technical scheme:
the tumor fine classification system based on cloud computing and artificial intelligence and fusing multi-dimensional medical data comprises a medical data collection module, a medical data management module, a tumor diagnosis model updating module and an intelligent tumor classification module;
the medical data collection module is used for collecting medical data with tumor disease diagnosis labels and inputting the collected medical data into the medical data management module;
the medical data management module comprises a medical data pre-storing unit and a medical data updating and detecting unit, the medical data pre-storing unit divides medical data of the same tumor disease type into one type according to a tumor disease diagnosis label carried by the medical data for storage, the medical data updating and detecting unit is used for detecting the medical data corresponding to each tumor disease type stored in the medical data pre-storing unit, and when the total quantity of the medical data corresponding to one tumor disease type reaches a given updating threshold value, the medical data pre-storing unit inputs the medical data corresponding to the tumor disease type into the tumor diagnosis model updating module;
the tumor diagnosis model updating module comprises a medical data processing unit, a medical database corresponding to each tumor disease type and a tumor diagnosis model updating unit, wherein the medical data processing unit is used for processing the received medical data, the processed medical data is used as medical sample data, the medical sample data is input into the corresponding medical database according to the corresponding tumor disease diagnosis label, the medical database stores the received new medical sample data, and randomly selects the medical sample data with the same quantity as the newly received medical sample data from the previously stored medical sample data and discards the medical sample data so as to realize the updating of the medical sample data in the medical database, the tumor diagnosis model updating unit is used for detecting the corresponding medical database in real time, and when the medical sample data updating exists in the corresponding medical database, calling medical sample data in the corresponding medical database to reconstruct a tumor diagnosis model corresponding to the tumor disease type;
the intelligent tumor classification module is used for processing medical data of a patient to be diagnosed, performing similar detection on the processed medical data of the patient to be diagnosed and medical sample data stored in a medical database corresponding to each tumor disease type, selecting the tumor disease type corresponding to the medical database most similar to the medical data of the patient to be diagnosed as the tumor disease detection type of the patient to be diagnosed, inputting the medical data of the patient to be diagnosed into a tumor diagnosis model corresponding to the tumor disease type, and the output value of the tumor diagnosis model is the tumor disease diagnosis result of the patient.
Further, the medical data includes medical images and clinical medical data of the patient.
Further, the medical data processing unit is used for processing the received medical data and comprises a medical image processing part and a medical data processing part, the medical image processing part is used for carrying out object segmentation and feature extraction on the received medical image so as to construct an image feature vector corresponding to the medical image, and the medical data processing part is used for processing the received clinical medical data and removing noise data in the clinical medical data.
Furthermore, the tumor diagnosis model updating unit calls medical sample data in a corresponding medical database to train and test the support vector machine, the medical sample data is used as an input value of the support vector machine, and a tumor disease diagnosis label corresponding to the medical sample data is used as an output value of the support vector machine, so that the tumor diagnosis model corresponding to each tumor disease type is obtained.
Further, when the tumor diagnosis model updating unit trains the support vector machine through the called medical sample data, the punishment factor and the kernel function parameter of the support vector machine are determined by adopting a firefly algorithm, in the process of optimizing the punishment factor and the kernel function parameter of the support vector machine by adopting the firefly algorithm, each firefly adopts a roulette rule to select to move towards an individual with higher fluorescence brightness than the firefly, the moving distance of each firefly is determined according to attraction, on the basis, the firefly i is selected to move towards the firefly j, and finally the (t +1) th iterative updating is realized, and the specific position updating formula is as follows:
in the above formula, x i (t +1) denotes the position of firefly i after the (t +1) th iteration update, x i (t) indicates the position of firefly i after the updating of the t-th iteration, x j (t) represents the position of firefly j after the updating of the t-th iteration, β ij (t) denotes the attraction of firefly j to firefly i after the t-th iteration update, α ij (t) represents the random term coefficients of the firefly i moving randomly towards the firefly j after the t-th iteration updating, rand is a random coefficient subject to positive distribution, and rand belongs to [0,1 ]]。
Further, the attraction degree beta of the firefly j to the firefly i after the t iteration is updated ij The value of (t) is set to:
in the above-mentioned formula, the compound of formula,
represents the original attraction of firefly j to firefly i after the t-th iteration update, and
the values of (A) are:
wherein, beta
0 When r is 0, the attraction of firefly, that is, the maximum attraction, γ is an optical absorption coefficient, and represents a characteristic that firefly gradually weakens with increasing distance, and r is
ij (t) is the Cartesian distance, rho, between firefly i and firefly j after the tth iterative update
ij (t) is a historical adjustment coefficient of the attraction of firefly j to firefly i after the tth iteration update, and ρ is
ij The value of (t) is:
μ (t) represents an iterative correction coefficient, and
wherein, T
max Is the maximum number of iterations, k
ij (t) represents the statistical coefficient of the history of the region between firefly i and firefly j after the t-th iteration update, k
ij The value of (t) is:
wherein omega
ij (t) denotes the position x
i (t) is the center, with r
ij (t) is a spherical region of radius, x
j (τ) is the location of firefly j after the τ -th iteration update, f (x)
j (τ),Ω
ij (t)) is for position x
j (τ) and region Ω
ij (t) a region between (t) and
m represents the number of fireflies in the population, and t represents the current iteration number.
Further, the random term coefficient alpha of the firefly i moving to the firefly j randomly after the t-th iteration updating ij The value of (t) is set to:
representing a set consisting of the fireflies which are selected as the moving direction when each firefly in the population is subjected to the (t +1) th iteration updating as K (t), and only keeping one of the repeated fireflies when the repeated fireflies exist in the set K (t) as the moving direction, and defining theta K (t) represents a moving direction attribute value of firefly in the set K (t), and θ K The value of (t) is:
in the above formula, M
K (t) indicates the number of fireflies in the set K (t), M indicates the number of fireflies in the population, y
K (t) represents the dominance of the spatial distribution of fireflies in set K (t), and y
K The value of (t) is:
wherein the fireflies in the set K (t) are increased from high to high according to the absolute fluorescence brightness valueLow rank ordered component sequence L
K (t), then x'
l (t) represents the sequence L
K (t) location of the l firefly in the t iteration updated, x'
l+1 (t) represents the sequence L
K (t) the position of the (l +1) th firefly in (t) after the updating of the t-th iteration, k is a given positive integer, and k is<M
K (t),x
l,a (t) is distance position x 'in the population after the t iteration update'
l (t) the position of the firefly at the a-th place,
is a sequence L
K (t) the spatial distribution of the first firefly in (t) is compared with the function, and
when theta is K The value of (t) satisfies: theta K (t)>When 1, then the random term coefficient alpha ij The value of (t) is:
when theta is K The value of (t) satisfies: theta K When (t) is less than or equal to 1, the random term coefficient alpha is ij The value of (t) is:
in the above formula, α
0 Is given an initial random coefficient value, and alpha
0 ∈[0,1],ω
j (t) local spatial coefficients of firefly j in set K (t) after the t-th iteration update, ω
j The value of (t) is:
x
j (t) indicates the position of firefly j after the t-th iteration update, δ
j (t) represents the global optimization coefficient, δ, of firefly j in the set K (t) after the t-th iteration update
j The value of (t) is:
wherein,
shows firefly j in sequence L after the t-th iterative update
K (ii) the ordering in (t),
represents the sequence L
K (t) A
The position of each firefly after the t iteration update.
The beneficial effects created by the invention are as follows: the high-dimensional image characteristics of the medical image are obtained by extracting the image characteristics of the medical image, and the tumor diagnosis model corresponding to each tumor disease type is constructed by combining clinical data, so that the high-efficiency and accurate diagnosis of each tumor disease type is realized, and the method has great significance for the diagnosis and early screening of the tumor diseases; the firefly algorithm is applied to the optimization of the parameters of the support vector machine, and the inherent defects of the firefly algorithm are improved, so that the classification precision of the support vector machine can be effectively improved through the parameters determined by the improved firefly algorithm.
Detailed Description
The invention is further described with reference to the following examples.
Referring to fig. 1, the tumor fine classification system based on cloud computing and artificial intelligence and fusing multidimensional medical data of the embodiment includes a medical data collection module, a medical data management module, a tumor diagnosis model updating module and an intelligent tumor classification module;
the medical data collection module is used for collecting medical data with tumor disease diagnosis labels and inputting the collected medical data into the medical data management module;
the medical data management module comprises a medical data pre-storing unit and a medical data updating and detecting unit, the medical data pre-storing unit divides medical data of the same tumor disease type into one type according to a tumor disease diagnosis label carried by the medical data for storage, the medical data updating and detecting unit is used for detecting the medical data corresponding to each tumor disease type stored in the medical data pre-storing unit, and when the total quantity of the medical data corresponding to one tumor disease type reaches a given updating threshold value, the medical data pre-storing unit inputs the medical data corresponding to the tumor disease type into the tumor diagnosis model updating module;
the tumor diagnosis model updating module comprises a medical data processing unit, a medical database corresponding to each tumor disease type and a tumor diagnosis model updating unit, wherein the medical data processing unit is used for processing the received medical data, the processed medical data is used as medical sample data, the medical sample data is input into the corresponding medical database according to the corresponding tumor disease diagnosis label, the medical database stores the received new medical sample data, and randomly selects the medical sample data with the same quantity as the newly received medical sample data from the previously stored medical sample data and discards the medical sample data so as to realize the updating of the medical sample data in the medical database, the tumor diagnosis model updating unit is used for detecting the corresponding medical database in real time, and when the medical sample data updating exists in the corresponding medical database, calling medical sample data in the corresponding medical database to reconstruct a tumor diagnosis model corresponding to the tumor disease type;
the intelligent tumor classification module is used for processing medical data of a patient to be diagnosed, performing similar detection on the processed medical data of the patient to be diagnosed and medical sample data stored in a medical database corresponding to each tumor disease type, selecting the tumor disease type corresponding to the medical database most similar to the medical data of the patient to be diagnosed as the tumor disease detection type of the patient to be diagnosed, inputting the medical data of the patient to be diagnosed into a tumor diagnosis model corresponding to the tumor disease type, and the output value of the tumor diagnosis model is the tumor disease diagnosis result of the patient.
Preferably, the medical data comprises medical images and clinical medical data of the patient.
Preferably, the medical data processing unit is configured to process the received medical data, and includes a medical image processing part and a medical data processing part, the medical image processing part is configured to perform object segmentation and feature extraction on the received medical image to construct an image feature vector corresponding to the medical image, and the medical data processing part is configured to process the received clinical medical data to remove noise data in the clinical medical data.
The embodiment extracts the image features of the medical image to obtain the high-dimensional image features of the medical image, and constructs the tumor diagnosis model corresponding to each tumor disease type by combining clinical data, thereby realizing efficient and accurate diagnosis of each tumor disease type, and having great significance for diagnosis and early screening of tumor diseases.
Preferably, the tumor diagnosis model updating unit calls medical sample data in a corresponding medical database to train and test the support vector machine, the medical sample data is used as an input value of the support vector machine, and the tumor disease diagnosis label corresponding to the medical sample data is used as an output value of the support vector machine, so as to obtain the tumor diagnosis model corresponding to each tumor disease type.
In the embodiment, the firefly algorithm is applied to the optimization of the parameters of the support vector machine, and the inherent defects of the firefly algorithm are improved, so that the classification accuracy of the support vector machine can be effectively improved through the parameters determined by the improved firefly algorithm.
Preferably, when the tumor diagnosis model updating unit trains the support vector machine through the called medical sample data, the punishment factor and the kernel function parameter of the support vector machine are determined by adopting a firefly algorithm, in the process of optimizing the punishment factor and the kernel function parameter of the support vector machine by adopting the firefly algorithm, each firefly adopts a roulette rule to select to move towards an individual with higher fluorescence brightness than the firefly, the moving distance of each firefly is determined according to attraction, on the basis, the firefly i is selected to move towards the firefly j, and finally the (t +1) th iterative updating is realized, and the specific position updating formula is as follows:
in the above formula, x i (t +1) denotes the position of firefly i after the (t +1) th iteration update, x i (t) indicates the position of firefly i after the updating of the t-th iteration, x j (t) represents the position of firefly j after the updating of the t-th iteration, β ij (t) denotes the attraction of firefly j to firefly i after the t-th iteration update, α ij (t) represents the random term coefficients of the firefly i moving randomly towards the firefly j after the t-th iteration updating, rand is a random coefficient subject to positive distribution, and rand belongs to [0,1 ]]。
Preferably, the attraction degree beta of the firefly j to the firefly i after the t iteration is updated ij The value of (t) is set to:
in the above-mentioned formula, the compound of formula,
represents the original attraction of firefly j to firefly i after the t-th iteration update, and
the values of (A) are:
wherein, beta
0 When r is 0, the attraction degree of firefly, that is, the maximum attraction degree, γ is a light absorption coefficient, and represents a characteristic that firefly gradually decreases with increasing distance, and r is
ij (t) is the Cartesian distance, rho, between firefly i and firefly j after the tth iterative update
ij (t) is a historical adjustment coefficient of the attraction of firefly j to firefly i after the tth iteration update, and ρ is
ij The value of (t) is:
μ (t) represents an iterative correction coefficient, and
wherein, T
max Is the maximum number of iterations, k
ij (t) represents the statistical coefficient of the history of the region between firefly i and firefly j after the t-th iteration update, k
ij The value of (t) is:
wherein omega
ij (t) denotes the position x
i (t) is the center, with r
ij (t) is a spherical region of radius, x
j (τ) is the location of firefly j after the τ -th iteration update, f (x)
j (τ),Ω
ij (t)) is for position x
j (τ) and region Ω
ij (t) a region between (t) and
m represents the number of fireflies in the population, and t represents the current iteration number.
Specifically, in the firefly algorithm, the absolute fluorescence brightness value of the firefly is higher, the solution represented by the firefly is better, the firefly moves towards an individual with higher fluorescence brightness than the firefly, and the firefly is finally gathered around the optimal firefly position through the movement of each generation of firefly, so that the optimal extreme point is found, and the purpose of population optimization is achieved. The moving distance of the firefly is directly related to the convergence rate and the optimization precision of the firefly, in the traditional firefly algorithm, the moving distance of the firefly is determined by the attraction degree between the fireflies, the attraction degree is inversely proportional to the distance between the fireflies, namely the attraction degree is reduced along with the increase of the distance, however, in the actual optimization process, the moving distance of the firefly is determined only by the distance, so that the algorithm lacks self-adaptation, in order to better balance the convergence rate and the optimization precision of the algorithm by adjusting the moving distance of the firefly, the embodiment introduces a historical adjustment coefficient, the historical adjustment coefficient is used for counting the average number of times that the firefly performs optimization on an area formed between the firefly and the optimal firefly selected by the firefly as the moving direction in the historical iteration process, when the area is searched by more fireflies in the historical iteration process, reduce this preferred firefly's attraction degree through historical adjustment coefficient to reduce this preferred firefly region too much repeated search, increase the regional chance of being searched for of other preferred fireflies, thereby increase the variety that the algorithm was solved, on the contrary, when this region was searched for by less firefly in history iterative process, increase this firefly's attraction degree through historical adjustment coefficient, make the firefly excavate this region, improve the local excavation precision of algorithm. Namely, the historical adjustment coefficient is set, so that the movement distance of the firefly can obtain better convergence rate and optimization accuracy when the position is updated according to the actual optimization condition.
Preferably, the random term coefficient α of the firefly i moving randomly toward the firefly j after the t-th iteration update ij The value of (t) is set to:
representing a set consisting of the fireflies which are selected as the moving direction when each firefly in the population is subjected to the (t +1) th iteration updating as K (t), and only keeping one of the repeated fireflies when the repeated fireflies exist in the set K (t) as the moving direction, and defining theta K (t) represents a moving direction attribute value of firefly in the set K (t), and θ K The value of (t) is:
in the above formula, M
k (t) represents the number of fireflies in the set K (t), M represents the number of fireflies in the population, y
K (t) represents the dominance value of the spatial distribution of fireflies in the set K (t), and y
K The value of (t) is:
wherein the fireflies in the set K (t) are sequenced from high to low according to the absolute fluorescence brightness value to form a sequence L
K (t), then x'
l (t) represents the sequence L
K (t) location of the l firefly in the t iteration updated, x'
l+1 (t) represents the sequence L
K (t) the position of the (l +1) th firefly in (t) after the updating of the t-th iteration, k is a given positive integer, and k is<M
k The value of (t), k may be 10, x
l,a (t) is distance position x 'in the population after the t iteration update'
l (t) the position of the firefly at the a-th place,
is a sequence L
K (t) the spatial distribution of the first firefly in (t) is compared with the function, and
when theta is K The value of (t) satisfies: theta K (t)>1, then the random term coefficient alpha ij The value of (t) is:
when theta is K The value of (t) satisfies: theta K When (t) is less than or equal to 1, the random term coefficient alpha is ij The value of (t) is:
in the above formula, α
0 Is given an initial random coefficient value, and alpha
0 ∈[0,1],ω
j (t) represents the local spatial coefficients, ω, of firefly j in the set K (t) after the t-th iteration update
j The value of (t) is:
x
j (t) indicates the position of firefly j after the t-th iteration update, δ
j (t) represents the global optimization coefficient, δ, of firefly j in the set K (t) after the t-th iteration update
j The value of (t) is:
wherein,
shows firefly j in sequence L after the t-th iteration update
K (ii) the ordering in (t),
represents the sequence L
K (t) A
The location of the individual fireflies after the t-th iteration of updating.
Specifically, in the firefly algorithm, each firefly is selected to move towards an individual with higher fluorescence brightness than the firefly by using the roulette rule, so the firefly selected by using the roulette rule as the moving direction is only related to the current absolute fluorescence brightness of the firefly, and the preferred firefly selected as the moving direction plays a role in guiding the optimizing direction of the population in the optimizing process, so when the selected preferred firefly is too slice-shaped on the basis of the current optimizing, iterative optimizing of the firefly in the population cannot be completely led, the population is easily subjected to the condition of local optimization, therefore, the algorithm is prevented from being subjected to the condition of local optimization by using the random term when the position of the firefly is updated in the population improvement, and the selection of the random term coefficient in the random term is directly related to the disturbance range of the random term, therefore, the random item coefficient in the firefly algorithm is improved, so that the random item is prevented from falling into local optimum, and the searching precision of the algorithm is improved. When the random item coefficient of each firefly in the group during position updating is set, firstly, the better firefly which is currently selected by the group and is taken as the moving direction is detected through the defined moving direction attribute value, when the number of the different better fireflies which are selected by the group and are taken as the moving direction is more, and the distribution among the better fireflies is more dispersed on the basis of current optimization, the better fireflies which is currently selected by the group and is taken as the moving direction can lead the group to carry out more comprehensive optimization, at the moment, the smaller random item coefficient is set, so that the random item in the position updating formula has the function of strengthening the area searching precision of the group, and when the number of the different better fireflies which are selected by the group and are taken as the moving direction is less, or the better fireflies are distributed on the basis of current optimization, the larger random item coefficient is set, and expanding the disturbance range of the random term, so that the random term in the position updating formula has the function of helping the firefly to jump out of the local optimum. The value of the random item coefficient is set according to the actual condition of the firefly selected as the moving direction, so that the search precision of the population is enhanced and the population is helped to jump out of local optimum through the random item coefficient, and the classification precision of the support vector machine can be effectively improved through the parameters determined by the firefly algorithm.
Finally, it should be noted that the above embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the protection scope of the present invention, although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions can be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.