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

Lee Martie

dblp:116/6867 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
2since 2021 · last 2022
—ORCID · none

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

Software engineering, systems software and programming languages · 4 · 4 first-authorArtificial intelligence and machine learning · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021

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
1 paper
Knowledge representation and reasoning · 56% Information extraction and text analysis · 44%
Databases, data mining, and information retrieval
1 paper
Knowledge graphs · 50% Web and social media mining · 50%
Software engineering, system software, and programming languages
2 papers
Software maintenance and evolution · 92% Empirical software engineering · 8%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
causal reasoning
0.612022
Knowledge-Based News Event Analysis and Forecasting Toolkit · IJCAI 2022
Natural language and speech › Information extraction and text analysis › event analysis
event prediction
0.612022
Knowledge-Based News Event Analysis and Forecasting Toolkit · IJCAI 2022
Knowledge graphs › temporal knowledge graph
event knowledge graph
0.612022
Knowledge-Based News Event Analysis and Forecasting Toolkit · IJCAI 2022
Web and social media mining › news analysis
news event analysis
0.612022
Knowledge-Based News Event Analysis and Forecasting Toolkit · IJCAI 2022
Software maintenance and evolution
code search
0.522017
Understanding the impact of support for iteration on code search · ESEC/SIGSOFT FSE 2017
CodeExchange: Supporting Reformulation of Internet-Scale Code Queries in Context (T) · ASE 2015
Software maintenance and evolution › code search
query reformulation
0.212015
CodeExchange: Supporting Reformulation of Internet-Scale Code Queries in Context (T) · ASE 2015
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge acquisition › knowledge extraction
causal knowledge extraction
0.212022
Knowledge-Based News Event Analysis and Forecasting Toolkit · IJCAI 2022
Empirical software engineering
developer studies
0.112015
CodeExchange: Supporting Reformulation of Internet-Scale Code Queries in Context (T) · ASE 2015

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

neuro-symbolic techniques · 1.1knowledge graph reasoning · 1.1user study · 0.3laboratory study · 0.2field deployment · 0.2
YearPublicationVenuePosition
2022 Knowledge-Based News Event Analysis and Forecasting Toolkit
abstract
We present a toolkit for knowledge-based news event analysis and forecasting. The toolkit is powered by a Knowledge Graph (KG) of events curated from structured and unstructured sources of event-related knowledge. The toolkit provides functions for 1) mapping ongoing news headlines to concepts in the KG, 2) retrieval, reasoning, and visualization for causal analysis and forecasting, and 3) extraction of causal knowledge from text documents to augment the KG with additional domain knowledge. Each function has a number of implementations using a wide range of state-of-the-art neuro-symbolic techniques. We show how the toolkit enables building a human-in-the-loop explainable solution for event analysis and forecasting.
Oktie Hassanzadeh, Parul Awasthy, Ken Barker 0002, Onkar Bhardwaj, Debarun Bhattacharjya, Mark Feblowitz, Lee Martie, Jian Ni, Kavitha Srinivas, Lucy Yip
IJCAI7
2022 Distributed adversarial training to robustify deep neural networks at scale
abstract
Current deep neural networks (DNNs) are vulnerable to adversarial attacks, where adversarial perturbations to the inputs can change or manipulate classification. To defend against such attacks, an effective and popular approach, known as adversarial training (AT), has been shown to mitigate the negative impact of adversarial attacks by virtue of a min-max robust training method. While effective, it remains unclear whether it can successfully be adapted to the distributed learning context. The power of distributed optimization over multiple machines enables us to scale up robust training over large models and datasets. Spurred by that, we propose distributed adversarial training (DAT), a large-batch adversarial training framework implemented over multiple machines. We show that DAT is general, which supports training over labeled and unlabeled data, multiple types of attack generation methods, and gradient compression operations favored for distributed optimization. Theoretically, we provide, under standard conditions in the optimization theory, the convergence rate of DAT to the first-order stationary points in general non-convex settings. Empirically, we demonstrate that DAT either matches or outperforms state-of-the-art robust accuracies and achieves a graceful training speedup (e.g., on ResNet-50 under ImageNet). Codes are available at https://github.com/dat-2022/dat.
Gaoyuan Zhang, Songtao Lu, Xiangyi Chen, Quanfu Fan, Lee Martie, Lior Horesh, Mingyi Hong 0001, Sijia Liu 0001
UAI7
2017 Understanding the impact of support for iteration on code search
abstract
Sometimes, when programmers use a search engine they know more or less what they need. Other times, programmers use the search engine to look around and generate possible ideas for the programming problem they are working on. The key insight we explore in this paper is that the results found in the latter case tend to serve as inspiration or triggers for the next queries issued. We introduce two search engines, CodeExchange and CodeLikeThis, both of which are specifically designed to enable the user to directly leverage the results in formulating the next query. CodeExchange does this with a set of four features supporting the programmer to use characteristics of the results to find other code with or without those characteristics. CodeLikeThis supports simply selecting an entire result to find code that is analogous, to some degree, to that result. We evaluated how these approaches were used along with two approaches not explicitly supporting iteration, a baseline and Google, in a user study among 24 developers. We find that search engines that support using results to form the next query can improve the programmers’ search experience and different approaches to iteration can provide better experiences depending on the task.
Lee Martie, André van der Hoek, Thomas Kwak
ESEC/SIGSOFT FSE1
2015 CodeExchange: Supporting Reformulation of Internet-Scale Code Queries in Context (T)
abstract
Programming today regularly involves searching for source code online, whether through a general search engine such as Google or a specialized code search engine such as SearchCode, Ohloh, or GitHub. Searching typically is an iterative process, with developers adjusting the keywords they use based on the results of the previous query. However, searching in this manner is not ideal, because just using keywords places limits on what developers can express as well as the overall interaction that is required. Based on the observation that the results from one query create a con-text in which a next is formulated, we present CodeExchange, a new code search engine that we developed to explicitly leverage this context to support fluid, expressive reformulation of queries. We motivate the need for CodeExchange, highlight its key design decisions and overall architecture, and evaluate its use in both a field deployment and a laboratory study.
Lee Martie, Thomas D. LaToza, André van der Hoek
ASE1
2015 Sameness: An Experiment in Code Search
abstract
To date, most dedicated code search engines use ranking algorithms that focus only on the relevancy between the query and the results. In practice, this means that a developer may receive search results that are all drawn from the same project, all implement the same algorithm using the same external library, or all exhibit the same complexity or size, among other possibilities that are less than ideal. In this paper, we propose that code search engines should also locate both diverse and concise (brief but complete) sets of code results. We present four novel algorithms that use relevance, diversity, and conciseness in ranking code search results. To evaluate these algorithms and the value of diversity and conciseness in code search, twenty-one professional programmers were asked to compare pairs of top ten results produced by competing algorithms. We found that two of our new algorithms produce top ten results that are strongly preferred by the programmers.
Lee Martie, André van der Hoek
MSR1
2012 Trendy bugs: Topic trends in the Android bug reports
abstract
Studying vast volumes of bug and issue discussions can give an understanding of what the community has been most concerned about, however the magnitude of documents can overload the analyst. We present an approach to analyze the development of the Android open source project by observing trends in the bug discussions in the Android open source project public issue tracker. This informs us of the features or parts of the project that are more problematic at any given point of time. In turn, this can be used to aid resource allocation (such as time and man power) to parts or features. We support these ideas by presenting the results of issue topic distributions over time using statistical analysis of the bug descriptions and comments for the Android open source project. Furthermore, we show relationships between those time distributions and major development releases of the Android OS.
Lee Martie, Vijay Krishna Palepu, Hitesh Sajnani, Cristina V. Lopes
MSR1