Showing the Equivalence of Two Training Algorithms, I

Zitieren

Dateien zu dieser Ressource

Dateien Größe Format Anzeige

Zu diesem Dokument gibt es keine Dateien.

KOCH, Manuel, Ingrid FISCHER, Michael BERTHOLD, 1998. Showing the Equivalence of Two Training Algorithms, I. ICNN '98 - International Conference on Neural Networks. Anchorage, AK, USA. In: 1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227). ICNN '98 - International Conference on Neural Networks. Anchorage, AK, USA. IEEE, pp. 447-456. ISBN 0-7803-4859-1. Available under: doi: 10.1109/IJCNN.1998.682308

@inproceedings{Koch1998Showi-24290, title={Showing the Equivalence of Two Training Algorithms, I}, year={1998}, doi={10.1109/IJCNN.1998.682308}, isbn={0-7803-4859-1}, publisher={IEEE}, booktitle={1998 IEEE International Joint Conference on Neural Networks Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98CH36227)}, pages={447--456}, author={Koch, Manuel and Fischer, Ingrid and Berthold, Michael} }

<rdf:RDF xmlns:dcterms="http://purl.org/dc/terms/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:bibo="http://purl.org/ontology/bibo/" xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:void="http://rdfs.org/ns/void#" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > <rdf:Description rdf:about="https://kops.uni-konstanz.de/rdf/resource/123456789/24290"> <dc:creator>Koch, Manuel</dc:creator> <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/> <dc:contributor>Koch, Manuel</dc:contributor> <dc:contributor>Berthold, Michael</dc:contributor> <dc:language>eng</dc:language> <dcterms:title>Showing the Equivalence of Two Training Algorithms, I</dcterms:title> <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <dc:rights>deposit-license</dc:rights> <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-22T08:22:22Z</dcterms:available> <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/rdf/resource/123456789/36"/> <bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/24290"/> <dc:creator>Fischer, Ingrid</dc:creator> <dc:creator>Berthold, Michael</dc:creator> <dcterms:issued>1998</dcterms:issued> <dc:contributor>Fischer, Ingrid</dc:contributor> <dcterms:bibliographicCitation>The 1998 IEEE International Joint Conference on Neural Networks Proceedings : IEEE World Congress on Computational Intelligence : May 4-May 9, 1998, Anchorage, Alaska, USA / [general chair: Patrick K. Simpson]. Piscataway : IEEE Service Center, 1998. - S. 447-456. - ISBN 0-7803-4859-1</dcterms:bibliographicCitation> <dcterms:rights rdf:resource="http://nbn-resolving.org/urn:nbn:de:bsz:352-20140905103605204-4002607-1"/> <dcterms:abstract xml:lang="eng">Graph transformations offer a powerful way to formally specify neural networks and their corresponding training algorithms. This formalism can be used to prove properties of these algorithms. In this paper graph transformations are used to show the equivalence of two training algorithms for recurrent neural networks; backpropagation through time, and a variant of real-time backpropagation. In addition to this proof a whole class of related training algorithms emerges from the used formalism.</dcterms:abstract> <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-08-22T08:22:22Z</dc:date> <foaf:homepage rdf:resource="http://localhost:8080/jspui"/> </rdf:Description> </rdf:RDF>

Das Dokument erscheint in:

KOPS Suche


Stöbern

Mein Benutzerkonto