Demo Data from SIGIR 2026 / reviewers in the wild / expert
Arun Reddy Nelakurthi
dblp:195/8251
· DBLP profile ↗
6ranked-venue papers
3as first author
1since 2021 · last 2021
—ORCID · none
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-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 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 |
Machine learning and data management · 32% Data mining · 32% Web and social media mining · 28% | |
| Computer graphics and multimedia
1 paper |
Visualization and visual analytics · 100% | |
| Human-computer interaction and pervasive computing
1 paper |
Collaborative and social computing · 77% Learning and educational technologies · 23% | |
| Artificial intelligence
2 papers |
Trustworthy machine learning · 100% |
Topics — the 6 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › visual analytics
deep learning model explanation |
0.5 | 1 | 2021 | A Visual Analytics Framework for Explaining and Diagnosing Transfer Learning Processes · IEEE Trans. Vis. Comput. Graph. 2021 |
Visualization and visual analytics
visual analytics |
0.5 | 1 | 2021 | A Visual Analytics Framework for Explaining and Diagnosing Transfer Learning Processes · IEEE Trans. Vis. Comput. Graph. 2021 |
Collaborative and social computing
crowdsourcing |
0.4 | 1 | 2020 | Crowd Teaching with Imperfect Labels · WWW 2020 |
Data mining
crowdsourcing |
0.3 | 1 | 2018 | Unlearn What You Have Learned: Adaptive Crowd Teaching with Exponentially Decayed Memory Learners · KDD 2018 |
Web and social media mining
social network analysis |
0.3 | 1 | 2017 | Finding Cut from the Same Cloth: Cross Network Link Recommendation via Joint Matrix Factorization · AAAI 2017 |
Recommender systems
user recommendation |
0.1 | 1 | 2017 | Finding Cut from the Same Cloth: Cross Network Link Recommendation via Joint Matrix Factorization · AAAI 2017 |
Methods — techniques the papers use, named apart from their topics
visual analytics · 1.0fine-tuning · 1.0case study · 1.0visual explanations · 0.4visual explanation · 0.4personalized teaching set · 0.3exponentially decayed memory · 0.3diversity balancing · 0.3topic modeling · 0.3joint matrix factorization · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | A Visual Analytics Framework for Explaining and Diagnosing Transfer Learning ProcessesabstractMany statistical learning models hold an assumption that the training data and the future unlabeled data are drawn from the same distribution. However, this assumption is difficult to fulfill in real-world scenarios and creates barriers in reusing existing labels from similar application domains. Transfer Learning is intended to relax this assumption by modeling relationships between domains, and is often applied in deep learning applications to reduce the demand for labeled data and training time. Despite recent advances in exploring deep learning models with visual analytics tools, little work has explored the issue of explaining and diagnosing the knowledge transfer process between deep learning models. In this paper, we present a visual analytics framework for the multi-level exploration of the transfer learning processes when training deep neural networks. Our framework establishes a multi-aspect design to explain how the learned knowledge from the existing model is transferred into the new learning task when training deep neural networks. Based on a comprehensive requirement and task analysis, we employ descriptive visualization with performance measures and detailed inspections of model behaviors from the statistical, instance, feature, and model structure levels. We demonstrate our framework through two case studies on image classification by fine-tuning AlexNets to illustrate how analysts can utilize our framework. Yuxin Ma 0001, Arlen Fan, Jingrui He, Arun Reddy Nelakurthi, Ross Maciejewski |
IEEE Trans. Vis. Comput. Graph. | 4 |
| 2020 | Crowd Teaching with Imperfect LabelsabstractThe need for annotated labels to train machine learning models led to a surge in crowdsourcing - collecting labels from non-experts. Instead of annotating from scratch, given an imperfect labeled set, how can we leverage the label information obtained from amateur crowd workers to improve the data quality? Furthermore, is there a way to teach the amateur crowd workers using this imperfect labeled set in order to improve their labeling performance? In this paper, we aim to answer both questions via a novel interactive teaching framework, which uses visual explanations to simultaneously teach and gauge the confidence level of the crowd workers. Yao Zhou 0003, Arun Reddy Nelakurthi, Ross Maciejewski, Wei Fan 0001, Jingrui He |
WWW | 2 |
| 2018 | Source Free Domain Adaptation Using an Off-the-Shelf ClassifierabstractWith the advancements in many data mining and machine learning tasks, together with the availability of large-scale annotated data sets, there have been an increasing number of off-the-shelf tools for addressing these tasks, like Stanford NLP Toolkit and Caffe Model Zoo. However, many of these tasks are time-evolving in nature due to, e.g., the emergence of new features and the change of class conditional distribution of features. As a result, the off-the-shelf tools are not able to adapt to such changes and will suffer from sub-optimal performance in the target application. In this paper, we propose a generic framework named AOT for adapting the outputs from an off-the-shelf tool to accommodate the changes in the learning task. It considers two major types of changes, i.e., label deficiency and distribution shift, and aims to maximally boost the performance of the off-the-shelf tool in the target domain, with the help of a limited number of target domain labeled examples. Furthermore, we propose an iterative algorithm to solve the resulting optimization problem, and we demonstrate the superior performance of the proposed AOT framework on text and image data sets. Arun Reddy Nelakurthi, Ross Maciejewski, Jingrui He |
IEEE BigData | 1 |
| 2018 | Unlearn What You Have Learned: Adaptive Crowd Teaching with Exponentially Decayed Memory LearnersabstractWith the increasing demand for large amount of labeled data, crowdsourcing has been used in many large-scale data mining applications. However, most existing works in crowdsourcing mainly focus on label inference and incentive design. In this paper, we address a different problem of adaptive crowd teaching, which is a sub-area of machine teaching in the context of crowdsourcing. Compared with machines, human beings are extremely good at learning a specific target concept (e.g., classifying the images into given categories) and they can also easily transfer the learned concepts into similar learning tasks. Therefore, a more effective way of utilizing crowdsourcing is by supervising the crowd to label in the form of teaching. In order to perform the teaching and expertise estimation simultaneously, we propose an adaptive teaching framework named JEDI to construct the personalized optimal teaching set for the crowdsourcing workers. In JEDI teaching, the teacher assumes that each learner has an exponentially decayed memory. Furthermore, it ensures comprehensiveness in the learning process by carefully balancing teaching diversity and learner's accurate learning in terms of teaching usefulness. Finally, we validate the effectiveness and efficacy of JEDI teaching in comparison with the state-of-the-art techniques on multiple data sets with both synthetic learners and real crowdsourcing workers. Yao Zhou 0003, Arun Reddy Nelakurthi, Jingrui He |
KDD | 2 |
| 2017 | Finding Cut from the Same Cloth: Cross Network Link Recommendation via Joint Matrix FactorizationabstractWith the emergence of online forums associated with major diseases, such as diabetes mellitus, many patients are increasingly dependent on such disease-specific social networks to gain access to additional resources. Among these patients, it is common for them to stick to one disease-specific social network, although their desired resources might be spread over multiple social networks, such as patients with similar questions and concerns. Motivated by this application, in this paper, we focus on cross network link recommendation, which aims to identify similar users across multiple heterogeneous social networks. The problem setting is different from existing work on cross network link prediction, which either tries to link accounts of the same user from different social networks, or aims to match users with complementary expertise or interest. To approach the problem of cross network link recommendation, we propose to jointly decompose the user-keyword matrices from multiple social networks, while requiring them to share the same topics and user group-topic association matrices. This constraint comes from the fact that social networks dedicated to the same disease tend to share the same topics as well as the interests of users groups in certain topics. Based on this intuition, we construct a generic optimization framework, provide four instantiations and an iterative optimization algorithm with performance analysis. In the experiments, we demonstrate the superiority of the proposed algorithm over state-of-the-art techniques on various real-world data sets. Arun Reddy Nelakurthi, Jingrui He |
AAAI | 1 |
| 2017 | User-guided Cross-domain Sentiment ClassificationabstractSentiment analysis has been studied for decades, and it is widely used in many real applications such as media monitoring. In sentiment analysis, when addressing the problem of limited labeled data from the target domain, transfer learning, or domain adaptation, has been successfully applied, which borrows information from a relevant source domain with abundant labeled data to improve the prediction performance in the target domain. The key to transfer learning is how to model the relatedness among different domains. For sentiment analysis, a common practice is to assume similar sentiment polarity for the common keywords shared by different domains. However, existing methods largely overlooked the human factor, i.e., the users who expressed such sentiment. In this paper, we address this problem by explicitly modeling the human factor related to sentiment classification. In particular, we assume that the content generated by the same user across different domains is biased in the same way in terms of the sentiment polarity. In other words, optimistic/pessimistic users demonstrate consistent sentiment patterns, no matter what the context is. To this end, we propose a new graph-based approach named U-Cross, which models the relatedness of different domains via both the shared users and keywords. It is non-parametric and semi-supervised in nature. Furthermore, we also study the problem of shared user selection to prevent ‘negative transfer’. In the experiments, we demonstrate the effectiveness of U-Cross by comparing it with existing state-of-the-art techniques on three real data sets. Arun Reddy Nelakurthi, Hanghang Tong, Ross Maciejewski, Nadya Bliss, Jingrui He |
SDM | 1 |