ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (30)
  • neural networks  (30)
  • Springer  (30)
  • American Geophysical Union (AGU)
  • Annual Reviews
  • Oxford University Press
  • 2000-2004  (30)
  • 1980-1984
  • 1935-1939
  • Computer Science  (28)
  • Economics  (2)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 99 (2000), S. 385-401 
    ISSN: 1572-9338
    Keywords: neural networks ; supervised learning ; constrained optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Conventional supervised learning in neural networks is carried out by performing unconstrained minimization of a suitably defined cost function. This approach has certain drawbacks, which can be overcome by incorporating additional knowledge in the training formalism. In this paper, two types of such additional knowledge are examined: Network specific knowledge (associated with the neural network irrespectively of the problem whose solution is sought) or problem specific knowledge (which helps to solve a specific learning task). A constrained optimization framework is introduced for incorporating these types of knowledge into the learning formalism. We present three examples of improvement in the learning behaviour of neural networks using additional knowledge in the context of our constrained optimization framework. The two network specific examples are designed to improve convergence and learning speed in the broad class of feedforward networks, while the third problem specific example is related to the efficient factorization of 2-D polynomials using suitably constructed sigma-pi networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 97 (2000), S. 287-311 
    ISSN: 1572-9338
    Keywords: genetic algorithms ; indicator selection ; neural networks ; early warning ; pattern recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Recognition of preconflict situations has a powerful potential for early warning of violent political conflicts. This paper focuses on the design and application of artificial neural networks as classifiers of preconflict situations. Achieving a desired level of performance of the neural network relies on the appropriate construction of recognition space (selection of indicators) and the choice of network architecture. A fast and effective method for the design of reliable neural recognition systems is described. It is based on genetic algorithm techniques and optimizes both the configuration of input space and the network parameters. The implementation of the methodology provides for increased performance of the classifier in terms of accuracy, generalization capacity, computational and data requirements.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Minds and machines 10 (2000), S. 361-380 
    ISSN: 1572-8641
    Keywords: connectionism ; mental representation ; neural networks ; causation ; explanation philosophy of mind
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Philosophy
    Notes: Abstract In this paper I defend the propriety of explaining the behavior of distributed connectionist networks by appeal to selected data stored therein. In particular, I argue that if there is a problem with such explanations, it is a consequence of the fact that information storage in networks is superpositional, and not because it is distributed. I then develop a “proto-account” of causation for networks, based on an account of Andy Clark's, that shows even superpositionality does not undermine information-based explanation. Finally, I argue that the resulting explanations are genuinely informative and not vacuous.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 27 (2000), S. 305-319 
    ISSN: 1573-0409
    Keywords: control ; fuzzy logic ; neural networks ; robotics
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this paper, a neuro-fuzzy technique has been used to steer a mobile robot. The neuro-fuzzy approach provides a good way to capture the information given by a human. In this manner, it has been possible to obtain the rules and membership functions automatically whereas a fuzzy approach needs to make a prior definition of the rules and membership functions. In order to apply the neuro-fuzzy strategy, two mobile robots have been developed. However, in this paper only the smallest one has been considered. Similar results are obtained for the biggest one. The results of the approach are satisfactory, avoiding the obstacles when the mobile robot is steered to the target.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 39 (2000), S. 203-242 
    ISSN: 0885-6125
    Keywords: InfoSpiders ; distributed information retrieval ; evolutionary algorithms ; local selection ; internalization ; reinforcement learning ; neural networks ; relevance feedback ; linkage topology ; scalability ; selective query expansion ; adaptive on-line Web agents
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information environments on-line in search of pages relevant to the user, by traversing hyperlinks in an autonomous and intelligent fashion. Each agent adapts to the spatial and temporal regularities of its local context thanks to a combination of machine learning techniques inspired by ecological models: evolutionary adaptation with local selection, reinforcement learning and selective query expansion by internalization of environmental signals, and optional relevance feedback. We evaluate the feasibility and performance of these methods in three domains: a general class of artificial graph environments, a controlled subset of the Web, and (preliminarly) the full Web. Our results suggest that InfoSpiders could take advantage of the starting points provided by search engines, based on global word statistics, and then use linkage topology to guide their search on-line. We show how this approach can complement the current state of the art, especially with respect to the scalability challenge.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Numerical algorithms 25 (2000), S. 241-262 
    ISSN: 1572-9265
    Keywords: approximation ; radial basis functions ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, we study approximation by radial basis functions including Gaussian, multiquadric, and thin plate spline functions, and derive order of approximation under certain conditions. Moreover, neural networks are also constructed by wavelet recovery formula and wavelet frames.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 12 (2000), S. 95-115 
    ISSN: 1573-7497
    Keywords: postal automation ; address reading ; neural networks ; handprinted digit recognition
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this article, we describe the OCR and image processing algorithms used to read destination addresses from non-standard letters (flats) by Siemens postal automation system currently in use by the Deutsche Post AG1. We first describe the sorting machine, its OCR hardware and the sequence of image processing and pattern recognition algorithms needed to solve the difficult task of reading mail addresses, especially handwritten ones. The article concentrates mainly on the two classifiers used to recognize handprinted digits. One of them is a complex time delayed neural network (TDNN) used to classify scaled digit-features. The other classifier extracts the structure of each digit and matches it to a number of prototypes. Different digits represented by the same graph are then discriminated by classifiying some of the features of the digit-graph with small neural networks. We also describe some approaches for the segmentation of the digits in the ZIP code, so that the resulting parts can be processed and evaluated by the classifiers.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 12 (2000), S. 207-215 
    ISSN: 1573-7497
    Keywords: fuzzy logic ; neural networks ; decision systems ; classification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, we combine neural networks with fuzzy logic techniques. We propose a fuzzy-neural network model for pattern recognition. The model consists of three layers. The first layer is an input layer. The second layer maps input features to the corresponding fuzzy membership values, and the third layer implements the inference engine. The learning process consists of two phases. During the first phase weights between the last two layers are updated using the gradient descent procedure, and during the second phase membership functions are updated or tuned. As an illustration the model is used to classify samples from a multispectral satellite image, a data set representing fruits, and Iris data set.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 12 (2000), S. 7-13 
    ISSN: 1573-7497
    Keywords: neural networks ; rule extraction ; knowledge representation ; structured knowledge ; connectionism ; hybrid systems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract As the second part of a special issue on “Neural Networks and Structured Knowledge,” the contributions collected here concentrate on the extraction of knowledge, particularly in the form of rules, from neural networks, and on applications relying on the representation and processing of structured knowledge by neural networks. The transformation of the low-level internal representation in a neural network into higher-level knowledge or information that can be interpreted more easily by humans and integrated with symbol-oriented mechanisms is the subject of the first group of papers. The second group of papers uses specific applications as starting point, and describes approaches based on neural networks for the knowledge representation required to solve crucial tasks in the respective application. The companion first part of the special issue [1] contains papers dealing with representation and reasoning issues on the basis of neural networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    ISSN: 1573-773X
    Keywords: adaptive learning algorithms ; blind signal processing ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Most of the algorithms for blind separation/extraction and independent component analysis (ICA) can not separate mixtures of sources with extremely low kurtosis or colored Gaussian sources. Moreover, to separate mixtures of super- and sub-Gaussian signals, it is necessary to use adaptive (time-variable) or switching nonlinearities which are controlled via computationally intensive measures, such as estimation of the sign of kurtosis of extracted signals. In this paper, we develop a very simple neural network model and an efficient on-line adaptive algorithm that sequentially extract temporally correlated sources with arbitrary distributions, including colored Gaussian sources and sources with extremely low values (or even zero) of kurtosis. The validity and performance of the algorithm have been confirmed by extensive computer simulation experiments.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 12 (2000), S. 225-237 
    ISSN: 1573-773X
    Keywords: approximator ; bagging ; boosting ; ensemble of classifiers ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Several methods (e.g., Bagging, Boosting) of constructing and combining an ensemble of classifiers have recently been shown capable of improving accuracy of a class of commonly used classifiers (e.g., decision trees, neural networks). The accuracy gain achieved, however, is at the expense of a higher requirement for storage and computation. This storage and computation overhead can decrease the utility of these methods when applied to real-world situations. In this Letter, we propose a learning approach which allows a single neural network to approximate a given ensemble of classifiers. Experiments on a large number of real-world data sets show that this approach can substantially save storage and computation while still maintaining accuracy similar to that of the entire ensemble.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 11 (2000), S. 59-78 
    ISSN: 1573-773X
    Keywords: basis functions ; continuous function approximation ; competitive learning ; interpolation ; neural networks ; on-line learning ; self-organizing map
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper introduces CSOM, a continuous version of the Self-Organizing Map(SOM). The CSOM network generates maps similar to those created with theoriginal SOM algorithm but, due to the continuous nature of the mapping,CSOM outperforms the SOM on function approximation tasks. CSOM integratesself-organization and smooth prediction into a single process. This is adeparture from previous work that required two training phases, one toself-organize a map using the SOM algorithm, and another to learn a smoothapproximation of a function. System performance is illustrated with threeexamples.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 12 (2000), S. 115-128 
    ISSN: 1573-773X
    Keywords: evolutionary algorithms ; generalization ; learning ; neural networks ; optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper proposes a new version of a method (G-Prop, genetic backpropagation) that attempts to solve the problem of finding appropriate initial weights and learning parameters for a single hidden layer Multilayer Perceptron (MLP) by combining an evolutionary algorithm (EA) and backpropagation (BP). The EA selects the MLP initial weights, the learning rate and changes the number of neurons in the hidden layer through the application of specific genetic operators, one of which is BP training. The EA works on the initial weights and structure of the MLP, which is then trained using QuickProp; thus G-Prop combines the advantages of the global search performed by the EA over the MLP parameter space and the local search of the BP algorithm. The application of the G-Prop algorithm to several real-world and benchmark problems shows that MLPs evolved using G-Prop are smaller and achieve a higher level of generalization than other perceptron training algorithms, such as QuickPropagation or RPROP, and other evolutive algorithms. It also shows some improvement over previous versions of the algorithm.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 14 (2000), S. 485-502 
    ISSN: 1573-7462
    Keywords: churn prediction ; neural networks ; decision trees
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We describe CHAMP (CHurn Analysis, Modeling, andPrediction), an automated system for modeling cellularsubscriber churn that is predicting which customerswill discontinue cellular phone service. We describevarious issues related to developing and deployingthis system including automating data access from aremote data warehouse, preprocessing, featureselection, model validation, and optimization toreflect business tradeoffs. Using data from GTE'sdata warehouse for cellular phone customers, CHAMP iscapable of developing churn models customized byregion for over one hundred GTE cellular phone marketstotaling over 5 million customers. Every month churnfactors are identified for each geographic region andmodels are updated to generate churn scores predictingwho is likely to churn in the short term. Learningmethods such as decision trees and genetic algorithmsare used for feature selection and a cascade neuralnetwork is used for predicting churn scores. Inaddition to producing churn scores, CHAMP alsoproduces qualitative results in the form of rules andcomparison of market trends that are disseminatedthrough a web based interface.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Artificial intelligence review 14 (2000), S. 447-484 
    ISSN: 1573-7462
    Keywords: data mining ; neural networks ; protein structure ; protein disorder prediction ; protein databases
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Although an ordered 3D structure is generally considered to be anecessary pre-condition for protein functionality, there are disorderedcounter examples found to have biological activity. The objectives ofour data mining project are: (1) to generalize from the limitedset of counter examples and then apply this knowledge to large databases of amino acid sequence in order to estimate commonness ofdisordered protein regions in nature, and (2) to determine whether thereare different types of protein disorder. For general disorderestimation, a neural network based predictor was designed and tested ondata built from several public domain data banks through a nontrivialsearch, statistical analysis and data dimensionality reduction. Inaddition, predictors for identification of family-specific disorder weredeveloped by extracting knowledge from databases generated throughmultiple sequence alignments of a known disordered sequence to otherhighly related proteins. Family-specific predictors were also integratedto test quality of general protein disorder identification from suchhybrid prediction systems. Out-of-sample cross validation performance ofseveral predictors was computed first, followed by tests on an unrelateddatabase of proteins with long disordered regions, and the applicationof few selected predictors to two large protein data banks:Nrl_3D, currently containing more than 10,000 protein fragmentsof known 3D structure, and Swiss Protein, having almost 60,000 proteinsequences. The obtained results provide evidence that long disorderedregions are common in nature, with an estimate that 11% of allthe residues in the Swiss Protein data bank belong to disordered regionsof length 40 or greater. The hypothesis that different protein disordertypes exist is supported by high specificity/low sensitivity resultsof two family-specific predictors, by hybrid systems outperforminggeneral models on a two-family test, and by existence of significantgaps in Swiss Protein vs. Nrl_3D disorder frequency estimates forboth families. These findings prompt the need for a revision in thecurrent understanding of protein structure and function, as well as forthe developing of improved disorder predictors that should haveimportant uses in biotechnology applications.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 13 (2000), S. 205-213 
    ISSN: 1573-7497
    Keywords: air traffic control ; collision avoidance ; neural networks ; genetic algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract As air traffic keeps increasing, many research programs focus on collision avoidance techniques. For short or medium term avoidance, new headings have to be computed almost on the spot, and feed forward neural nets are susceptible to find solutions in a much shorter amount of time than classical avoidance algorithms (A *, stochastic optimization, etc.) In this article, we show that a neural network can be built with unsupervised learning to compute nearly optimal trajectories to solve two aircraft conflicts with the highest reliability, while computing headings in a few milliseconds.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 11 (2000), S. 139-151 
    ISSN: 1573-773X
    Keywords: competitive learning ; neural networks ; local minimum ; self-creating network ; stability-and-plasticity dilemma ; vector quantization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents a novel self-creating neural network scheme which employs two resource counters to record network learning activity. The proposed scheme not only achieves the biologically plausible learning property, but it also harmonizes equi-error and equi-probable criteria. The training process is smooth and incremental: it not only avoids the stability-and-plasticity dilemma, but also overcomes the dead-node problem and the deficiency of local minimum. Comparison studies on learning vector quantization involving stationary and non-stationary, structured and non-structured inputs demonstrate that the proposed scheme outperforms other competitive networks in terms of quantization error, learning speed, and codeword search efficiency.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 11 (2000), S. 185-195 
    ISSN: 1573-773X
    Keywords: Bayesian inference ; ill-posed problems ; neural networks ; RBF ; regularization techniques ; smoothing functions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Regularisation is a well-known technique for working with ill-posed and ill-conditioned problems that have been explored in a variety of different areas, including Bayesian inference, functional analysis, optimisation, numerical analysis and connectionist systems. In this paper we present the equivalence between the Bayesian approach to the regularisation theory and the Tikhonov regularisation into the function approximation theory framework, when radial basis functions networks are employed. This equivalence can be used to avoid expensive calculations when regularisation techniques are employed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 11 (2000), S. 219-228 
    ISSN: 1573-773X
    Keywords: hybrid modeling ; genetic algorithms ; feature selection ; methanol synthesis ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A Hybrid modeling approach, combining an analytical model with a radial basis function neural network is introduced in this paper. The modeling procedure is combined with genetic algorithm based feature selection designed to select informative variables from the set of available measurements. By only using informative inputs, the model's generalization ability can be enhanced. The approach proposed is applied to modeling of the liquid–phase methanol synthesis. It is shown that a hybrid modeling approach exploiting available a priori knowledge and experimental data can considerably outperform a purely analytical approach.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 11 (2000), S. 229-238 
    ISSN: 1573-773X
    Keywords: neural networks ; abdominal surgery ; AAA ; transfusion ; cost ; MSBOS
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Typing and crossmatching blood is a significant cost for most hospitals, regardless of whether the blood is actually transfused. Many hospitals have implemented a Maximum Surgical Blood Order Schedule, MSBOS, to control over-ordering of blood units for surgery. The research presented in this article examines the use of neural networks for predicting the quantity of blood required by individual patients undergoing abdominal surgery (e.g. splenectomy). A comparison is made between the neural network predictions at a particular hospital versus the current MSBOS methodology for ordering surgical blood, by using the crossmatch to transfusion ratio. Results from the neural network transfusion predictions for the abdominal aortic aneurysm (AAA) surgery imply that neural networks can significantly improve the transfusion efficiency of hospitals. However, further examination of neural network capabilities for predicting the transfusion needs of patients undergoing other types of abdominal surgeries indicates that for operations other than the AAA, neural networks tend to under-predict the transfusion requirements of ten percent of the patients. Even if not used to limit over-ordering of blood for surgical transfusions, neural networks may be used as an intelligent decision support system to evaluate the current efficiency of hospital transfusion practices and to indicate beneficial changes to current MSBOS values.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 21
    Electronic Resource
    Electronic Resource
    Springer
    Neural processing letters 11 (2000), S. 39-49 
    ISSN: 1573-773X
    Keywords: functional equations ; functional networks ; learning ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, a minimax method for learning functional networks is presented. The idea of the method is to minimize themaximum absolute error between predicted and observed values. In addition, the invertible functions appearing in the modelare assumed to be linear convex combinations of invertible functions. This guarantees the invertibilityof the resulting approximations. The learning method leads to a linear programming problem and then: (a) the solution isobtained in a finite number of iterations, and (b) the global optimum is attained. The method is illustrated withseveral examples of applications, including the Hénon and Lozi series. The results show that the method outperforms standard least squares direct methods.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 22
    Electronic Resource
    Electronic Resource
    Springer
    Information retrieval 3 (2000), S. 87-103 
    ISSN: 1573-7659
    Keywords: neural networks ; news agent ; recurrent plausibility network ; text classification ; machine learning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The research project AgNeT develops Agents for Neural Text routing in the internet. Unrestricted potentially faulty text messages arrive at a certain delivery point (e.g. email address or world wide web address). These text messages are scanned and then distributed to one of several expert agents according to a certain task criterium. Possible specific scenarios within this framework include the learning of the routing of publication titles or news titles. In this paper we describe extensive experiments for semantic text routing based on classified library titles and newswire titles. This task is challenging since incoming messages may contain constructions which have not been anticipated. Therefore, the contributions of this research are in learning and generalizing neural architectures for the robust interpretation of potentially noisy unrestricted messages. Neural networks were developed and examined for this topic since they support robustness and learning in noisy unrestricted real-world texts. We describe and compare different sets of experiments. The first set of experiments tests a recurrent neural network for the task of library title classification. Then we describe a larger more difficult newswire classification task from information retrieval. The comparison of the examined models demonstrates that techniques from information retrieval integrated into recurrent plausibility networks performed well even under noise and for different corpora.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 23
    ISSN: 1573-6873
    Keywords: neural networks ; modeling ; population density ; orientation tuning ; visual cortex
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Medicine , Physics
    Notes: Abstract We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are grouped into large populations of similar neurons. For each population, we form a probability density that represents the distribution of neurons over all possible states. The populations are coupled via stochastic synapses in which the conductance of a neuron is modulated according to the firing rates of its presynaptic populations. The evolution equation for each of these probability densities is a partial differential-integral equation, which we solve numerically. Results obtained for several example networks are tested against conventional computations for groups of individual neurons. We apply this approach to modeling orientation tuning in the visual cortex. Our population density model is based on the recurrent feedback model of a hypercolumn in cat visual cortex of Somers et al. (1995). We simulate the response to oriented flashed bars. As in the Somers model, a weak orientation bias provided by feed-forward lateral geniculate input is transformed by intracortical circuitry into sharper orientation tuning that is independent of stimulus contrast. The population density approach appears to be a viable method for simulating large neural networks. Its computational efficiency overcomes some of the restrictions imposed by computation time in individual neuron simulations, allowing one to build more complex networks and to explore parameter space more easily. The method produces smooth rate functions with one pass of the stimulus and does not require signal averaging. At the same time, this model captures the dynamics of single-neuron activity that are missed in simple firing-rate models.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 24
    ISSN: 1573-2614
    Keywords: Breath sounds ; respiratory sounds ; intensive care unit ; spectral analysis ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Medicine
    Notes: Abstract Objective.Develop and test methods for representing and classifying breath sounds in an intensive care setting. Methods.Breath sounds were recorded over the bronchial regions of the chest. The breath sounds were represented by their averaged power spectral density, summed into feature vectors across the frequency spectrum from 0 to 800 Hertz. The sounds were segmented by individual breath and each breath was divided into inspiratory and expiratory segments. Sounds were classified as normal or abnormal. Different back-propagation neural network configurations were evaluated. The number of input features, hidden units, and hidden layers were varied.Results.2127 individual breath sounds from the ICU patients and 321breaths from training tapes were obtained. Best overall classification rate for the ICU breath sounds was 73% with 62% sensitivity and 85% specificity. Best overall classification rate for the training tapes was 91% with 87%sensitivity and 95% specificity. Conclusions.Long term monitoring of lung sounds is not feasible unless several barriers can be overcome. Several choices in signal representation and neural network design greatly improved the classification rates of breath sounds. The analysis of transmitted sounds from the trachea to the lung is suggested as an area for future study.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 25
    Electronic Resource
    Electronic Resource
    Springer
    Statistics and computing 10 (2000), S. 289-297 
    ISSN: 1573-1375
    Keywords: leave-one-out error rates ; linear discriminant functions ; logistic discrimination ; mixed integer programming classification ; neural networks ; pseudo-likelihood ; tree-based classifiers
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The location model is a familiar basis for discriminant analysis of mixtures of categorical and continuous variables. Its usual implementation involves second-order smoothing, using multivariate regression for the continuous variables and log-linear models for the categorical variables. In spite of the smoothing, these procedures still require many parameters to be estimated and this in turn restricts the categorical variables to a small number if implementation is to be feasible. In this paper we propose non-parametric smoothing procedures for both parts of the model. The number of parameters to be estimated is dramatically reduced and the range of applicability thereby greatly increased. The methods are illustrated on several data sets, and the performances are compared with a range of other popular discrimination techniques. The proposed method compares very favourably with all its competitors.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 26
    ISSN: 1573-7497
    Keywords: genetic algorithm/neural network hybrid ; genetic algorithms ; neural networks ; genetic learning ; aflatoxin prediction
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Aflatoxin contamination in peanut crops is a problem of significant health and financial importance. Predicting aflatoxin levels prior to crop harvest is useful for minimizing the impact of a contaminated crop and is the goal of our research. Backpropagation neural networks have been used to model problems of this type, however development of networks poses the complex problem of setting values for architectural features and backpropagation parameters. Genetic algorithms have been used in other studies to determine parameters for backpropagation neural networks. This paper describes the development of a genetic algorithm/backpropagation neural network hybrid (GA/BPN) in which a genetic algorithm is used to find architectures and backpropagation parameter values simultaneously for a backpropagation neural network that predicts aflatoxin contamination levels in peanuts based on environmental data. Learning rate, momentum, and number of hidden nodes are the parameters that are set by the genetic algorithm. A three-layer feed-forward network with logistic activation functions is used. Inputs to the network are soil temperature, drought duration, crop age, and accumulated heat units. The project showed that the GA/BPN approach automatically finds highly fit parameter sets for backpropagation neural networks for the aflatoxin problem.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 27
    Electronic Resource
    Electronic Resource
    Springer
    Applied intelligence 12 (2000), S. 193-205 
    ISSN: 1573-7497
    Keywords: Elman recurrent networks ; neural networks ; hidden layer ; genetic algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The relationship between the size of the hidden layer in a neural network and performance in a particular domain is currently an open research issue. Often, the number of neurons in the hidden layer is chosen empirically and subsequently fixed for the training of the network. Fixing the size of the hidden layer limits an inherent strength of neural networks—the ability to generalize experiences from one situation to another, to adapt to new situations, and to overcome the “brittleness” often associated with traditional artificial intelligence techniques. This paper proposes an evolutionary algorithm to search for network sizes along with weights and connections between neurons. This research builds upon the neuro-evolution tool SANE, developed by David Moriarty. SANE evolves neurons and networks simultaneously, and is modified in this work in several ways, including varying the hidden layer size, and evolving Elman recurrent neural networks for non-Markovian tasks. These modifications allow the evolution of better performing and more consistent networks, and do so more efficiently and faster. SANE, modified with variable network sizing, learns to play modified casino blackjack and develops a successful card counting strategy. The contributions of this research are up to 8.3% performance increases over fixed hidden layer size models while reducing hidden layer processing time by almost 10%, and a faster, more autonomous approach to the scaling of neuro-evolutionary techniques to solving larger and more difficult problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 28
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous robots 9 (2000), S. 27-39 
    ISSN: 1573-7527
    Keywords: path planning ; real-time planning ; obstacle clearance ; robot manipulators ; nonstationary environment ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this paper, a novel neural network approach to real-time collision-free path planning of robot manipulators in a nonstationary environment is proposed, which is based on a biologically inspired neural network model for dynamic trajectory generation of a point mobile robot. The state space of the proposed neural network is the joint space of the robot manipulators, where the dynamics of each neuron is characterized by a shunting equation or an additive equation. The real-time robot path is planned through the varying neural activity landscape that represents the dynamic environment. The proposed model for robot path planning with safety consideration is capable of planning a real-time “comfortable” path without suffering from the “too close” nor “too far” problems. The model algorithm is computationally efficient. The computational complexity is linearly dependent on the neural network size. The effectiveness and efficiency are demonstrated through simulation studies.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 29
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous robots 9 (2000), S. 151-173 
    ISSN: 1573-7527
    Keywords: gestures ; human robot interaction ; mobile robot navigation ; service robots ; visual template matching ; hidden markov models ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Service robotics is currently a highly active research area in robotics, with enormous societal potential. Since service robots directly interact with people, finding “natural” and easy-to-use user interfaces is of fundamental importance. While past work has predominately focussed on issues such as navigation and manipulation, relatively few robotic systems are equipped with flexible user interfaces that permit controlling the robot by “natural” means. This paper describes a gesture interface for the control of a mobile robot equipped with a manipulator. The interface uses a camera to track a person and recognize gestures involving arm motion. A fast, adaptive tracking algorithm enables the robot to track and follow a person reliably through office environments with changing lighting conditions. Two alternative methods for gesture recognition are compared: a template based approach and a neural network approach. Both are combined with the Viterbi algorithm for the recognition of gestures defined through arm motion (in addition to static arm poses). Results are reported in the context of an interactive clean-up task, where a person guides the robot to specific locations that need to be cleaned and instructs the robot to pick up trash.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 30
    Electronic Resource
    Electronic Resource
    Springer
    Automated software engineering 7 (2000), S. 239-261 
    ISSN: 1573-7535
    Keywords: clustering ; objects ; abstract data types ; neural networks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents a general approach for the identification of objects in procedural programs. The approach is based on neural architectures that perform an unsupervised learning of clusters. We describe two such neural architectures, explain how to use them in identifying objects in software systems and briefly describe a prototype tool, which implements the clustering algorithms. With the aid of several examples, we explain how our approach can identify abstract data types as well as groups of routines which reference a common set of data. The clustering results are compared to the results of many other object identification techniques. Finally, several case studies were performed on existing programs to evaluate the object identification approach. Results concerning two representative programs and their generated clusters are discussed.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...