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.
Fuzz used the concept of black-box testing, is critical to an auto vulnerability mining method, there is blindness in this method. This paper presents a semi-automation model of vulnerability mining based on local fuzz with data stream control and hidden debug technology, the practice shows us that this algorithm makes the fuzz much faster and correct.
Decision tree, as an important classification algorithm in data mining, has been successfully applied in many fields. In this paper, based on the analysis of the essential characteristics of decision tree algorithm, we give a leaf criterion for multi-decision values of decision attribute, and establish a mathematical model for the selection for expanded attributes; also we give a concrete model based...
With the wide application of GIS to all kinds of fields, and developing of the technique of data mining and spatial data collection, the technique of data mining in spatial database-spatial data mining is coming out. In order to satisfy the people's demand for the interesting and potentially useful knowledge from the spatial database, this thesis used a wide using spatial clustering algorithm: k-means...
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...
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 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...
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.