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.
We describe an efficient algorithm for releasing a provably private estimate of the degree distribution of a network. The algorithm satisfies a rigorous property of differential privacy, and is also extremely efficient, running on networks of 100 million nodes in a few seconds. Theoretical analysis shows that the error scales linearly with the number of unique degrees, whereas the error of conventional...
This paper presents an improved particle swarm optimization algorithm with feasibility- based rules (FRIPSO) to solve mixed-variable constrained optimization problems. Different kinds of variables are dealt in different ways in FRIPSO algorithm. Constraint handling is based on simple feasibility-based rules without the use of a penalty function which is frequently cumbersome to parameterize, nor need...
Decision tree, as a simple classification algorithm, is an effective tool for mining knowledge rules, and it has been successfully applied in many fields. Based on the analysis of the essential characteristics of decision tree algorithm, for the selection of the expanded attributes, we put forward leaf criterion; data utilization criterion and comprehensive effect criterion which can recognize the...
A Particle Swarm Optimization algorithm with feasibility-based rules (FRPSO) is proposed in this paper to solve mixed-variable optimization problems. An approach to handle various kinds of variables is discussed. Constraint handling is based on simple feasibility-based rules, not needing addinional penalty parameters and not guaranteeing to be in the feasible region at all times. Two real-world mixed-varible...
In this paper, for the refinement of the database in data mining, by synthetically analyzing the characteristics of the current attribute reduction methods and decision tree algorithm, we put forward formalized description model of rule knowledge, and establish a kind of attribute reduction method (BD-RED) of decision tree by using similarity between rules families. Further, we discuss the construction...
The digital image acquisition and processing technology already mature also in domains and so on visual communication obtains day by day. However, the image acquisition and processing technology had many kinds, for example white balance processing and image denoising methods. The traditional image acquisition and processing systems are implemented using software by the PC or DSP chip, and sometimes...
Bot nicknames within one IRC-based botnet must have uniform structure, because they are generated by the same bot fixedly. In this paper, the similarity of nicknames in the same channel is defined by the term dasiachannel distancepsila. And a novel algorithm based on channel distance is proposed to detect IRC-based botnets. The most significant contribution of this algorithm is that it can detect...
The attribute reduction of information system can improve the accuracy of knowledge discovery, machine learning, etc. and it also can improve the efficiency. This paper proposes an attribute testing reduction algorithm, the algorithm can make the information system retain as few as attributes under the condition that maintains the original style, it can not only save much time for the later system...
As a kind of intelligence computation method, evolutionary computation is widely applied and ceaselessly developed. Generally, it is made up of genetic algorithm, evolutionary strategies and evolutionary programming. And genetic algorithm is one of the most common ones, it has the features of easy structure and strong adaptability, achieves great success in many real fields, but it has much shortcomings...
Mining association rule is one of the common forms in data mining, in which the critical problem is to gain the frequent itemsets efficiently. The classical Apriori and AprioriTid algorithm, which are used to construct the frequent itemset, are analyzed in this paper. Author finds out that there too many data due to those items repeatedly saved in the AprioriTid algorithm. On the basis of analysis,...
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.