Cited by 196Neural Networks and ApplicationsDomain Adaptation and Few-Shot LearningModel Reduction and Neural Networks

A review of some techniques for inclusion of domain-knowledge into deep neural networks

Open access
Dash, Tirtharaj, Chitlangia, Sharad, Ahuja, Aditya, Srinivasan, Ashwin·2022·Scientific Reports

Abstract

We present a survey of ways in which existing scientific knowledge are included when constructing models with neural networks. The inclusion of domain-knowledge is of special interest not just to constructing scientific assistants, but also, many other areas that involve understanding data using human-machine collaboration. In many such instances, machine-based model construction may benefit significantly from being provided with human-knowledge of the domain encoded in a sufficiently precise form. This paper examines the inclusion of domain-knowledge by means of changes to: the input, the loss-function, and the architecture of deep networks. The categorisation is for ease of exposition: in practice we expect a combination of such changes will be employed. In each category, we describe techniques that have been shown to yield significant changes in the performance of deep neural networks.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41598-021-04590-0

Cites

109 of 109 references verified0 citation errors · 0 not checkable

Statistics

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.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Integrating external domain knowledge into emotion recognition models is usually a complex and time-consuming process.

    “However, integrating external domain knowledge into emotion recognition models is usually a complex and timeconsuming process [19].”

    From Emotion Classification With Visibility Graphs (2025) · cites this paper as [19]

    The Introduction (‘Focus of the paper’; page not provided) describes increasing complexity in ways of incorporating domain knowledge, and ‘Challenges and concluding remarks’ identifies technical difficulties. The passages do not establish that integration is usually time-consuming or address emotion recognition models specifically. (LLM, conf=0.84)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

3 of the 112 references couldn’t be matched to a known paper.

Research works printed but not linked: 9

  1. Garcez, A. S. d., Broda, K. B. & Gabbay, D. M. Neural-symbolic learning systems: foundations and applications (Springer, 2012).
  2. Radford, A. et al. Language models are unsupervised multitask learners. OpenAI Blog. 1, 9 (2019).
  3. Ellis, K., Morales, L., Meyer, M. S., Solar-Lezama, A. & Tenenbaum, J. B. Dreamcoder: Bootstrapping domain-specific languages for neurally-guided bayesian program learning. In Proceedings of the 2nd Workshop on Neural Abstract Machines and Program Induction (2018).
  4. Hogan, A. et al. Knowledge graphs. arXiv preprint arXiv:2003.02320 (2020). · arXiv
  5. Devlin, J., Chang, M.-W., Lee, K. & Toutanova, K. Bert: Pre-training of deep bidirectional transformers for language understanding. In NAACL-HLT (1), 4171–4186 (2019). https://aclweb.org/anthology/papers/N/N19/N19-1423/.
  6. Vishwanathan, S. V. N., Schraudolph, N. N., Kondor, R. & Borgwardt, K. M. Graph kernels. J. Mach. Learn. Res. 11, 1201–1242 (2010).
  7. Sourek, G., Aschenbrenner, V., Zelezny, F., Schockaert, S. & Kuzelka, O. Lifted relational neural networks: Efficient learning of latent relational structures. J. Artif. Intell. Res. 62, 69–100 (2018). · DOI
  8. Brown, T. B. et al. Language models are few-shot learners. arXiv preprint arXiv:2005.14165 (2020). · arXiv
  9. Anderson, M., Anderson, S. & Armen, C. Medethex: Toward a medical ethics advisor (Caring Machines, In AAAI Fall Symposium, 2005).

Cited by

Sorted by citations

Authors
Dash, T., Chitlangia, S., Ahuja, A., & Srinivasan, A.
Affiliations
Birla Institute of Technology and Science, Pilani - Goa Campus (IN)
Corresponding author
Dash, Tirtharaj
Venue
Scientific Reports
Published
2022-01-20
Volume
12
Issue
1
Pages
1040-1040
ISSN
2045-2322 (ISSN-L)
OpenAlex
W4205511145
Cited by
196
References
112
Citations by year
2026: 30 · 2025: 52 · 2024: 52 · 2023: 49 · 2022: 11 · 2021: 2
FWCI
13.49
Type
journal article
Language
en
Open access
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
  • University of New South Wales
  • Birla Institute of Technology and Science, Pilani
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Neural Networks and Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Model Reduction and Neural Networks
Keywords
domain knowledge, deep neural network, loss functions, network architecture, input encoding, human-machine collaboration

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