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.
? Tutorial for this page

Varun Nandkumar Golani

dblp:305/7213 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2022
—ORCID · none

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

Databases, data management, data science and information retrieval · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 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.

Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 50% Machine learning and data management · 50%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning and data management
concept learning
0.612022
EvoLearner: Learning Description Logics with Evolutionary Algorithms · WWW 2022
Knowledge graphs
link prediction
0.612022
EvoLearner: Learning Description Logics with Evolutionary Algorithms · WWW 2022
Knowledge, reasoning and agents › Knowledge representation and reasoning
description logic
0.212022
EvoLearner: Learning Description Logics with Evolutionary Algorithms · WWW 2022

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

information gain · 1.1evolutionary algorithm · 1.1biased random walk · 1.1
YearPublicationVenuePosition
2022 EvoLearner: Learning Description Logics with Evolutionary Algorithms
abstract
Classifying nodes in knowledge graphs is an important task, e.g., for predicting missing types of entities, predicting which molecules cause cancer, or predicting which drugs are promising treatment candidates. While black-box models often achieve high predictive performance, they are only post-hoc and locally explainable and do not allow the learned model to be easily enriched with domain knowledge. Towards this end, learning description logic concepts from positive and negative examples has been proposed. However, learning such concepts often takes a long time and state-of-the-art approaches provide limited support for literal data values, although they are crucial for many applications. In this paper, we propose EvoLearner—an evolutionary approach to learn concepts in , which is the attributive language with complement () paired with qualified cardinality restrictions () and data properties (). We contribute a novel initialization method for the initial population: starting from positive examples, we perform biased random walks and translate them to description logic concepts. Moreover, we improve support for data properties by maximizing information gain when deciding where to split the data. We show that our approach significantly outperforms the state of the art on the benchmarking framework SML-Bench for structured machine learning. Our ablation study confirms that this is due to our novel initialization method and support for data properties.
Stefan Heindorf, Lukas Blübaum, Nick Düsterhus, Till Werner, Varun Nandkumar Golani, Caglar Demir, Axel-Cyrille Ngonga Ngomo
WWW5