Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

J. Clayton Kerce

dblp:305/7702 · also James Clayton Kerce · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
6since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
5 papers
Knowledge representation and reasoning · 82% Graph learning · 8% Vision and language · 7%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 10 heaviest of 12, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
logic-based reasoning
1.522024
Temporal Inductive Logic Reasoning over Hypergraphs · IJCAI 2024
TEILP: Time Prediction over Knowledge Graphs via Logical Reasoning · AAAI 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph reasoning
temporal knowledge graph reasoning
1.422024
TEILP: Time Prediction over Knowledge Graphs via Logical Reasoning · AAAI 2024
TILP: Differentiable Learning of Temporal Logical Rules on Knowledge Graphs · ICLR 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning › neuro-symbolic reasoning
differentiable reasoning
0.812024
TEILP: Time Prediction over Knowledge Graphs via Logical Reasoning · AAAI 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge graph
temporal knowledge graph
0.812024
TEILP: Time Prediction over Knowledge Graphs via Logical Reasoning · AAAI 2024
Knowledge graphs
knowledge graph reasoning
0.812024
Temporal Inductive Logic Reasoning over Hypergraphs · IJCAI 2024
Knowledge, reasoning and agents › Knowledge representation and reasoning › logic programming
inductive logic programming
0.712023
LogicDP: Creating Labels for Graph Data via Inductive Logic Programming · ICLR 2023
Knowledge, reasoning and agents › Knowledge representation and reasoning
commonsense reasoning
0.612022
LOGICDEF: An Interpretable Defense Framework against Adversarial Examples via Inductive Scene Graph Reasoning · AAAI 2022
Computer vision › Vision and language › visual reasoning
scene graph reasoning
0.612022
LOGICDEF: An Interpretable Defense Framework against Adversarial Examples via Inductive Scene Graph Reasoning · AAAI 2022
Security and privacy of machine learning
adversarial defense
0.612022
LOGICDEF: An Interpretable Defense Framework against Adversarial Examples via Inductive Scene Graph Reasoning · AAAI 2022
Computer vision › Image recognition and object detection › image classification
object classification
0.212022
LOGICDEF: An Interpretable Defense Framework against Adversarial Examples via Inductive Scene Graph Reasoning · AAAI 2022

Methods — techniques the papers use, named apart from their topics

inductive logic programming · 3.3scene graph · 1.1curriculum learning · 1.1random walk · 0.8conditional probability density functions · 0.8temporal logic · 0.7differentiable learning · 0.7
YearPublicationVenuePosition
2024 TEILP: Time Prediction over Knowledge Graphs via Logical Reasoning
abstract
Conventional embedding-based models approach event time prediction in temporal knowledge graphs (TKGs) as a ranking problem. However, they often fall short in capturing essential temporal relationships such as order and distance. In this paper, we propose TEILP, a logical reasoning framework that naturaly integrates such temporal elements into knowledge graph predictions. We first convert TKGs into a temporal event knowledge graph (TEKG) which has a more explicit representation of time in term of nodes of the graph. The TEKG equips us to develop a differentiable random walk approach to time prediction. Finally, we introduce conditional probability density functions, associated with the logical rules involving the query interval, using which we arrive at the time prediction. We compare TEILP with state-of-the-art methods on five benchmark datasets. We show that our model achieves a significant improvement over baselines while providing interpretable explanations. In particular, we consider several scenarios where training samples are limited, event types are imbalanced, and forecasting the time of future events based on only past events is desired. In all these cases, TEILP outperforms state-of-the-art methods in terms of robustness.
Siheng Xiong, Yuan Yang 0007, Ali Payani, J. Clayton Kerce, Faramarz Fekri
AAAI4
2024 Temporal Inductive Logic Reasoning over Hypergraphs
Yuan Yang 0007, Siheng Xiong, Ali Payani, J. Clayton Kerce, Faramarz Fekri
IJCAI4
2023 TILP: Differentiable Learning of Temporal Logical Rules on Knowledge Graphs
Siheng Xiong, Yuan Yang 0007, Faramarz Fekri, J. Clayton Kerce
ICLR4
2023 LogicDP: Creating Labels for Graph Data via Inductive Logic Programming
Yuan Yang 0007, Faramarz Fekri, J. Clayton Kerce, Ali Payani
ICLR3
2022 LOGICDEF: An Interpretable Defense Framework against Adversarial Examples via Inductive Scene Graph Reasoning
abstract
Deep vision models have provided new capability across a spectrum of applications in transportation, manufacturing, agriculture, commerce, and security. However, recent studies have demonstrated that these models are vulnerable to adversarial attack, exposing a risk-of-use in critical applications where untrusted parties have access to the data environment or even directly to the sensor inputs. Existing adversarial defense methods are either limited to specific types of attacks or are too complex to be applied to practical vision models. More importantly, these methods rely on techniques that are not interpretable to humans. In this work, we argue that an effective defense should produce an explanation as to why the system is attacked, and by using a representation that is easily readable by a human user, e.g. a logic formalism. To this end, we propose logic adversarial defense (LogicDef), a defense framework that utilizes the scene graph of the image to provide a contextual structure for detecting and explaining object classification. Our framework first mines inductive logic rules from the extracted scene graph, and then uses these rules to construct a defense model that alerts the user when the vision model violates the consistency rules. The defense model is interpretable and its robustness is further enhanced by incorporating existing relational commonsense knowledge from projects such as ConceptNet. In order to handle the hierarchical nature of such relational reasoning, we use a curriculum learning approach based on object taxonomy, yielding additional improvements to training and performance.
Yuan Yang 0007, J. Clayton Kerce, Faramarz Fekri
AAAI2
2021 Visual Question Answering based on Formal Logic
abstract
Visual question answering (VQA) has been gaining a lot of traction in the machine learning community in the recent years due to the challenges posed in understanding information coming from multiple modalities (i.e., images, language). In VQA, a series of questions are posed based on a set of images and the task at hand is to arrive at the answer. To achieve this, we take a symbolic reasoning based approach using the framework of formal logic. The image and the questions are converted into symbolic representations on which explicit reasoning is performed. We propose a formal logic framework where (i) images are converted to logical background facts with the help of scene graphs, (ii) the questions are translated to first-order predicate logic clauses using a transformer based deep learning model, and (iii) perform satisfiability checks, by using the background knowledge and the grounding of predicate clauses, to obtain the answer. Our proposed method is highly interpretable and each step in the pipeline can be easily analyzed by a human. We validate our approach on the CLEVR and the GQA dataset. We achieve near perfect accuracy of 99.6% on the CLEVR dataset comparable to the state of art models, showcasing that formal logic is a viable tool to tackle visual question answering. Our model is also data efficient, achieving 99.1% accuracy on CLEVR dataset when trained on just 10% of the training data.
Muralikrishnna G. Sethuraman, Ali Payani, Faramarz Fekri, J. Clayton Kerce
ICMLA4