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.

Subburam Rajaram

dblp:209/9640 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Artificial intelligence and machine learning · 2Graphics, 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
Information extraction and text analysis · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › relation extraction › document-level relation extraction
cross-sentence relation extraction
0.412019
Neural Relation Extraction within and across Sentence Boundaries · AAAI 2019
Natural language and speech › Information extraction and text analysis › relation extraction
dependency-based relation extraction
0.412019
Neural Relation Extraction within and across Sentence Boundaries · AAAI 2019
Natural language and speech › Information extraction and text analysis
relation extraction
0.412019
Neural Relation Extraction within and across Sentence Boundaries · AAAI 2019

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

recursive neural network · 0.4recurrent neural network · 0.4dependency paths · 0.4
YearPublicationVenuePosition
2019 Neural Relation Extraction within and across Sentence Boundaries
abstract
Past work in relation extraction mostly focuses on binary relation between entity pairs within single sentence. Recently, the NLP community has gained interest in relation extraction in entity pairs spanning multiple sentences. In this paper, we propose a novel architecture for this task: inter-sentential dependency-based neural networks (iDepNN). iDepNN models the shortest and augmented dependency paths via recurrent and recursive neural networks to extract relationships within (intra-) and across (inter-) sentence boundaries. Compared to SVM and neural network baselines, iDepNN is more robust to false positives in relationships spanning sentences. We evaluate our models on four datasets from newswire (MUC6) and medical (BioNLP shared task) domains that achieve state-of-the-art performance and show a better balance in precision and recall for inter-sentential relationships. We perform better than 11 teams participating in the BioNLP shared task 2016 and achieve a gain of 5.2% (0.587 vs 0.558) in F1 over the winning team. We also release the crosssentence annotations for MUC6.
Pankaj Gupta 0003, Subburam Rajaram, Hinrich Schütze, Thomas A. Runkler
AAAI2
2018 Deep Temporal-Recurrent-Replicated-Softmax for Topical Trends over Time
abstract
Pankaj Gupta, Subburam Rajaram, Hinrich Schütze, Bernt Andrassy. Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers). 2018.
Pankaj Gupta 0003, Subburam Rajaram, Hinrich Schütze, Bernt Andrassy
NAACL-HLT2