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

Sam Anzaroot

dblp:88/10440 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 1 first-authorComputer networks · 1Databases, data management, data science and information retrieval · 1Graphics, 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.

Databases, data mining, and information retrieval
2 papers
Data mining · 58% Machine learning and data management · 25% Information retrieval · 17%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Computational social science and digital humanities · 100%
Artificial intelligence
2 papers
Information extraction and text analysis · 100%
Human-computer interaction and pervasive computing
1 paper
Ubiquitous computing and smart environments · 100%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities › social computing
crisis informatics
0.412020
Unsupervised Detection of Sub-Events in Large Scale Disasters · AAAI 2020
Data mining
text mining
0.412020
Unsupervised Detection of Sub-Events in Large Scale Disasters · AAAI 2020
Ubiquitous computing and smart environments
social sensing
0.112012
Free-form text summarization in social sensing · IPSN 2012
Information retrieval › document processing › document analysis › document representation
semantic embedding
0.112020
Unsupervised Detection of Sub-Events in Large Scale Disasters · AAAI 2020
Mathematical optimization › continuous optimization
convex optimization
0.112014
Learning Soft Linear Constraints with Application to Citation Field Extraction · ACL (1) 2014
Mathematical optimization › large-scale optimization › decomposition methods
dual decomposition
0.112014
Learning Soft Linear Constraints with Application to Citation Field Extraction · ACL (1) 2014
Natural language and speech › Information extraction and text analysis
event extraction
0.012012
Free-form text summarization in social sensing · IPSN 2012

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

semantic embedding · 0.9noun-verb pair extraction · 0.9clustering · 0.9structured prediction · 0.6dual decomposition · 0.6convex optimization · 0.6text summarization · 0.3
YearPublicationVenuePosition
2020 Unsupervised Detection of Sub-Events in Large Scale Disasters
abstract
Social media plays a major role during and after major natural disasters (e.g., hurricanes, large-scale fires, etc.), as people “on the ground” post useful information on what is actually happening. Given the large amounts of posts, a major challenge is identifying the information that is useful and actionable. Emergency responders are largely interested in finding out what events are taking place so they can properly plan and deploy resources. In this paper we address the problem of automatically identifying important sub-events (within a large-scale emergency “event”, such as a hurricane). In particular, we present a novel, unsupervised learning framework to detect sub-events in Tweets for retrospective crisis analysis. We first extract noun-verb pairs and phrases from raw tweets as sub-event candidates. Then, we learn a semantic embedding of extracted noun-verb pairs and phrases, and rank them against a crisis-specific ontology. We filter out noisy and irrelevant information then cluster the noun-verb pairs and phrases so that the top-ranked ones describe the most important sub-events. Through quantitative experiments on two large crisis data sets (Hurricane Harvey and the 2015 Nepal Earthquake), we demonstrate the effectiveness of our approach over the state-of-the-art. Our qualitative evaluation shows better performance compared to our baseline.
Chidubem Arachie, Manas Gaur, Sam Anzaroot, William Groves, Ke Zhang 0013, Alejandro Jaimes
AAAI3
2014 Learning Soft Linear Constraints with Application to Citation Field Extraction
abstract
Accurately segmenting a citation string into fields for authors, titles, etc. is a challenging task because the output typically obeys various global constraints.Previous work has shown that modeling soft constraints, where the model is encouraged, but not require to obey the constraints, can substantially improve segmentation performance.On the other hand, for imposing hard constraints, dual decomposition is a popular technique for efficient prediction given existing algorithms for unconstrained inference.We extend dual decomposition to perform prediction subject to soft constraints.Moreover, with a technique for performing inference given soft constraints, it is easy to automatically generate large families of constraints and learn their costs with a simple convex optimization problem during training.This allows us to obtain substantial gains in accuracy on a new, challenging citation extraction dataset.
Sam Anzaroot, Alexandre Tachard Passos, David Belanger 0002, Andrew McCallum
ACL (1)1
2012 Free-form text summarization in social sensing
abstract
This demonstration illustrates an information aggregation and summarization service for social sensing applications. Social sensing, using mobile phones and other networked devices in the possession of individuals, has gained significant popularity in recent years. In some cases, the information collected is structured, such as numeric data from temperature sensors, accelerometers, or GPS devices. Aggregate statistical properties, such as expected values, standard deviations, and outliers, can be easily computed, and can be used to summarize the data set. In other cases, however, the collection includes unstructured data types such as text or images with textual annotations. The concepts of expected values and outliers are harder to define, yet it is still important to be able to aggregate and summarize the data. We demonstrate a system which can automatically summarize real-time textual data common to social sensing applications. Specifically, we focus on text messages that describe events in the environment. The output of our service provides a reliable summary of observations that can be used in many contexts from military intelligence to participatory sensing campaigns.
Hongzhao Huang, Sam Anzaroot, Heng Ji 0001, Hieu Khac Le, Dong Wang 0002, Tarek F. Abdelzaher
IPSN2
2011 Joint inference for cross-document information extraction
abstract
Previous information extraction (IE) systems are typically organized as a pipeline architecture of separated stages which make independent local decisions. When the data grows beyond some certain size, the extracted facts become inter-dependent and thus we can take advantage of information redundancy to conduct reasoning across documents and improve the performance of IE. We describe a joint inference approach based on information network structure to conduct cross-fact reasoning with an integer linear programming framework. Without using any additional labeled data this new method obtained 13.7%-24.4% user browsing cost reduction over a state-of-the-art IE system which extracts various types of facts independently.
Qi Li 0014, Sam Anzaroot, Wen-Pin Lin, Xiang Li 0066, Heng Ji 0001
CIKM2