Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Gadi Pinkas"'
Publikováno v:
IEEE Open Journal of Engineering in Medicine and Biology, Vol 1, Pp 268-274 (2020)
Automated voice-based detection of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) could facilitate the screening for COVID19. A dataset of cellular phone recordings from 88 subjects was recently collected. The dataset included vocal utt
Externí odkaz:
https://doaj.org/article/ceca39267f21438cbb216bfe599ccc0e
Autor:
Tarek R. Besold, Artur d’Avila Garcez, Sebastian Bader, Howard Bowman, Pedro Domingos, Pascal Hitzler, Kai-Uwe Kühnberger, Luis C. Lamb, Priscila Machado Vieira Lima, Leo de Penning, Gadi Pinkas, Hoifung Poon, Gerson Zaverucha
The study and understanding of human behaviour is relevant to computer science, artificial intelligence, neural computation, cognitive science, philosophy, psychology, and several other areas. Presupposing cognition as basis of behaviour, among the m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8f994f9c5b14a295ac1a53d425a142f
https://doi.org/10.3233/faia210348
https://doi.org/10.3233/faia210348
Publikováno v:
IEEE Open Journal of Engineering in Medicine and Biology, Vol 1, Pp 268-274 (2020)
Automated voice-based detection of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) could facilitate the screening for COVID19. A dataset of cellular phone recordings from 88 subjects was recently collected. The dataset included vocal utt
Autor:
Gadi Pinkas
Publikováno v:
Neural computation. 3(2)
Connectionist networks with symmetric weights (like Hopfield networks and Boltzmann Machines) use gradient descent to find a minimum for quadratic energy functions. We show equivalence between the problem of satisfiability in propositional calculus a
Publikováno v:
Biologically Inspired Cognitive Architectures. 6:87-95
For a long time, connectionist architectures have been criticized for having propositional fixation, lack of compositionality and, in general, for their weakness in representing sophisticated symbolic information and processing it. This work offers a
Autor:
Gadi Pinkas
Publikováno v:
Artificial Intelligence. 77:203-247
The paper presents a connectionist framework that is capable of representing and learning propositional knowledge. An extended version of propositional calculus is developed and is demonstrated to be useful for nonmonotonic reasoning, dealing with co
Publikováno v:
Artificial Neural Networks and Machine Learning – ICANN 2012 ISBN: 9783642332685
ICANN (1)
ICANN (1)
We show how to encode, retrieve and process complex structures equivalent to First-Order Logic (FOL) formulae, with Artificial Neural Networks (ANNs) designed for energy-minimization. The solution constitutes a binding mechanism that uses a neural Wo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7957832b4da13b6ee15fbbe4adad671b
https://doi.org/10.1007/978-3-642-33269-2_61
https://doi.org/10.1007/978-3-642-33269-2_61
Publikováno v:
KDD
Many fraud analysis systems have at their heart a rule-based engine for generating alerts about suspicious behaviors. The rules in the system are usually based on expert knowledge. Automatic rule discovery aims at using past examples of fraudulent an
Autor:
Uzi Murad, Gadi Pinkas
Publikováno v:
Principles of Data Mining and Knowledge Discovery ISBN: 9783540664901
PKDD
PKDD
Many fraud analysis applications try to detect “probably fraudulent” usage patterns, and to discover these patterns in historical data. This paper builds on a different detection concept; there are no fixed “probably fraudulent” patterns, but
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c0afdec5baeed5a2f5a5249dca63f614
https://doi.org/10.1007/978-3-540-48247-5_27
https://doi.org/10.1007/978-3-540-48247-5_27
Autor:
Gadi Pinkas, Rina Dechter
Symmetric networks designed for energy minimization such as Boltzman machines and Hopfield nets are frequently investigated for use in optimization, constraint satisfaction and approximation of NP-hard problems. Nevertheless, finding a global solutio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3406b7d5e9a3819df6cebc7646b15f9e