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

Digital Commons Network™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 3571 - 3600 of 8762

Full-Text Articles in Entire DC Network

Deepdualmapper: A Gated Fusion Network For Automatic Map Extraction Using Aerial Images And Trajectories, Hao Wu, Hanyuan Zhang, Xinyu Zhang, Weiwei Sun, Baihua Zheng, Yuning Jiang Feb 2020

Deepdualmapper: A Gated Fusion Network For Automatic Map Extraction Using Aerial Images And Trajectories, Hao Wu, Hanyuan Zhang, Xinyu Zhang, Weiwei Sun, Baihua Zheng, Yuning Jiang

Research Collection School Of Computing and Information Systems

Automatic map extraction is of great importance to urban computing and location-based services. Aerial image and GPS trajectory data refer to two different data sources that could be leveraged to generate the map, although they carry different types of information. Most previous works on data fusion between aerial images and data from auxiliary sensors do not fully utilize the information of both modalities and hence suffer from the issue of information loss. We propose a deep convolutional neural network called DeepDualMapper which fuses the aerial image and trajectory data in a more seamless manner to extract the digital map. We …

Go to article

Does Reputational Sanctions Deter Negligence In Information Security Management? A Field Quasi-Experiment, Qian Tang, Andrew B. Whinston Feb 2020

Does Reputational Sanctions Deter Negligence In Information Security Management? A Field Quasi-Experiment, Qian Tang, Andrew B. Whinston

Research Collection School Of Computing and Information Systems

Security negligence, a major cause of data breaches, occurs when an organization’s information technology management fails to adequately address security vulnerabilities. By conducting a field quasi-experiment using outgoing spam as a focal security issue, this study investigates the effectiveness of reputational sanctions in reducing security negligence in a global context. In the quasi-experiment, a reputational sanction mechanism based on outgoing spam was established for four countries, and for each country, reputational sanctions were imposed on the 10 organizations with the largest outgoing spam volumes—that is, these organizations were listed publicly. We find that because of our reputational sanction mechanism, organizations …

Go to article

Generating Realistic Stock Market Order Streams, Junyi Li, Xintong Wang, Yaoyang Lin, Arunesh Sinha, Michael P. Wellman Feb 2020

Generating Realistic Stock Market Order Streams, Junyi Li, Xintong Wang, Yaoyang Lin, Arunesh Sinha, Michael P. Wellman

Research Collection School Of Computing and Information Systems

We propose an approach to generate realistic and high-fidelity stock market data based on generative adversarial networks. We model the order stream as a stochastic process with finite history dependence, and employ a conditional Wasserstein GAN to capture history dependence of orders in a stock market. We test our approach with actual market and synthetic data on a number of different statistics, and find the generated data to be close to real data.

Go to article

Solving Online Threat Screening Games Using Constrained Action Space Reinforcement Learning, Sanket Shah, Arunesh Sinha, Pradeep Varakantham, Andrew Perrault, Millind Tambe Feb 2020

Solving Online Threat Screening Games Using Constrained Action Space Reinforcement Learning, Sanket Shah, Arunesh Sinha, Pradeep Varakantham, Andrew Perrault, Millind Tambe

Research Collection School Of Computing and Information Systems

Large-scale screening for potential threats with limited resources and capacity for screening is a problem of interest at airports, seaports, and other ports of entry. Adversaries can observe screening procedures and arrive at a time when there will be gaps in screening due to limited resource capacities. To capture this game between ports and adversaries, this problem has been previously represented as a Stackelberg game, referred to as a Threat Screening Game (TSG). Given the significant complexity associated with solving TSGs and uncertainty in arrivals of customers, existing work has assumed that screenees arrive and are allocated security resources at …

Go to article

Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Dung D. Le, Hady W. Lauw Feb 2020

Stochastically Robust Personalized Ranking For Lsh Recommendation Retrieval, Dung D. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Locality Sensitive Hashing (LSH) has become one of the most commonly used approximate nearest neighbor search techniques to avoid the prohibitive cost of scanning through all data points. For recommender systems, LSH achieves efficient recommendation retrieval by encoding user and item vectors into binary hash codes, reducing the cost of exhaustively examining all the item vectors to identify the topk items. However, conventional matrix factorization models may suffer from performance degeneration caused by randomly-drawn LSH hash functions, directly affecting the ultimate quality of the recommendations. In this paper, we propose a framework named SRPR, which factors in the stochasticity of …

Go to article

Topic Modeling On Document Networks With Adjacent-Encoder, Ce Zhang, Hady W. Lauw Feb 2020

Topic Modeling On Document Networks With Adjacent-Encoder, Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Oftentimes documents are linked to one another in a network structure,e.g., academic papers cite other papers, Web pages link to other pages. In this paper we propose a holistic topic model to learn meaningful and unified low-dimensional representations for networked documents that seek to preserve both textual content and network structure. On the basis of reconstructing not only the input document but also its adjacent neighbors, we develop two neural encoder architectures. Adjacent-Encoder, or AdjEnc, induces competition among documents for topic propagation, and reconstruction among neighbors for semantic capture. Adjacent-Encoder-X, or AdjEnc-X, extends this to also encode the network structure …

Go to article

Mcdpc: Multi‐Center Density Peak Clustering, Yizhang Wang, Di Wang, Xiaofeng Zhang, Wei Pang, Chunyan Miao, Ah-Hwee Tan, You Zhou Feb 2020

Mcdpc: Multi‐Center Density Peak Clustering, Yizhang Wang, Di Wang, Xiaofeng Zhang, Wei Pang, Chunyan Miao, Ah-Hwee Tan, You Zhou

Research Collection School Of Computing and Information Systems

Density peak clustering (DPC) is a recently developed density-based clustering algorithm that achieves competitive performance in a non-iterative manner. DPC is capable of effectively handling clusters with single density peak (single center), i.e., based on DPC’s hypothesis, one and only one data point is chosen as the center of any cluster. However, DPC may fail to identify clusters with multiple density peaks (multi-centers) and may not be able to identify natural clusters whose centers have relatively lower local density. To address these limitations, we propose a novel clustering algorithm based on a hierarchical approach, named multi-center density peak clustering (McDPC). …

Go to article

Zero-Shot Ingredient Recognition By Multi-Relational Graph Convolutional Network, Jingjing Chen, Liangming Pan, Zhipeng Wei, Xiang Wang, Chong-Wah Ngo, Tat-Seng Chua Feb 2020

Zero-Shot Ingredient Recognition By Multi-Relational Graph Convolutional Network, Jingjing Chen, Liangming Pan, Zhipeng Wei, Xiang Wang, Chong-Wah Ngo, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Recognizing ingredients for a given dish image is at the core of automatic dietary assessment, attracting increasing attention from both industry and academia. Nevertheless, the task is challenging due to the difficulty of collecting and labeling sufficient training data. On one hand, there are hundred thousands of food ingredients in the world, ranging from the common to rare. Collecting training samples for all of the ingredient categories is difficult. On the other hand, as the ingredient appearances exhibit huge visual variance during the food preparation, it requires to collect the training samples under different cooking and cutting methods for robust …

Go to article

Gdface: Gated Deformation For Multi-View Face Image Synthesis, Xuemiao Xu, Keke Li, Cheng Xu, Shengfeng He Feb 2020

Gdface: Gated Deformation For Multi-View Face Image Synthesis, Xuemiao Xu, Keke Li, Cheng Xu, Shengfeng He

Research Collection School Of Computing and Information Systems

Photorealistic multi-view face synthesis from a single image is an important but challenging problem. Existing methods mainly learn a texture mapping model from the source face to the target face. However, they fail to consider the internal deformation caused by the change of poses, leading to the unsatisfactory synthesized results for large pose variations. In this paper, we propose a Gated Deformable Face Synthesis Network to model the deformation of faces that aids the synthesis of the target face image. Specifically, we propose a dual network that consists of two modules. The first module estimates the deformation of two views …

Go to article

Joint Learning Of Answer Selection And Answer Summary Generation In Community Question Answering, Yang Deng, Wai Lam, Yuexiang Xie, Daoyuan Chen, Yaliang Li, Min Yang, Ying Shen Feb 2020

Joint Learning Of Answer Selection And Answer Summary Generation In Community Question Answering, Yang Deng, Wai Lam, Yuexiang Xie, Daoyuan Chen, Yaliang Li, Min Yang, Ying Shen

Research Collection School Of Computing and Information Systems

Community question answering (CQA) gains increasing popularity in both academy and industry recently. However, the redundancy and lengthiness issues of crowdsourced answers limit the performance of answer selection and lead to reading difficulties and misunderstandings for community users. To solve these problems, we tackle the tasks of answer selection and answer summary generation in CQA with a novel joint learning model. Specifically, we design a question-driven pointer-generator network, which exploits the correlation information between question-Answer pairs to aid in attending the essential information when generating answer summaries. Meanwhile, we leverage the answer summaries to alleviate noise in original lengthy answers …

Go to article

Multi-Level Fine-Scaled Sentiment Sensing With Ambivalence Handling, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria Feb 2020

Multi-Level Fine-Scaled Sentiment Sensing With Ambivalence Handling, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria

Research Collection School Of Computing and Information Systems

Social media represent a rich source of information, such as critiques, feedback, and other opinions posted online by Internet users. Such information is typically a good reflection of users’ sentiments and attitudes towards various services, topics, or products. Sentiment analysis has become an increasingly important natural language processing (NLP) task to help users make sense of what is happening in the Internet blogosphere and it can be useful for companies as well as public organizations. However, most existing sentiment analysis techniques are only able to analyze data at the aggregate level, merely providing a binary classification (positive vs. negative), and …

Go to article

Automated Deprecated-Api Usage Update For Android Apps: How Far Are We?, Ferdian Thung, Stefanus Agus Haryono, Lucas Serrano, Gilles Muller, Julia Lawall, David Lo, Lingxiao Jiang Feb 2020

Automated Deprecated-Api Usage Update For Android Apps: How Far Are We?, Ferdian Thung, Stefanus Agus Haryono, Lucas Serrano, Gilles Muller, Julia Lawall, David Lo, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

As the Android API evolves, some API methods may be deprecated, to be eventually removed. App developers face the challenge of keeping their apps up-to-date, to ensure that the apps work in both older and newer Android versions. Currently, AppEvolve is the state-of-the-art approach to automate such updates, and it has been shown to be quite effective. Still, the number of experiments reported is moderate, involving only API usage updates in 41 usage locations. In this work, we replicate the evaluation of AppEvolve and assess whether its effectiveness is generalizable. Given the set of APIs on which AppEvolve has been …

Go to article

Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang Feb 2020

Interpretable Rumor Detection In Microblogs By Attending To User Interactions, Ling Min Serena Khoo, Hai Leong Chieu, Zhong Qian, Jing Jiang

Research Collection School Of Computing and Information Systems

We address rumor detection by learning to differentiate between the community’s response to real and fake claims in microblogs. Existing state-of-the-art models are based on tree models that model conversational trees. However, in social media, a user posting a reply might be replying to the entire thread rather than to a specific user. We propose a post-level attention model (PLAN) to model long distance interactions between tweets with the multi-head attention mechanism in a transformer network. We investigated variants of this model: (1) a structure aware self-attention model (StA-PLAN) that incorporates tree structure information in the transformer network, and (2) …

Go to article

Distinguishing Similar Design Pattern Instances Through Temporal Behavior Analysis, Renhao Xiong, David Lo, Bixin Li Feb 2020

Distinguishing Similar Design Pattern Instances Through Temporal Behavior Analysis, Renhao Xiong, David Lo, Bixin Li

Research Collection School Of Computing and Information Systems

Design patterns (DPs) encapsulate valuable design knowledge of object-oriented systems. Detecting DP instances helps to reveal the underlying rationale, thus facilitates the maintenance of legacy code. Resulting from the internal similarity of DPs, implementation variants, and missing roles, approaches based on static analysis are unable to well identify structurally similar instances. Existing approaches further employ dynamic techniques to test the runtime behaviors of candidate instances. Automatically verifying the runtime behaviors of DP instances is a challenging task in multiple aspects. This paper presents an approach to improve the verification process of existing approaches. To exercise the runtime behaviors of DP …

Go to article

Are The Code Snippets What We Are Searching For? A Benchmark And An Empirical Study On Code Search With Natural-Language Queries, Shuhan Yan, Hang Yu, Yuting Chen, Beijun Shen Feb 2020

Are The Code Snippets What We Are Searching For? A Benchmark And An Empirical Study On Code Search With Natural-Language Queries, Shuhan Yan, Hang Yu, Yuting Chen, Beijun Shen

Research Collection School Of Computing and Information Systems

Code search methods, especially those that allow programmers to raise queries in a natural language, plays an important role in software development. It helps to improve programmers' productivity by returning sample code snippets from the Internet and/or source-code repositories for their natural-language queries. Meanwhile, there are many code search methods in the literature that support natural-language queries. Difficulties exist in recognizing the strengths and weaknesses of each method and choosing the right one for different usage scenarios, because (1) the implementations of those methods and the datasets for evaluating them are usually not publicly available, and (2) some methods leverage …

Go to article

Saga: Efficient And Large-Scale Detection Of Near-Miss Clones With Gpu Acceleration, Guanhua Li, Yijian Wu, Chanchal K. Roy, Jun Sun, Xin Peng, Nanjie Zhan, Bin Hu, Jingyi Ma Feb 2020

Saga: Efficient And Large-Scale Detection Of Near-Miss Clones With Gpu Acceleration, Guanhua Li, Yijian Wu, Chanchal K. Roy, Jun Sun, Xin Peng, Nanjie Zhan, Bin Hu, Jingyi Ma

Research Collection School Of Computing and Information Systems

Clone detection on large code repository is necessary for many big code analysis tasks. The goal is to provide rich information on identical and similar code across projects. Detecting near-miss code clones on big code is challenging since it requires intensive computing and memory resources as the scale of the source code increases. In this work, we propose SAGA, an efficient suffix-array based code clone detection tool designed with sophisticated GPU optimization. SAGA not only detects Type-l and Type-2 clones but also does so for cross-project large repositories and for the most computationally expensive Type-3 clones. Meanwhile, it also works …

Go to article

Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham Feb 2020

Neural Approximate Dynamic Programming For On-Demand Ride-Pooling, Sanket Shah, Meghna Lowalekar, Pradeep Varakantham

Research Collection School Of Computing and Information Systems

On-demand ride-pooling (e.g., UberPool, LyftLine, GrabShare) has recently become popular because of its ability to lower costs for passengers while simultaneously increasing revenue for drivers and aggregation companies (e.g., Uber). Unlike in Taxi on Demand (ToD) services – where a vehicle is assigned one passenger at a time – in on-demand ride-pooling, each vehicle must simultaneously serve multiple passengers with heterogeneous origin and destination pairs without violating any quality constraints. To ensure near real-time response, existing solutions to the real-time ride-pooling problem are myopic in that they optimise the objective (e.g., maximise the number of passengers served) for the current …

Go to article

Social Influence Does Matter: User Action Prediction For In-Feed Advertising., Hongyang Wang, Qingfei Meng, Ju Fan, Yuchen Li, Laizhong Cui, Xiaoman Zhao, Chong Peng, Gong Chen Chen, Xiaoyong Du Feb 2020

Social Influence Does Matter: User Action Prediction For In-Feed Advertising., Hongyang Wang, Qingfei Meng, Ju Fan, Yuchen Li, Laizhong Cui, Xiaoman Zhao, Chong Peng, Gong Chen Chen, Xiaoyong Du

Research Collection School Of Computing and Information Systems

Social in-feed advertising delivers ads that seamlessly fit insidea user’s feed, and allows users to engage in social actions(likes or comments) with the ads. Many businesses payhigher attention to “engagement marketing” that maximizessocial actions, as social actions can effectively promote brandawareness. This paper studies social action prediction for infeedadvertising. Most existing works overlook the social influenceas a user’s action may be affected by her friends’actions. This paper introduces an end-to-end approach thatleverages social influence for action prediction, and focuseson addressing the high sparsity challenge for in-feed ads. Wepropose to learn influence structure that models who tendsto be influenced. We extract …

Go to article

Deepbindiff: Learning Program-Wide Code Representations For Binary Diffing, Yue Duan, Xuezixiang Li, Jinghan Wang, Wang, Heng Yin Feb 2020

Deepbindiff: Learning Program-Wide Code Representations For Binary Diffing, Yue Duan, Xuezixiang Li, Jinghan Wang, Wang, Heng Yin

Research Collection School Of Computing and Information Systems

Binary diffing analysis quantitatively measures the differences between two given binaries and produces fine-grained basic block matching. It has been widely used to enable different kinds of critical security analysis. However, all existing program analysis and machine learning based techniques suffer from low accuracy, poor scalability, coarse granularity, or require extensive labeled training data to function. In this paper, we propose an unsupervised program-wide code representation learning technique to solve the problem. We rely on both the code semantic information and the program-wide control flow information to generate block embeddings. Furthermore, we propose a k-hop greedy matching algorithm to find …

Go to article

Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He Feb 2020

Example-Based Colourization Via Dense Encoding Pyramids, Chufeng Xiao, Chu Han, Zhuming Zhang, Jing Qin, Tien-Tsin Wong, Guoqiang Han, Shengfeng He

Research Collection School Of Computing and Information Systems

We propose a novel deep example-based image colourization method called dense encoding pyramid network. In our study, we define the colourization as a multinomial classification problem. Given a greyscale image and a reference image, the proposed network leverages large-scale data and then predicts colours by analysing the colour distribution of the reference image. We design the network as a pyramid structure in order to exploit the inherent multi-scale, pyramidal hierarchy of colour representations. Between two adjacent levels, we propose a hierarchical decoder–encoder filter to pass the colour distributions from the lower level to higher level in order to take both …

Go to article

Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Christopher M. Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang Jan 2020

Learning-Guided Network Fuzzing For Testing Cyber-Physical System Defences, Yuqi Chen, Christopher M. Poskitt, Jun Sun, Sridhar Adepu, Fan Zhang

Research Collection School Of Computing and Information Systems

The threat of attack faced by cyber-physical systems (CPSs), especially when they play a critical role in automating public infrastructure, has motivated research into a wide variety of attack defence mechanisms. Assessing their effectiveness is challenging, however, as realistic sets of attacks to test them against are not always available. In this paper, we propose smart fuzzing, an automated, machine learning guided technique for systematically finding 'test suites' of CPS network attacks, without requiring any knowledge of the system's control programs or physical processes. Our approach uses predictive machine learning models and metaheuristic search algorithms to guide the fuzzing of …

Go to article

Key Regeneration-Free Ciphertext-Policy Attribute-Based Encryption And Its Application, Hui Cui, Robert H. Deng, Baodong Qin, Jian Weng Jan 2020

Key Regeneration-Free Ciphertext-Policy Attribute-Based Encryption And Its Application, Hui Cui, Robert H. Deng, Baodong Qin, Jian Weng

Research Collection School Of Computing and Information Systems

Attribute-based encryption (ABE) provides a promising solution for enabling scalable access control over encrypted data stored in the untrusted servers (e.g., cloud) due to its ability to perform data encryption and decryption defined over descriptive attributes. In order to bind different components which correspond to different attributes in a user's attribute-based decryption key together, key randomization technique has been applied in most existing ABE schemes. This randomization method, however, also empowers a user the capability of regenerating a newly randomized decryption key over a subset of the attributes associated with the original decryption key. Because key randomization breaks the linkage …

Go to article

Game Theoretical Study On Client-Controlled Cloud Data Deduplication, Xueqin Liang, Zheng Yan, Robert H. Deng Jan 2020

Game Theoretical Study On Client-Controlled Cloud Data Deduplication, Xueqin Liang, Zheng Yan, Robert H. Deng

Research Collection School Of Computing and Information Systems

Data deduplication eliminates redundant data and is receiving increasing attention in cloud storage services due to the proliferation of big data and the demand for efficient storage. Data deduplication not only requires a consummate technological designing, but also involves multiple parties with conflict interests. Thus, how to design incentive mechanisms and study their acceptance by all relevant stakeholders remain important open issues. In this paper, we detail the payoff structure of a client-controlled deduplication scheme and analyze the feasibilities of unified discount and individualized discount under this structure. Through game theoretical study, a privacy-preserving individualized discount-based incentive mechanism is further …

Go to article

Migrating From Monoliths To Cloud-Based Microservices: A Banking Industry Example, Alan Megargel, Venky Shankararaman, David K. Walker Jan 2020

Migrating From Monoliths To Cloud-Based Microservices: A Banking Industry Example, Alan Megargel, Venky Shankararaman, David K. Walker

Research Collection School Of Computing and Information Systems

As more organizations are placing cloud computing at the heart of their digital transformation strategy, it is important that they adopt appropriate architectures and development methodologies to leverage the full benefits of the cloud. A mere “lift and move” approach, where traditional monolith applications are moved to the cloud will not support the demands of digital services. While, monolithic applications may be easier to develop and control, they are inflexible to change and lack the scalability needed for cloud environments. Microservices architecture, which adopts some of the concepts and principles from service-oriented architecture, provides a number of benefits when developing …

Go to article

The Future Of Work Now: Medical Coding With Ai, Thomas H. Davenport, Steven M. Miller Jan 2020

The Future Of Work Now: Medical Coding With Ai, Thomas H. Davenport, Steven M. Miller

Research Collection School Of Computing and Information Systems

The coding of medical diagnosis and treatment has always been a challenging issue. Translating a patient’s complex symptoms, and a clinician’s efforts to address them, into a clear and unambiguous classification code was difficult even in simpler times. Now, however, hospitals and health insurance companies want very detailed information on what was wrong with a patient and the steps taken to treat them— for clinical record-keeping, for hospital operations review and planning, and perhaps most importantly, for financial reimbursement purposes.

Go to article

Emoco: Visual Analysis Of Emotion Coherence In Presentation Videos, Haipeng Zeng, Xingbo Wang, Aoyu Wu, Yong Wang, Quan Li, Alex Endert, Huamin Qu Jan 2020

Emoco: Visual Analysis Of Emotion Coherence In Presentation Videos, Haipeng Zeng, Xingbo Wang, Aoyu Wu, Yong Wang, Quan Li, Alex Endert, Huamin Qu

Research Collection School Of Computing and Information Systems

Emotions play a key role in human communication and public presentations. Human emotions are usually expressed through multiple modalities. Therefore, exploring multimodal emotions and their coherence is of great value for understanding emotional expressions in presentations and improving presentation skills. However, manually watching and studying presentation videos is often tedious and time-consuming. There is a lack of tool support to help conduct an efficient and in-depth multi-level analysis. Thus, in this paper, we introduce EmoCo, an interactive visual analytics system to facilitate efficient analysis of emotion coherence across facial, text, and audio modalities in presentation videos. Our visualization system features …

Go to article

Memory And Resource Leak Defects And Their Repairs In Java Projects, Mohammadreza Ghanavati, Diego Costa, Janos Seboek, David Lo, Artur Andrzejak Jan 2020

Memory And Resource Leak Defects And Their Repairs In Java Projects, Mohammadreza Ghanavati, Diego Costa, Janos Seboek, David Lo, Artur Andrzejak

Research Collection School Of Computing and Information Systems

Despite huge software engineering efforts and programming language support, resource and memory leaks are still a troublesome issue, even in memory-managed languages such as Java. Understanding the properties of leak-inducing defects, how the leaks manifest, and how they are repaired is an essential prerequisite for designing better approaches for avoidance, diagnosis, and repair of leak-related bugs. We conduct a detailed empirical study on 452 issues from 10 large opensource Java projects. The study proposes taxonomies for the leak types, for the defects causing them, and for the repair actions. We investigate, under several aspects, the distributions within each taxonomy and …

Go to article

Optimal Feature Selection For Learning-Based Algorithms For Sentiment Classification, Zhaoxia Wang, Zhiping Lin Jan 2020

Optimal Feature Selection For Learning-Based Algorithms For Sentiment Classification, Zhaoxia Wang, Zhiping Lin

Research Collection School Of Computing and Information Systems

Sentiment classification is an important branch of cognitive computation—thus the further studies of properties of sentiment analysis is important. Sentiment classification on text data has been an active topic for the last two decades and learning-based methods are very popular and widely used in various applications. For learning-based methods, a lot of enhanced technical strategies have been used to improve the performance of the methods. Feature selection is one of these strategies and it has been studied by many researchers. However, an existing unsolved difficult problem is the choice of a suitable number of features for obtaining the best sentiment …

Go to article

Aateam: Achieving The Ad Hoc Teamwork By Employing The Attention Mechanism, Shuo Chen, Ewa Andrejczuk, Zhiguang Cao, Jie Zhang Jan 2020

Aateam: Achieving The Ad Hoc Teamwork By Employing The Attention Mechanism, Shuo Chen, Ewa Andrejczuk, Zhiguang Cao, Jie Zhang

Research Collection School Of Computing and Information Systems

In the ad hoc teamwork setting, a team of agents needs to perform a task without prior coordination. The most advanced approach learns policies based on previous experiences and reuses one of the policies to interact with new teammates. However, the selected policy in many cases is sub-optimal. Switching between policies to adapt to new teammates' behaviour takes time, which threatens the successful performance of a task. In this paper, we propose AATEAM – a method that uses the attention-based neural networks to cope with new teammates' behaviour in real-time. We train one attention network per teammate type. The attention …

Go to article

Business Analytics/Business Intelligence And It Infrastructure : Impact On Organizational Agility, Xiaofeng Chen, Keng Siau Jan 2020

Business Analytics/Business Intelligence And It Infrastructure : Impact On Organizational Agility, Xiaofeng Chen, Keng Siau

Research Collection School Of Computing and Information Systems

This is an empirical research investigating the impact of business analytics (BA) and business intelligence (BI) use, IT infrastructure flexibility, and their interactions on organizational agility. Synthesizing the systems theory and awareness-motivation-capability framework, the authors propose that BA-Use, IT infrastructure flexibility, and their interactions significantly influence organizational agility. The results show the significant association of BA use and IT infrastructure flexibility with organizational agility. The results also suggest that BA use may demand corporations to build a more flexible IT infrastructure. However, the data does not reveal the proposed interaction between the two drivers of organizational agility.

Go to article

First Prev Next Last