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

Mona Jalal

dblp:166/8377 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
3since 2021 · last 2023
0000-0001-9904-9354ORCID · verified

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

Artificial intelligence and machine learning · 3 · 1 since 2021Systems, architecture and hardware · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021Databases, data management, data science and information retrieval · 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
Machine learning and data management · 56% Data mining · 27% Query processing and optimization · 17%

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

TopicWeightPapersLastEvidence papers
Machine learning and data management
active learning
0.312017
Online Graph Completion: Multivariate Signal Recovery in Computer Vision · CVPR 2017
Machine learning and data management › in-database machine learning
factorized learning
0.212015
Demonstration of Santoku: Optimizing Machine Learning over Normalized Data · Proc. VLDB Endow. 2015
Machine learning and data management › relational machine learning
learning over normalized data
0.212015
Demonstration of Santoku: Optimizing Machine Learning over Normalized Data · Proc. VLDB Endow. 2015
Data mining › dimensionality reduction
feature selection
0.112015
Demonstration of Santoku: Optimizing Machine Learning over Normalized Data · Proc. VLDB Endow. 2015

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

graph fourier transform · 0.3collaborative filtering · 0.3adaptive submodularity · 0.3functional dependencies · 0.2factorized learning · 0.2
YearPublicationVenuePosition
2023 ReNo: novel switch architecture for reliability improvement of NoCs
Zahra Shirmohammadi, Yassin Allivand, Fereshte Mozafari, Ahmad Patooghy, Mona Jalal, Sanaz Kazemi Abharian
J. Supercomput.5
2023 Correction to: ReNo: novel switch architecture for reliability improvement of NoCs
Zahra Shirmohammadi, Yassin Allivand, Fereshte Mozafari, Ahmad Patooghy, Mona Jalal, Sanaz Kazemi Abharian
J. Supercomput.5
2021 Leveraging Affect Transfer Learning for Behavior Prediction in an Intelligent Tutoring System
abstract
In this work, we propose a video-based transfer learning approach for predicting problem outcomes of students working with an intelligent tutoring system (ITS). By analyzing a student's face and gestures, our method predicts the outcome of a student answering a problem in an ITS from a video feed. Our work is motivated by the reasoning that the ability to predict such outcomes enables tutoring systems to adjust interventions, such as hints and encouragement, and to ultimately yield improved student learning. We collected a large labeled dataset of student interactions with an intelligent online math tutor consisting of 68 sessions, where 54 individual students solved 2,749 problems. We will release this dataset publicly upon publication of this paper. It will be available at https://www.cs.bu.edu/faculty/betke/research/learning/. Working with this dataset, our transfer-learning challenge was to design a representation in the source domain of pictures obtained “in the wild” for the task of facial expression analysis, and transferring this learned representation to the task of human behavior prediction in the domain of webcam videos of students in a classroom environment. We developed a novel facial affect representation and a user-personalized training scheme that unlocks the potential of this representation. We designed several variants of a recurrent neural network that models the temporal structure of video sequences of students solving math problems. Our final model, named ATL-BP for Affect Transfer Learning for Behavior Prediction, achieves a relative increase in mean F -score of 50 % over the state-of-the-art method on this new dataset.
Nataniel Ruiz, Hao Yu 0014, Danielle Allessio, Mona Jalal, Ajjen Joshi, Tom Murray 0001, John J. Magee, Jacob Whitehill, Vitaly Ablavsky, Ivon Arroyo, Beverly P. Woolf, Stan Sclaroff, Margrit Betke
FG4
2020 Visual complexity analysis using deep intermediate-layer features
abstract
In this paper, we focus on visual complexity, an image attribute that humans can subjectively evaluate based on the level of details in the image. We explore unsupervised information extraction from intermediate convolutional layers of deep neural networks to measure visual complexity. We derive an activation energy metric that combines convolutional layer activations to quantify visual complexity. To show the effectiveness of our proposed metric for various applications, we introduce Savoias, a visual complexity dataset that compromises of more than 1,400 images from seven diverse image categories (e.g., advertisement and interior design). We demonstrate high correlations of our deep neural network-based measure of visual complexity with human-curated ground-truth (GT) scores on various widely used network architectures, e.g., VGG16, ResNet-v2-152, and EfficientNet, and in networks trained on two classification tasks (object and scene classification). This result reveals that intermediate convolutional layers of deep neural networks carry information about the complexity of images that is meaningful to people. Furthermore, we show that our method of measuring visual complexity outperforms traditional methods on Savoias and two other state-of-the-art benchmark datasets. Moreover, we perform extensive analysis on the performance difference between our unsupervised method and a supervised method trained on the feature map, and show that by supervision, we can improve the prediction. Finally, we demonstrate that, within the context of a category, visually more complex images are also more memorable to human observers.
Elham Saraee, Mona Jalal, Margrit Betke
Comput. Vis. Image Underst.2
2017 Online Graph Completion: Multivariate Signal Recovery in Computer Vision
abstract
The adoption of "human-in-the-loop" paradigms in computer vision and machine learning is leading to various applications where the actual data acquisition (e.g., human supervision) and the underlying inference algorithms are closely interwined. While classical work in active learning provides effective solutions when the learning module involves classification and regression tasks, many practical issues such as partially observed measurements, financial constraints and even additional distributional or structural aspects of the data typically fall outside the scope of this treatment. For instance, with sequential acquisition of partial measurements of data that manifest as a matrix (or tensor), novel strategies for completion (or collaborative filtering) of the remaining entries have only been studied recently. Motivated by vision problems where we seek to annotate a large dataset of images via a crowdsourced platform or alternatively, complement results from a state-of-the-art object detector using human feedback, we study the "completion" problem defined on graphs, where requests for additional measurements must be made sequentially. We design the optimization model in the Fourier domain of the graph describing how ideas based on adaptive submodularity provide algorithms that work well in practice. On a large set of images collected from Imgur, we see promising results on images that are otherwise difficult to categorize. We also show applications to an experimental design problem in neuroimaging.
Won Hwa Kim, Mona Jalal, Seong Jae Hwang, Sterling C. Johnson
CVPR2
2015 Demonstration of Santoku: Optimizing Machine Learning over Normalized Data
abstract
Advanced analytics is a booming area in the data management industry and a hot research topic. Almost all toolkits that implement machine learning (ML) algorithms assume that the input is a single table, but most relational datasets are not stored as single tables due to normalization. Thus, analysts often join tables to obtain a denormalized table. Also, analysts typically ignore any functional dependencies among features because ML toolkits do not support them. In both cases, time is wasted in learning over data with redundancy. We demonstrate Santoku , a toolkit to help analysts improve the performance of ML over normalized data. Santoku applies the idea of factorized learning and automatically decides whether to denormalize or push ML computations through joins. Santoku also exploits database dependencies to provide automatic insights that could help analysts with exploratory feature selection. It is usable as a library in R, which is a popular environment for advanced analytics. We demonstrate the benefits of Santoku in improving ML performance and helping analysts with feature selection.
Arun Kumar 0001, Mona Jalal, Boqun Yan, Jeffrey F. Naughton, Jignesh M. Patel
Proc. VLDB Endow.2