Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Farhad Shakerin"'
Autor:
Farhad Shakerin
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 306, Iss Proc. ICLP 2019, Pp 379-388 (2019)
We present a fast and scalable algorithm to induce non-monotonic logic programs from statistical learning models. We reduce the problem of search for best clauses to instances of the High-Utility Itemset Mining (HUIM) problem. In the HUIM problem, fe
Externí odkaz:
https://doaj.org/article/4b5edbfe94a34a91804dfa89900ca350
Publikováno v:
Theory and Practice of Logic Programming. 22:658-677
FOLD-RM is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data. It generates an (explainable) answer set programming (ASP) rule set for multi-category classification tasks while maintaining
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::40d31d9b4160a11e716e082a7a5c2e74
https://doi.org/10.1017/s1471068422000205
https://doi.org/10.1017/s1471068422000205
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 325:73-86
Understanding the meaning of a text is a fundamental challenge of natural language understanding (NLU) and from its early days, it has received significant attention through question answering (QA) tasks. We introduce a general semantics-based framew
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::609e20ac0574d4bb8a0961517a3cbf63
https://doi.org/10.4204/eptcs.325.13
https://doi.org/10.4204/eptcs.325.13
An approach based on answer set programming (ASP) is proposed in this paper for representing knowledge generated from natural language texts. Knowledge in a text is modeled using a Neo Davidsonian-like formalism, which is then represented as an answe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e7546b462ef7bc0a6cdc575e92f0e47
http://arxiv.org/abs/2112.11241
http://arxiv.org/abs/2112.11241
Understanding the meaning of a text is a fundamental challenge of natural language understanding (NLU) research. An ideal NLU system should process a language in a way that is not exclusive to a single task or a dataset. Keeping this in mind, we have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c4e2f2b1bc96db5312faaae047870256
http://arxiv.org/abs/2101.11707
http://arxiv.org/abs/2101.11707
Autor:
Gopal Gupta, Farhad Shakerin
We focus on the problem of inducing logic programs that explain models learned by the support vector machine (SVM) algorithm. The top-down sequential covering inductive logic programming (ILP) algorithms (e.g., FOIL) apply hill-climbing search using
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07dcfbee330987aa9eb1274c35ed6e72
Publikováno v:
Practical Aspects of Declarative Languages ISBN: 9783030391966
PADL
PADL
AQuA (ASP-based Question Answering) is an Answer Set Programming (ASP) based visual question answering framework that truly “understands” an input picture and answers natural language questions about that picture. The knowledge contained in the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::020af91f6b2c3e621a018a9de58e6468
https://doi.org/10.1007/978-3-030-39197-3_4
https://doi.org/10.1007/978-3-030-39197-3_4
Publikováno v:
Theory and Practice of Logic Programming. 17:1010-1026
In inductive learning of a broad concept, an algorithm should be able to distinguish concept examples from exceptions and noisy data. An approach through recursively finding patterns in exceptions turns out to correspond to the problem of learning de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3843861233c0e4dbb08e61a4e7f9971b
https://doi.org/10.1017/s1471068417000333
https://doi.org/10.1017/s1471068417000333
Autor:
Farhad Shakerin, Gopal Gupta
Publikováno v:
AAAI
We present a heuristic based algorithm to induce nonmonotonic logic programs that will explain the behavior of XGBoost trained classifiers. We use the technique based on the LIME approach to locally select the most important features contributing to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::33770464d13ed150e11e578f75a93846
http://arxiv.org/abs/1808.00629
http://arxiv.org/abs/1808.00629
Publikováno v:
ARCADE@CADE
Answer Set Programming (ASP) has emerged as a successful paradigm for developing intelligent applications. ASP is based on adding negation as failure to logic programming under the stable model semantics regime. ASP allows for sophisticated reasoning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4858129c1adf233686e216f54679c11
https://doi.org/10.29007/ngm2
https://doi.org/10.29007/ngm2