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

Matthew Burgess

dblp:129/6756 · DBLP profile ↗
← Back
7ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0002-3750-4347ORCID · corroborated

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

Databases, data management, data science and information retrieval · 4 · 2 first-authorArtificial intelligence and machine learning · 3 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 2 · 1 first-authorSystems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Human-computer interaction and ubiquitous 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.

Databases, data mining, and information retrieval
2 papers
Information retrieval · 94% Data integration and cleaning · 6%
Artificial intelligence
2 papers
Language models and text generation · 61% Information extraction and text analysis · 30% Representation and self-supervised learning · 9%

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

TopicWeightPapersLastEvidence papers
Information retrieval › search engines
dataset search
0.412019
Google Dataset Search: Building a search engine for datasets in an open Web ecosystem · WWW 2019
Information retrieval
search engines
0.412019
Google Dataset Search: Building a search engine for datasets in an open Web ecosystem · WWW 2019
Natural language and speech › Language models and text generation › text generation › text simplification
lexical simplification
0.212016
SimpleScience: Lexical Simplification of Scientific Terminology · EMNLP 2016
Natural language and speech › Language models and text generation › text generation
text simplification
0.212016
SimpleScience: Lexical Simplification of Scientific Terminology · EMNLP 2016
Information retrieval › document processing › document analysis › text reuse detection
plagiarism detection
0.212016
The Legislative Influence Detector: Finding Text Reuse in State Legislation · KDD 2016
Information retrieval › document processing › document analysis
text reuse detection
0.212016
The Legislative Influence Detector: Finding Text Reuse in State Legislation · KDD 2016
Machine learning › Representation and self-supervised learning › word representation
word embedding
0.112016
SimpleScience: Lexical Simplification of Scientific Terminology · EMNLP 2016
Computational social science and digital humanities › legal informatics
legislative text analysis
0.112016
The Legislative Influence Detector: Finding Text Reuse in State Legislation · KDD 2016

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

semantic metadata · 0.4schema.org · 0.4word embeddings · 0.2
YearPublicationVenuePosition
2019 Google Dataset Search: Building a search engine for datasets in an open Web ecosystem
abstract
There are thousands of data repositories on the Web, providing access to millions of datasets. National and regional governments, scientific publishers and consortia, commercial data providers, and others publish data for fields ranging from social science to life science to high-energy physics to climate science and more. Access to this data is critical to facilitating reproducibility of research results, enabling scientists to build on others' work, and providing data journalists easier access to information and its provenance. In this paper, we discuss Google Dataset Search, a dataset-discovery tool that provides search capabilities over potentially all datasets published on the Web. The approach relies on an open ecosystem, where dataset owners and providers publish semantically enhanced metadata on their own sites. We then aggregate, normalize, and reconcile this metadata, providing a search engine that lets users find datasets in the “long tail” of the Web. In this paper, we discuss both social and technical challenges in building this type of tool, and the lessons that we learned from this experience.
Dan Brickley, Matthew Burgess, Natasha F. Noy
WWW2
2016 Prototype Synthesis for Model Laws
abstract
State legislatures often rely on existing text when drafting new bills.Resource and expertise constraints, which often drive this copying behavior, can be taken advantage of by lobbyists and special interest groups.These groups provide model bills, which encode policy agendas, with the intent that the models become actual law.Unfortunately, model legislation is often opaque to the public-both in source and content.In this paper we present LOBBYBACK, a system that reverse engineers model legislation from observed text.LOBBYBACK identifies clusters of bills which have text reuse and generates "prototypes" that represent a canonical version of the text shared between the documents.We demonstrate that LOBBY-BACK accurately reconstructs model legislation and apply it to a dataset of over 550k bills.
Matthew Burgess, Eugenia Giraudy, Eytan Adar
ACL (1)1
2016 SimpleScience: Lexical Simplification of Scientific Terminology
abstract
Lexical simplification of scientific terms represents a unique challenge due to the lack of a standard parallel corpora and fast rate at which vocabulary shift along with research.We introduce SimpleScience, a lexical simplification approach for scientific terminology.We use word embeddings to extract simplification rules from a parallel corpora containing scientific publications and Wikipedia.To evaluate our system we construct SimpleSciGold, a novel gold standard set for science-related simplifications.We find that our approach outperforms prior context-aware approaches at generating simplifications for scientific terms.
Yea-Seul Kim, Jessica Hullman, Matthew Burgess, Eytan Adar
EMNLP3
2016 The Legislative Influence Detector: Finding Text Reuse in State Legislation
abstract
State legislatures introduce at least 45,000 bills each year. However, we lack a clear understanding of who is actually writing those bills. As legislators often lack the time and staff to draft each bill, they frequently copy text written by other states or interest groups. However, existing approaches to detect text reuse are slow, biased, and incomplete. Journalists or researchers who want to know where a particular bill originated must perform a largely manual search. Watchdog organizations even hire armies of volunteers to monitor legislation for matches. Given the time-consuming nature of the analysis, journalists and researchers tend to limit their analysis to a subset of topics (e.g. abortion or gun control) or a few interest groups.
Matthew Burgess, Eugenia Giraudy, Julian Katz-Samuels, Joe Walsh, Derek Willis, Lauren Haynes, Rayid Ghani
KDD1
2013 Brainwash: A Data System for Feature Engineering
Michael R. Anderson, Dolan Antenucci, Victor Bittorf, Matthew Burgess, Michael J. Cafarella, Arun Kumar 0001, Feng Niu, Yongjoo Park, Christopher Ré, Ce Zhang 0001
CIDR4
2013 Machine learning-based anomaly detection for post-silicon bug diagnosis
abstract
The exponentially growing complexity of modern processors intensifies verification challenges. Traditional pre-silicon verification covers less and less of the design space, resulting in increasing post-silicon validation effort. A critical challenge is the manual debugging of intermittent failures on prototype chips, where multiple executions of a same test do not yield a consistent outcome. We leverage the power of machine learning to support automatic diagnosis of these difficult, inconsistent bugs. During post-silicon validation, lightweight hardware logs a compact measurement of observed signal activity over multiple executions of a same test: some may pass, somemay fail. Our novel algorithm applies anomaly detection techniques similar to those used to detect credit card fraud to identify the approximate cycle of a bug's occurrence and a set of candidate root-cause signals. Compared against other state-of-the-art solutions in this space, our new approach can locate the time of a bug's occurrence with nearly 4x better accuracy when applied to the complex OpenSPARC T2 design.
Andrew DeOrio, Qingkun Li, Matthew Burgess, Valeria Bertacco
DATE3
2013 Leveraging Noisy Lists for Social Feed Ranking
Matthew Burgess, Alessandra Mazzia, Eytan Adar, Michael J. Cafarella
ICWSM1