Results 241 to 250 of about 3,865,632 (281)
Some of the next articles are maybe not open access.
2022
This report documents the program and the outcomes of Dagstuhl Seminar 21362 "Structure and Learning", held from September 5 to 10, 2021. Structure and learning are among the most prominent topics in Artificial Intelligence (AI) today. Integrating symbolic and numeric inference was set as one of the next open AI problems at the Townhall meeting "A 20 ...
Dong, Tiansi +4 more
openaire +1 more source
This report documents the program and the outcomes of Dagstuhl Seminar 21362 "Structure and Learning", held from September 5 to 10, 2021. Structure and learning are among the most prominent topics in Artificial Intelligence (AI) today. Integrating symbolic and numeric inference was set as one of the next open AI problems at the Townhall meeting "A 20 ...
Dong, Tiansi +4 more
openaire +1 more source
On Learning Decision Structures
Fundamenta Informaticae, 1997A decision structure is a simple and powerful tool for organizing a decision process. It differs from a conventional decision tree in that its nodes are assigned tests that can be functions of the attributes, rather than single attributes; the branches stemming from a node can be assigned a subset of attribute values rather than a single attribute ...
Imam, Ibrahim F., Michalski, Ryszard S.
openaire +2 more sources
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2020
We present Neural Structured Learning (NSL) in TensorFlow [2], a new learning paradigm to train neural networks by leveraging structured signals in addition to feature inputs. Structure can be explicit as represented by a graph, or implicit, either induced by adversarial perturbation or inferred using techniques like embedding learning.
Arjun Gopalan +7 more
openaire +1 more source
We present Neural Structured Learning (NSL) in TensorFlow [2], a new learning paradigm to train neural networks by leveraging structured signals in addition to feature inputs. Structure can be explicit as represented by a graph, or implicit, either induced by adversarial perturbation or inferred using techniques like embedding learning.
Arjun Gopalan +7 more
openaire +1 more source
Learning structurally indeterminate clauses
1998This paper describes a new kind of language bias, S-structural indeterminate clauses, which takes into account the meaning of predicates that play a key role in the complexity of learning in structural domains. Structurally indeterminate clauses capture an important background knowledge in structural domains such as medicine, chemistry or computational
Zucker, Jean-Daniel +1 more
openaire +2 more sources
Learning structured representations
Neurocomputing, 2003Abstract SHRUTI is a connectionist model that demonstrates how a network of neuron-like elements can encode a large body of semantic, episodic, and causal knowledge, and rapidly make decisions and perform explanatory and predictive reasoning. To further ground this model in the functioning of the brain it must be shown that components of the model ...
Lokendra Shastri, Carter Wendelken
openaire +1 more source
Structuring Learning Activities
Innovations in Education and Training International, 1996SUMMARY Examination of different learning activities can give an insight into their effectiveness for the learning process. The present paper seeks to identify basic structural features of learning activities through their analysis, comparison and evaluation.
Atara Sivan, David Kember
openaire +1 more source
Learning Paradigmatic Structure
2018This chapter reviews research on the acquisition of paradigmatic structure (including research on canonical antonyms, morphological paradigms, associative inference, grammatical gender and noun classes). It discusses the second-order schema hypothesis, which views paradigmatic structure as mappings between constructions.
openaire +2 more sources
2016
We study the problem of learning ensembles in the online setting, when the hypotheses are selected out of a base family that may be a union of possibly very complex sub-families. We prove new theoretical guarantees for the online learning of such ensembles in terms of the sequential Rademacher complexities of these sub-families.
Mehryar Mohri, Scott Yang
openaire +1 more source
We study the problem of learning ensembles in the online setting, when the hypotheses are selected out of a base family that may be a union of possibly very complex sub-families. We prove new theoretical guarantees for the online learning of such ensembles in terms of the sequential Rademacher complexities of these sub-families.
Mehryar Mohri, Scott Yang
openaire +1 more source
Collaborative structure and feature learning for multi-view clustering
Information Fusion, 2023Weiqing Yan, Jinlai Ren, Guanghui
exaly