Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Physical Sciences and Mathematics (8556)
- Computer Sciences (8539)
- Databases and Information Systems (3453)
- Software Engineering (2164)
- Artificial Intelligence and Robotics (1697)
-
- Information Security (1071)
- Numerical Analysis and Scientific Computing (1025)
- Graphics and Human Computer Interfaces (933)
- Engineering (888)
- Social and Behavioral Sciences (681)
- Business (642)
- Theory and Algorithms (493)
- Computer Engineering (451)
- Operations Research, Systems Engineering and Industrial Engineering (410)
- Programming Languages and Compilers (379)
- OS and Networks (324)
- Communication (297)
- Social Media (240)
- Public Affairs, Public Policy and Public Administration (217)
- Transportation (195)
- Medicine and Health Sciences (181)
- Education (170)
- Management Information Systems (167)
- Data Storage Systems (162)
- E-Commerce (148)
- International and Area Studies (111)
- Asian Studies (110)
- Health Information Technology (110)
- Digital Communications and Networking (104)
- Technology and Innovation (104)
- Keyword
-
- Deep learning (123)
- Machine learning (122)
- Social media (74)
- Artificial intelligence (72)
- Reinforcement learning (69)
-
- Privacy (65)
- Data mining (64)
- Cloud computing (58)
- Deep Learning (56)
- Empirical study (54)
- Optimization (54)
- Security (54)
- Visualization (51)
- Task analysis (50)
- Online learning (49)
- Software engineering (49)
- Training (49)
- Neural networks (48)
- Singapore (48)
- Anomaly detection (47)
- Feature extraction (46)
- Twitter (46)
- Large Language Models (45)
- Blockchain (44)
- Collaboration (44)
- Semantics (43)
- Access control (41)
- Algorithms (40)
- Android (39)
- Natural language processing (39)
- Publication Year
- File Type
Articles 5821 - 5850 of 8597
Full-Text Articles in Entire DC Network
Semantic Visualization For Spherical Representation, Tuan M. V. Le, Hady W. Lauw
Semantic Visualization For Spherical Representation, Tuan M. V. Le, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Visualization of high-dimensional data such as text documents is widely applicable. The traditional means is to find an appropriate embedding of the high-dimensional representation in a low-dimensional visualizable space. As topic modeling is a useful form of dimensionality reduction that preserves the semantics in documents, recent approaches aim for a visualization that is consistent with both the original word space, as well as the semantic topic space. In this paper, we address the semantic visualization problem. Given a corpus of documents, the objective is to simultaneously learn the topic distributions as well as the visualization coordinates of documents. We propose …
Utilizing Microblogs For Improving Automatic News High-Lights Extraction, Zhongyu Wei, Wei Gao
Utilizing Microblogs For Improving Automatic News High-Lights Extraction, Zhongyu Wei, Wei Gao
Research Collection School Of Computing and Information Systems
Story highlights form a succinct single-document summary consisting of 3-4 highlight sentences that reflect the gist of a news article. Automatically producing news highlights is very challenging. We propose a novel method to improve news highlights extraction by using microblogs. The hypothesis is that microblog posts, although noisy, are not only indicative of important pieces of information in the news story, but also inherently “short and sweet” resulting from the artificial compression effect due to the length limit. Given a news article, we formulate the problem as two rank-then-extract tasks: (1) we find a set of indicative tweets and use …
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …
Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain
Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain
Research Collection School Of Computing and Information Systems
We study the problem of online multitask learning for solving multiple related classification tasks in parallel, aiming at classifying every sequence of data received by each task accurately and efficiently. One practical example of online multitask learning is the micro-blog sentiment detection on a group of users, which classifies micro-blog posts generated by each user into emotional or non-emotional categories. This particular online learning task is challenging for a number of reasons. First of all, to meet the critical requirements of online applications, a highly efficient and scalable classification solution that can make immediate predictions with low learning cost is …
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …
Managing Complexity Through Selective Decoupling, C. Jason Woodard, Eric K. Clemons
Managing Complexity Through Selective Decoupling, C. Jason Woodard, Eric K. Clemons
Research Collection School Of Computing and Information Systems
Designers of complex systems are often confounded by the tendency for design changes to increase performance on some dimensions while decreasing it on others. While adopting a more modular architecture may temper these opposing effects, modularization can also deprive designers of opportunities to harness complementarities among system elements. This paper explores this tension using an NK model in which product designers can modify the structure of their fitness landscapes by suppressing or restoring interactions between components. We find that these changes can lead to improved performance by flattening harmful interactions that would otherwise cause search efforts to become trapped on …
The Learning Curves In Open-Source Software (Oss) Development Network, Youngsoo Kim, Lingxiao Jiang
The Learning Curves In Open-Source Software (Oss) Development Network, Youngsoo Kim, Lingxiao Jiang
Research Collection School Of Computing and Information Systems
We examine the learning curves of individual software developers in Open-Source Software (OSS) Development. We collected the dataset of multi-year code change histories from the repositories for five open source software projects involving more than 100 developers. We build and estimate regression models to assess individual developers' learning progress (in reducing the likelihood they may make a bug). Our estimation results show that developer's coding experience does not decrease bug ratios while cumulative bug-fixing experience leads to learning progress. The results may have implications and provoke future research on project management about allocating resources on tasks that add new code …
Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu
Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu
Research Collection School Of Computing and Information Systems
For better viral marketing, there has been a lot of research on social influence maximization. However, the problem that who is influenced and how diverse the influenced population is, which is important in real-world marketing, has largely been neglected. To that end, in this paper, we propose to consider the magnitude of influence and the diversity of the influenced crowd simultaneously. Specifically, we formulate it as an optimization problem, i.e., diversified social influence maximization. First, we present a general framework for this problem, under which we construct a class of diversity measures to quantify the diversity of the influenced crowd. …
Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau
Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP). The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to construct an initial solution, and then using a hybrid Simulated Annealing and Tabu Search (SA-TS) algorithm to further improve the solution. Experimental results show that the hybrid metaheuristic is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time. The proposed algorithm is extended to solve the Generalized Quadratic Assignment Problem (GQAP), with an emphasis on modelling and solving a practical problem, namely an examination timetabling problem. We found that …
A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau
A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
This paper presents a generalization of the Orienteering Problem, the Time-Dependent Orienteering Problem (TDOP) which is based on the real-life application of providing automatic tour guidance to a large leisure facility such as a theme park. In this problem, the travel time between two nodes depends on the time when the trip starts. We formulate the problem as an integer linear programming (ILP) model. We then develop various heuristics in a step by step fashion: greedy construction, local search and variable neighborhood descent, and two versions of iterated local search. The proposed metaheuristics were tested on modified benchmark instances, randomly …
Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau
Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
The patrol scheduling problem is concerned with assigning security teams to different stations for distinct time intervals while respecting a limited number of contractual constraints. The objective is to minimise the total distance travelled while maximising the coverage of the stations with respect to their security requirement levels. This paper introduces a hyper-heuristic strategy focusing on generating diverse solutions for a bi-objective patrol scheduling problem. While a variety of hyper-heuristics have been applied to a large suite of problem domains usually in the form of single-objective optimisation, we suggest an alternative approach for solving the patrol scheduling problem with two …
Automatic Fine-Grained Issue Report Reclassification, Pavneet Singh Kochhar, Ferdian Thung, David Lo
Automatic Fine-Grained Issue Report Reclassification, Pavneet Singh Kochhar, Ferdian Thung, David Lo
Research Collection School Of Computing and Information Systems
Issue tracking systems are valuable resources during software maintenance activities. These systems contain different categories of issue reports such as bug, request for improvement (RFE), documentation, refactoring, task etc. While logging issue reports into a tracking system, reporters can indicate the category of the reports. Herzig et al. Recently reported that more than 40% of issue reports are given wrong categories in issue tracking systems. Among issue reports that are marked as bugs, more than 30% of them are not bug reports. The misclassification of issue reports can adversely affects developers as they then need to manually identify the categories …
Guest Editorial: Special Issue On Brain Inspired Models Of Cognitive Memory, Huajin Tang, Kiruthika Ramanathan, Ning Nign
Guest Editorial: Special Issue On Brain Inspired Models Of Cognitive Memory, Huajin Tang, Kiruthika Ramanathan, Ning Nign
Research Collection School Of Computing and Information Systems
Current memory technologies have experienced significant progress in terms of storage capacity, operation speed, integration capability, etc. However, their functions are highly constrained in storing and transferring data in space and time, prompting the need for improvement. In contrast to physical memories, the biological counterpart – cognitive memory – has versatile functions. For instance, human memory stores data associatively such that different modalities of data could be retrieved simultaneously; it can learn different concepts, categorize and store them in an organized manner; it can process and store data concurrently and in a distributed fashion; it can restore content even if …
A Fast Decomposition Approach For Traffic Control, Xiaocheng Tang, Sébastien Blandin, Laura Wynter
A Fast Decomposition Approach For Traffic Control, Xiaocheng Tang, Sébastien Blandin, Laura Wynter
Research Collection School Of Computing and Information Systems
Real-time road traffic control has been the subject of active research efforts for more than fifty years. In recent years, however, the convergence of ubiquitous sensing with seamless communication technologies has motivated the development of more computationally efficient control methods, able to operate in real-time in a live environment. In this work, we present a fast decomposition method for network optimization problems, with application to real-time traffic control. Our approach is based on a nonlinear programming formulation of the network control problem and consists of an alternating directions method using forward numerical simulation in place of one of the optimization …
Urban Planning Process: Can Technology Enhance Participatory Communication?, Rojin Vishkaie, Richard Levy, Anthony Tang
Urban Planning Process: Can Technology Enhance Participatory Communication?, Rojin Vishkaie, Richard Levy, Anthony Tang
Research Collection School Of Computing and Information Systems
Oftentimes, within the urban planning process, urban planners and GIS experts must work together using desktop Computer-Aided Design (CAD) and Geographic Information System (GIS). However, participatory communication and visualization which are important in the urban planning process, are not a central focus in the design of current computer-aided planning technologies. This study tends to provide an understanding of technological challenges and complexities urban planners and GIS experts encounter while engaging in a participatory environment during the urban planning process. This study also explores the perceptions of urban planners and GIS experts about the potential impact and usefulness of interactive surfaces …
Video Event Detection Using Motion Relativity And Feature Selection, Feng Wang, Zhanhu Sun, Yu-Gang Jiang, Chong-Wah Ngo
Video Event Detection Using Motion Relativity And Feature Selection, Feng Wang, Zhanhu Sun, Yu-Gang Jiang, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Event detection plays an essential role in video content analysis. In this paper, we present our approach based on motion relativity and feature selection for video event detection. First, we propose a new motion feature, namely Expanded Relative Motion Histogram of Bag-of-Visual-Words (ERMH-BoW) to employ motion relativity for event detection. In ERMH-BoW, by representing what aspect of an event with Bag-of-Visual-Words (BoW), we construct relative motion histograms between different visual words to depict the objects' activities or how aspect of the event. ERMH-BoW thus integrates both what and how aspects for a complete event description. Meanwhile, we show that by …
On Macro And Micro Exploration Of Hashtag Diffusion In Twitter, Yazhe Wang, Baihua Zheng
On Macro And Micro Exploration Of Hashtag Diffusion In Twitter, Yazhe Wang, Baihua Zheng
Research Collection School Of Computing and Information Systems
This exploratory work studies hashtag diffusion in Twitter. The analysis is conducted from two aspects. From the macro perspective, we study general properties of hashtag diffusion, and classify hashtags into three main classes based on their temporal dynamics referred as 'single spike', 'multi-spikes', and 'fluctuation', and find that each of these classes has some unique characteristics. From the micro perspective, we investigate individual diffusion.We adopt Edelman's 'topology of influence' theory to identify four type of users with different influence levels in diffusion based on their dynamic retweet behaviors. The results of our study are useful for gaining more insights of …
A Palm Vein Identification System Based On Gabor Wavelet Features, Ran Wang, Guoyou Wang, Zhong Chen, Zhigang Zeng, Yong Wang
A Palm Vein Identification System Based On Gabor Wavelet Features, Ran Wang, Guoyou Wang, Zhong Chen, Zhigang Zeng, Yong Wang
Research Collection School Of Computing and Information Systems
As a new and promising biometric feature, thermal palm vein pattern has drawn lots of attention in research and application areas. Many algorithms have been proposed for authentication since palm vein has special characteristics, such as liveness detection and hard to forgery. However, the detection accuracy of palm vein quite depends on the preprocessing and feature representation, which is supposed to be translation and rotation invariant to some extent. In this paper, we proposed an effective method for palm vein identification based on Gabor wavelet features which contains five steps: image acquisition, ROI detection, image preprocessing, features extraction, and matching. …
An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau
An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Automating the process of finding good parameter settings is important in the design of high-performing algorithms. These automatic processes can generally be categorized into off-line and on-line methods. Off-line configuration consists in learning and selecting the best setting in a training phase, and usually fixes it while solving an instance. On-line adaptation methods on the contrary vary the parameter setting adaptively during each algorithm run. In this work, we provide an empirical study of both approaches on the operator selection problem, explore the possibility of varying parameter value by a non-adaptive distribution tuned off-line, and incorporate the off-line with on-line …
Automated Prediction Of Glasgow Outcome Scale For Traumatic Brain Injury, Bolan Su, Thien Anh Dinh, A. K. Ambastha, Tianxia Gong, Tomi Silander, Shijian Lu, C. C. Tchoyoson Lim, Boon Chuan Pang, Cheng Kiang Lee, Tze-Yun Leong, Chew Lim Tan
Automated Prediction Of Glasgow Outcome Scale For Traumatic Brain Injury, Bolan Su, Thien Anh Dinh, A. K. Ambastha, Tianxia Gong, Tomi Silander, Shijian Lu, C. C. Tchoyoson Lim, Boon Chuan Pang, Cheng Kiang Lee, Tze-Yun Leong, Chew Lim Tan
Research Collection School Of Computing and Information Systems
Clinical features found in brain CT scan images are widely used in traumatic brain injury (TBI) as indicators for Glasgow Outcome Scale (GOS) prediction. However, due to the lack of automated methods to measure and quantify the CT scan image features, the computerized prediction of GOS in TBI has not been well studied. This paper introduces an automated GOS prediction system for traumatic brain CT images. Different from most existing systems that perform the prognosis based on pre-processed data, our system directly works on brain CT scan images based on the image features. Our system can also be extended to …
Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
In this paper we study a novel query type, called direct neighbor query. Two objects in a dataset are direct neighbors (DNs) if a window selection may exclusively retrieve these two objects. Given a source object, a DN search computes all of its direct neighbors in the dataset. The DNs define a new type of affinity that differs from existing formulations (e.g., nearest neighbors, nearest surrounders, reverse nearest neighbors, etc.) and finds application in domains where user interests are expressed in the form of windows, i.e., multi-attribute range selections. Drawing on key properties of the DN relationship, we develop an …
Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li
Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li
Research Collection School Of Computing and Information Systems
Kernel-based regression represents an important family of learning techniques for solving challenging regression tasks with non-linear patterns. Despite being studied extensively, most of the existing work suffers from two major drawbacks: (i) they are often designed for solving regression tasks in a batch learning setting, making them not only computationally inefficient and but also poorly scalable in real-world applications where data arrives sequentially; and (ii) they usually assume a fixed kernel function is given prior to the learning task, which could result in poor performance if the chosen kernel is inappropriate. To overcome these drawbacks, this paper presents a novel …
Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao
Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao
Research Collection School Of Computing and Information Systems
In this paper we study how to summarize travel-related information in forum threads to generate supplementary travel guides. Such summaries presumably can provide additional and more up-to-date information to tourists. Existing multi-document summarization methods have limitations for this task because (1) they do not generate structured summaries but travel guides usually follow a certain template, and (2) they do not put emphasis on named entities but travel guides often recommend points of interest to travelers. To overcome these limitations, we propose to use a latent variable model to align forum threads with the section structure of well-written travel guides. The …
Ranking Model Selection And Fusion For Effective Microblog Search, Zhongyu Wei, Wei Gao, Tarek El-Ganainy, Walid Magdy, Kam-Fai Wong
Ranking Model Selection And Fusion For Effective Microblog Search, Zhongyu Wei, Wei Gao, Tarek El-Ganainy, Walid Magdy, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
Re-ranking was shown to have positive impact on the effectiveness for microblog search. Yet existing approaches mostly focused on using a single ranker to learn some better ranking function with respect to various relevance features. Given various available rank learners (such as learning to rank algorithms), in this work, we mainly study an orthogonal problem where multiple learned ranking models form an ensemble for re-ranking the retrieved tweets than just using a single ranking model in order to achieve higher search effectiveness. We explore the use of query-sensitive model selection and rank fusion methods based on the result lists produced …
Symbolic Analysis Of An Electric Vehicle Charging Protocol, Li Li, Jun Pang, Yang Liu, Jun Sun, Jin Song Dong
Symbolic Analysis Of An Electric Vehicle Charging Protocol, Li Li, Jun Pang, Yang Liu, Jun Sun, Jin Song Dong
Research Collection School Of Computing and Information Systems
In this paper, we describe our analysis of a recently proposed electric vehicle charing protocol. The protocol builds on complex cryptographic primitives such as commitment, zeroknowledge proofs, BBS+ signature and etc. Moreover, interesting properties such as secrecy, authentication, anonymity, and location privacy are claimed on this protocol. It thus presents a challenge for formal verification, as no single existing tool for security protocol analysis support for all the required features. In our analysis, we employ and combine the strength of two stateof-the-art symbolic verifiers, Tamarin and ProVerif, to check all important properties of the protocol.
Detecting Differences Across Multiple Instances Of Code Clones, Yun Lin, Zhenchang Xing, Yinxing Xue, Yang Liu, Xin Peng, Jun Sun, Wenyun Zhao
Detecting Differences Across Multiple Instances Of Code Clones, Yun Lin, Zhenchang Xing, Yinxing Xue, Yang Liu, Xin Peng, Jun Sun, Wenyun Zhao
Research Collection School Of Computing and Information Systems
Clone detectors find similar code fragments (i.e., instances of code clones) and report large numbers of them for industrial systems. To maintain or manage code clones, developers often have to investigate differences of multiple cloned code fragments. However,existing program differencing techniques compare only two code fragments at a time. Developers then have to manually combine several pairwise differencing results. In this paper, we present an approach to automatically detecting differences across multiple clone instances. We have implemented our approach as an Eclipse plugin and evaluated its accuracy with three Java software systems. Our evaluation shows that our algorithm has precision …
Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang
Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang
Research Collection School Of Computing and Information Systems
A big challenge in text classification is to perform classification on a large-scale and high-dimensional text corpus in the presence of imbalanced class distributions and a large number of irrelevant or noisy term features. A number of techniques have been proposed to handle this challenge with varying degrees of success. In this paper, by combining the strengths of two widely used text classification techniques, K-Nearest-Neighbor (KNN) and centroid based (Centroid) classifiers, we propose a scalable and effective flat classifier, called CenKNN, to cope with this challenge. CenKNN projects high-dimensional (often hundreds of thousands) documents into a low-dimensional (normally a few …
Collaborative Error Reduction For Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo
Collaborative Error Reduction For Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo
Research Collection School Of Computing and Information Systems
Hierarchical classification (HC) is a popular and efficient way for detecting the semantic concepts from the images. The conventional method always selects the branch with the highest classification response. This branch selection strategy has a risk of propagating classification errors from higher levels of the hierarchy to the lower levels. We argue that the local strategy is too arbitrary, because the candidate nodes are considered individually, which ignores the semantic and context relationships among concepts. In this paper, we first propose a novel method for HC, which is able to utilize the semantic relationship among candidate nodes and their children …
Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
Most non-trivial problems require the coordinated performance of multiple goal-oriented and time-critical tasks. Coordinating the performance of the tasks is required due to the dependencies among the tasks and the sharing of resources. In this work, an agent learns to perform a task using reinforcement learning with a self-organizing neural network as the function approximator. We propose a novel coordination strategy integrating Motivated Learning (ML) and a self-organizing neural network for multi-agent reinforcement learning (MARL). Specifically, we adapt the ML idea of using pain signal to overcome the resource competition issue. Dependency among the agents is resolved using domain knowledge …
Board Interlock Networks And The Use Of Relative Performance Evaluation, Qian Hao, Nan Hu, Ling Liu, Lee J. Yao
Board Interlock Networks And The Use Of Relative Performance Evaluation, Qian Hao, Nan Hu, Ling Liu, Lee J. Yao
Research Collection School Of Computing and Information Systems
Purpose - The purpose of this paper is to explore how networks of boards of directors affect relative performance evaluation (RPE) in chief executive officer (CEO) compensation. Design/methodology/approach - In this study, the authors propose that an interlocking network is an important inter-corporate setting, which has a bearing on whether boards decide to use RPE in CEO compensation. They adopt four typical graph measures to depict the centrality/position of each board in the interlock network: degree, betweenness, eigenvector and closeness, and study their impacts on RPE use. Findings - The authors find that firms that have more connected board members …