Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

55 results about "Conditional entropy" patented technology

In information theory, the conditional entropy (or equivocation) quantifies the amount of information needed to describe the outcome of a random variable Y given that the value of another random variable X is known. Here, information is measured in shannons, nats, or hartleys. The entropy of Y conditioned on X is written as H(Y|X).

Distributed denial of service attack detection method based on C4.5 decision tree algorithm

The invention discloses a distributed denial of service attack detection method based on a C4.5 decision tree algorithm in software defined network environment, and the method comprises the followingsteps: collecting flow table information returned back by an OpenFlow switch through an OpenFlow protocol; extracting field information related to a DDoS attack from the flow table information, converting the extracted information into parameters capable of analyzing network flow distribution variation and taking the parameters as attributes, and forming a training set of a decision tree; classifying flows with the C4.5 decision tree algorithm, calculating class information entropy according to training set data classes; orderly calculating conditional entropy of the attributes, gain of information, information entropy of the attributes and information gain ratio of the attributes; selecting the attribute with the highest information gain ratio as a root node of the decision tree, and selecting the attributes with highest information gain ratio from the residual attributes as a fork node, and repeating the steps above until forming the decision tree; and using the finally formed decision tree to perform classification operation for the new network flow, and detecting whether the DDoS attack exists. The method can detect the DDoS attack more accurately.
Owner:NANJING UNIV OF POSTS & TELECOMM

Sensor arrangement method for reducing uncertainty of structural mode recognition

The invention belongs to the technical field of civil engineering structure health monitoring, and provides a sensor arrangement method for reducing the uncertainty of structural mode recognition. Theinfluences of structure model errors and measurement noises on measurement data are separated; the structural rigidity changes are used as the model errors; and Gaussian noises are used as the measurement noises. By adopting a Monte Carlo method, a large number of possible situations are simulated to obtain a structural mode matrix under the condition of the model errors; a conditional entropy index is proposed for quantifying and calculating the uncertainty of a mode recognition parameter result; and the problem of an uncertain Fisher information array, which cannot be solved by a traditional information entropy method is solved by using the conditional entropy index. A position corresponding to the minimum value of the conditional entropy index is an optimal sensor arrangement position.According to the sensor arrangement method provided by the invention, the influences of the structural mode errors and the measurement noises on the structural mode recognition are fully considered;and a great help is provided for improving the precision of structural mode parameter recognition.
Owner:DALIAN UNIV OF TECH

Pseudo label loss unsupervised adversarial domain adaptive picture classification method based on Gaussian uniform mixture model

The invention discloses a pseudo label loss unsupervised adversarial domain adaptive picture classification method based on a Gaussian uniform mixture model. According to the method, knowledge is migrated to a related target domain in a cross-domain manner by using a large amount of available annotation data of a related source domain through a transfer learning or domain adaptation method to obtain target data with labels; according to the domain adaptation method, Gaussian uniform mixture model detection outliers and a deep neural network are fused for image classification, the Gaussian uniform mixture model is used for modeling a cosine distance from target sample features of each class to a class mean value, and a target sample posterior probability is obtained and serves as an importance degree for estimating a target sample pseudo label; adding auxiliary pseudo tag loss proposed based on a target sample pseudo tag generated in the training process into training of the neural network; meanwhile, conditional entropy loss is minimized, so that learned features are far away from a decision boundary; a large number of experiments prove that the method can improve the picture classification accuracy of the deep network model.
Owner:CHINA UNIV OF MINING & TECH

Route interference impact metering method based on information entropy

The invention provides a method of route interfering and affecting metric based on information entropy, comprising the following steps: (1) expressing a pair of a source point and a sink communicated in the network and a plurality of paths between the source point and the sink as point to point network; (2) under the condition that any data flow is on the appointed primary path, conducting statistics on the actual path used by a transmit packet to obtain used probability distribution of a path set, and the probability distribution is used as the condition probability distribution on the condition of the appointed primary path; (3) calculating the conditional entropy according to the condition probability distribution on the condition of the appointed primary path, and the conditional entropy is used as the route interfering and affecting metric on the condition of the appointed primary path; (4) conducting statistics of all the paths to take the paths as the probability of the primary path which is used as the used probability distribution of the primary path aggregation, and conducting statistical average on the route interfering and affecting metric of the appointed primary path obtained in the step (3) aiming at the used probability distribution of the primary path aggregation to obtain the route interfering and affecting metric of the whole independent path network. The method is more applicable and accurate compared with the present method.
Owner:SOUTH CHINA UNIV OF TECH +1

City CA model establishment method based on maximum entropy principle

The invention discloses a city CA model establishment method based on a maximum entropy principle. The method comprises the steps that two-stage land utilization grid data is acquired and reclassified; the classified data is superimposed to obtain a city land utilization increase range, and random sampling and coordinate calculation are conducted in the range to obtain sample point data; a space variable influencing city land utilization extension is processed, and a result is used as a classification model constraint condition; a sample point and the constraint condition are used for model training to obtain a classification model with the maximum conditional entropy; a land utilization matrix and a cell corresponding to a matrix element are established, a space coordinate of the cell isinput into the model, the conditional probability of each cell classified as urban land under influence of the constraint condition is obtained and used as the CA model cell transition probability, and a city extension CA model is established on the basis of the CA model cell transition probability and in combination with neighborhood constraint. According to the method, the CA model with the maximum entropy is established and applied to urban land extension simulation, the randomness problem is considered, and the method helps to more precisely simulate city development.
Owner:WUHAN UNIV

Data publishing method and system

The invention relates to a data publishing method and system. The method comprises the steps that sensitive attribute weights of all set fields in original data provided by a data publisher are determined according to information entropy; determining an association attribute weight of each set field according to the conditional entropy and the information gain; determining a privacy weight of each set field according to the sensitive attribute weight and the associated attribute weight; performing non-negative numeralization processing on the data of the set field to obtain a privacy sensitive data matrix; obtaining a privacy sensitive data matrix with a privacy weight; performing norm calculation on the privacy sensitive data matrix with the privacy weight to determine a privacy risk leakage coefficient; judging whether the privacy risk leakage coefficient is within a set range or not; and if the privacy risk leakage coefficient is not within the set range, desensitizing the data corresponding to each set field in the original data, replacing the data corresponding to the set fields with the desensitized data, and recalculating the privacy risk leakage coefficient until the privacy risk leakage coefficient conforms to the set range. According to the invention, the risk of data privacy leakage is reduced.
Owner:GUIZHOU UNIV

A method and system for eliminating redundancy of agrometeorological data based on information entropy

The invention relates to the field of agricultural data processing, in particular to a method for eliminating redundancy of agrometeorological data based on information entropy, comprising the steps of constructing a decision information table, collecting all object sets, a condition attribute set, a decision attribute set, an attribute value set and a system function, and constructing a decisioninformation table. Calculating the mutual information amount, and obtaining the mutual information amount according to the information entropy and the conditional entropy; Determining a related attribute, if the attribute a is a related attribute, making the kernel attribute data set R = R U {a}; Determining a kernel attribute data set step of determining a value of the kernel attribute data set Rand outputting the kernel attribute data set R if the mutual information amount between the kernel attribute data set R and the decision attribute set is equal to the mutual information amount between the conditional attribute set and the decision attribute set; Disaster assessment step, performing data mining and analyzing the core attribute data set R, according to the results, assessing agro-meteorological disaster. The invention can improve the processing speed of agrometeorological data and improve the accuracy of agrometeorological disaster assessment.
Owner:GUANGDONG KINGPOINT DATA SCI & TECH CO LTD

Method for determining the optimal segmentation scale of satellite image segmentation based on information gain ratio

The invention discloses a method for determining the optimal segmentation scale of satellite image segmentation based on information gain rate, includes obtaining high-resolution satellite remote sensing image, preprocessing, selecting representative region as sample region determined by optimal segmentation scale, classifying surface features of sample region, obtaining image classification result of sample region as reference image determined by optimal segmentation scale, and obtaining image classification result of sample region as reference image determined by optimal segmentation scale;setting a series of segmentation scale parameters from small to large, using multi-scale segmentation technology, the sample image is segmented in multi-scale to obtain a series of segmented object vectors; Based on Shannon information entropy formula, the information entropy of reference image and segmentation vector is calculated, and the conditional entropy of reference image with segmentationvector is calculated, then the information gain and information gain ratio of segmentation vector are calculated. The optimal segmentation scale is selected according to the principle of maximum information gain rate. Finally, based on the optimal segmentation scale, the original image is segmented at multiple scales.
Owner:ZHEJIANG UNIV

Man-machine relationship verification method and device based on equipment use conditions

The invention discloses a man-machine relationship verification method and device based on equipment use conditions. The method comprises the following steps: obtaining an equipment use condition database, and extracting a training set D from the equipment use condition database; extracting a feature set A of the training set D, wherein the feature set A contains features for judging the use condition of the equipment; calculating the empirical conditional entropy and the information gain of each feature in the feature set A to the training set D based on an ID3 algorithm so as to select a proper root node and a proper intermediate node; constructing a decision tree according to the selected root node and the intermediate node; and analyzing whether the equipment is frequently used or notand whether the equipment is replaced and used arbitrarily or not based on the decision tree so as to adjust and maintain the requirements of the equipment. The invention further discloses a corresponding device. Whether the equipment is frequently used or not and whether the behavior of replacing the equipment without permission occurs or not can be discovered in time through equipment feature identification calculation so that the information security and accuracy are improved, and the problems that the equipment is idle and the user of the equipment can be replaced without permission are solved.
Owner:国网浙江武义县供电有限公司 +1

Distributed Denial of Service Attack Detection Method Based on C4.5 Decision Tree Algorithm

The invention discloses a distributed denial of service attack detection method based on a C4.5 decision tree algorithm in software defined network environment, and the method comprises the followingsteps: collecting flow table information returned back by an OpenFlow switch through an OpenFlow protocol; extracting field information related to a DDoS attack from the flow table information, converting the extracted information into parameters capable of analyzing network flow distribution variation and taking the parameters as attributes, and forming a training set of a decision tree; classifying flows with the C4.5 decision tree algorithm, calculating class information entropy according to training set data classes; orderly calculating conditional entropy of the attributes, gain of information, information entropy of the attributes and information gain ratio of the attributes; selecting the attribute with the highest information gain ratio as a root node of the decision tree, and selecting the attributes with highest information gain ratio from the residual attributes as a fork node, and repeating the steps above until forming the decision tree; and using the finally formed decision tree to perform classification operation for the new network flow, and detecting whether the DDoS attack exists. The method can detect the DDoS attack more accurately.
Owner:NANJING UNIV OF POSTS & TELECOMM

Equivocation augmentation dynamic secrecy system

Shannon's equivocation, the conditional entropy of key or message with respect to a specific ciphertext, is the primary indicator of the security of any secrecy system, in that when key equivocation H E (K) or message equivocation H E (M) attain log 0 (or 1) under a brute-force attack, the system is compromised and has no security. We propose a simplistic equivocation definition of security which distinguishes between “secure / unsolvable” and “insecure / solvable” encipherments. Whilst equivocation may be used practically in a passive manner to cryptanalyse finite-length key “insecure / solvable” secrecy systems to determine the length of ciphertext required to compromise the secrecy system, the invention in this patent offers a cryptographic design framework which allows for the equivocation of finite-length key systems to be actively engineered using equivocation augmentation, such that the residual key and message equivocation of any cryptosystem may be continuously augmented at a faster rate than it is lost, effectively ensuring that equivocation can never attain log 0. In short, it allows for the encryption of any length of message with any finite length key into a ciphertext with “secure / unsolvable” security characteristics. Alternatively, it allows for the cryptographic engineering of information theoretic security in all finite length key systems. The invention is primarily aimed at solving two major problems: (a) a viable practical security solution against future quantum computing / artificial intelligence threats (the QC / AI problem), and (b) a viable practical security solution to the privacy / national interest dichotomy problem, in that it allows for the engineering of security systems which are capable of simultaneously supporting both the absolute privacy of individual users and the security interests of the user group at large. Various methods, apparatuses, and systems are described which allow for the implementation of a “secure / unsolvable” secrecy system which is fast, extensible, simple to implement in hardware and software, and able to be incorporated by or with any existing security solution or cryptographic primitives.
Owner:FIGUEIRA HELDER SILVESTRE PAIVA

Multi-target feature selection method and device for image classification and storage medium

The invention provides a multi-target feature selection method and device for image classification and a storage medium, and the method comprises the steps: calculating the conditional entropy corresponding to each dimension of feature in a training sample containing multi-dimensional image features, and calculating the selected probability of the dimension of feature; initializing a preset number of particles by using a particle swarm optimization algorithm; calculating target function values of all particles, performing non-dominated sorting, and selecting a non-dominated solution to update the optimal position of a particle individual and the global optimal position of a particle swarm; when the current number of iterations reaches a preset condition, carrying out local search based on cross entropy, updating speed information and position information of particles in the local search step, calculating target function values of all particles, carrying out non-dominated sorting, and selecting a non-dominated solution to update the optimal position of a particle individual and the global optimal position of a particle swarm; and outputting a final solution by adopting an inflection point selection method under the condition that the number of iterations reaches a preset number of iterations threshold.
Owner:BEIJING UNIV OF POSTS & TELECOMM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products