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

Busra Celikkaya

dblp:230/7912 · also E. Busra Celikkaya, Emine Busra Celikkaya · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0002-7679-288XORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 2 first-authorGraphics, 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
3 papers
Information extraction and text analysis · 81% Probabilistic and Bayesian machine learning · 19%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Medical and health informatics · 100%

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

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis › entity linking
biomedical entity linking
0.412020
LATTE: Latent Type Modeling for Biomedical Entity Linking · AAAI 2020
Natural language and speech › Information extraction and text analysis
entity linking
0.412020
LATTE: Latent Type Modeling for Biomedical Entity Linking · AAAI 2020
Data integration and cleaning
entity disambiguation
0.412020
LATTE: Latent Type Modeling for Biomedical Entity Linking · AAAI 2020
Natural language and speech › Information extraction and text analysis
named entity recognition
0.412019
Joint Entity Extraction and Assertion Detection for Clinical Text · ACL (1) 2019
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference › approximate inference
variational inference
0.212014
Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes · ICML 2014
Medical and health informatics › clinical text processing
clinical text annotation
0.112020
LATTE: Latent Type Modeling for Biomedical Entity Linking · AAAI 2020
Medical and health informatics
clinical text processing
0.112019
Joint Entity Extraction and Assertion Detection for Clinical Text · ACL (1) 2019
Algorithms and data structures › numerical linear algebra › matrix function
matrix exponential computation
0.112014
Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes · ICML 2014

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

latent variable modeling · 1.3joint learning · 1.3multi-task learning · 0.8hierarchical encoder-decoder · 0.8conditional softmax shared decoder · 0.8sum of time-ordered products · 0.4matrix exponential expansion · 0.4
YearPublicationVenuePosition
2020 LATTE: Latent Type Modeling for Biomedical Entity Linking
abstract
Entity linking is the task of linking mentions of named entities in natural language text, to entities in a curated knowledge-base. This is of significant importance in the biomedical domain, where it could be used to semantically annotate a large volume of clinical records and biomedical literature, to standardized concepts described in an ontology such as Unified Medical Language System (UMLS). We observe that with precise type information, entity disambiguation becomes a straightforward task. However, fine-grained type information is usually not available in biomedical domain. Thus, we propose LATTE, a LATent Type Entity Linking model, that improves entity linking by modeling the latent fine-grained type information about mentions and entities. Unlike previous methods that perform entity linking directly between the mentions and the entities, LATTE jointly does entity disambiguation, and latent fine-grained type learning, without direct supervision. We evaluate our model on two biomedical datasets: MedMentions, a large scale public dataset annotated with UMLS concepts, and a de-identified corpus of dictated doctor's notes that has been annotated with ICD concepts. Extensive experimental evaluation shows our model achieves significant performance improvements over several state-of-the-art techniques.
Ming Zhu 0015, Busra Celikkaya, Parminder Bhatia, Chandan K. Reddy
AAAI2
2019 Joint Entity Extraction and Assertion Detection for Clinical Text
abstract
Negative medical findings are prevalent in clinical reports, yet discriminating them from positive findings remains a challenging task for information extraction.Most of the existing systems treat this task as a pipeline of two separate tasks, i.e., named entity recognition (NER) and rule-based negation detection.We consider this as a multi-task problem and present a novel end-to-end neural model to jointly extract entities and negations.We extend a standard hierarchical encoder-decoder NER model and first adopt a shared encoder followed by separate decoders for the two tasks.This architecture performs considerably better than the previous rule-based and machine learning-based systems.To overcome the problem of increased parameter size especially for low-resource settings, we propose the Conditional Softmax Shared Decoder architecture which achieves state-of-art results for NER and negation detection on the 2010 i2b2/VA challenge dataset and a proprietary de-identified clinical dataset.
Parminder Bhatia, Busra Celikkaya, Mohammad Khalilia
ACL (1)2
2019 Towards Fast and Unified Transfer Learning Architectures for Sequence Labeling
abstract
Sequence labeling systems have advanced continuously using neural architectures over the past several years. However, these tasks require large sets of annotated data to achieve such performance. In particular, we focus on the Named Entity Recognition (NER) task on clinical notes, which is one of the most fundamental and critical problems for medical text analysis. Our work centers on effectively adapting these neural architectures towards low-resource settings using parameter transfer methods. We complement a standard hierarchical NER model with a general transfer learning framework, the Tunable Transfer Network (TTN) consisting of parameter sharing between the source and target tasks, and showcase scores significantly above the baseline architecture. Our best TTN model achieves 2-5% improvement over pre-trained language model BERT as well as its multi task extension MT-DNN in low resource settings. However, our proposed sharing scheme requires an exponential search over tied parameter sets to generate an optimal configuration. To mitigate the problem of exhaustively searching for model optimization, we propose the Dynamic Transfer Networks (DTN), a gated architecture which learns the appropriate parameter sharing scheme between source and target datasets. DTN achieves the improvements of the optimized transfer learning framework with just a single training setting, effectively removing the need for an exponential search.
Parminder Bhatia, Kristjan Arumae, Busra Celikkaya
ICMLA3
2019 Comprehend Medical: A Named Entity Recognition and Relationship Extraction Web Service
abstract
Comprehend Medical is a stateless and Health Insurance Portability and Accountability Act (HIPAA) eligible Named Entity Recognition (NER) and Relationship Extraction (RE) service launched under Amazon Web Services (AWS) trained using state-of-the-art deep learning models. Contrary to many existing open source tools, Comprehend Medical is scalable and does not require steep learning curve, dependencies, pipeline configurations, or installations. Currently, Comprehend Medical performs NER in five medical categories: Anatomy, Medical Condition, Medications, Protected Health Information (PHI) and Treatment, Test and Procedure (TTP). Additionally, the service provides relationship extraction for the detected entities as well as contextual information such as negation and temporality in the form of traits. Comprehend Medical provides two Application Programming Interfaces (API): 1) the NERe API which returns all the extracted named entities, their traits and the relationships between them and 2) the PHId API which returns just the protected health information contained in the text. Furthermore, Comprehend Medical is accessible through AWS Console, Java and Python Software Development Kit (SDK), making it easier for non-developers and developers to use.
Parminder Bhatia, Busra Celikkaya, Mohammad Khalilia, Selvan Senthivel
ICMLA2
2014 Deterministic Anytime Inference for Stochastic Continuous-Time Markov Processes
abstract
We describe a deterministic anytime method for calculating filtered and smoothed distributions in large variable-based continuous time Markov processes. Prior non-random algorithms do not converge to the true distribution in the limit of infinite computation time. Sampling algorithms give different results each time run, which can lead to instability when used inside expectation-maximization or other algorithms. Our method combines the anytime convergent properties of sampling with the non-random nature of variational approaches. It is built upon a sum of time-ordered products, an expansion of the matrix exponential. We demonstrate that our method performs as well as or better than the current best sampling approaches on benchmark problems.
Busra Celikkaya, Christian R. Shelton
ICML1
2011 Factored Filtering of Continuous-Time Systems
Busra Celikkaya, Christian R. Shelton, William Lam
UAI1