Many relationships among data in several areas (such as computer vision, molecular chemistry and pattern recognition) can be represented by graphs. In the machine learning setting, it is an important learning task to classify graph-structural data correctly. Typically, the established techniques for this setting proceed via graph kernels and neural-network classification. In this work, we explore end-to-end learning for graphs: the objective is to operate on the graph representations directly. The key idea of our approach is to use standard tools for graph canonization. We test the performance of this approach on several datasets arising from bioinformatics. In general, we find that the graph canonization, as such, does not improve the accuracy of the classification. A possible reason for this behavior is that the neural network ends up overfitting to the given adjacency matrix representation.
"Sinopsis" puede pertenecer a otra edición de este libro.
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 26388700745
Cantidad disponible: 4 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Many relationships among data in several areas (such as computer vision, molecular chemistry and pattern recognition) can be represented by graphs. In the machine learning setting, it is an important learning task to classify graph-structural data correctly. Typically, the established techniques for this setting proceed via graph kernels and neural-network classification. In this work, we explore end-to-end learning for graphs: the objective is to operate on the graph representations directly. The key idea of our approach is to use standard tools for graph canonization. We test the performance of this approach on several datasets arising from bioinformatics. In general, we find that the graph canonization, as such, does not improve the accuracy of the classification. A possible reason for this behavior is that the neural network ends up overfitting to the given adjacency matrix representation. 52 pp. Englisch. Nº de ref. del artículo: 9786202224178
Cantidad disponible: 2 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand. Nº de ref. del artículo: 391947670
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND. Nº de ref. del artículo: 18388700739
Cantidad disponible: 4 disponibles
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Yamen EmreEmre Yamen, studied Bachelor of Science Informatics at RWTH Aachen University. Master Student in Informatics and working on Machine Learning.Many relationships among data in several areas (such as computer vision, molec. Nº de ref. del artículo: 293729627
Cantidad disponible: Más de 20 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Taschenbuch. Condición: Neu. Neuware -Many relationships among data in several areas (such as computer vision, molecular chemistry and pattern recognition) can be represented by graphs. In the machine learning setting, it is an important learning task to classify graph-structural data correctly. Typically, the established techniques for this setting proceed via graph kernels and neural-network classification. In this work, we explore end-to-end learning for graphs: the objective is to operate on the graph representations directly. The key idea of our approach is to use standard tools for graph canonization. We test the performance of this approach on several datasets arising from bioinformatics. In general, we find that the graph canonization, as such, does not improve the accuracy of the classification. A possible reason for this behavior is that the neural network ends up overfitting to the given adjacency matrix representation.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 52 pp. Englisch. Nº de ref. del artículo: 9786202224178
Cantidad disponible: 2 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Many relationships among data in several areas (such as computer vision, molecular chemistry and pattern recognition) can be represented by graphs. In the machine learning setting, it is an important learning task to classify graph-structural data correctly. Typically, the established techniques for this setting proceed via graph kernels and neural-network classification. In this work, we explore end-to-end learning for graphs: the objective is to operate on the graph representations directly. The key idea of our approach is to use standard tools for graph canonization. We test the performance of this approach on several datasets arising from bioinformatics. In general, we find that the graph canonization, as such, does not improve the accuracy of the classification. A possible reason for this behavior is that the neural network ends up overfitting to the given adjacency matrix representation. Nº de ref. del artículo: 9786202224178
Cantidad disponible: 1 disponibles