Processing of cyclic graphs with recursive neural networks
Küçük Resim Yok
Tarih
2009
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Maltepe Üniversitesi
Erişim Hakkı
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Özet
Recursive neural networks are a powerful tool for processing structured data. They are filling the gap between connectionism, which is usually related to poorly organized data, and a great variety of real-world problems such as document processing, where the information is naturally incoded in the relationships among the basic entities. More precisely recursive neural networks can deal only with directed ordered acyclic graphs (DOAGs), in which the children of any given node are ordered. While this assumption is reasonable in some applications, it introduces unnecessary constraints in others. Example of such applications is classification of HTML pages. In this paper, we explain a methodology, which allow us to process any cyclic directed graph. The computational power of recursive neural networks is established.
Açıklama
Anahtar Kelimeler
Graph processing by neural networks, Recursive neural networks, Cyclic graphs
Kaynak
International Conference of Mathematical Sciences
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Rezaei, Z. (2009). Processing of cyclic graphs with recursive neural networks. Maltepe Üniversitesi. s. 402.
