The DOI matches its Crossref record; 52 of the 52 references it cites were found in a registry or an index.
A general framework for adaptive processing of data structures
Abstract
A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to relatively poor structures, like arrays or sequences. The framework described in this paper is an attempt to unify adaptive models like artificial neural nets and belief nets for the problem of processing structured information. In particular, relations between data variables are expressed by directed acyclic graphs, where both numerical and categorical values coexist. The general framework proposed in this paper can be regarded as an extension of both recurrent neural networks and hidden Markov models to the case of acyclic graphs. In particular we study the supervised learning problem as the problem of learning transductions from an input structured space to an output structured space, where transductions are assumed to admit a recursive hidden statespace representation. We introduce a graphical formalism for representing this class of adaptive transductions by means of recursive networks, i.e., cyclic graphs where nodes are labeled by variables and edges are labeled by generalized delay elements. This representation makes it possible to incorporate the symbolic and subsymbolic nature of data. Structures are processed by unfolding the recursive network into an acyclic graph called encoding network. In so doing, inference and learning algorithms can be easily inherited from the corresponding algorithms for artificial neural networks or probabilistic graphical model.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743
Neural networks for pattern recognition
(1994) · Choice Reviews Online · doi:10.5860/choice.31-5500 · Cited by 18,538
(1988) · Cited by 16,582
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Elman, J. L. (1990) · Cognitive Science · doi:10.1207/s15516709cog1402_1 · Cited by 11,212
Learning long-term dependencies with gradient descent is difficult
Bengio, Y., Simard, P., & Frasconi, P. (1994) · IEEE Transactions on Neural Networks · doi:10.1109/72.279181 · Cited by 8,542
Self-citationMcCabe, T. J. (1976) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1976.233837 · Cited by 6,059
Principles of Artificial Intelligence
Nilsson, N. J. (1982) · doi:10.1007/978-3-662-09438-9 · Cited by 3,457
Lauritzen, S. L. (1996) · doi:10.1093/oso/9780198522195.001.0001 · Cited by 2,976
Graphical Models in Applied Multivariate Statistics
Goodall, C. R. (1991) · Technometrics · doi:10.1080/00401706.1991.10484880 · Cited by 1,849
Parallel Networks that Learn to Pronounce English Text
B, T. J. S. A. (1987) · Cited by 1,514
Structural Pattern Recognition
Pavlidis, T. (1977) · Springer eBooks · doi:10.1007/978-3-642-88304-0 · Cited by 1,055
Syntactic pattern recognition and applications
Fu, K. (1968) · Medical Entomology and Zoology · Cited by 1,015
Pattern Recognition: Statistical, Structural and Neural Approaches
Schalkoff, R. J. (1991) · Medical Entomology and Zoology · Cited by 964
Inductive Inference: Theory and Methods
Angluin, D., & Smith, C. H. (1983) · ACM Computing Surveys · doi:10.1145/356914.356918 · Cited by 887
Recursive distributed representations
Pollack, J. B. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90005-k · Cited by 852
Principles of Artificial Intelligence
(1981) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1981.4767059 · Cited by 847
Complexity of automaton identification from given data
Gold, E. M. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90562-4 · Cited by 771
Extracting refined rules from knowledge-based neural networks
Towell, G. G., & Shavlik, J. W. (1993) · Machine Learning · doi:10.1007/bf00993103 · Cited by 757
Syntactic pattern recognition and applications
Firschein, O. (1983) · Proceedings of the IEEE · doi:10.1109/proc.1983.12755 · Cited by 753
On the Computational Power of Neural Nets
Siegelmann, H. T., & Sontag, E. D. (1995) · Journal of Computer and System Sciences · doi:10.1006/jcss.1995.1013 · Cited by 692
Learning, invariance, and generalization in high-order neural networks
Giles, C. L., & Maxwell, T. (1987) · Applied Optics · doi:10.1364/ao.26.004972 · Cited by 676
Supervised neural networks for the classification of structures
Sperduti, A., & Starita, A. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572108 · Cited by 666
Self-citationHolographic reduced representations
Plate, T. A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.377968 · Cited by 657
Applications of stochastic context-free grammars using the Inside-Outside algorithm
Lari, K., & Young, S. J. (1991) · Computer Speech & Language · doi:10.1016/0885-2308(91)90009-f · Cited by 639
Learning task-dependent distributed representations by backpropagation through structure
Goller, C., & Kuchler, A. (2002) · Proceedings of International Conference on Neural Networks (ICNN'96) · doi:10.1109/icnn.1996.548916 · Cited by 581
Operations for Learning with Graphical Models
Buntine, W. L. (1994) · Journal of Artificial Intelligence Research · doi:10.1613/jair.62 · Cited by 530
The Molecular Connectivity Chi Indexes and Kappa Shape Indexes in Structure‐Property Modeling
Hall, L. H., & Kier, L. B. (1991) · Reviews in Computational Chemistry · doi:10.1002/9780470125793.ch9 · Cited by 399
Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks
Giles, C. L., Miller, C. B., Chen, D., Chen, H. H., Sun, G. Z., & Lee, Y. C. (1992) · Neural Computation · doi:10.1162/neco.1992.4.3.393 · Cited by 392
The estimation of stochastic context-free grammars using the Inside-Outside algorithm
Lari, K., & Young, S. J. (1990) · Computer Speech & Language · doi:10.1016/0885-2308(90)90022-x · Cited by 379
Mean Field Theory for Sigmoid Belief Networks
Saul, L. K., Jaakkola, T., & Jordan, M. I. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.251 · Cited by 327
Mapping part-whole hierarchies into connectionist networks
Hinton, G. E. (1990) · Artificial Intelligence · doi:10.1016/0004-3702(90)90004-j · Cited by 310
Input-output HMMs for sequence processing
Bengio, Y., & Frasconi, P. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.536317 · Cited by 300
Self-citationThe gamma model—A new neural model for temporal processing
Vries, B. D., & Principe, J. C. (1992) · Neural Networks · doi:10.1016/s0893-6080(05)80035-8 · Cited by 254
SETHEO: A high-performance theorem prover
Letz, R., Schümann, J., Bayerl, S., et al. (1992) · Journal of Automated Reasoning · doi:10.1007/bf00244282 · Cited by 241
Constructing deterministic finite-state automata in recurrent neural networks
Omlin, C. W., & Giles, C. L. (1996) · Journal of the ACM · doi:10.1145/235809.235811 · Cited by 178
The Recurrent Cascade-Correlation architecture
Fahlman, S. E. (2018) · doi:10.1184/r1/6610754 · Cited by 145
Representation of Finite State Automata in Recurrent Radial Basis Function Networks
Frasconi, P., Gori, M., Maggini, M., & Soda, G. (1996) · Machine Learning · doi:10.1007/bf00116897 · Cited by 98
Self-citationGiles, C. L., & Omlin, C. W. P. (1993) · Connection Science · doi:10.1080/09540099308915703 · Cited by 89
Recurrent Neural Networks for Missing or Asynchronous Data
Bengio, Y., & Gingras, F. (1995) · Cited by 78
EXPERIMENTAL COMPARISON OF THE EFFECT OF ORDER IN RECURRENT NEURAL NETWORKS
MILLER, C. B., & Giles, C. L. (1993) · International Journal of Pattern Recognition and Artificial Intelligence · doi:10.1142/s0218001493000431 · Cited by 50
Forcada, M. L., & Carrasco, R. C. (1995) · Neural Computation · doi:10.1162/neco.1995.7.5.923 · Cited by 42
On the Computational Power of Recurrent Neural Networks for Structures
Sperduti, A. (1997) · Neural Networks · doi:10.1016/s0893-6080(96)00105-0 · Cited by 38
Self-citationLabelling Recursive Auto-associative Memory
Sperduti, A. (1994) · Connection Science · doi:10.1080/09540099408915733 · Cited by 33
Self-citationLearning distributed representations for the classification of terms
Sperduti, A., Starita, A., & Goller, C. (1995) · Cited by 29
Self-citationExtended Cascade-Correlation for syntactic and structural pattern recognition
Sperduti, A., Majidi, D., & Starita, A. (1996) · Lecture notes in computer science · doi:10.1007/3-540-61577-6_10 · Cited by 24
Self-citationEncoding Labeled Graphs by Labeling RAAM
Sperduti, A. (1993) · Padua Research Archive (University of Padova) · Cited by 24
Self-citationDesign and analysis of hierarchical software metrics
Prather, R. E. (1995) · ACM Computing Surveys · doi:10.1145/234782.234784 · Cited by 16
Stability properties of labeling recursive auto-associative memory
Sperduti, A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.471363 · Cited by 15
Self-citationSperduti, A., & Starita, A. (1995) · Artificial Neural Nets and Genetic Algorithms · doi:10.1007/978-3-7091-7535-4_96 · Cited by 12
Self-citationEncoding syntactical trees with labelling recursive auto-associative memory
Cadoret, V. (1994) · European Conference on Artificial Intelligence · Cited by 6
A memory model based on LRAAM for associative access of structures
Sperduti, A., & Starita, A. (2002) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1996.548953 · Cited by 4
Self-citation
Cited by
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Self-citationVeličković, P., Casanova, A., Liò, P., Cucurull, G., Romero, A., & Bengio, Y. (2017) · arXiv (Cornell University) · doi:10.17863/cam.48429 · Cited by 8,657
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
Supervised Sequence Labelling with Recurrent Neural Networks
Graves, A. (2012) · Studies in Computational Intelligence · doi:10.1007/978-3-642-24797-2 · Cited by 3,120
Metadata
- Authors
- Frasconi, P., Gori, M., & Sperduti, A.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 1998
- Volume
- 9
- Issue
- 5
- Pages
- 768-786
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2127827747
- Cited by
- 471
- References
- 52
- FWCI
- 21.88
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.