• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2379
  • 1213
  • 184
  • 153
  • 119
  • 59
  • 26
  • 24
  • 24
  • 23
  • 21
  • 19
  • 19
  • 18
  • 17
  • Tagged with
  • 5263
  • 5263
  • 1723
  • 1704
  • 1437
  • 1244
  • 1188
  • 1106
  • 970
  • 690
  • 682
  • 631
  • 591
  • 506
  • 491
  • 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.
1

Connectionist rule processing using recursive auto-associative memory

St Aubyn, Michael January 2001 (has links)
No description available.
2

Neural models of temporal sequences

Taylor, Neill Richard January 1998 (has links)
No description available.
3

Analysing rounding data using radial basis function neural networks model

Triastuti Sugiyarto, Endang January 2007 (has links)
Unspecified counting practices used in a data collection may create rounding to certain ‘based’ number that can have serious consequences on data quality. Statistical methods for analysing missing data are commonly used to deal with the issue but it could actually aggravate the problem. Rounded data are not missing data, instead some observations were just systematically lumped to certain based numbers reflecting the rounding process or counting behaviour. A new method to analyse rounded data would therefore be academically valuable. The neural network model developed in this study fills the gap and serves the purpose by complementing and enhancing the conventional statistical methods. The model detects, analyses, and quantifies the existence of periodic structures in a data set because of rounding. The robustness of the model is examined using simulated data sets containing specific rounding numbers of different levels. The model is also subjected to theoretical and numerical tests to confirm its validity before being used on real applications. Overall, the model performs very well making it suitable for many applications. The assessment results show the importance of using the right best fit in rounding detection. The detection power and cut-off point estimation also depend on data distribution and rounding based numbers. Detecting rounding of prime numbers is easier than non-prime numbers due to the unique characteristics of the former. The bigger the number, the easier is the detection. This is in a complete contrast with non-prime numbers, where the bigger the number, the more will be the “factor” numbers distracting rounding detection. Using uniform best fit on uniform data produces the best result and lowest cut-off point. The consequence of using a wrong best fit on uniform data is however also the worst. The model performs best on data containing 10-40% rounding levels as less or more rounding levels produce unclear rounding pattern or distort the rounding detection, respectively. The modulo-test method also suffers the same problem. Real data applications on religious census data confirms the modulo-test finding that the data contains rounding base 5, while applications on cigarettes smoked and alcohol consumed data show good detection results. The cigarettes data seem to contain rounding base 5, while alcohol consumption data indicate no rounding patterns that may be attributed to the ways the two data were collected. The modelling applications can be extended to other areas in which rounding is common and can have significant consequences. The modelling development can he refined to include data-smoothing process and to make it user friendly as an online modelling tool. This will maximize the model’s potential use
4

Neural network training for modelling and control

McLoone, Sean Francis January 1996 (has links)
No description available.
5

Problem solving with optimization networks

Gee, Andrew Howard January 1993 (has links)
No description available.
6

Optical processing of neural networks

Neil, Mark Andrew Aquilla January 1989 (has links)
No description available.
7

Neural implementations of canonical correlation analysis

Lai, Pei Ling January 2000 (has links)
No description available.
8

On the theory of generalization and self-structuring in linearly weighted connectionist networks

Holden, Sean Barry January 1993 (has links)
No description available.
9

An information-theoretic approach to unsupervised connectionist models

Plumbley, Mark David January 1991 (has links)
No description available.
10

On the representation of temporal data for connectionist word recognition

Lucke, Helmut January 1991 (has links)
No description available.

Page generated in 0.039 seconds