• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 28
  • 14
  • 9
  • Tagged with
  • 117
  • 22
  • 19
  • 16
  • 7
  • 6
  • 6
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • 5
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.

Scaling-up reinforcement learning using parallelization and symbolic planning

Grounds, Matthew Jon January 2007 (has links)
No description available.

Automatically evolving rule induction algorithms with grammar-based genetic programming

Pappa, Gisele Lobo January 2007 (has links)
In the last 30 years, research in the field of rule induction algorithms produced a large number of algorithms. However, these algorithms are usually obtained from the combination of a basic rule induction algorithm (typically following the sequential covering approach) with new evaluation functions, pruning methods and stopping criteria for refining or producing rules, generating many "new" and more sophisticated sequential covering algorithms. We cannot deny that these attempts to improve the basic sequential covering ~approach have succeeded. Hence, if manually changing these major components of rule induction algorithms can result in new, significantly better ones, why not to automate this process to make it more cost-effective? This is the core idea of this work: to automate the process of designing rule induction algorithms by means of grammar-based genetic programming. Grammar-based Genetic Programming (GGP) is a special type of evolutionary algorithm used to automatically evolve computer programs. The most interesting feature of this type of algorithm is that it incorporates a grammar into its search mechanism, which expresses prior knowledge about the problem being solved. Since we have a lot of previous knowledge about how humans design rule induction algorithms, this type of algorithm is intuitively a suitable tool to automatically evolve rule induction algorithms. The grammar given to the proposed GGP system includes knowledge about how humans- design rule induction algorithms, and also presents some new elements which could work in rule induction algorithms, but to the best of our knowledge were not previously tested. The GG P system aims to evolve rule induction algorithms under two different frameworks, as follows. In the first framework, the GGP is used to evolve robust rule induction algorithms, i.e., algorithms which were designed to be applied to virtually any classification data set, like a manually-designed rule induction algorithm. In the second framework, the GGP is applied to evolve rule induction algorithms tailored to a specific application XVI domain, i.e., rule induction algorithms tailored to a single data set. Note that the latter framework is hardly feasible on a hard scale in the case of conventional, manually-designed algorithms, since the number of classification data sets greatly outnumbers the number of rule induction algorithms designers. However, it is clearly feasible on a large scale when using the proposed system, which automates the process of rule induction algorithm design and implementation. Overall, extensive computational experiments with 20 VCI data sets and 5 bioinformatics data sets showed that effective rule induction algorithms can be automatically generated using the GGP in both frameworks. Moreover, the automatically evolved rule induction algorithms were shown to be competitive with (and overall slightly better than) four well-known manually designed rule induction algorithms when comparing their predictive accuracies. The proposed GGP system was also compared to a grammar-based hillclimbing system, and experimental results showed that the GGP system is a more effective method to evolve rule induction algorithms than the grammar-based hillclimbing method. At last, a multi-objective version of the GGP (based on the concept of Pareto dominance) was also proposed, and experiments were performed to evolve robust rule induction algorithms which generate both accurate and simple models. The results showed that in most of the cases the GGP system can produce rule induction algorithms which are competitive in predictive accuracy to wellknown human-designed rule induction algorithms, but generate simpler classification modes - i.e., smaller rule sets, intuitively easier to be interpreted by the user.

Mixability and predictive complexity

Viyuygin, Mikhail January 2004 (has links)
No description available.

Transductive algorithms for regression estimation with confidence in the typicalness framework

Melluish, Thomas January 2005 (has links)
No description available.

Algorithmic theory of randomness and its applications

Nouretdinov, Ilia January 2003 (has links)
No description available.

Experimental design techniques in evolutionary algorithms

Chan, Kit Yan January 2006 (has links)
No description available.

Machine learning techniques for probability forecasting and their practical evaluations

Lindsay, David George January 2007 (has links)
No description available.

Combining multiple classifiers for text categorization using the Dempster-Shafer theory of evidence

Bi, Yaxin January 2005 (has links)
No description available.

Ensemble meta-learning for regression

Rooney, Niall January 2008 (has links)
No description available.

Non-rigid motion behaviour learning : a spectral and graphical approach

Wang, Hongfang January 2007 (has links)
No description available.

Page generated in 0.0135 seconds