Hao Wenning

Survey of Probabilistic Graphical Models

Probabilistic graphical model (PGM) is a generic model that represents the probability-based relationships among random variables by a graph, and is a general method for knowledge representation and inference involving uncertainty. In recent years, PGM provides an important means for solving the uncertainty of intelligent information field, and becomes research focus in the fields of machine learning and artificial intelligence etc. In the paper, PGM and its three types of basic models are reviewed, including the learning and inference theory, research status, application and promotion.

A Decision Tree Algorithm Based on Dispersion Measure of Attribute Information

In this paper, an improved decision tree algorithm based on dispersion measure of attribute information was proposed, which combined information gain and dispersion of attribute information as an evaluation criterion of attribute selection in order to overcome the deficiency that ID3 decision tree algorithm leaned to the multi-value attribute. From results of the experiment, it can be demonstrated that the proposed algorithm could over the deficiency of leaning to the multi-value attribute, and has good performance on classification.

Design and Implementation of Database Encrypting Middleware

To solve the problem of encrypting mechanism that existing database system provide, this paper proposed a new database encrypting middleware system architecture, illustrates the exec theory and encrypting/decrypting strategy of the middleware, brings forward the algorithm for encrypting index constructing and query transformating, finally analyzes the security of encrypted index.

QoS Routing Algorithm Based on Parameter Adaptive Ant Colony Optimization

Ant colony optimization (ACO) is a kind of new type heuristically optimizing algorithm, having ability to organize itself. In order to solve the problem that QoS routing faces while study at present, this paper proposes a new QoS routing algorithm based on an improved ACO which introduces a routing quality based parameter adaptive mechanism. Simulation results demonstrate that the algorithm has a better performance in generating a path satisfying operations QoS demand.