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.

Sarthak Dash

dblp:185/6802 · DBLP profile ↗
← Back
6ranked-venue papers
3as first author
3since 2021 · last 2023
0000-0001-8765-4055ORCID · corroborated

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

Artificial intelligence and machine learning · 4 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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
2 papers
Knowledge representation and reasoning · 33% Graph learning · 33% Information extraction and text analysis · 17%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Transfer learning and domain adaptation
cross-domain transfer
0.412020
Taxonomy Construction of Unseen Domains via Graph-based Cross-Domain Knowledge Transfer · ACL 2020
Machine learning › Graph learning › graph generation
directed acyclic graph generation
0.412020
Taxonomy Construction of Unseen Domains via Graph-based Cross-Domain Knowledge Transfer · ACL 2020
Machine learning › Graph learning
graph neural network
0.412020
Taxonomy Construction of Unseen Domains via Graph-based Cross-Domain Knowledge Transfer · ACL 2020
Knowledge, reasoning and agents › Knowledge representation and reasoning › semantic representation › semantic relations
hypernymy detection
0.412020
Hypernym Detection Using Strict Partial Order Networks · AAAI 2020
Natural language and speech › Information extraction and text analysis
lexical semantics
0.412020
Hypernym Detection Using Strict Partial Order Networks · AAAI 2020
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › ontology learning
taxonomy learning
0.412020
Taxonomy Construction of Unseen Domains via Graph-based Cross-Domain Knowledge Transfer · ACL 2020

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

variational autoencoder · 0.5clustering · 0.5strict partial order network · 0.4soft constraints · 0.4graph neural network · 0.4cross-domain transfer learning · 0.4
YearPublicationVenuePosition
2023 NLFOA: Natural Language Focused Ontology Alignment
abstract
For Ontology Alignment (OA), the task is to align semantically equivalent concepts and relations from different ontologies. This task plays a crucial role in many downstream tasks and applications in academia and industry. Since manually aligning ontologies is inefficient and costly, numerous approaches exist to do this automatically. However, most approaches are tailored to specific domains, are rule-based systems or based on feature engineering, and require external knowledge. The most recent advances in the field of OA rely on the widely proven effectiveness of pre-trained language models to represent the human-generated language that describes the entities in an ontology. However, these approaches additionally require sophisticated algorithms or Graph Neural Networks to exploit an ontology’s graphical structure to achieve state-of-the-art performance. In this work, we present NLFOA, or Natural Language Focused Ontology Alignment, which purely focuses on the natural language contained in ontologies to process the ontology’s semantics as well as graphical structure. An evaluation of our approach on common OA datasets shows superior results when finetuning with only a small number of training samples. Additionally, it demonstrates strong results in a zero-shot setting which could be employed in an active learning setup to reduce human labor when manually aligning ontologies significantly.
Florian Schneider 0001, Sarthak Dash, Sugato Bagchi, Nandana Mihindukulasooriya, Alfio Massimiliano Gliozzo
K-CAP2
2023 Linking Tabular Columns to Unseen Ontologies
Sarthak Dash, Sugato Bagchi, Nandana Mihindukulasooriya, Alfio Massimiliano Gliozzo
ISWC1
2021 Open Knowledge Graphs Canonicalization using Variational Autoencoders
abstract
Noun phrases and Relation phrases in open knowledge graphs are not canonicalized, leading to an explosion of redundant and ambiguous subject-relation-object triples.Existing approaches to solve this problem take a two-step approach.First, they generate embedding representations for both noun and relation phrases, then a clustering algorithm is used to group them using the embeddings as features.In this work, we propose Canonicalizing Using Variational Autoencoders (CUVA) 1 , a joint model to learn both embeddings and cluster assignments in an end-to-end approach, which leads to a better vector representation for the noun and relation phrases.Our evaluation over multiple benchmarks shows that CUVA outperforms the existing state-of-the-art approaches.Moreover, we introduce CANONICNELL, a novel dataset to evaluate entity canonicalization systems.
Sarthak Dash, Gaetano Rossiello, Nandana Mihindukulasooriya, Sugato Bagchi, Alfio Massimiliano Gliozzo
EMNLP (1)1
2020 Hypernym Detection Using Strict Partial Order Networks
abstract
This paper introduces Strict Partial Order Networks (SPON), a novel neural network architecture designed to enforce asymmetry and transitive properties as soft constraints. We apply it to induce hypernymy relations by training with is-a pairs. We also present an augmented variant of SPON that can generalize type information learned for in-vocabulary terms to previously unseen ones. An extensive evaluation over eleven benchmarks across different tasks shows that SPON consistently either outperforms or attains the state of the art on all but one of these benchmarks.
Sarthak Dash, Md. Faisal Mahbub Chowdhury, Alfio Massimiliano Gliozzo, Nandana Mihindukulasooriya, Nicolas R. Fauceglia
AAAI1
2020 Taxonomy Construction of Unseen Domains via Graph-based Cross-Domain Knowledge Transfer
abstract
Extracting lexico-semantic relations as graphstructured taxonomies, also known as taxonomy construction, has been beneficial in a variety of NLP applications.Recently Graph Neural Network (GNN) has shown to be powerful in successfully tackling many tasks.However, there has been no attempt to exploit GNN to create taxonomies.In this paper, we propose Graph2Taxo, a GNN-based cross-domain transfer framework for the taxonomy construction task.Our main contribution is to learn the latent features of taxonomy construction from existing domains to guide the structure learning of an unseen domain.We also propose a novel method of directed acyclic graph (DAG) generation for taxonomy construction.Specifically, our proposed Graph2Taxo uses a noisy graph constructed from automatically extracted noisy hyponym-hypernym candidate pairs, and a set of taxonomies for some known domains for training.The learned model is then used to generate taxonomy for a new unknown domain given a set of terms for that domain.Experiments on benchmark datasets from science and environment domains show that our approach attains significant improvements correspondingly over the state of the art.
Sarthak Dash, Md. Faisal Mahbub Chowdhury, Nandana Mihindukulasooriya, Alfio Massimiliano Gliozzo
ACL2
2020 Dynamic Faceted Search for Technical Support Exploiting Induced Knowledge
Nandana Mihindukulasooriya, Ruchi Mahindru, Md. Faisal Mahbub Chowdhury, Yu Deng 0004, Nicolas R. Fauceglia, Gaetano Rossiello, Sarthak Dash, Alfio Massimiliano Gliozzo, Shu Tao
ISWC (2)7