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  (313)
  • Computer Science  (313)
Collection
  • Articles  (313)
Journal
  • 1
    Publication Date: 2020-10-30
    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
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 16 (1994), S. 161-183 
    ISSN: 0885-6125
    Keywords: Neural networks ; PAC learning ; nonoverlapping ; read-once formula ; learning with queries
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We investigate, within the PAC learning model, the problem of learning nonoverlapping perceptron networks (also known as read-once formulas over a weighted threshold basis). These are loop-free neural nets in which each node has only one outgoing weight. We give a polynomial time algorithm that PAC learns any nonverlapping perceptron network using examples and membership queries. The algorithm is able to identify both the architecture and the weight values necessary to represent the function to be learned. Our results shed some light on the effect of the overlap on the complexity of learning in neural networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 16 (1994), S. 57-86 
    ISSN: 0885-6125
    Keywords: cognitive development ; balance scale ; connectionist learning ; cascade-correlation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We used cascade-correlation to model human cognitive development on a well studied psychological task, the balance scale. In balance scale experiments, the child is asked to predict the outcome of placing certain numbers of equal weights at various distances to the left or right of a fulcrum. Both stage progressions and information salience effects have been found with children on this task. Cascade-correlation is a generative connectionist algorithm that constructs its own network topology as it learns. Cascade-correlation networks provided better fits to these human data than did previous models, whether rule-based or connectionist. The network model was used to generate a variety of novel predictions for psychological research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 21 (1995), S. 151-175 
    ISSN: 0885-6125
    Keywords: domain knowledge ; change of representation ; theory revision ; protein structure prediction ; homology modeling ; amino acid properties
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Predicting the fold, or approximate 3D structure, of a protein from its amino acid sequence is an important problem in biology. The homology modeling approach uses a protein database to identify fold-class relationships by sequence similarity. The main limitation of this method is that some proteins with similar structures appear to have very different sequences, which we call the “hidden-homology problem.” As in other real-world domains for machine learning, this difficulty may be caused by a low-level representation. Learning in such domains can be improved by using domain knowledge to search for representations that better match the inductive bias of a preferred algorithm. In this domain, knowledge of amino acid properties can be used to construct higher-level representations of protein sequences. In one experiment using a 179-protein data set, the accuracy of fold-class prediction was increased from 77.7% to 81.0%. The search results are analyzed to refine the grouping of small residues suggested by Dayhoff. Finally, an extension to the representation incorporates sequential context directly into the representation, which can express finer relationships among the amino acids. The methods developed in this domain are generalized into a framework that suggests several systematic roles for domain knowledge in machine learning. Knowledge may define both a space of alternative representations, as well as a strategy for searching this space. The search results may be summarized to extract feedback for revising the domain knowledge.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 4 (1989), S. 293-336 
    ISSN: 0885-6125
    Keywords: knowledge acquisition ; knowledge engineering ; human–computer interaction ; strategic knowledge ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Strategic knowledge is used by an agent to decide what action to perform next, where actions have consequences external to the agent. This article presents a computer-mediated method for acquiring strategic knowledge. The general knowledge acquisition problem and the special difficulties of acquiring strategic knowledge are analyzed in terms of representation mismatch: the difference between the form in which knowledge is available from the world and the form required for knowledge systems. ASK is an interactive knowledge acquisition tool that elicits strategic knowledge from people in the form of justifications for action choices and generates strategy rules that operationalize and generalize the expert's advice. The basic approach is demonstrated with a human–computer dialog in which ASK acquires strategic knowledge for medical diagnosis and treatment. The rationale for and consequences of specific design decisions in ASK are analyzed, and the scope of applicability and limitations of the approach are assessed. The paper concludes by discussing the contribution of knowledge representation to automated knowledge acquisition.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 16 (1994), S. 57-86 
    ISSN: 0885-6125
    Keywords: cognitive development ; balance scale ; connectionist learning ; cascade-correlation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We used cascade-correlation to model human cognitive development on a well studied psychological task, the balance scale. In balance scale experiments, the child is asked to predict the outcome of placing certain numbers of equal weights at various distances to the left or right of a fulcrum. Both stage progressions and information salience effects have been found with children on this task. Cascade-correlation is a generative connectionist algorithm that constructs its own network topology as it learns. Cascade-correlation networks provided better fits to these human data than did previous models, whether rule-based or connectionist. The network model was used to generate a variety of novel predictions for psychological research.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 16 (1994), S. 161-183 
    ISSN: 0885-6125
    Keywords: Neural networks ; PAC learning ; nonoverlapping ; read-once formula ; learning with queries
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract We investigate, within the PAC learning model, the problem of learning nonoverlapping perceptron networks (also known as read-once formulas over a weighted threshold basis). These are loop-free neural nets in which each node has only one outgoing weight. We give a polynomial time algorithm that PAC learns any nonoverlapping perceptron network using examples and membership queries. The algorithm is able to identify both the architecture and the weight values necessary to represent the function to be learned. Our results shed some light on the effect of the overlap on the complexity of learning in neural networks.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 4 (1989), S. 293-336 
    ISSN: 0885-6125
    Keywords: knowledge acquisition ; knowledge engineering ; human-computer interaction ; strategic knowledge ; knowledge representation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Strategic knowledge is used by an agent to decide what action to perform next, where actions have consequences external to the agent. This article presents a computer-mediated method for acquiring strategic knowledge. The general knowledge acquisition problem and the special difficulties of acquiring strategic knowledge are analyzed in terms of representation mismatch: the difference between the form in which knowledge is available from the world and the form required for knowledge systems. ASK is an interactive knowledge acquisition tool that elicits strategic knowledge from people in the form of justifications for action choices and generates strategy rules that operationalize and generalize the expert's advice. The basic approach is demonstrated with a human-computer dialog in which ASK acquires strategic knowledge for medical diagnosis and treatment. The rationale for and consequences of specific design decisions in ASK are analyzed, and the scope of applicability and limitations of the approach are assessed. The paper concludes by discussing the contribution of knowledge representation to automated knowledge acquisition.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Machine learning 21 (1995), S. 151-175 
    ISSN: 0885-6125
    Keywords: domain knowledge ; change of representation ; theory revision ; protein structure prediction ; homology modeling ; amino acid properties
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract Predicting the fold, or approximate 3D structure, of a protein from its amino acid sequence is an important problem in biology. The homology modeling approach uses a protein database to identify fold-class relationships by sequence similarity. The main limitation of this method is that some proteins with similar structures appear to have very different sequences, which we call the “hidden-homology problem.” As in other real-world domains for machine learning, this difficulty may be caused by a low-level representation. Learning in such domains can be improved by using domain knowledge to search for representations that better match the inductive bias of a preferred algorithm. In this domain, knowledge of amino acid properties can be used to construct higher-level representations of protein sequences. In one experiment using a 179-protein data set, the accuracy of fold-class prediction was increased from 77.7% to 81.0%. The search results are analyzed to refine the grouping of small residues suggested by Dayhoff. Finally, an extension to the representation incorporates sequential context directly into the representation, which can express finer relationships among the amino acids. The methods developed in this domain are generalized into a framework that suggests several systematic roles for domain knowledge in machine learning. Knowledge may define both a space of alternative representations, as well as a strategy for searching this space. The search results may be summarized to extract feedback for revising the domain knowledge.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    The journal of supercomputing 1 (1988), S. 273-290 
    ISSN: 1573-0484
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A new version of the Quadratic Sieve algorithm, used for factoring large integers, has recently emerged. The new algorithm, called the Multiple Polynomial Quadratic Sieve, not only considerably improves the original Quadratic Sieve but also adds features that ideally suit a parallel implementation. The parallel implementation used for the new algorithm, a novel remote batching system, is also described.
    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...