The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
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...
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...
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.
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...
To meet the demand of relation database copyright protection, a zero-watermarking algorithm is proposed. we introduce the idea of classification to database watermark working, giving a certain extent ease to the limit of data types and error bounds in database. This algorithm never changes the information of original object, but proves the databases' copyright belongs through the extraction of data's...
To solve the inefficiency problem of traditional PAM algorithm for initial cluster center, a new improved PAM algorithm is proposed. The algorithm builds minimum spanning tree and then splits it to get k initial clusters with the relevant cluster centers. Theory analysis and experimental results show that the found initial centers are closed to the desired cluster centers, and the improved algorithm...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.