Open Access. Powered by Scholars. Published by Universities.®

Numerical Analysis and Scientific Computing Commons™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 151 - 180 of 1060

Full-Text Articles in Numerical Analysis and Scientific Computing

Conreader: Exploring Implicit Relations In Contracts For Contract Clause Extraction, Weiwen Xu, Yang Deng, Wenqiang Lei, Wenlong Zhao, Tat-Seng Chua, Wai Lam Dec 2022

Conreader: Exploring Implicit Relations In Contracts For Contract Clause Extraction, Weiwen Xu, Yang Deng, Wenqiang Lei, Wenlong Zhao, Tat-Seng Chua, Wai Lam

Research Collection School Of Computing and Information Systems

We study automatic Contract Clause Extraction (CCE) by modeling implicit relations in legal contracts. Existing CCE methods mostly treat contracts as plain text, creating a substantial barrier to understanding contracts of high complexity. In this work, we first comprehensively analyze the complexity issues of contracts and distill out three implicit relations commonly found in contracts, namely, 1) Long-range Context Relation that captures the correlations of distant clauses; 2) Term-Definition Relation that captures the relation between important terms with their corresponding definitions; and 3) Similar Clause Relation that captures the similarities between clauses of the same type. Then we propose a …

Go to article

Understanding Sentiment Through Context, Richard M.Crowley, M.H. Franco Wong Dec 2022

Understanding Sentiment Through Context, Richard M.Crowley, M.H. Franco Wong

Research Collection School Of Accountancy

We examine whether empirical results using text-based sentiment of U.S. annual reports depend on the underlying context, within documents, from which sentiment is measured. We construct a clause-level measure of context, showing that sentiment is driven by many different contexts and that positive and negative sentiment are driven by different contexts. We then construct context-level sentiment measures and examine whether sentiment works as expected at the context-level across four prediction problems. Our results demonstrate that document-level sentiment exhibits significant noise in prediction and suggest that document-level aggregation of sentiment leads to missed empirical nuances. The contexts driving sentiment results vary …

Go to article

Pacific: Towards Proactive Conversational Question Answering Over Tabular And Textual Data In Finance, Yang Deng, Wenqiang Lei, Wenxuan Zhang, Wai Lam, Tat-Seng Chua Dec 2022

Pacific: Towards Proactive Conversational Question Answering Over Tabular And Textual Data In Finance, Yang Deng, Wenqiang Lei, Wenxuan Zhang, Wai Lam, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

To facilitate conversational question answering (CQA) over hybrid contexts in finance, we present a new dataset, named PACIFIC. Compared with existing CQA datasets, PACIFIC exhibits three key features: (i) proactivity, (ii) numerical reasoning, and (iii) hybrid context of tables and text. A new task is defined accordingly to study Proactive Conversational Question Answering (PCQA), which combines clarification question generation and CQA. In addition, we propose a novel method, namely UniPCQA, to adapt a hybrid format of input and output content in PCQA into the Seq2Seq problem, including the reformulation of the numerical reasoning process as code generation. UniPCQA performs multi-task …

Go to article

A Unified Dialogue User Simulator For Few-Shot Data Augmentation, Dazhen Wan, Zheng Zhang, Qi Zhu, Lizi Liao, Minlie Huang Dec 2022

A Unified Dialogue User Simulator For Few-Shot Data Augmentation, Dazhen Wan, Zheng Zhang, Qi Zhu, Lizi Liao, Minlie Huang

Research Collection School Of Computing and Information Systems

Pre-trained language models have shown superior performance in task-oriented dialogues. However, existing datasets are on limited scales, which cannot support large-scale pre-training. Fortunately, various data augmentation methods have been developed to augment largescale task-oriented dialogue corpora. However, they heavily rely on annotated data in the target domain, which require a tremendous amount of data collection and human labeling work. In this paper, we build a unified dialogue user simulation model by pre-training on several publicly available datasets. The model can then be tuned on a target domain with fewshot data. The experiments on a target dataset across multiple domains show …

Go to article

Dronlomaly: Runtime Detection Of Anomalous Drone Behaviors Via Log Analysis And Deep Learning, Lwin Khin Shar, Wei Minn, Nguyen Binh Duong Ta, Jianli Fan, Lingxiao Jiang, Daniel Wai Kiat Lim Dec 2022

Dronlomaly: Runtime Detection Of Anomalous Drone Behaviors Via Log Analysis And Deep Learning, Lwin Khin Shar, Wei Minn, Nguyen Binh Duong Ta, Jianli Fan, Lingxiao Jiang, Daniel Wai Kiat Lim

Research Collection School Of Computing and Information Systems

Drones are increasingly popular and getting used in a variety of missions such as area surveillance, pipeline inspection, cinematography, etc. While the drone is conducting a mission, anomalies such as sensor fault, actuator fault, configuration errors, bugs in controller program, remote cyber- attack, etc., may affect the drone’s physical stability and cause serious safety violations such as crashing into the public. During a flight mission, drones typically log flight status and state units such as GPS coordinates, actuator outputs, accelerator readings, gyroscopic readings, etc. These log data may reflect the above-mentioned anomalies. In this paper, we propose a novel, deep …

Go to article

Innovative And Effective Spreadsheet Tool For Learning Sentiment Analysis And Prediction, Michelle L. F. Cheong, Jean Yun-Chen Chen Dec 2022

Innovative And Effective Spreadsheet Tool For Learning Sentiment Analysis And Prediction, Michelle L. F. Cheong, Jean Yun-Chen Chen

Research Collection School Of Computing and Information Systems

In this paper, we describe a spreadsheet tool which was developed and implemented to teach sentiment analysis and prediction to university students who are less technically inclined. We adopted the “Use-Modify-Create” cycle to ensure that the students learn the computing concepts and practices in a progressive and active learning manner, and we evaluated the effectiveness of the tool using the Learning Object Evaluation Scale for Students (LOES-S). The evaluation shows that our tool performed well in terms of quality, learn and engagement constructs, and our paired T-test shows strong evidence that, on average, the course module with the tool does …

Go to article

A Recommendation On How To Teach K-Means In Introductory Analytics Courses, Manoj Thulasidas Dec 2022

A Recommendation On How To Teach K-Means In Introductory Analytics Courses, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

We teach K-Means clustering in introductory data analytics courses because it is one of the simplest and most widely used unsupervised machine learning algorithms. However, one drawback of this algorithm is that it does not offer a clear method to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. What is usually taught as the solution for the K Selection problem is the so-called elbow method, where we look at the incremental changes in some quality metric (usually, the sum of squared errors, SSE), trying to find a sudden change. In addition to …

Go to article

An Efficient Annealing-Assisted Differential Evolution For Multi-Parameter Adaptive Latent Factor Analysis, Qing Li, Guansong Pang, Mingsheng Shang Dec 2022

An Efficient Annealing-Assisted Differential Evolution For Multi-Parameter Adaptive Latent Factor Analysis, Qing Li, Guansong Pang, Mingsheng Shang

Research Collection School Of Computing and Information Systems

A high-dimensional and incomplete (HDI) matrix is a typical representation of big data. However, advanced HDI data analysis models tend to have many extra parameters. Manual tuning of these parameters, generally adopting the empirical knowledge, unavoidably leads to additional overhead. Although variable adaptive mechanisms have been proposed, they cannot balance the exploration and exploitation with early convergence. Moreover, learning such multi-parameters brings high computational time, thereby suffering gross accuracy especially when solving a bilinear problem like conducting the commonly used latent factor analysis (LFA) on an HDI matrix. Herein, an efficient annealing-assisted differential evolution for multi-parameter adaptive latent factor analysis …

Go to article

Mining Competitively-Priced Bundle Configurations, Ezekiel Ong Young, Hady W. Lauw Dec 2022

Mining Competitively-Priced Bundle Configurations, Ezekiel Ong Young, Hady W. Lauw

Research Collection School Of Computing and Information Systems

We examine the bundle configuration problem in the presence of competition. Given a competitor's bundle configuration and pricing, we determine what to bundle together, and at what prices, to maximize the target firm's revenue. We highlight the difficulty in pricing bundles and propose a scalable alternative and an efficient search heuristic to refine the approximate prices. Furthermore, we extend the heuristics proposed by previous work to accommodate the presence of a competitor. We analyze the effectiveness of our proposed models through experimentation on real-life ratings-based preference data.

Go to article

Continual Learning With Neural Networks, Pham Hong Quang Nov 2022

Continual Learning With Neural Networks, Pham Hong Quang

Dissertations and Theses Collection (Open Access)

Recent years have witnessed tremendous successes of artificial neural networks in many applications, ranging from visual perception to language understanding. However, such achievements have been mostly demonstrated on a large amount of labeled data that is static throughout learning. In contrast, real-world environments are always evolving, where new patterns emerge and the older ones become inactive before reappearing in the future. In this respect, continual learning aims to achieve a higher level of intelligence by learning online on a data stream of several tasks. As it turns out, neural networks are not equipped to learn continually: they lack the ability …

Go to article

A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas Nov 2022

A Quality Metric For K-Means Clustering Based On Centroid Locations, Manoj Thulasidas

Research Collection School Of Computing and Information Systems

K-Means clustering algorithm does not offer a clear methodology to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. In this paper, we present a new metric for clustering quality and describe its use for K selection. The proposed metric, based on the locations of the centroids, as well as the desired properties of the clusters, is developed in two stages. In the initial stage, we take into account the full covariance matrix of the clustering variables, thereby making it mathematically similar to a reduced chi2. We then extend it to account for …

Go to article

Daot: Domain-Agnostically Aligned Optimal Transport For Domain-Adaptive Crowd Counting, Huilin Zhu, Jingling Yuan, Xian Zhong, Zhengwei Yang, Zheng Wang, Shengfeng He Nov 2022

Daot: Domain-Agnostically Aligned Optimal Transport For Domain-Adaptive Crowd Counting, Huilin Zhu, Jingling Yuan, Xian Zhong, Zhengwei Yang, Zheng Wang, Shengfeng He

Research Collection School Of Computing and Information Systems

Domain adaptation is commonly employed in crowd counting to bridge the domain gaps between different datasets. However, existing domain adaptation methods tend to focus on inter-dataset differences while overlooking the intra-differences within the same dataset, leading to additional learning ambiguities. These domain-agnostic factors,e.g., density, surveillance perspective, and scale, can cause significant in-domain variations, and the misalignment of these factors across domains can lead to a drop in performance in cross-domain crowd counting. To address this issue, we propose a Domain-agnostically Aligned Optimal Transport (DAOT) strategy that aligns domain-agnostic factors between domains. The DAOT consists of three steps. First, individual-level differences …

Go to article

Efficient Navigation For Constrained Shortest Path With Adaptive Expansion Control, Wenwen Xia, Yuchen Li, Wentian Guo, Shenghong Li Nov 2022

Efficient Navigation For Constrained Shortest Path With Adaptive Expansion Control, Wenwen Xia, Yuchen Li, Wentian Guo, Shenghong Li

Research Collection School Of Computing and Information Systems

In many route planning applications, finding constrained shortest paths (CSP) is an important and fundamental problem. CSP aims to find the shortest path between two nodes on a graph while satisfying a path constraint. Solving CSPs requires a large search space and is prohibitively slow on large graphs, even with the state-of-the-art parallel solution on GPUs. The reason lies in the lack of effective navigational information and pruning strategies in the search procedure. In this paper, we propose SPEC, a Shortest Path Enhanced approach for solving the exact CSP problem. Our design rationales of SPEC rely on the observation that …

Go to article

Meta-Complementing The Semantics Of Short Texts In Neural Topic Models, Ce Zhang, Hady Wirawan Lauw Nov 2022

Meta-Complementing The Semantics Of Short Texts In Neural Topic Models, Ce Zhang, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Topic models infer latent topic distributions based on observed word co-occurrences in a text corpus. While typically a corpus contains documents of variable lengths, most previous topic models treat documents of different lengths uniformly, assuming that each document is sufficiently informative. However, shorter documents may have only a few word co-occurrences, resulting in inferior topic quality. Some other previous works assume that all documents are short, and leverage external auxiliary data, e.g., pretrained word embeddings and document connectivity. Orthogonal to existing works, we remedy this problem within the corpus itself by proposing a Meta-Complement Topic Model, which improves topic quality …

Go to article

Graph Neural Network With Self-Attention And Multi-Task Learning For Credit Default Risk Prediction, Zihao Li, Xianzhi Wang, Lina Yao, Yakun Chen, Guandong Xu, Ee-Peng Lim Nov 2022

Graph Neural Network With Self-Attention And Multi-Task Learning For Credit Default Risk Prediction, Zihao Li, Xianzhi Wang, Lina Yao, Yakun Chen, Guandong Xu, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

We propose a graph neural network with self-attention and multi-task learning (SaM-GNN) to leverage the advantages of deep learning for credit default risk prediction. Our approach incorporates two parallel tasks based on shared intermediate vectors for input vector reconstruction and credit default risk prediction, respectively. To better leverage supervised data, we use self-attention layers for feature representation of categorical and numeric data; we further link raw data into a graph and use a graph convolution module to aggregate similar information and cope with missing values during constructing intermediate vectors. Our method does not heavily rely on feature engineering work and …

Go to article

Explanation Guided Contrastive Learning For Sequential Recommendation, Lei Wang, Ee-Peng Lim, Zhiwei Liu, Tianxiang Zhao Oct 2022

Explanation Guided Contrastive Learning For Sequential Recommendation, Lei Wang, Ee-Peng Lim, Zhiwei Liu, Tianxiang Zhao

Research Collection Lee Kong Chian School Of Business

Recently, contrastive learning has been applied to the sequential recommendation task to address data sparsity caused by users with few item interactions and items with few user adoptions. Nevertheless, the existing contrastive learning-based methods fail to ensure that the positive (or negative) sequence obtained by some random augmentation (or sequence sampling) on a given anchor user sequence remains to be semantically similar (or different). When the positive and negative sequences turn out to be false positive and false negative respectively, it may lead to degraded recommendation performance. In this work, we address the above problem by proposing Explanation Guided Augmentations …

Go to article

Equivariance And Invariance Inductive Bias For Learning From Insufficient Data, Tan Wang, Qianru Sun, Sugiri Pranata, Karlekar Jayashree, Hanwang Zhang Oct 2022

Equivariance And Invariance Inductive Bias For Learning From Insufficient Data, Tan Wang, Qianru Sun, Sugiri Pranata, Karlekar Jayashree, Hanwang Zhang

Research Collection School Of Computing and Information Systems

We are interested in learning robust models from insufficient data, without the need for any externally pre-trained model checkpoints. First, compared to sufficient data, we show why insufficient data renders the model more easily biased to the limited training environments that are usually different from testing. For example, if all the training "swan" samples are "white", the model may wrongly use the "white" environment to represent the intrinsic class "swan". Then, we justify that equivariance inductive bias can retain the class feature while invariance inductive bias can remove the environmental feature, leaving only the class feature that generalizes to any …

Go to article

Pruning The Communication Bandwidth Between Reinforcement Learning Agents Through Causal Inference: An Innovative Approach To Designing A Smart Grid Power System, Xianjie Zhang, Yu Liu, Wenjun Li, Chen Gong Oct 2022

Pruning The Communication Bandwidth Between Reinforcement Learning Agents Through Causal Inference: An Innovative Approach To Designing A Smart Grid Power System, Xianjie Zhang, Yu Liu, Wenjun Li, Chen Gong

Research Collection School Of Computing and Information Systems

Electricity demands are increasing significantly and the traditional power grid system is facing huge challenges. As the desired next-generation power grid system, smart grid can provide secure and reliable power generation, and consumption, and can also realize the system’s coordinated and intelligent power distribution. Coordinating grid power distribution usually requires mutual communication between power distributors to accomplish coordination. However, the power network is complex, the network nodes are far apart, and the communication bandwidth is often expensive. Therefore, how to reduce the communication bandwidth in the cooperative power distribution process task is crucially important. One way to tackle this problem …

Go to article

Class Is Invariant To Context And Vice Versa: On Learning Invariance For Out-Of-Distribution Generalization, Jiaxin Qi, Kaihua Tang, Qianru Sun, Xian-Sheng Hua, Hanwang Zhang Oct 2022

Class Is Invariant To Context And Vice Versa: On Learning Invariance For Out-Of-Distribution Generalization, Jiaxin Qi, Kaihua Tang, Qianru Sun, Xian-Sheng Hua, Hanwang Zhang

Research Collection School Of Computing and Information Systems

Out-Of-Distribution generalization (OOD) is all about learning invariance against environmental changes. If the context in every class is evenly distributed, OOD would be trivial because the context can be easily removed due to an underlying principle: class is invariant to context. However, collecting such a balanced dataset is impractical. Learning on imbalanced data makes the model bias to context and thus hurts OOD. Therefore, the key to OOD is context balance.We argue that the widely adopted assumption in prior work—the context bias can be directly annotated or estimated from biased class prediction—renders the context incomplete or even incorrect. In contrast, …

Go to article

Exploiting Reuse For Gpu Subgraph Enumeration, Wentiao Guo, Yuchen Li, Kian-Lee Tan Sep 2022

Exploiting Reuse For Gpu Subgraph Enumeration, Wentiao Guo, Yuchen Li, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Subgraph enumeration is important for many applications such as network motif discovery, community detection, and frequent subgraph mining. To accelerate the execution, recent works utilize graphics processing units (GPUs) to parallelize subgraph enumeration. The performances of these parallel schemes are dominated by the set intersection operations which account for up to $95\%$ of the total processing time. (Un)surprisingly, a significant portion (as high as $99\%$) of these operations is actually redundant, i.e., the same set of vertices is repeatedly encountered and evaluated. Therefore, in this paper, we seek to salvage and recycle the results of such operations to avoid repeated …

Go to article

Deep Learning-Based Text Recognition Of Agricultural Regulatory Document, Hua Leong Fwa, Farn Haur Chan Sep 2022

Deep Learning-Based Text Recognition Of Agricultural Regulatory Document, Hua Leong Fwa, Farn Haur Chan

Research Collection School Of Computing and Information Systems

In this study, an OCR system based on deep learning techniques was deployed to digitize scanned agricultural regulatory documents comprising of certificates and labels. Recognition of the certificates and labels is challenging as they are scanned images of the hard copy form and the layout and size of the text as well as the languages vary between the various countries (due to diverse regulatory requirements). We evaluated and compared between various state-of-the-art deep learningbased text detection and recognition model as well as a packaged OCR library – Tesseract. We then adopted a two-stage approach comprising of text detection using Character …

Go to article

Systems And Methods For Contrastive Learning With Self-Labeling Refinement, Pan Zhou, Caiming Xiong, Steven Hoi Aug 2022

Systems And Methods For Contrastive Learning With Self-Labeling Refinement, Pan Zhou, Caiming Xiong, Steven Hoi

Research Collection School Of Computing and Information Systems

Embodiments described herein provide a contrastive learning mechanism with self - labeling refinement , which iteratively employs the network and data themselves to generate more accurate and informative soft labels for contrastive learning . Specifically , the contrastive learning framework includes a self - labeling refinery module to explicitly generate accurate labels , and a momentum mix - up module to increase similarity between a query and its positive , which in turn implicitly improves label accuracy.

Go to article

Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao Aug 2022

Interpreting Trajectories From Multiple Views: A Hierarchical Self-Attention Network For Estimating The Time Of Arrival, Zebin Chen, Xiaolin Xiao, Yue-Jiao Gong, Jun Fang, Nan Ma, Hua Chai, Zhiguang Cao

Research Collection School Of Computing and Information Systems

Estimating the time of arrival is a crucial task in intelligent transportation systems. Although considerable efforts have been made to solve this problem, most of them decompose a trajectory into several segments and then compute the travel time by integrating the attributes from all segments. The segment view, though being able to depict the local traffic conditions straightforwardly, is insufficient to embody the intrinsic structure of trajectories on the road network. To overcome the limitation, this study proposes multi-view trajectory representation that comprehensively interprets a trajectory from the segment-, link-, and intersection-views. To fulfill the purpose, we design a hierarchical …

Go to article

Extract Human Mobility Patterns Powered By City Semantic Diagram, Zhangqing Shan, Weiwei Shan, Baihua Zheng Aug 2022

Extract Human Mobility Patterns Powered By City Semantic Diagram, Zhangqing Shan, Weiwei Shan, Baihua Zheng

Research Collection School Of Computing and Information Systems

With widespread deployment of GPS devices, massive spatiotemporal trajectories became more accessible. This booming trend paved the solid data ground for researchers to discover the regularities or patterns of human mobility. However, there are still three challenges in semantic pattern extraction including semantic absence, semantic bias and semantic complexity. In this paper, we invent and apply a novel data structure namely City Semantic Diagram to overcome above three challenges. First, our approach resolves semantic absence by exactly identifying semantic behaviours from raw trajectories. Second, the delicate design of semantic purification helps us to detect semantic complexity from human mobility. Third, …

Go to article

Aligning Dual Disentangled User Representations From Ratings And Textual Content, Nhu Thuat Tran, Hady Wirawan Lauw Aug 2022

Aligning Dual Disentangled User Representations From Ratings And Textual Content, Nhu Thuat Tran, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

Classical recommendation methods typically render user representation as a single vector in latent space. Oftentimes, a user's interactions with items are influenced by several hidden factors. To better uncover these hidden factors, we seek disentangled representations. Existing disentanglement methods for recommendations are mainly concerned with user-item interactions alone. To further improve not only the effectiveness of recommendations but also the interpretability of the representations, we propose to learn a second set of disentangled user representations from textual content and to align the two sets of representations with one another. The purpose of this coupling is two-fold. For one benefit, we …

Go to article

P-Meta: Towards On-Device Deep Model Adaptation, Zhongnan Qu, Zimu Zhou, Yongxin Tong, Lothar Thiele Aug 2022

P-Meta: Towards On-Device Deep Model Adaptation, Zhongnan Qu, Zimu Zhou, Yongxin Tong, Lothar Thiele

Research Collection School Of Computing and Information Systems

Data collected by IoT devices are often private and have a large diversity across users. Therefore, learning requires pre-training a model with available representative data samples, deploying the pre-trained model on IoT devices, and adapting the deployed model on the device with local data. Such an on-device adaption for deep learning empowered applications demands data and memory efficiency. However, existing gradient-based meta learning schemes fail to support memory-efficient adaptation. To this end, we propose p-Meta, a new meta learning method that enforces structure-wise partial parameter updates while ensuring fast generalization to unseen tasks. Evaluations on few-shot image classification and reinforcement …

Go to article

Order Constraints In Optimal Transport, Fabian Lim, Laura Wynter, Shiau Hong Lim Jul 2022

Order Constraints In Optimal Transport, Fabian Lim, Laura Wynter, Shiau Hong Lim

Research Collection School Of Computing and Information Systems

Optimal transport is a framework for comparing measures whereby a cost is incurred for transporting one measure to another. Recent works have aimed to improve optimal transport plans through the introduction of various forms of structure. We introduce novel order constraints into the optimal transport formulation to allow for the incorporation of structure. We define an efficient method for obtaining explainable solutions to the new formulation that scales far better than standard approaches. The theoretical properties of the method are provided. We demonstrate experimentally that order constraints improve explainability using the e-SNLI (Stanford Natural Language Inference) dataset that includes human-annotated …

Go to article

Robustness And Personalization In Federated Learning: A Unified Approach Via Regularization, Achintya Kundu, Pengqian Yu, Laura Wynter, Shiau Hong Lim Jul 2022

Robustness And Personalization In Federated Learning: A Unified Approach Via Regularization, Achintya Kundu, Pengqian Yu, Laura Wynter, Shiau Hong Lim

Research Collection School Of Computing and Information Systems

We present a class of methods for robust, personalized federated learning, called Fed+, that unifies many federated learning algorithms. The principal advantage of this class of methods is to better accommodate the real-world characteristics found in federated training, such as the lack of IID data across parties, the need for robustness to outliers or stragglers, and the requirement to perform well on party-specific datasets. We achieve this through a problem formulation that allows the central server to employ robust ways of aggregating the local models while keeping the structure of local computation intact. Without making any statistical assumption on the …

Go to article

Contours Of Virtual Enfreakment In Fighting Game Characters, Sercan Sengun, Peter Mawhorter, James Bowie-Wilson, Yusef Audeh, Haewoon Kwak, D. Fox Harrell Jul 2022

Contours Of Virtual Enfreakment In Fighting Game Characters, Sercan Sengun, Peter Mawhorter, James Bowie-Wilson, Yusef Audeh, Haewoon Kwak, D. Fox Harrell

Research Collection School Of Computing and Information Systems

Characters in fighting videogames1 such as Street Fighter V and Tekken7 typically reveal a phenomenon that we define as virtual enfreakment: their bodies, costumes, and fighting styles are exaggerated (1) in a manner that emphasizes perceived exoticism and (2) to enable them to be easily visually and conceptually distinguishable from one another. Here, using both quantitative and qualitative methods, including crowd-sourced surveys and analyses of game mechanics, we report on the contours of virtual enfreakment in those games. We specifically examine differences in character design across gender, national-origin, and skin-color lines. Disappointingly but not surprisingly, we find racism and sexism …

Go to article

Data-Driven Retail Decision-Making Using Spatial Partitioning And Delineation Of Communities, Ming Hui Tan, Kar Way Tan Jul 2022

Data-Driven Retail Decision-Making Using Spatial Partitioning And Delineation Of Communities, Ming Hui Tan, Kar Way Tan

Research Collection School Of Computing and Information Systems

Urbanisation is resulting in rapid growth in road networks within cities. The evolution of road networks can be indicative of a city's economic growth and it is a field of research gaining prominence in recent years. This paper proposes a framework for spatial partition of large scale road networks that produces appropriately sized geospatial units in order to identify the type of community they serve. To this end, we have developed a three-stage procedure which first partitions the road network using Louvain method, followed by outlining the boundary of each partition using Uber H3 grids before classifying each partition using …

Go to article

First Prev Next Last