Clare Voss

Clare Voss

Auto-generated profile, based on publicly available information

Clare Voss

Army Research Laboratory, Adelphi, MD, USA

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 August 2016
Verified
Conference Paper
Open access
XRXiang Ren
Xiang Ren
WHWenqi He
Wenqi He
MQMeng Qu
Meng Qu
CVClare R. Voss
Clare R. Voss
HJHeng Ji
Heng Ji
JHJiawei Han
Jiawei Han
Current systems of fine-grained entity typing use distant supervision in conjunction with existing knowledge bases to assign categories (type labels) to entity mentions. However, the type labels so obtained from knowledge bases are often noisy (i.e., incorrect for the entity mention's local context). We define a new task, Label Noise Reduction in Entity Typing (LNR), to be the automatic identification of correct type labels (type-paths) for training examples, given the set of candidate type labels obtained by distant supervision with a given type hierarchy. The unknown type labels for individual entity mentions and the semantic similarity between entity types pose unique challenges for solving the LNR task. We propose a general framework, called PLE, to jointly embed entity mentions, text features and entity types into the same low-dimensional space where, in that space, objects whose types are semantically close have similar representations. Then we estimate the type-path for each training example in a top-down manner using the learned embeddings. We formulate a global objective for learning the embeddings from text corpora and knowledge bases, which adopts a novel margin-based loss that is robust to noisy labels and faithfully models type correlation derived from knowledge bases. Our experiments on three public typing datasets demonstrate the effectiveness and robustness of PLE, with an average of 25% improvement in accuracy compared to next best method.

1 January 2016
Verified
Conference Paper
Open access
DLDi Lu
Di Lu
CVClare Voss
Clare Voss
FTFangbo Tao
Fangbo Tao
XRXiang Ren
Xiang Ren
RGRachel Guan
Rachel Guan
LKLance Kaplan
Lance Kaplan

2 March 2023
Verified
Report
Closed access
MMMatthew Marge
Matthew Marge
CBClaire Bonial
Claire Bonial
SLStephanie Lukin
Stephanie Lukin
CVClare Voss
Clare Voss

19 November 2014 in arXiv
Verified
Preprint
Open access
PDF file
AEAhmed El-Kishky
Ahmed El-Kishky
YSYanglei Song
Yanglei Song
CWChi Wang
Chi Wang
CVClare Voss
Clare Voss
JHJiawei Han
Jiawei Han
While most topic modeling algorithms model text corpora with unigrams, human interpretation often relies on inherent grouping of terms into phrases. As such, we consider the problem of discovering topical phrases of mixed lengths. Existing work either performs post processing to the inference results of unigram-based topic models, or utilizes complex n-gram-discovery topic models. These methods generally produce low-quality topical phrases or suffer from poor scalability on even moderately-sized datasets. We propose a different approach that is both computationally efficient and effective. Our solution combines a novel phrase mining framework to segment a document into single and multi-word phrases, and a new topic model that operates on the induced document partition. Our approach discovers high quality topical phrases with negligible extra cost to the bag-of-words topic model in a variety of datasets including research publication titles, abstracts, reviews, and news articles.

1 December 2002 in Machine Translation
Verified
Journal Article
Closed access
PDF file
CVClare R. Voss
Clare R. Voss
CECarol J. Van Ess-Dykema
Carol J. Van Ess-Dykema