Có 60+ tài liệu thuộc chủ đề "kiến thức máy tính"
tailieu.vn Xem trực tuyến Tải xuống
Some others define syntactical restrictions (e.g., the “length” of the pattern is below a threshold) and checking them does not need any access to the data. We emphasized that the model is however quite general: beside the itemsets or sequences, L can denote, e.g., the language of partitions over a collection of objects or the language of decision trees on...
tailieu.vn Xem trực tuyến Tải xuống
describe a mining algorithm but rather a pruning technique for non anti-monotonic and non monotonic constraints. Considering a sub-lattice ˚ A of 2 I , the problem is to decide whether this sub-lattice can be pruned. A sub-lattice is characterized by its maximal element M and its minimal element m, i.e., the sub-lattice is the collection of all itemsets S...
tailieu.vn Xem trực tuyến Tải xuống
The following paragraphs present two algorithms for incorporating link information into search engines: PageRank (Page et al., 1998) and Kleinberg’s Hubs and Authorities (Kleinberg, 1999).. The PageRank algorithm takes a set of interconnected pages and calculates a score for each. Similarly, a pages that is pointed to by numerous other marginally important pages is probably itself important. A more formal...
tailieu.vn Xem trực tuyến Tải xuống
A Review of Evolutionary Algorithms for Data Mining. The motivation for applying EAs to data mining is that they are robust, adaptive search techniques that perform a global search in the solution space.. The paradigm of Evolutionary Algorithms (EAs) consists of stochastic search algo- rithms inspired by the process of neo-Darwinian evolution (Back et al. In essence, the motivation for...
tailieu.vn Xem trực tuyến Tải xuống
Freitas 2006), and comprehensibility is usually evaluated by a measure of the syntactic simplicity of the classifier, say the size of the rule set. The latter can be measured in an objective manner, for instance, by simply counting the total number of rule conditions in the rule set represented by an individual.. The basic idea of an interactive fitness function...
tailieu.vn Xem trực tuyến Tải xuống
The conventional approach to cope with such multi-objective optimization problems using evolutionary algorithms is to convert the problem into a single- optimization problem. For instance, in the above example of two-objective attribute selection, the fitness function could be defined as, say: “2/3 classification error + 1/3 Num- ber of selected attributes”.. This can be done by using a multi-objective EA,...
tailieu.vn Xem trực tuyến Tải xuống
20.1 Introduction. The mechanism that generates reward signals and introduces new states is re- ferred to as the dynamics of the environment. However as the agent interacts with the environment and observes the actual consequences of its decisions, it can gradually adapt its behav- ior accordingly. Through learning the agent chooses actions according to a policy. Typically the objective of...
tailieu.vn Xem trực tuyến Tải xuống
In order to achieve good behavior, the agent must explore its environment. While exploring, some of the choices may be poor ones, which may lead to severe costs. In such cases, it is more appropriate to train the agent on a computer-simulated model of the en- vironment. RL methods have been used to solve a variety of problems in a...
tailieu.vn Xem trực tuyến Tải xuống
The popularity of neural networks is due to their powerful modeling capability for pattern recognition. Several important characteristics of neural networks make them suitable and valuable for data mining. First, as opposed to the traditional model- based methods, neural networks do not require several unrealistic a priori assump- tions about the underlying data generating process and specific model structures.. Rather,...
tailieu.vn Xem trực tuyến Tải xuống
How many and what variables to use in the input layer will directly affect the performance of neural network in both in-sample fitting and out-of-sample prediction.. The neural network parameters are estimated with the training sample, while the performance of the model is monitored and evaluated with the validation sample.. Model selection can also be done with all of the...
tailieu.vn Xem trực tuyến Tải xuống
(2006), Identifying significant predictors of injury severity in traffic accidents using a series of artificial neural networks Accident Analysis and Prevention . IEEE Transactions on Neural Networks . (2001), An object-oriented neural network approach to short-term traffic forecasting.. European Journal of Operation Research . (2006), Time series sales forecasting for short shelf-life food products based on artificial neural networks and...
tailieu.vn Xem trực tuyến Tải xuống
22.4.2 Binary Relation (Granulation. 22.4.3 Fuzzy Binary Granulations (Fuzzy Binary Relations). 22.5 Non-partition Application - Chinese Wall Security Policy Model. 22.5.1 Simple Chinese Wall Security Policy. 22.6 Knowledge Representations. 22.6.1 Relational Tables and Partitions. id 1 , id 2. id 1 , id 2 , id 3. id 4 , id 5. id 6 , id 7 , id 8...
tailieu.vn Xem trực tuyến Tải xuống
ID-1 ID-2 ID-3 ID-4 ID-5 ID-6 ID-7 ID-8 ID-9. W1 W2 W3 W4 ID-4 ID-5. b) Children of the second child W 3 = {id 4 , id 5. c) Children of the third child: W 4 = {id 6 , id 7 , id 8 .id 9. 22.7.4 Topological tree. We will combine two trees in Figure 22.1 into...
tailieu.vn Xem trực tuyến Tải xuống
The major hurdle in this task is that the functioning of the brain is much less understood. The most important characteristic of this information age is the abundance of data. Advances in computer technology, in particular the Internet, have led to what some people call “data explosion”: the amount of data available to any person has increased so much that...
tailieu.vn Xem trực tuyến Tải xuống
In case of fuzzy clustering, a pattern may belong to all the classes with a certain fuzzy membership grade (Jain et al., 1999).. X i − m i 2 (23.13). Each pattern in the data set is then assigned to the closest cluster-centre. Centroids are updated by using the mean of the associated patterns. In the c-medoids algorithm (Kaufman and...
tailieu.vn Xem trực tuyến Tải xuống
The quality of the partition yielded by such a particle can be judged by an appropriate cluster validity index.. However, if it is found that no flag could be set to one in a particle (all activation threshholds are smaller than 0.5), we randomly select 2 thresholds and re-initialize them to a random value between 0.5 and 1.0. Thus the...
tailieu.vn Xem trực tuyến Tải xuống
Optimization and Operations Research, Lecture Notes in Economics and Mathematical Systems, Berlin, Springer, vol.157, pp. IEEE Eng Med Biol, 13, pp.730742.. The particle swarm - explosion, stability, and convergence in a multidimensional complex space, In IEEE Transactions on Evolutionary Computation pp. Das S, Abraham A, and Konar A (2008) Automatic Kernel Clustering with Multi-Elitist Particle Swarm Optimization Algorithm, Pattern Recognition...
tailieu.vn Xem trực tuyến Tải xuống
The UR-ID3 algorithm (Maher and Clair, 1993)) starts by building a strict decision tree, and subsequently fuzzifies the conditions of the tree. However, the tree, which is the first step, is only used to propose fuzzy sets of the continuous domains (using the generated thresholds). This approach combines tree-growing and pruning, to determine the struc- ture of the soft decision...
tailieu.vn Xem trực tuyến Tải xuống
and Lavi I., Space Decomposition In Data Mining: A Clustering Ap- proach, Proceedings of the 14th International Symposium On Methodologies For Intel- ligent Systems, Maebashi, Japan, Lecture Notes in Computer Science, Springer-Verlag, 2003, pp. and Maimon, O., Clustering methods, Data Mining and Knowledge Discovery Handbook, pp. and Maimon, O., Data mining for improving the quality of manufacturing: a feature set...
tailieu.vn Xem trực tuyến Tải xuống
The estimates of the β ’s are given (in matrix form) by ˆ β =(X t X. Machine learning assumes that the given data (x i ,y i. min f ∈F Ψ(y− f (x))d p(x,y) (25.4) when the density function p(x,y) is unknown but a random independent sample of (x i ,y i ) is given. (y − f (x))...