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.

Pamela Bhattacharya

dblp:07/9103 · DBLP profile ↗
← Back
11ranked-venue papers
8as first author
2since 2021 · last 2023
—ORCID · none

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

Software engineering, systems software and programming languages · 8 · 7 first-authorArtificial intelligence and machine learning · 3 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 3 · 2 first-author · 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
2 papers
Deep learning architectures and training · 32% Learning theory · 32% Information extraction and text analysis · 21%
Software engineering, system software, and programming languages
3 papers
Software maintenance and evolution · 67% Empirical software engineering · 33%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 77% Knowledge graphs · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
convolutional neural network
0.712023
Mind the Pool: Convolutional Neural Networks Can Overfit Input Size · ICLR 2023
Machine learning › Learning theory
generalization
0.712023
Mind the Pool: Convolutional Neural Networks Can Overfit Input Size · ICLR 2023
Web and social media mining
misinformation detection
0.612022
Joint International Workshop on Misinformation and Misbehavior Mining on the Web & Making a Credible Web for Tomorrow (MIS2-TrueFact) · KDD 2022
Software maintenance and evolution
software evolution
0.322012
Graph-based analysis and prediction for software evolution · ICSE 2012
Using software evolution history to facilitate development and maintenance · ICSE 2011
Software maintenance and evolution › software quality assurance
software quality prediction
0.322012
Graph-based analysis and prediction for software evolution · ICSE 2012
Using software evolution history to facilitate development and maintenance · ICSE 2011
Empirical software engineering › mining software repositories
defect prediction
0.112012
Graph-based analysis and prediction for software evolution · ICSE 2012
Software maintenance and evolution
software maintenance
0.112012
Graph-based analysis and prediction for software evolution · ICSE 2012
Empirical software engineering
mining software repositories
0.112011
Using software evolution history to facilitate development and maintenance · ICSE 2011

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

pooling · 0.7sequence labeling · 0.4neural entity recognition · 0.4graph topology analysis · 0.1graph mining · 0.1statistical analysis · 0.1
YearPublicationVenuePosition
2023 Mind the Pool: Convolutional Neural Networks Can Overfit Input Size
Bilal Alsallakh, David Yan, Narine Kokhlikyan, Vivek Miglani, Orion Reblitz-Richardson, Pamela Bhattacharya
ICLR6
2022 Joint International Workshop on Misinformation and Misbehavior Mining on the Web & Making a Credible Web for Tomorrow (MIS2-TrueFact)
abstract
The MIS2-TrueFact is geared towards bringing academic, industry, and government researchers and practitioners together to tackle the challenges in misinformation, misbehavior, and data quality issues on the web with heterogeneous and multi-modal sources of information including texts, images, videos, relational data, social networks, and knowledge graphs.
Pamela Bhattacharya, Jing Gao 0004, Meng Jiang 0001, Mehran Kafai, Srijan Kumar, Qi Li 0012, Neil Shah, Sihong Xie, Philip S. Yu, Ming Zeng 0001
KDD1
2020 To Schedule or not to Schedule: Extracting Task Specific Temporal Entities and Associated Negation Constraints
abstract
State of the art research for date-time 1 entity extraction from text is task agnostic.Consequently, while the methods proposed in literature perform well for generic date-time extraction from texts, they don't fare as well on task specific date-time entity extraction where only a subset of the date-time entities present in the text are pertinent to solving the task.Furthermore, some tasks require identifying negation constraints associated with the date-time entities to correctly reason over time.We showcase a novel model for extracting task-specific date-time entities along with their negation constraints.We show the efficacy of our method on the task of date-time understanding in the context of scheduling meetings for an email-based digital AI scheduling assistant.Our method achieves an absolute gain of 19% f-score points compared to baseline methods in detecting the date-time entities relevant to scheduling meetings and a 4% improvement over baseline methods for detecting negation constraints over date-time entities.
Barun Patra, Chala Fufa, Pamela Bhattacharya, Charles Lee
EMNLP (1)3
2014 Determining Developers' Expertise and Role: A Graph Hierarchy-Based Approach
abstract
Determining contributors' expertise, role, and individual importance are fundamental for assessing their impact on a software project. Currently-used expertise metrics are agnostic to contributor roles and can lead to incorrect characterizations. To address these issues, we operationalize contributor expertise and role. First, we revisit current expertise metrics and show that their use bundles many different aspects, creating ambiguity. Second, we introduce clearly-defined contributor roles, which capture multiple project facets. Third, we propose a graph model, based on contributor collaborations, that captures the hierarchical structure of the contributor community in a concise yet informative way. We demonstrate the model's usefulness in two ways: (a) for identifying the structure and evolution of contributor interactions, (b) for predicting contributor roles. We substantiate our study using two large open-source projects, Fire fox and Eclipse. Our systematic approach clarifies and isolates contributor role and expertise, and sheds light onto the dynamics of contributors within software projects.
Pamela Bhattacharya, Iulian Neamtiu, Michalis Faloutsos
ICSME1
2012 Graph-based analysis and prediction for software evolution
abstract
We exploit recent advances in analysis of graph topology to better understand software evolution, and to construct predictors that facilitate software development and maintenance. Managing an evolving, collaborative software system is a complex and expensive process, which still cannot ensure software reliability. Emerging techniques in graph mining have revolutionized the modeling of many complex systems and processes. We show how we can use a graph-based characterization of a software system to capture its evolution and facilitate development, by helping us estimate bug severity, prioritize refactoring efforts, and predict defect-prone releases. Our work consists of three main thrusts. First, we construct graphs that capture software structure at two different levels: (a) the product, i.e., source code and module level, and (b) the process, i.e., developer collaboration level. We identify a set of graph metrics that capture interesting properties of these graphs. Second, we study the evolution of eleven open source programs, including Firefox, Eclipse, MySQL, over the lifespan of the programs, typically a decade or more. Third, we show how our graph metrics can be used to construct predictors for bug severity, high-maintenance software parts, and failure-prone releases. Our work strongly suggests that using graph topology analysis concepts can open many actionable avenues in software engineering research and practice.
Pamela Bhattacharya, Marios Iliofotou, Iulian Neamtiu, Michalis Faloutsos
ICSE1
2012 Mining challenge 2012: The Android platform
abstract
The MSR Challenge offers researchers and practitioners in the area of Mining Software Repositories a common data set and asks them to put their mining tools and approaches on a dare. This year, the challenge is on the Android platform. We provided the change and bug report data for the Android platform asked researchers to uncover interesting findings related to the Android platform. In this paper, we describe the role of the MSR Challenge, highlight the data provided and summarize the papers accepted for inclusion in this year's challenge.
Emad Shihab, Yasutaka Kamei, Pamela Bhattacharya
MSR3
2012 Automated, highly-accurate, bug assignment using machine learning and tossing graphs
Pamela Bhattacharya, Iulian Neamtiu, Christian R. Shelton
J. Syst. Softw.1
2011 Using software evolution history to facilitate development and maintenance
abstract
Much research in software engineering have been focused on improving software quality and automating the maintenance process to reduce software costs and mitigating complications associated with the evolution process. Despite all these efforts, there are still high cost and effort associated with software bugs and software maintenance, software still continues to be unreliable, and software bugs can wreak havoc on software producers and consumers alike. My dissertation aims to advance the state-of-art in software evolution research by designing tools that can measure and predict software quality and to create integrated frameworks that helps in improving software maintenance and research that involves mining software repositories.
Pamela Bhattacharya
ICSE1
2011 Assessing programming language impact on development and maintenance: a study on c and c++
abstract
Billions of dollars are spent every year for building and maintaining software. To reduce these costs we must identify the key factors that lead to better software and more productive development. One such key factor, and the focus of our paper, is the choice of programming language. Existing studies that analyze the impact of choice of programming language suffer from several deficiencies with respect to methodology and the applications they consider. For example, they consider applications built by different teams in different languages, hence fail to control for developer competence, or they consider small-sized, infrequently-used, short-lived projects. We propose a novel methodology which controls for development process and developer competence, and quantifies how the choice of programming language impacts software quality and developer productivity. We conduct a study and statistical analysis on a set of long-lived, widely-used, open source projects - Firefox, Blender, VLC, and MySQL. The key novelties of our study are: (1) we only consider projects which have considerable portions of development in two languages, C and C++, and (2) a majority of developers in these projects contribute to both C and C++ code bases. We found that using C++ instead of C results in improved software quality and reduced maintenance effort, and that code bases are shifting from C to C++. Our methodology lays a solid foundation for future studies on comparative advantages of particular programming languages.
Pamela Bhattacharya, Iulian Neamtiu
ICSE1
2011 Bug-fix time prediction models: can we do better?
abstract
Predicting bug-fix time is useful in several areas of software evolution, such as predicting software quality or coordinating development effort during bug triaging. Prior work has proposed bug-fix time prediction models that use various bug report attributes (e.g., number of developers who participated in fixing the bug, bug severity, number of patches, bug-opener's reputation) for estimating the time it will take to fix a newly-reported bug. In this paper we take a step towards constructing more accurate and more general bug-fix time prediction models by showing how existing models fail to validate on large projects widely-used in bug studies. In particular, we used multivariate and univariate regression testing to test the prediction significance of existing models on 512,474 bug reports from five open source projects: Eclipse, Chrome and three products from the Mozilla project (Firefox, Seamonkey and Thunderbird). The results of our regression testing indicate that the predictive power of existing models is between 30% and 49% and that there is a need for more independent variables (attributes) when constructing a prediction model. Additionally, we found that, unlike in prior recent studies on commercial software, in the projects we examined there is no correlation between bug-fix likelihood, bug-opener's reputation and the time it takes to fix a bug. These findings indicate three open research problems: (1) assessing whether prioritizing bugs using bug-opener's reputation is beneficial, (2) identifying attributes which are effective in predicting bug-fix time, and (3) constructing bug-fix time prediction models which can be validated on multiple projects.
Pamela Bhattacharya, Iulian Neamtiu
MSR1
2010 Fine-grained incremental learning and multi-feature tossing graphs to improve bug triaging
abstract
Software bugs are inevitable and bug fixing is a difficult, expensive, and lengthy process. One of the primary reasons why bug fixing takes so long is the difficulty of accurately assigning a bug to the most competent developer for that bug kind or bug class. Assigning a bug to a potential developer, also known as bug triaging, is a labor-intensive, time-consuming and fault-prone process if done manually. Moreover, bugs frequently get reassigned to multiple developers before they are resolved, a process known as bug tossing. Researchers have proposed automated techniques to facilitate bug triaging and reduce bug tossing using machine learning-based prediction and tossing graphs. While these techniques achieve good prediction accuracy for triaging and reduce tossing paths, they are vulnerable to several issues: outdated training sets, inactive developers, and imprecise, single-attribute tossing graphs. In this paper we improve triaging accuracy and reduce tossing path lengths by employing several techniques such as refined classification using additional attributes and intra-fold updates during training, a precise ranking function for recommending potential tossees in tossing graphs, and multi-feature tossing graphs. We validate our approach on two large software projects, Mozilla and Eclipse, covering 856,259 bug reports and 21 cumulative years of development. We demonstrate that our techniques can achieve up to 83.62% prediction accuracy in bug triaging. Moreover, we reduce tossing path lengths to 1.5-2 tosses for most bugs, which represents a reduction of up to 86.31% compared to original tossing paths. Our improvements have the potential to significantly reduce the bug fixing effort, especially in the context of sizable projects with large numbers of testers and developers.
Pamela Bhattacharya, Iulian Neamtiu
ICSM1