The gradual rise of precision medicine,such as mining cardiopulmonary exercise time series of young hypertensive patients,can understand the response of different individuals to aerobic exercise training.This helps to improve the efficiency of hypertension management plan and achieve aerobic exercise intervention more effectively.One of the bottlenecks in this study is that it is difficult to obtain sufficient sample data.To solve the above problem,this paper adopts the weighted dynamic-time-warping barycenter averaging algorithm(WDBA) to realize data augmentation of time series,focusing on the barycenter selection and the weight assignment.In this paper,the concept of active barycenter is introduced for the first time,and the selection strategies of representative barycenter and diversity barycenter are proposed to improve the effect of data augmentation.Furthermore,aiming at the shortcomings of the existing weight assignment strategies,a random strategy with decreasing distance is proposed to further improve the generalization ability of the model by avoiding the synthesis of duplicate samples.Experimental results show that the accuracy of predicting the efficacy of aerobic exercise intervention in young hypertensive patients can be further improved by considering both the barycenter selection and the weight assignment for data augmentation in the background of this study.

In recent years,the research of sequential recommendation has developed rapidly in the recommendation field,existing methods are good at capturing users’ sequential behavior to achieve preference prediction.Among them,some advanced methods integrate users’ sentiment information to guide behavior mining.However,the advanced sentiment-based models do not consider mining relations between multi-category user sentiment sequences.Moreover,such methods cannot intuitively explain the contribution of temporal sentiments to user preferences.To make up for the above shortcomings,this paper first attempts to store temporal sentiments in the form of memory and impose constraints on them.Specifically,this research proposes two mechanisms including sentiment self-constraint and sentiment mutual-constraint to explore the associations between multiple categories of sentiments and assist user behaviors in completing sequential recommendations.Furthermore,the proposed memory framework is able to record users’ temporal sentiment attention,so that it can provide a certain degree of intuitive explanation on the basis of accurately predicting users’ temporal preference.Experimental results show that our approach outperforms existing state-of-the-art sequential methods,and it has better explainable effects than the sentiment-based sequential recommendation models.

In order to establish an accurate multibeam sonar elevation data prediction model and solve the problem of the accuracy of air-squared prediction of artificial reefs,a multibeam sonar elevation data prediction method based on a combined model of improved convolutional neural network(CNN) and BP neural network is proposed.First,the improved CNN is used to extract topographic trend features by full convolutional operation of the elevation data,and then input to BP to further explore the internal topographic trend change pattern,so as to achieve the prediction of multibeam sonar elevation data.Experiments are conducted with multibeam sonar elevation data from a submarine ranch and cross-validated using the null square volume of artificial reefs.Finally,it is compared with the traditional kriging,BP,GA-BP,and PSO-BP models.The results show that the improved CNN-BP model performs the best prediction results on multibeam sonar elevation data and artificial reef air-square volume,which verifies the feasibility,reliability and high accuracy of the proposed method.

In recent years,academia has gradually accumulated a large amount of data.As an effective method for representing and analyzing big data,network structure has rich dimensions and can model a large amount of data in real life.Graph online analytic processing(Graph OLAP) technology inherits the related ideas of traditional OLAP technology,allowing users to analyze multi-dimensional network data from different angles and granularities.However,most of the existing graph OLAP technologies revolve around the construction of data cubes,and most of the related operations are simple extensions of traditional OLAP technologies on graph data,and the built models have weak ability to mine the topology of the network itself.To this end,the aca-demic network constellation model and related graph OLAP analysis algorithms are firstly designed,which more clearly highlights the topological structure information of academic networks and improves the analysis ability of graph OLAP.Secondly,the corresponding materialization strategy is proposed,which effectively improves the efficiency of graph OLAP analysis.

Community structure is an important feature in complex networks,and the goal of local community detection is to query a community subgraph containing a set of seed nodes.Traditional local community detection algorithms usually use the topology of the network for community query,ignoring the rich node attribute information in the network.A local community detection algorithm based on multi-objective particle swarm optimization is proposed for realistic and widespread attribute networks.Firstly,attribute relationship edges are constructed based on the attribute similarity between nodes and their multi-order neighbours,and topological relationship edges are obtained by weighting the network structure based on the motif information,followed by sampling the two relationship edges around the core nodes using a random walk algorithm to obtain alternative node sets.Based on this,the alternative node sets are iteratively filtered by a multi-objective particle swarm optimization algorithm to obtain a topologically tight and attribute-homogeneous community structure.Experimental results on real datasets show that the proposed method improves the performance of local community detection.

Traffic prediction is an important research component of urban intelligent transportation systems to make our travel more efficient and safer.Accurately predicting traffic flow remains a huge challenge due to complex temporal and spatial depen-dencies.In recent years,graph convolutional network(GCN) has shown great potential for traffic prediction,but GCN-based mo-dels tend to focus on capturing temporal and spatial dependencies,ignoring the dynamic correlation between temporal and spatial dependencies and failing to integrate them well.In addition,previous approaches use real-world static traffic networks to construct spatial adjacency matrices,which may ignore the dynamic spatial dependencies.To overcome these limitations and improve the performance of the model,a novel spatial-temporal Graph-CoordAttention network(STGCA) is proposed.Specifically,the spatial-temporal synchronization module is proposed to model the spatial-temporal dependence of the crossing relations at different moments.Then,a dynamic graph learning scheme is proposed to mine potential graph information based on data correlation between traffic flows.Compared with the existing baseline models on four publicly available datasets,STGCA exhibits excellent perfor-mance.

Feature mining is a key step to learn the interaction between users and items in the recommendation algorithm model,which is of great significance to improve the accuracy of the recommendation model.Among the existing feature mining models,although the linear logistic regression model is simple and can achieve good fitting effect,its generalization ability is weak,and the model has a large demand for feature parameters.Deep & Cross network can effectively realize the cross extraction of features,but its representation ability of data features is still insufficient.Therefore,by introducing the idea of multiple residual structure and cross coding,an improved recommendation model of Deep & Cross network based on decision tree is proposed.Firstly,it designs a tree structure based on GBDT algorithm to construct enhanced features,which strengthens the deep mining of the model on potential features.Secondly,the input parameter dimension of the embedded layer of the model is amplified and optimized.Finally,the improved Deep & Cross network recommendation model is used for recommendation prediction.This design can not only break the limitations of existing models in generalization ability,but also keep the feature parameters simple and strengthen their representation ability,so as to effectively mine the hidden associations of users and improve the accuracy of recommendation.Experimental results based on the public test data set show that the prediction effect of the proposed model is better than the exis-ting feature interaction methods.

The traditional density clustering algorithms do not consider the attribute difference between data points in the clustering process,but treat all data points as homogenous points.Based on the traditional DBSCAN algorithm,a dynamic neighborhood－－density based spatial clustering of applications with noise(DN-DBSCAN) is proposed.When it is working,each point’s neighborhood radius is determined by the properties of itself,so the neighborhood radius is dynamic changing.Thus,different influences on datasets produced by points with different properties is reflected in the clustering results,making the density clustering algorithm has more practical meaning and can be more reasonable to solve practical problems.On the basis of example analysis,the DN-DBSCAN algorithm is applied to solve the urban agglomeration division problem in the Yangtze river delta,and the results of DBSCAN algorithm,OPTICS algorithm and DPC algorithm are compared and analyzed.The results show that DN-DBSCAN algorithm can reasonably classify urban agglomerations in the Yangtze river delta according to the different attributes of each city with an accuracy of 95%,which is much higher than the accuracy of 85%,85% and 88% of the other three algorithms respectively,indicating that it has a better ability to solve practical problems.

Temporal hierarchical data is a kind of hierarchical data characterized by time dimension description and is used to model the hierarchical structure that changes over time.Compared with management methods for common hierarchical data,there are still problems in temporal hierarchical data management such as the complexity of storage scheme design and inefficiency of query and update.To solve the above problems,a temporal hierarchical data management method based on nested intervals scheme is proposed.4 types of change in hierarchical data are firstly analyzed from the perspective of the node change,based on which the storage and query capabilities of multi-version nodes in a rational database are then realized by extending the time labels.Finally,the abundantly gapped nested intervals scheme(AGNIS) is put forward to solve the problem of data insertion inefficiency in common nested intervals scheme.Experiments based on the data of Chinese administrative division and its adjustment from 2021 to 2022 show that the proposed method can implement the storage of historical hierarchical data and the query of hie-rarchical snapshot at any time,with a high efficiency in data query and update operation.

Credit evaluation is a key problem in finance,which predicts whether a user is at risk of defaulting and thus reduces bad debt losses.One of the key challenges in credit evaluation is the presence of a large number of invalid or redundant features in the dataset.To solve this problem,an improved feature selection using forest optimization algorithm(IFSFOA) is proposed.It addresses the shortcomings of the original algorithm FSFOA by using a cardinality check-based initialization strategy instead of randomized initialization in the initialization phase to improve the algorithm’s search capability;using a multi-level variation strategy in the local seeding phase to optimize the local search capability and solve the problems of restricted search space and localization of FSFOA;using a greedy selection strategy to select high-quality trees and eliminate low-quality trees when updating the candidate forest.In updating the candidate forest,we use the greedy selection strategy to select high-quality trees and eliminate low-quality trees,and converge the search dispersion process.Finally,the results show that IFSFOA outperforms FSFOA and more efficient feature selection algorithms proposed in recent years in terms of classification ability and dimension reduction ability,and validates the effectiveness of IFSFOA by setting up comparison experiments on public credit evaluation datasets covering low,medium and high dimensions.

In the era of big data,data access speed is an important indicator to measure the performance of large-scale storage systems.Index is one of the main technologies to improve data access performance in database system.In recent years,learned index(LI) is proposed,which uses machine learning models instead of traditional B+-tree indexes,leverages pattern about the under-lying data distribution to train the models and optimize the indirect search of data query into the direct search of function calculation,learned index can speed up queries and reduce the size of an index.However,the fitting effect of LI is general,and it assumes that the data is static and read-only,it does not support modification operations such as insertion.This paper presents GDLIN,a novel form of a learned index,which uses gradient descent algorithm to fit the data.Gradient descent algorithm can reduce the error between the predict position and the actual position,which can reduce the cost of local research.Besides,GDLIN recursive calls the construction algorithm until only one model is created,which makes full use of keys’ distribution,and avoids the increase of the size of index with the data volume.In addition,GDLIN uses the sorted linked list to address the problem of data insertion.Experiment results demonstrate GDLIN improves the lookup throughput by 2.1× compared with the traditional B＋-trees without insertion.Besides,GDLIN improves the lookup performance by 1.08× compared with the LI when the factor of insertion is 0.5.

Traffic flow forecasting is of great importance to urban road planning,traffic safety issues and building smart cities.However,most existing traffic prediction models cannot capture the dynamic spatio-temporal correlation of traffic data well enough to obtain satisfactory prediction results.To address this problem,a dynamic spatio-temporal neural network-based city traffic flow prediction method is proposed to solve the traffic flow prediction problem.First,by modelling the nearest cycle dependence,daily cycle dependence and weekly cycle dependence of the traffic data,a 3D convolutional neural network is used on each component to extract the high-dimensional features of urban traffic.Then,an improved residual structure is used to capture the correlation between remote area pairs and the prediction area,and a fusion of spatial attention and temporal attention mechanisms is used to capture the dynamic correlation between traffic flows in different time periods in different areas.Finally,the outputs of the three components are weighted and fused using a parameter matrix-based approach to obtain the prediction results.Experiments on two publicly available datasets,TaxiBJ and BikeNYC,show that the proposed model outperforms the mainstream traffic forecasting models.

Effective anomaly detection of multivariate time series is important for data mining analysis.However,most of the exi-sting detection methods are based on single modality,they cannot effectively utilize the distribution information of time series in multi-modal space.For multi-modal features,there is no effective adaptive fusion method and extraction method of spatial-temporal dependence.In this paper,a time series anomaly detection method based on multi-modal feature fusion is proposed.The multi-modal feature adaptive fusion module is established,it can adaptively fuse the multi-modal features through convolution network and soft selection mode.The spatial-temporal attention module is proposed,it is composed of temporal attention and spatial attention.It extracts spatial-temporal dependence of the multi-modal features and outputs the spatial-temporal attention vector.Then the model prediction results are obtained based on the spatial-temporal attention vector.By learning the distribution of normal samples,anomaly detection result is obtained according to the error measure between the predicted values and the real values.The proposed method is compared with other state-of-the-art models on four public datasets,and results demonstrate its effectiveness.

Emotional information contained in massive texts on the Internet expresses public views and attitudes.How to identify and utilize emotional resources has become the focus of research in various fields.By combing the relevant theories and literature on fine-grained emotion recognition,this paper summarizes the classification methods and application scenarios,and discusses the technical challenges and practical gaps.Through analysis,it is found that fine-grained emotion recognition methods mainly include emotion lexicon,traditional machine learning and neural network learning,which are mostly used in business analysis and public opinion management.In view of the future research trend,firstly,the real-time updating of online emotion words,domain lexicon construction and semantic analysis technology can be studied.Secondly,how to improve the automatic classification of training data and build a semi-supervised learning model need to be further discussed.In addition,the research of business analysis and public opinion management can explore the integration of aspect extraction and emotion recognition.This paper summarizes and comments on emotion recognition technology and its application,which can provide a reference for the subsequent research.

To promote the development of health and medical big data and actively promote the safe sharing of medical data,this paper constructs a tripartite evolutionary game model of the system manager,data provider and data demander based on the blockchain architecture.Firstly,prospect theory is combined with evolutionary game,and the parameters of traditional evolutio-nary game are improved by the prospect value function.Secondly,the possibility of game equilibrium and its evolution trend are discussed.Finally,the influence of different factors on the decision-making of each participant in medical data sharing under blockchain architecture is discussed through numerical simulation.The results show that the choice of initial strategy has a signi-ficant influence on the stability of game strategy.The evolution of the system can be accelerated by improving the regulatory bene-fits of the system manager,reducing the perceived losses of the data provider,and improving the compensation of the data demander for actively reporting non-compliance behaviors,thus enhancing the trust of all participants and promoting the formation of trust relationships.

With the advent of the era of big data,the structure of data becomes more and more complex,and the dimensions of data set become higher and higher,which will affect the efficiency of data mining greatly.Therefore,it is necessary to perform data compression or attribute reduction to information systems,that is,to remove unnecessary redundant attributes,reduce data dimensions,and improve the efficiency of data mining.The reduction methods proposed by many scholars in the past regard each attribute as equally important.But in real life,people’s attention to each conditional attribute in the data set is often different.Aiming at this phenomenon,based on the classical fuzzy decision data set,this paper weights different conditional attributes,defines the weighted score function,and further establishes the fuzzy order decision information system with attention degree.Then the distribution function is introduced into the system and the distribution reduction method is established by the distribution discer-nible matrix.Finally,the feasibility of the method is verified by a case study.

Community structure is an important potential feature that exists widely in complex networks.As a key task of network analysis,mining the community structure has important theoretical and practical significance for exploring the potential characteristics,understanding the network organization structure,and discovering the hidden rules and interaction pattern.This paper introduces the background and significance of community detection,and summarizes and combs the methods of community detection from two aspects:static network community detection and dynamic network community detection.Among them,the community detection methods of static network include community detection based on division,community detection based on hierarchical clustering,community detection based on modularity,community detection based on non-negative matrix factorization and community detection based on deep learning.Dynamic network community detection methods include incremental clustering community detection and evolutionary clustering community detection.This paper also introduces the commonly used evaluation metrics of community detection.Finally,some challenges faced by community detection and the future development direction are discussed.

For services on location-based social network(LBSNs),effective point of interest(POI) recommendation has great economic and social utility.However,how to comprehend the position,structure and behavior related information of LBSNs and proceed reasoning for POI recommendation is still a challenge task.To exploit the heterogeneous information on LBSN,a novel graph attentive aggregation model for POI recommendation(POIR-GAT) is proposed,which exploits both users’ social information and POIs’ attributed information.Firstly,POIR-GAT uses social relationship to construct user-user graph,and extracts user feature vector together with user-POI interaction graph.Secondly,it constructs feature matrix based on different attributes of POIs,obtains hidden factors through matrix decomposition,integrates multiple features into POI feature vector,and learns their common influence on user behavior.Finally,it realizes the integration of social factors and POI features recommended model.Extensive experiments on two public datasets show that the proposed POIR-GAT model can effectively integrate users’ social information and POI feature information,and improve the quality of POI recommendation.

The spreading capacity of nodes has been one of the most attractive problems in the field of complex networks.Due to the large size of nodes in network,researchers want to find accurate measures to estimate the spreading capacity of nodes.In this paper,a new method is proposed based on the basic concepts of information theory and k-shell,which measures the spreading capacity of nodes according to the topological information of their locations in the network.Experimental results show that the proposed method is more effective than other similar methods,and can effectively avoid the “rich club phenomenon” of k-shell method.

Fuzzy support vector machine(FSVM) effectively distinguishes the importance of different samples by introducing fuzzy memberships,which reduces the sensitivity of traditional support vector machines to noise data.The membership function designed based on Euclidean distance ignores the overall distribution of samples and does not consider the different importance of sample features.A fuzzy support vector machine method based on weighted Mahalanobis distance is proposed.This method first applies the Relief-F algorithm to estimate the weight of each feature.Then it utilizes the weight for calculating the weighted Mahalanobis distance between the sample and the center of its class.Finally,the fuzzy membership of the sample is calculated based on weighted Mahalanobis distance.Furthermore,considering the difficulty of determining the kernel function and its parameters,a fuzzy multi-kernel support vector machine(FMKSVM) based on weighted Mahalanobis distance is put forward,which combines FSVM with multiple kernel learning methods.The multi-kernel is constructed in the form of weighted sum,and the weight of each kernel is calculated according to the central kernel alignment method(CKA).The proposed method not only reduces the influence of weakly relevant features on classification results,but also enables a more adequate and accurate representation of the data.Experimental results show that,FSVM based on weighted Mahalanobis distance has higher classification accuracy than FSVM based on Euclidean distance and Mahalanobis distance,and the classification performance of FMKSVM based on weighted Mahalanobis distance is superior to that of the single-kernel model.

With the rapid development of information technology and network technology and their widespread use in military field,networking information-centric system of systems comes into being.The networking information-centric system of systems is dominated by information,its main manifestation is the information activity process.The rationality and efficiency of the information activity process directly affect the operational effectiveness of information in the combat system.The use of process mi-ning technology to discover information activity process models from information activity event logs can provide effective support for modelling,testing and enhancement of information activity processes.Simply filtering noise in logs through event frequency analysis can easily lead to the loss of valid low-frequency paths and reduce the accuracy of the mined information activity processes.Combining the special characteristics of military information activities and the effectiveness characteristics of information transfer,a structure aggregation degree based effective low frequency path mining algorithm is proposed.Simulation analysis shows that the method can successfully separate log noise and effective low frequency paths,which is important for mining real and effective information processes.

In order to alleviate the data sparse problem and improve the accuracy of collaborative filtering algorithm,a recommendation algorithm based on Apriori algorithm and improved similarity is presented.Firstly,it uses Apriori algorithm to mine the potential connections between users,and uses the confidence of the association rules between users to represent the potential connections between users,then constructs a user confidence matrix to fill the user rating matrix.Secondly,the algorithm uses the confidence matrix to improve the traditional similarity calculation formula and build a comprehensive similarity calculation formula between users.Finally,the algorithm uses the filled user rating matrix and the comprehensive similarity between users to make recommendations for users.The proposed algorithm has higher algorithm accuracy than traditional algorithms.Compared with other algorithms,the proposed algorithm can effectively alleviate the long tail problem of the recommendation system,so as to further improve the recommendation quality of the recommendation system.

A spatial co-location pattern is a subset of spatial features whose instances frequently locate together in the neighborhood.Traditional co-location pattern does not distinguish the importance of features in the pattern,and ignores the dominant relationship among features.The co-location pattern with dominant feature considers the inequality of features in the pattern,and analyzes the dominant relationship among features,which can be used in many applications.However,the existing methods for mining co-location pattern with dominant feature do not comprehensively consider the possible tendency and influence intensity of one feature dominating other features from the perspective of features’ instances distribution,so that the dominant relationship among features is not properly revealed.This paper first analyzes the spatial distribution of features’ instances in a co-location pattern,proposes the pattern dominance index to measure the possible tendency of a feature dominating other features in a pattern,and proposes the dominant influence index to measure the influence intensity of the dominance tendency.Based on the two new measures,the dominant feature mining of co-location pattern is proposed.Then an efficient algorithm for mining co-location pattern with dominant feature is proposed by optimizing the calculation of new measures.A large number of experiments on real data sets and synthetic data sets verify that the proposed method can effectively identify the dominant feature in a co-location pattern,and it can efficiently mine co-location patterns with dominant feature.

In the training stage of the generative adversarial networks(GAN) based anomaly detection method,its training set consists of only normal data.When training data are sufficient,the GAN based anomaly detection method may obtain smaller reconstruction error.However,in the testing stage,the difference between the reconstruction errors of normal data and those of part novel data is too small,which makes the discriminant performance of the GAN based anomaly detection method become poor.To solve this problem,a memory-augmented GAN based anomaly detection method is proposed.A memory-augmented mo-dule is introduced into the proposed method to make it remember the characteristic of normal data.Hence,the reconstruction error of novel data becomes larger and thus the discriminant ability of the proposed method is enhanced.In comparison with the related approaches,experimental results on MNIST,Fashion-MNIST and CIFAR-10 verify that the proposed method has better detection performance.

Community discovery is a hot topic in the field of complex networks.Many local community detection algorithms have been proposed to quickly discover high-quality communities,but most of them have seed-dependent or stability problems.Some algorithms try to accurately find the seed nodes according to the topology characteristics of the core nodes that they are highly surrounded by neighbors and far away from each other to avoid the above problems.But the calculation of distance makes its time complexity is high.In this paper,a community detection method based on influence of core nodes(CDIC) is proposed.This me-thod first searches for all possible core nodes according to the topological characteristics of core nodes and network adjacency information.Then it uses the higher influential of true core nodes and the idea of label propagation to expand the communities and eliminate nodes wrongly selected as the core to avoid the seed-dependent problems.Besides,the calculation without distance also ensures low time complexity.Finally,a community attraction to nodes based on the similarity theory is proposed to merge specific nodes to ensure the stability of the results.The normalized mutual information and purity of the proposed method,6 classic algorithms and 2 algorithms proposed in recent years are compared on 64 artificial networks and 4 real networks.The results show the effectiveness of CDIC.

In recent years,graph network has been widely used in the field of recommendation and made a great progress.How-ever,the existing methods tend to focus on the interaction modeling of user projects,so the performance is limited by the problem of data sparsity.Therefore,this paper proposes a movie recommendation model based on graph attention network of attribute graph by using additional attribute information.Firstly,an attention-based GNN is proposed,which uses explicit feed-back to calculate the attention score between entities and attributes.Compared with the aggregation method using Laplace matrix,it can distinguish the influence of different attributes on entities more effectively,and the information aggregation between attributes and entities can be more effective.In addition,different entities are affected differently by attributes and behaviors,a fine-grained pre-ference fusion strategy is designed in this paper to calculate a set of preference fusion weights for each entity to make the embedding representation of entities more accurate and personalized.Experimental results on real data set show that the recommendation method that makes full use of attribute information contained in attribute graph can effectively alleviate the problem of data sparsity and is significantly better than other basic algorithm in terms of recall rate and nDCG,two evaluation indexes of movie recommendation.

For fuzzy neighborhood systems,upper and lower fuzzy rough approximation operators based on general fuzzy logic operators are proposed,and the basic properties of the operators are investigated.Then,the concepts of neighborhood system of serial,reflexive,symmetric,unary and Euclidean are extended to fuzzy neighborhood systems.Finally,the related algebraic structures of fuzzy rough approximation operators are discussed when the fuzzy neighborhood system is serial,reflexive,symmetric,unary and Euclidean.

Disease diagnosis is a field of electronic health record data mining where lots of researchers are interested in,and it is also an important link to realize the intellectualization of medical diagnosis.However,due to the diversity of data sources,complex data structure and potential correlation among different types of health sensing data,there is a problem of how to fuse heterogeneous data in the process of feature extraction and data mining.Therefore,comprehensively considering clinical sensing data,personal physical record data and relationship data between diseases,and mining the latent relevant features can make the diagnosis of multi-category diseases more accurate.Dynamic and static relationship fusion of multi-source health perception data for disease diagnosis(DSRF) is proposed.Firstly,the dynamic and static relationship fusion algorithm is used to extract data correlation features and solve the heterogeneity of dynamic clinical sensing time series data and static personal physical condition data.Then the dependency matrix of multi-category diseases is calculated to extract the correlations among diseases.Finally,various health sen-sing data is fused based on the gated recurrent unit network.The comprehensive analysis of multi-source heterogeneous data is completed after the above three steps.Experimental results on the real-world American MIMIC-III clinical dataset show that the proposed model outperforms state-of-the-art models and is able to diagnose multiple categories of diseases accurately.

This paper studies the probability of fuzzy random events based on axiomatic fuzzy set,defines fuzzy random events and their corresponding probabilities,discusses some basic properties of probabilities of fuzzy random events,gives the product rule of fuzzy random events probability,and proves the law of total probability of fuzzy random events and Bayes’rule.

In recent years,as the number of high school graduates growing,the demand of college entrance filling is increasing.But faced with massive amounts of college entrance data,students always cannot make reasonable decisions conform to their own will in a short time,resulting in filling accident.To address this issue,on the basis of crawling college entrance history data by web spider,a novel college entrance filling recommendation algorithm based on score line prediction and multi-feature fusion(Reco-PMF) is proposed.Firstly,BP neural network is applied to predict all the colleges admission lines of current year.Then,combining with colleges’ rankings,an admission probability algorithm is constructed on the basis of three score related features.Genetic algorithm is employed to optimize the weights of above features.On this basis,recommendation-score is defined to measure admission risk.Finally,a college filling list with multi-admission risk is generated.Experiment results show that,the college admission line prediction algorithm based on BP neural network performs better than other algorithms under all error bounds.Compared with existing on-line services of Baidu and Kuake,Reco-PMF increases the acceptance rates by 14.8% and 24.1%,and improves the average ranking of recommended colleges by 99 and 87 in accepted colleges.