ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
Filter
  • Articles  (91)
  • 2000-2004  (85)
  • 1975-1979  (6)
  • 1940-1944
  • Computer Science  (91)
Collection
  • Articles  (91)
Years
Year
Journal
  • 1
    Publication Date: 2004-03-16
    Description: 〈br /〉〈span class="detail_caption"〉Notes: 〈/span〉Alatalo, R V -- Aragon, S -- Aviles, J M -- Barbosa, A -- Gomes, C Bessa -- Cadee, N -- Christe, P -- Cuervo, J J -- Diaz, M -- Erritzoe, J -- Galeotti, P -- Garamszegi, L Z -- Gil, D -- Gontard-Danek, M -- Legendre, S -- Martin, T E -- Martinez, J -- Martin-Vivaldi, M -- Martinez, J G -- Merino, S -- Moreno, J -- Mousseau, Tim -- Ninni, P -- Petrie, M -- Pulido, F -- Rubolini, D -- Saino, N -- Soler, J J -- Soler, M -- Spottiswoode, C -- Szep, T -- Thornhill, R -- Zamora, C -- Sacchi, Roberto -- New York, N.Y. -- Science. 2004 Mar 12;303(5664):1612.〈br /〉〈span class="detail_caption"〉Record origin:〈/span〉 〈a href="http://www.ncbi.nlm.nih.gov/pubmed/15016981" target="_blank"〉PubMed〈/a〉
    Keywords: *Ecology ; Publishing ; *Scientific Misconduct
    Print ISSN: 0036-8075
    Electronic ISSN: 1095-9203
    Topics: Biology , Chemistry and Pharmacology , Computer Science , Medicine , Natural Sciences in General , Physics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 2003-10-31
    Print ISSN: 1367-4803
    Electronic ISSN: 1460-2059
    Topics: Biology , Computer Science , Medicine
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Publication Date: 2004-03-12
    Print ISSN: 0036-8075
    Electronic ISSN: 1095-9203
    Topics: Biology , Chemistry and Pharmacology , Computer Science , Medicine , Natural Sciences in General , Physics
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Oxford, UK and Boston, USA : Blackwell Publishers Ltd
    Computational intelligence 16 (2000), S. 0 
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: The basic nearest-neighbor rule generalizes well in many domains but has several shortcomings, including inappropriate distance functions, large storage requirements, slow execution time, sensitivity to noise, and an inability to adjust its decision boundaries after storing the training data. This paper proposes methods for overcoming each of these weaknesses and combines the methods into a comprehensive learning system called the Integrated Decremental Instance-Based Learning Algorithm (IDIBL) that seeks to reduce storage, improve execution speed, and increase generalization accuracy, when compared to the basic nearest neighbor algorithm and other learning models. IDIBL tunes its own parameters using a new measure of fitness that combines confidence and cross-validation accuracy in order to avoid discretization problems with more traditional leave-one-out cross-validation. In our experiments IDIBL achieves higher generalization accuracy than other less comprehensive instance-based learning algorithms, while requiring less than one-fourth the storage of the nearest neighbor algorithm and improving execution speed by a corresponding factor. In experiments on twenty-one data sets, IDIBL also achieves higher generalization accuracy than that reported for sixteen major machine learning and neural network models.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Bingley : Emerald
    Kybernetes 32 (2003), S. 653-657 
    ISSN: 0368-492X
    Source: Emerald Fulltext Archive Database 1994-2005
    Topics: Computer Science
    Notes: Addresses how the life sciences have concentrated on the pathology of aging while ignoring the biocultural aspects of health in the process of growing older. Argues that growing older is a dynamic cognitive, biological and cultural coauthoring of health rather than a hopeless unfolding of progressive pathology. Proposes that this fragmented concept of aging precludes operationalizing and understanding the cultural markers that affect longevity. These cultural milestones, or biocultural portals include middle age markers, retirement markers, perceived wisdom, sexuality, status in the community, transcendental beliefs, sense of empowerment vs helplessness and any other biocultural phase in human development. Suggests that the biocultural portals define and trigger the phase transitions of life as well as influence how they are accommodated. For example, the markers for middle age established by a culture, strongly influence the cognitive and biological expectations for the second half of life.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 29 (2000), S. 47-78 
    ISSN: 1573-0409
    Keywords: autonomous intelligent systems ; embedded machine learning ; planning and execution ; reinforcement learning ; theory formation ; theory revision ; unsupervised machine learning
    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 Agents (hardware or software) that act autonomously in an environment have to be able to integrate three basic behaviors: planning, execution, and learning. This integration is mandatory when the agent has no knowledge about how its actions can affect the environment, how the environment reacts to its actions, or, when the agent does not receive as an explicit input, the goals it must achieve. Without an “a priori” theory, autonomous agents should be able to self-propose goals, set-up plans for achieving the goals according to previously learned models of the agent and the environment, and learn those models from past experiences of successful and failed executions of plans. Planning involves selecting a goal to reach and computing a set of actions that will allow the autonomous agent to achieve the goal. Execution deals with the interaction with the environment by application of planned actions, observation of resulting perceptions, and control of successful achievement of the goals. Learning is needed to predict the reactions of the environment to the agent actions, thus guiding the agent to achieve its goals more efficiently. In this context, most of the learning systems applied to problem solving have been used to learn control knowledge for guiding the search for a plan, but few systems have focused on the acquisition of planning operator descriptions. As an example, currently, one of the most used techniques for the integration of (a way of) planning, execution, and learning is reinforcement learning. However, they usually do not consider the representation of action descriptions, so they cannot reason in terms of goals and ways of achieving those goals. In this paper, we present an integrated architecture, lope, that learns operator definitions, plans using those operators, and executes the plans for modifying the acquired operators. The resulting system is domain-independent, and we have performed experiments in a robotic framework. The results clearly show that the integrated planning, learning, and executing system outperforms the basic planner in that domain.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 38 (2000), S. 257-286 
    ISSN: 0885-6125
    Keywords: instance-based learning ; nearest neighbor ; instance reduction ; pruning ; classification
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Instance-based learning algorithms are often faced with the problem of deciding which instances to store for use during generalization. Storing too many instances can result in large memory requirements and slow execution speed, and can cause an oversensitivity to noise. This paper has two main purposes. First, it provides a survey of existing algorithms used to reduce storage requirements in instance-based learning algorithms and other exemplar-based algorithms. Second, it proposes six additional reduction algorithms called DROP1–DROP5 and DEL (three of which were first described in Wilson & Martinez, 1997c, as RT1–RT3) that can be used to remove instances from the concept description. These algorithms and 10 algorithms from the survey are compared on 31 classification tasks. Of those algorithms that provide substantial storage reduction, the DROP algorithms have the highest average generalization accuracy in these experiments, especially in the presence of uniform class noise.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    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 ...
  • 9
    ISSN: 1573-2894
    Keywords: nonlinear programming ; augmented Lagrangians ; numerical methods
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract An Augmented Lagrangian algorithm that uses Gauss-Newton approximations of the Hessian at each inner iteration is introduced and tested using a family of Hard-Spheres problems. The Gauss-Newton model convexifies the quadratic approximations of the Augmented Lagrangian function thus increasing the efficiency of the iterative quadratic solver. The resulting method is considerably more efficient than the corresponding algorithm that uses true Hessians. A comparative study using the well-known package LANCELOT is presented.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Publication Date: 2001-04-01
    Print ISSN: 0031-3203
    Electronic ISSN: 1873-5142
    Topics: Computer Science
    Published by Elsevier
    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...