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

Rajarshi Bhowmik

dblp:220/4104 · DBLP profile ↗
← Back
5ranked-venue papers
4as first author
1since 2021 · last 2024
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 3 first-authorArtificial intelligence and machine learning · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 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
3 papers
Language models and text generation · 56% Information extraction and text analysis · 44%
Databases, data mining, and information retrieval
3 papers
Knowledge graphs · 76% Information retrieval · 12% Data integration and cleaning · 12%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Language models and text generation
text generation
0.722019
Be Concise and Precise: Synthesizing Open-Domain Entity Descriptions from Facts · WWW 2019
Generating Fine-Grained Open Vocabulary Entity Type Descriptions · ACL (1) 2018
Natural language and speech › Language models and text generation › text generation › neural text generation
copy mechanism
0.412019
Be Concise and Precise: Synthesizing Open-Domain Entity Descriptions from Facts · WWW 2019
Natural language and speech › Information extraction and text analysis
text classification
0.412019
Domain-Independent Automated Processing of Free-Form Text Data in Telecom · ICDE 2019
Natural language and speech › Information extraction and text analysis › knowledge discovery from text
topic detection
0.412019
Domain-Independent Automated Processing of Free-Form Text Data in Telecom · ICDE 2019
Natural language and speech › Information extraction and text analysis › text classification
unsupervised text classification
0.412019
Domain-Independent Automated Processing of Free-Form Text Data in Telecom · ICDE 2019
Natural language and speech › Language models and text generation › text generation › data-to-text generation
entity description generation
0.312018
Generating Fine-Grained Open Vocabulary Entity Type Descriptions · ACL (1) 2018
Data integration and cleaning
entity disambiguation
0.112019
Be Concise and Precise: Synthesizing Open-Domain Entity Descriptions from Facts · WWW 2019
Information retrieval
text analysis
0.112019
Domain-Independent Automated Processing of Free-Form Text Data in Telecom · ICDE 2019

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

unsupervised learning · 0.8multi-stage text processing pipeline · 0.8encoder-decoder model · 0.8copy mechanism · 0.8fact embeddings · 0.7dynamic memory network · 0.7
YearPublicationVenuePosition
2024 Unsupervised Contrast-Consistent Ranking with Language Models
abstract
Niklas Stoehr, Pengxiang Cheng, Jing Wang, Daniel Preotiuc-Pietro, Rajarshi Bhowmik. Proceedings of the 18th Conference of the European Chapter of the Association for Computational Linguistics (Volume 1: Long Papers). 2024.
Niklas Stoehr, Pengxiang Cheng 0001, Jing Wang 0069, Daniel Preotiuc-Pietro, Rajarshi Bhowmik
EACL (1)5
2020 Explainable Link Prediction for Emerging Entities in Knowledge Graphs
Rajarshi Bhowmik, Gerard de Melo
ISWC (1)1
2019 Domain-Independent Automated Processing of Free-Form Text Data in Telecom
abstract
Free-form, unstructured and semi-structured textual data has become increasingly more prevalent in the telecommunications industry, with service and equipment providers alike. Some typical examples include textual data from customer care tickets, machine logs, alarm and alerting systems, and diagnostics. There is a growing business need to rapidly and automatically understand the underlying key topics and categories of this bulk collection of text. With the present mode of operation of relying on domain experts to analyze textual data, there is a clear need to apply text analytics to automate the process. Difficulties arise due to the jargon-filled and fragmented, incomplete nature of textual data in this field. In this paper, we propose a domain-agnostic, unsupervised approach that deploys a multi-stage text processing pipeline for automatically discovering the key topics and categories from free-form text documents. Using anonymized datasets retrieved from actual customer care tickets and system logs, we show that our approach outperforms traditional text mining approaches, and performs comparably to manual categorization tasks that were undertaken by domain experts with full system knowledge.
Rajarshi Bhowmik, Ahmet A. Akyamaç
ICDE1
2019 Be Concise and Precise: Synthesizing Open-Domain Entity Descriptions from Facts
abstract
Despite being vast repositories of factual information, cross-domain knowledge graphs, such as Wikidata and the Google Knowledge Graph, only sparsely provide short synoptic descriptions for entities. Such descriptions that briefly identify the most discernible features of an entity provide readers with a near-instantaneous understanding of what kind of entity they are being presented. They can also aid in tasks such as named entity disambiguation, ontological type determination, and answering entity queries. Given the rapidly increasing numbers of entities in knowledge graphs, a fully automated synthesis of succinct textual descriptions from underlying factual information is essential. To this end, we propose a novel fact-to-sequence encoder-decoder model with a suitable copy mechanism to generate concise and precise textual descriptions of entities. In an in-depth evaluation, we demonstrate that our method significantly outperforms state-of-the-art alternatives.
Rajarshi Bhowmik, Gerard de Melo
WWW1
2018 Generating Fine-Grained Open Vocabulary Entity Type Descriptions
abstract
While large-scale knowledge graphs provide vast amounts of structured facts about entities, a short textual description can often be useful to succinctly characterize an entity and its type.Unfortunately, many knowledge graph entities lack such textual descriptions.In this paper, we introduce a dynamic memory-based network that generates a short open vocabulary description of an entity by jointly leveraging induced fact embeddings as well as the dynamic context of the generated sequence of words.We demonstrate the ability of our architecture to discern relevant information for more accurate generation of type description by pitting the system against several strong baselines.
Rajarshi Bhowmik, Gerard de Melo
ACL (1)1