University of Alaska Anchorage
University of Pennsylvania
University of Minnesota - Morris
Old Dominion University
University of Dayton
Colby College
Virginia Commonwealth University
Edith Cowan University
United States Military Academy
Recommendations With Minimum Exposure Guarantees: A Post-Processing Framework,
2024
Singapore Management University
Recommendations With Minimum Exposure Guarantees: A Post-Processing Framework, Ramon Lopes, Rodrigo Alves, Antoine Ledent, Rodrygo L. T. Santos, Marius Kloft
Research Collection School Of Computing and Information Systems
Relevance-based ranking is a popular ingredient in recommenders, but it frequently struggles to meet fairness criteria because social and cultural norms may favor some item groups over others. For instance, some items might receive lower ratings due to some sort of bias (e.g. gender bias). A fair ranking should balance the exposure of items from advantaged and disadvantaged groups. To this end, we propose a novel post-processing framework to produce fair, exposure-aware recommendations. Our approach is based on an integer linear programming model maximizing the expected utility while satisfying a minimum exposure constraint. The model has fewer variables than previous …
Joint Location And Cost Planning In Maximum Capture Facility Location Under Random Utilities,
2023
Singapore Management University
Joint Location And Cost Planning In Maximum Capture Facility Location Under Random Utilities, Ngan H. Duong, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
We study a joint facility location and cost planning problem in a competitive market under random utility maximization (RUM) models. The objective is to locate new facilities and make decisions on the costs (or budgets) to spend on the new facilities, aiming to maximize an expected captured customer demand, assuming that customers choose a facility among all available facilities according to a RUM model. We examine two RUM frameworks in the discrete choice literature, namely, the additive and multiplicative RUM. While the former has been widely used in facility location problems, we are the first to explore the latter in …
Robust Maximum Capture Facility Location Under Random Utility Maximization Models,
2023
Singapore Management University
Robust Maximum Capture Facility Location Under Random Utility Maximization Models, Tien Thanh Dam, Thuy Anh Ta, Tien Mai
Research Collection School Of Computing and Information Systems
We study a robust version of the maximum capture facility location problem in a competitive market, assuming that each customer chooses among all available facilities according to a random utility maximization (RUM) model. We employ the generalized extreme value (GEV) family of models and assume that the parameters of the RUM model are not given exactly but lie in convex uncertainty sets. The problem is to locate new facilities to maximize the worst-case captured user demand. We show that, interestingly, our robust model preserves the monotonicity and submodularity from its deterministic counterpart, implying that a simple greedy heuristic can guarantee …
Instance-Specific Algorithm Configuration Via Unsupervised Deep Graph Clustering,
2023
Singapore Management University
Instance-Specific Algorithm Configuration Via Unsupervised Deep Graph Clustering, Wen Song, Yi Liu, Zhiguang Cao, Yaoxin Wu, Qiqiang Li
Research Collection School Of Computing and Information Systems
Instance-specific Algorithm Configuration (AC) methods are effective in automatically generating high-quality algorithm parameters for heterogeneous NP-hard problems from multiple sources. However, existing works rely on manually designed features to describe training instances, which are simple numerical attributes and cannot fully capture structural differences. Targeting at Mixed-Integer Programming (MIP) solvers, this paper proposes a novel instances-specific AC method based on end-to-end deep graph clustering. By representing an MIP instance as a bipartite graph, a random walk algorithm is designed to extract raw features with both numerical and structural information from the instance graph. Then an auto-encoder is designed to learn dense …
Sentiment Analysis Of Public Perception Towards Elon Musk On Reddit (2008-2022),
2023
University of Louisville
Sentiment Analysis Of Public Perception Towards Elon Musk On Reddit (2008-2022), Daniel Maya Bonilla, Samuel Iradukunda, Pamela Thomas
The Cardinal Edge
As Elon Musk’s influence in technology and business continues to expand, it becomes crucial to comprehend public sentiment surrounding him in order to gauge the impact of his actions and statements. In this study, we conducted a comprehensive analysis of comments from various subreddits discussing Elon Musk over a 14-year period, from 2008 to 2022. Utilizing advanced sentiment analysis models and natural language processing techniques, we examined patterns and shifts in public sentiment towards Musk, identifying correlations with key events in his life and career. Our findings reveal that public sentiment is shaped by a multitude of factors, including his …
Carbon-Aware Mine Planning With A Novel Multi-Objective Framework,
2023
Singapore Management University
Carbon-Aware Mine Planning With A Novel Multi-Objective Framework, Nurul Asyikeen Binte Azhar, Aldy Gunawan, Shih-Fen Cheng, Erwin Leonardi
Research Collection School Of Computing and Information Systems
The logistical complication of long-term mine planning involves deciding the sequential extraction of materials from the mine pit and their subsequent processing steps based on geological, geometrical, and resource constraints. The net present value (NPV) of profit over the mine's lifespan usually forms the sole objective for this problem, which is considered as the NP-hard precedence-constrained production scheduling problem (PCPSP) as well. However, increased pressure for more sustainable and carbon-aware industries also calls for environmental indicators to be considered. In this paper, we enhance the generic PCPSP formulation into a multi-objective optimization (MOO) problem whereby carbon cost forms an additional …
K-St: A Formal Executable Semantics Of The Structured Text Language For Plcs,
2023
Singapore Management University
K-St: A Formal Executable Semantics Of The Structured Text Language For Plcs, Kun Wang, Jingyi Wang, Christopher M. Poskitt, Xiangxiang Chen, Jun Sun, Peng Cheng
Research Collection School Of Computing and Information Systems
Programmable Logic Controllers (PLCs) are responsible for automating process control in many industrial systems (e.g. in manufacturing and public infrastructure), and thus it is critical to ensure that they operate correctly and safely. The majority of PLCs are programmed in languages such as Structured Text (ST). However, a lack of formal semantics makes it difficult to ascertain the correctness of their translators and compilers, which vary from vendor-to-vendor. In this work, we develop K-ST, a formal executable semantics for ST in the K framework. Defined with respect to the IEC 61131-3 standard and PLC vendor manuals, K-ST is a high-level …
Uncertainty-Adjusted Inductive Matrix Completion With Graph Neural Networks,
2023
Singapore Management University
Uncertainty-Adjusted Inductive Matrix Completion With Graph Neural Networks, Petr Kasalicky, Antoine Ledent, Rodrigo Alves
Research Collection School Of Computing and Information Systems
We propose a robust recommender systems model which performs matrix completion and a ratings-wise uncertainty estimation jointly. Whilst the prediction module is purely based on an implicit low-rank assumption imposed via nuclear norm regularization, our loss function is augmented by an uncertainty estimation module which learns an anomaly score for each individual rating via a Graph Neural Network: data points deemed more anomalous by the GNN are downregulated in the loss function used to train the low-rank module. The whole model is trained in an end-to-end fashion, allowing the anomaly detection module to tap on the supervised information available in …
Models And Algorithms For Promoting Diverse And Fair Query Results,
2023
New Jersey Institute of Technology
Models And Algorithms For Promoting Diverse And Fair Query Results, Md Mouinul Islam
Dissertations
Ensuring fairness and diversity in search results are two key concerns in compelling search and recommendation applications. This work explicitly studies these two aspects given multiple users' preferences as inputs, in an effort to create a single ranking or top-k result set that satisfies different fairness and diversity criteria. From group fairness standpoint, it adapts demographic parity like group fairness criteria and proposes new models that are suitable for ranking or producing top-k set of results. This dissertation also studies equitable exposure of individual search results in long tail data, a concept related to individual fairness. First, the dissertation focuses …
Human-Ai Complex Task Planning,
2023
New Jersey Institute of Technology
Human-Ai Complex Task Planning, Sepideh Nikookar
Dissertations
The process of complex task planning is ubiquitous and arises in a variety of compelling applications. A few leading examples include designing a personalized course plan or trip plan, designing music playlists/work sessions in web applications, or even planning routes of naval assets to collaboratively discover an unknown destination. For all of these aforementioned applications, creating a plan requires satisfying a basic construct, i.e., composing a sequence of sub-tasks (or items) that optimizes several criteria and satisfies constraints. For instance, in course planning, sub-tasks or items are core and elective courses, and degree requirements capture their complex dependencies as constraints. …
How I Read An Article That Uses Machine Learning Methods,
2023
Thomas Jefferson University
How I Read An Article That Uses Machine Learning Methods, Aziz Nazha, Olivier Elemento, Shannon Mcweeney, Moses Miles, Torsten Haferlach
Kimmel Cancer Center Faculty Papers
No abstract provided.
Graph Representation Learning With Box Embeddings,
2023
University of Massachusetts Amherst
Graph Representation Learning With Box Embeddings, Dongxu Zhang
Doctoral Dissertations
Graphs are ubiquitous data structures, present in many machine-learning tasks, such as link prediction of products and node classification of scientific papers. As gradient descent drives the training of most modern machine learning architectures, the ability to encode graph-structured data using a differentiable representation is essential to make use of this data. Most approaches encode graph structure in Euclidean space, however, it is non-trivial to model directed edges. The naive solution is to represent each node using a separate "source" and "target" vector, however, this can decouple the representation, making it harder for the model to capture information within longer …
Learning To Send Reinforcements: Coordinating Multi-Agent Dynamic Police Patrol Dispatching And Rescheduling Via Reinforcement Learning,
2023
Singapore Management University
Learning To Send Reinforcements: Coordinating Multi-Agent Dynamic Police Patrol Dispatching And Rescheduling Via Reinforcement Learning, Waldy Joe, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
We address the problem of coordinating multiple agents in a dynamic police patrol scheduling via a Reinforcement Learning (RL) approach. Our approach utilizes Multi-Agent Value Function Approximation (MAVFA) with a rescheduling heuristic to learn dispatching and rescheduling policies jointly. Often, police operations are divided into multiple sectors for more effective and efficient operations. In a dynamic setting, incidents occur throughout the day across different sectors, disrupting initially-planned patrol schedules. To maximize policing effectiveness, police agents from different sectors cooperate by sending reinforcements to support one another in their incident response and even routine patrol. This poses an interesting research challenge …
Document-Level Relation Extraction Via Separate Relation Representation And Logical Reasoning,
2023
Singapore Management University
Document-Level Relation Extraction Via Separate Relation Representation And Logical Reasoning, Heyan Huang, Changsen Yuan, Qian Liu, Yixin Cao
Research Collection School Of Computing and Information Systems
Document-level relation extraction (RE) extends the identification of entity/mentions’ relation from the single sentence to the long document. It is more realistic and poses new challenges to relation representation and reasoning skills. In this article, we propose a novel model, SRLR, using Separate Relation Representation and Logical Reasoning considering the indirect relation representation and complex reasoning of evidence sentence problems. Specifically, we first expand the judgment of relational facts from the entity-level to the mention-level, highlighting fine-grained information to capture the relation representation for the entity pair. Second, we propose a logical reasoning module to identify evidence sentences and conduct …
Decoy-Target Database Strategy And False Discovery Rate Analysis For Glycan Identification,
2023
Western University
Decoy-Target Database Strategy And False Discovery Rate Analysis For Glycan Identification, Xiaoou Li
Electronic Thesis and Dissertation Repository
In recent years, the technology of glycopeptide sequencing through MS/MS mass spectrometry data has achieved remarkable progress. Various software tools have been developed and widely used for protein identification. Estimation of false discovery rate (FDR) has become an essential method for evaluating the performance of glycopeptide scoring algorithms. The target-decoy strategy, which involves constructing decoy databases, is currently the most popular utilized method for FDR calculation. In this study, we applied various decoy construction algorithms to generate decoy glycan databases and proposed a novel approach to calculate the FDR by using the EM algorithm and mixture model.
Estimation Of Recursive Route Choice Models With Incomplete Trip Observations,
2023
Singapore Management University
Estimation Of Recursive Route Choice Models With Incomplete Trip Observations, Tien Mai, The Viet Bui, Quoc Phong Nguyen, Tho V. Le
Research Collection School Of Computing and Information Systems
This work concerns the estimation of recursive route choice models in the situation that the trip observations are incomplete, i.e., there are unconnected links (or nodes) in the observations. A direct approach to handle this issue could be intractable because enumerating all paths between unconnected links (or nodes) in a real network is typically not possible. We exploit an expectation–maximization (EM) method that allows dealing with the missing-data issue by alternatively performing two steps of sampling the missing segments in the observations and solving maximum likelihood estimation problems. Moreover, observing that the EM method could be expensive, we propose a …
Framework For Assessing Information System Security Posture Risks,
2023
The University of Western Ontario
Framework For Assessing Information System Security Posture Risks, Syed Waqas Hamdani
Electronic Thesis and Dissertation Repository
In today’s data-driven world, Information Systems, particularly the ones operating in regulated industries, require comprehensive security frameworks to protect against loss of confidentiality, integrity, or availability of data, whether due to malice, accident or otherwise. Once such a security framework is in place, an organization must constantly monitor and assess the overall compliance of its systems to detect and rectify any issues found. This thesis presents a technique and a supporting toolkit to first model dependencies between security policies (referred to as controls) and, second, devise models that associate risk with policy violations. Third, devise algorithms that propagate risk when …
Say That Again: The Role Of Multimodal Redundancy In Communication And Context,
2023
Dartmouth College
Say That Again: The Role Of Multimodal Redundancy In Communication And Context, Brandon Javier Dormes
Cognitive Science Senior Theses
With several modes of expression, such as facial expressions, body language, and speech working together to convey meaning, social communication is rich in redundancy. While typically relegated to signal preservation, this study investigates the role of cross-modal redundancies in establishing performance context, focusing on unaided, solo performances. Drawing on information theory, I operationalize redundancy as predictability and use an array of machine learning models to featurize speakers' facial expressions, body poses, movement speeds, acoustic features, and spoken language from 24 TEDTalks and 16 episodes of Comedy Central Stand-Up Presents. This analysis demonstrates that it is possible to distinguish between these …
Optimal Domain-Partitioning Algorithm For Real-Life Transportation Networks And Finite Element Meshes,
2023
Old Dominion University
Optimal Domain-Partitioning Algorithm For Real-Life Transportation Networks And Finite Element Meshes, Jimesh Bhagatji, Sharanabasaweshwara Asundi, Eric Thompson, Duc T. Nguyen
Civil & Environmental Engineering Faculty Publications
For large-scale engineering problems, it has been generally accepted that domain-partitioning algorithms are highly desirable for general-purpose finite element analysis (FEA). This paper presents a heuristic numerical algorithm that can efficiently partition any transportation network (or any finite element mesh) into a specified number of subdomains (usually depending on the number of parallel processors available on a computer), which will result in “minimising the total number of system BOUNDARY nodes” (as a primary criterion) and achieve “balancing work loads” amongst the subdomains (as a secondary criterion). The proposed seven-step heuristic algorithm (with enhancement features) is based on engineering common sense …
A Novel Approach To Extending Music Using Latent Diffusion,
2023
California Polytechnic State University, San Luis Obispo
A Novel Approach To Extending Music Using Latent Diffusion, Keon Roohparvar, Franz J. Kurfess
Master's Theses
Using deep learning to synthetically generate music is a research domain that has gained more attention from the public in the past few years. A subproblem of music generation is music extension, or the task of taking existing music and extending it. This work proposes the Continuer Pipeline, a novel technique that uses deep learning to take music and extend it in 5 second increments. It does this by treating the musical generation process as an image generation problem; we utilize latent diffusion models (LDMs) to generate spectrograms, which are image representations of music. The Continuer Pipeline is able to …
