Demo Data from EDBT 2026 / reviewers in the wild / expert
Ben Murdoch
dblp:198/0867
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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
1 paper |
Knowledge representation and reasoning · 50% Reinforcement learning · 50% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning
action selection |
0.3 | 1 | 2017 | What Can You Do with a Rock? Affordance Extraction via Word Embeddings · IJCAI 2017 |
Knowledge, reasoning and agents › Knowledge representation and reasoning
commonsense reasoning |
0.3 | 1 | 2017 | What Can You Do with a Rock? Affordance Extraction via Word Embeddings · IJCAI 2017 |
Methods — techniques the papers use, named apart from their topics
word embeddings · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | What Can You Do with a Rock? Affordance Extraction via Word EmbeddingsabstractAutonomous agents must often detect affordances: the set of behaviors enabled by a situation. Affordance extraction is particularly helpful in domains with large action spaces, allowing the agent to prune its search space by avoiding futile behaviors. This paper presents a method for affordance extraction via word embeddings trained on a tagged Wikipedia corpus. The resulting word vectors are treated as a common knowledge database which can be queried using linear algebra. We apply this method to a reinforcement learning agent in a text-only environment and show that affordance-based action selection improves performance in most cases. Our method increases the computational complexity of each learning step but significantly reduces the total number of steps needed. In addition, the agent's action selections begin to resemble those a human would choose. Nancy Fulda, Daniel Ricks, Ben Murdoch, David Wingate |
IJCAI | 3 |