Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Machine learning (3)
- Clustering (2)
- Cross-docking (2)
- Genetic algorithm (2)
- Scheduling (2)
-
- Vehicle routing problem (2)
- Accessibility (1)
- Adaptive large neighborhood search (1)
- Affective computing (1)
- Agile satellite scheduling (1)
- Algorithm (1)
- Attack strategies (1)
- Attributed graph (1)
- Autonomous agents (1)
- Autonomous vehicle (1)
- Averaging technology (1)
- Big data (1)
- Boundary-based genetic algorithm (1)
- Building blockes (1)
- CEGAR (1)
- Collaborative filtering (1)
- Component detection (1)
- Concurrency (1)
- Content filtering (1)
- Curves or lines (COLs) (1)
- Customer Churn (1)
- Customer scoring (1)
- Data mining (1)
- Data stream mining (1)
- Data structures and algorithms for data management (1)
Articles 1 - 30 of 31
Full-Text Articles in Physical Sciences and Mathematics
A Near-Optimal Change-Detection Based Algorithm For Piecewise-Stationary Combinatorial Semi-Bandits, Huozhi Zhou, Lingda Wang, Lav N. Varshney, Ee-Peng Lim
A Near-Optimal Change-Detection Based Algorithm For Piecewise-Stationary Combinatorial Semi-Bandits, Huozhi Zhou, Lingda Wang, Lav N. Varshney, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
We investigate the piecewise-stationary combinatorial semi-bandit problem. Compared to the original combinatorial semi-bandit problem, our setting assumes the reward distributions of base arms may change in a piecewise-stationary manner at unknown time steps. We propose an algorithm, GLR-CUCB, which incorporates an efficient combinatorial semi-bandit algorithm, CUCB, with an almost parameter-free change-point detector, the Generalized Likelihood Ratio Test (GLRT). Our analysis shows that the regret of GLR-CUCB is upper bounded by O(√NKT logT), where N is the number of piecewise-stationary segments, K is the number of base arms, and T is the number of time steps. As a complement, we also …
A Survey Of Typical Attributed Graph Queries, Yanhao Wang, Yuchen Li, Ju Fan, Chang Ye, Mingke Chai
A Survey Of Typical Attributed Graph Queries, Yanhao Wang, Yuchen Li, Ju Fan, Chang Ye, Mingke Chai
Research Collection School Of Computing and Information Systems
Graphs are commonly used for representing complex structures such as social relationships, biological interactions, and knowledge bases. In many scenarios, graphs not only represent topological relationships but also store the attributes that denote the semantics associated with their vertices and edges, known as attributed graphs. Attributed graphs can meet demands for a wide range of applications, and thus a variety of queries on attributed graphs have been proposed. However, these diverse types of attributed graph queries have not been systematically investigated yet. In this paper, we provide an extensive survey of several typical types of attributed graph queries. We propose …
Highly Efficient And Scalable Multi-Hop Ride-Sharing, Yixin Xu, Lars Kulik, Renata Borovica‐Gajic, Abdullah Aldwyish, Jianzhong Qi
Highly Efficient And Scalable Multi-Hop Ride-Sharing, Yixin Xu, Lars Kulik, Renata Borovica‐Gajic, Abdullah Aldwyish, Jianzhong Qi
Research Collection School Of Computing and Information Systems
On-demand ride-sharing services such as Uber and Lyft have gained tremendous popularity over the past decade, largely driven by the omnipresence of mobile devices. Ride-sharing services can provide economic and environmental benefits such as reducing traffic congestion and vehicle emissions. Multi-hop ride-sharing enables passengers to transfer between vehicles within a single trip, which significantly extends the benefits of ride-sharing and provides ride opportunities that are not possible otherwise. Despite its advantages, offering real-time multi-hop ride-sharing services at large scale is a challenging computational task due to the large combination of vehicles and passenger transfer points. To address these challenges, we …
Base-Package Recommendation Framework Based On Consumer Behaviours In Iptv Platform, Kuruparan Shanmugalingam, Ruwinda Ranganayanke, Chanka Gunawardhaha, Rajitha Navarathna
Base-Package Recommendation Framework Based On Consumer Behaviours In Iptv Platform, Kuruparan Shanmugalingam, Ruwinda Ranganayanke, Chanka Gunawardhaha, Rajitha Navarathna
Research Collection School Of Computing and Information Systems
Internet Protocol TeleVision (IPTV) provides many services such as live television streaming, time-shifted media, and Video On Demand (VOD). However, many customers do not engage properly with their subscribed packages due to a lack of knowledge and poor guidance. Many customers fail to identify the proper IPTV service package based on their needs and to utilise their current package to the maximum. In this paper, we propose a base-package recommendation model with a novel customer scoring-meter based on customers behaviour. Initially, our paper describes an algorithm to measure customers engagement score, which illustrates a novel approach to track customer engagement …
Reducing Estimation Bias Via Triplet-Average Deep Deterministic Policy Gradient, Dongming Wu, Xingping Dong, Jianbing Shen, Steven C. H. Hoi
Reducing Estimation Bias Via Triplet-Average Deep Deterministic Policy Gradient, Dongming Wu, Xingping Dong, Jianbing Shen, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
The overestimation caused by function approximation is a well-known property in Q-learning algorithms, especially in single-critic models, which leads to poor performance in practical tasks. However, the opposite property, underestimation, which often occurs in Q-learning methods with double critics, has been largely left untouched. In this article, we investigate the underestimation phenomenon in the recent twin delay deep deterministic actor-critic algorithm and theoretically demonstrate its existence. We also observe that this underestimation bias does indeed hurt performance in various experiments. Considering the opposite properties of single-critic and double-critic methods, we propose a novel triplet-average deep deterministic policy gradient algorithm that …
Efficient Sampling Algorithms For Approximate Temporal Motif Counting, Jingjing Wang, Yanhao Wang, Wenjun Jiang, Yuchen Li, Kian-Lee Tan
Efficient Sampling Algorithms For Approximate Temporal Motif Counting, Jingjing Wang, Yanhao Wang, Wenjun Jiang, Yuchen Li, Kian-Lee Tan
Research Collection School Of Computing and Information Systems
A great variety of complex systems ranging from user interactions in communication networks to transactions in financial markets can be modeled as temporal graphs, which consist of a set of vertices and a series of timestamped and directed edges. Temporal motifs in temporal graphs are generalized from subgraph patterns in static graphs which take into account edge orderings and durations in addition to structures. Counting the number of occurrences of temporal motifs is a fundamental problem for temporal network analysis. However, existing methods either cannot support temporal motifs or suffer from performance issues. In this paper, we focus on approximate …
Reinforcement Learning For Zone Based Multiagent Pathfinding Under Uncertainty, Jiajing Ling, Tarun Gupta, Akshat Kumar
Reinforcement Learning For Zone Based Multiagent Pathfinding Under Uncertainty, Jiajing Ling, Tarun Gupta, Akshat Kumar
Research Collection School Of Computing and Information Systems
We address the problem of multiple agents finding their paths from respective sources to destination nodes in a graph (also called MAPF). Most existing approaches assume that all agents move at fixed speed, and that a single node accommodates only a single agent. Motivated by the emerging applications of autonomous vehicles such as drone traffic management, we present zone-based path finding (or ZBPF) where agents move among zones, and agents' movements require uncertain travel time. Furthermore, each zone can accommodate multiple agents (as per its capacity). We also develop a simulator for ZBPF which provides a clean interface from the …
Querying Recurrent Convoys Over Trajectory Data, Munkh-Erdene Yadamjav, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury, Hanan Samet
Querying Recurrent Convoys Over Trajectory Data, Munkh-Erdene Yadamjav, Zhifeng Bao, Baihua Zheng, Farhana M. Choudhury, Hanan Samet
Research Collection School Of Computing and Information Systems
Moving objects equipped with location-positioning devices continuously generate a large amount of spatio-temporal trajectory data. An interesting finding over a trajectory stream is a group of objects that are travelling together for a certain period of time. Existing studies on mining co-moving objects do not consider an important correlation between co-moving objects, which is the reoccurrence of the movement pattern. In this study, we define a problem of finding recurrent pattern of co-moving objects from streaming trajectories and propose an efficient solution that enables us to discover recent co-moving object patterns repeated within a given time period. Experimental results on …
Vehicle Routing Problem With Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Vehicle Routing Problem With Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
Cross-docking is a logistics strategy that aims at less transportation costs and fast customer deliveries. Incorporating an efficient vehicle routing could increase the benefits of the cross-docking. In this paper, the vehicle routing problem with reverse cross-docking (VRP-RCD) is studied. Reverse logistics has attracted more attention due to its ability to gain more profit and maintain the competitiveness of a company. VRP-RCD includes a four-level supply chain network: suppliers, cross-dock, customers, and outlets, with the objective of minimizing vehicle operational and transportation costs. A two-phase heuristic that employs an adaptive large neighborhood search (ALNS) with various destroy and repair operators …
A Genetic Algorithm To Minimise Number Of Vehicles In An Electric Vehicle Routing Problem, Kiian Leong Bertran Queck, Hoong Chuin Lau
A Genetic Algorithm To Minimise Number Of Vehicles In An Electric Vehicle Routing Problem, Kiian Leong Bertran Queck, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
Electric Vehicles (EVs) and charging infrastructure are starting to become commonplace in major cities around the world. For logistics providers to adopt an EV fleet, there are many factors up for consideration, such as route planning for EVs with limited travel range as well as long-term planning of fleet size. In this paper, we present a genetic algorithm to perform route planning that minimises the number of vehicles required. Specifically, we discuss the challenges on the violations of constraints in the EV routing problem (EVRP) arising from applying genetic algorithm operators. To overcome the challenges, techniques specific to addressing the …
A Hybrid Framework Using A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Sabrish Gopalakrishnan, Jianyuan Bo, Hoong Chuin Lau
A Hybrid Framework Using A Qubo Solver For Permutation-Based Combinatorial Optimization, Siong Thye Goh, Sabrish Gopalakrishnan, Jianyuan Bo, Hoong Chuin Lau
Research Collection School Of Computing and Information Systems
In this paper, we propose a hybrid framework to solve large-scale permutation-based combinatorial problems effectively using a high-performance quadratic unconstrained binary optimization (QUBO) solver. To do so, transformations are required to change a constrained optimization model to an unconstrained model that involves parameter tuning. We propose techniques to overcome the challenges in using a QUBO solver that typically comes with limited numbers of bits. First, to smooth the energy landscape, we reduce the magnitudes of the input without compromising optimality. We propose a machine learning approach to tune the parameters for good performance effectively. To handle possible infeasibility, we introduce …
Adaptive Task Sampling For Meta-Learning, Chenghao Liu, Zhihao Wang, Doyen Sahoo, Yuan Fang, Kun Zhang, Steven C. H. Hoi
Adaptive Task Sampling For Meta-Learning, Chenghao Liu, Zhihao Wang, Doyen Sahoo, Yuan Fang, Kun Zhang, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Meta-learning methods have been extensively studied and applied in computer vision, especially for few-shot classification tasks. The key idea of meta-learning for few-shot classification is to mimic the few-shot situations faced at test time by randomly sampling classes in meta-training data to construct fewshot tasks for episodic training. While a rich line of work focuses solely on how to extract meta-knowledge across tasks, we exploit the complementary problem on how to generate informative tasks. We argue that the randomly sampled tasks could be sub-optimal and uninformative (e.g., the task of classifying “dog” from “laptop” is often trivial) to the meta-learner. …
An Exact Algorithm For Agile Earth Observation Satellite Scheduling With Time-Dependent Profits, Guansheng Peng, Guopeng Song, Lining Xing, Aldy Gunawan, Pieter Vansteenwegen
An Exact Algorithm For Agile Earth Observation Satellite Scheduling With Time-Dependent Profits, Guansheng Peng, Guopeng Song, Lining Xing, Aldy Gunawan, Pieter Vansteenwegen
Research Collection School Of Computing and Information Systems
The scheduling of an Agile Earth Observation Satellite (AEOS) consists of selecting and scheduling a subset of possible targets for observation in order to maximize the collected profit related to the images while satisfying its operational constraints. In this problem, a set of candidate targets for observation is given, each with a time-dependent profit and a visible time window. The exact profit of a target depends on the start time of its observation, reaching its maximum at the midpoint of its visible time window. This time dependency stems from the fact that the image quality is determined by the look …
Geoprune: Efficiently Matching Trips In Ride-Sharing Through Geometric Properties, Yixin Xu, Jianzhong Qi, Renata Borovica-Gajic
Geoprune: Efficiently Matching Trips In Ride-Sharing Through Geometric Properties, Yixin Xu, Jianzhong Qi, Renata Borovica-Gajic
Research Collection School Of Computing and Information Systems
On-demand ride-sharing is rapidly growing. Matching trip requests to vehicles efficiently is critical for the service quality of ride-sharing. To match trip requests with vehicles, a prune-And-select scheme is commonly used. The pruning stage identifies feasible vehicles that can satisfy the trip constraints (e.g., trip time). The selection stage selects the optimal one(s) from the feasible vehicles. The pruning stage is crucial to lowering the complexity of the selection stage and to achieve efficient matching. We propose an effective and efficient pruning algorithm called GeoPrune. GeoPrune represents the time constraints of trip requests using circles and ellipses, which can be …
The Prediction Of Delay Time At Intersection And Route Planning For Autonomous Vehicles, Genwang Gou, Yongxin Zhao, Jiawei Liang, Ling Shi
The Prediction Of Delay Time At Intersection And Route Planning For Autonomous Vehicles, Genwang Gou, Yongxin Zhao, Jiawei Liang, Ling Shi
Research Collection School Of Computing and Information Systems
Intelligent Intersections (roundabout and crossroads) management is considered as one of the challenges to significantly improve urban traffic efficiency. Recent researches in artificial intelligence suggest that autonomous vehicles have the possibility of forming intelligent intersection management, and likely to occupy the leading role in future urban traffic. If route planning method can be used for route decision of autonomous vehicle, the urban traffic efficiency can be further improved. In this paper, we propose an Intelligent Intersection Control Protocol (IICP) for controlling autonomous vehicles cross intersection, and recommend route for autonomous vehicles to reduce travel time and improve urban traffic efficiency. …
Probabilistic Value Selection For Space Efficient Model, Gunarto Sindoro Njoo, Baihua Zheng, Kuo-Wei Hsu, Wen-Chih Peng
Probabilistic Value Selection For Space Efficient Model, Gunarto Sindoro Njoo, Baihua Zheng, Kuo-Wei Hsu, Wen-Chih Peng
Research Collection School Of Computing and Information Systems
An alternative to current mainstream preprocessing methods is proposed: Value Selection (VS). Unlike the existing methods such as feature selection that removes features and instance selection that eliminates instances, value selection eliminates the values (with respect to each feature) in the dataset with two purposes: reducing the model size and preserving its accuracy. Two probabilistic methods based on information theory's metric are proposed: PVS and P + VS. Extensive experiments on the benchmark datasets with various sizes are elaborated. Those results are compared with the existing preprocessing methods such as feature selection, feature transformation, and instance selection methods. Experiment results …
Improving Multimodal Named Entity Recognition Via Entity Span Detection With Unified Multimodal Transformer, Jianfei Yu, Jing Jiang, Li Yang, Rui Xia
Improving Multimodal Named Entity Recognition Via Entity Span Detection With Unified Multimodal Transformer, Jianfei Yu, Jing Jiang, Li Yang, Rui Xia
Research Collection School Of Computing and Information Systems
In this paper, we study Multimodal Named Entity Recognition (MNER) for social media posts. Existing approaches for MNER mainly suffer from two drawbacks: (1) despite generating word-aware visual representations, their word representations are insensitive to the visual context; (2) most of them ignore the bias brought by the visual context. To tackle the first issue, we propose a multimodal interaction module to obtain both image-aware word representations and word-aware visual representations. To alleviate the visual bias, we further propose to leverage purely text-based entity span detection as an auxiliary module, and design a Unified Multimodal Transformer to guide the final …
Query Graph Generation For Answering Multi-Hop Complex Questions From Knowledge Bases, Yunshi Lan, Jing Jiang
Query Graph Generation For Answering Multi-Hop Complex Questions From Knowledge Bases, Yunshi Lan, Jing Jiang
Research Collection School Of Computing and Information Systems
Previous work on answering complex questions from knowledge bases usually separately addresses two types of complexity: questions with constraints and questions with multiple hops of relations. In this paper, we handle both types of complexity at the same time. Motivated by the observation that early incorporation of constraints into query graphs can more effectively prune the search space, we propose a modified staged query graph generation method with more flexible ways to generate query graphs. Our experiments clearly show that our method achieves the state of the art on three benchmark KBQA datasets.
Big Data, Spatial Optimization, And Planning, Kai Cao, Wenwen Li, Richard Church
Big Data, Spatial Optimization, And Planning, Kai Cao, Wenwen Li, Richard Church
Research Collection School Of Computing and Information Systems
Spatial optimization represents a set of powerful spatial analysis techniques that can be used to identify optimal solution(s) and even generate a large number of competitive alternatives. The formulation of such problems involves maximizing or minimizing one or more objectives while satisfying a number of constraints. Solution techniques range from exact models solved with such approaches as linear programming and integer programming, or heuristic algorithms, i.e. Tabu Search, Simulated Annealing, and Genetic Algorithms. Spatial optimization techniques have been utilized in numerous planning applications, such as location-allocation modeling/site selection, land use planning, school districting, regionalization, routing, and urban design. These methods …
Towards Distributed Node Similarity Search On Graphs, Tianming Zhang, Yunjun Gao, Baihua Zheng, Lu Chen, Shiting Wen, Wei Guo
Towards Distributed Node Similarity Search On Graphs, Tianming Zhang, Yunjun Gao, Baihua Zheng, Lu Chen, Shiting Wen, Wei Guo
Research Collection School Of Computing and Information Systems
Node similarity search on graphs has wide applications in recommendation, link prediction, to name just a few. However, existing studies are insufficient due to two reasons: (i) the scale of the real-world graph is growing rapidly, and (ii) vertices are always associated with complex attributes. In this paper, we propose an efficiently distributed framework to support node similarity search on massive graphs, which considers both graph structure correlation and node attribute similarity in metric spaces. The framework consists of preprocessing stage and query stage. In the preprocessing stage, a parallel KD-tree construction (KDC) algorithm is developed to form a newly …
Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu
Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu
Research Collection School Of Computing and Information Systems
Learning graphs from data automatically have shown encouraging performance on clustering and semisupervised learning tasks. However, real data are often corrupted, which may cause the learned graph to be inexact or unreliable. In this paper, we propose a novel robust graph learning scheme to learn reliable graphs from the real-world noisy data by adaptively removing noise and errors in the raw data. We show that our proposed model can also be viewed as a robust version of manifold regularized robust principle component analysis (RPCA), where the quality of the graph plays a critical role. The proposed model is able to …
A Matheuristic Algorithm For Solving The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
A Matheuristic Algorithm For Solving The Vehicle Routing Problem With Cross-Docking, Aldy Gunawan, Audrey Tedja Widjaja, Pieter Vansteenwegen, Vincent F. Yu
Research Collection School Of Computing and Information Systems
This paper studies the integration of the vehicle routing problem with cross-docking, namely VRPCD. The aim is to find a set of routes to deliver single products from a set of suppliers to a set of customers through a cross-dock facility, such that the operational and transportation costs are minimized, without violating the vehicle capacity and time horizon constraints. A two-phase matheuristic approach that uses the routes of the local optima of an adaptive large neighborhood search (ALNS) as columns in a set-partitioning formulation of the VRPCD is designed. This matheuristic outperforms the state-of-the-art algorithms in solving a subset of …
On The Robustness Of Cascade Diffusion Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras
On The Robustness Of Cascade Diffusion Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras
Research Collection School Of Computing and Information Systems
How can we assess a network's ability to maintain its functionality under attacks? Network robustness has been studied extensively in the case of deterministic networks. However, applications such as online information diffusion and the behavior of networked public raise a question of robustness in probabilistic networks. We propose three novel robustness measures for networks hosting a diffusion under the Independent Cascade (IC) model, susceptible to node attacks. The outcome of such a process depends on the selection of its initiators, or seeds, by the seeder, as well as on two factors outside the seeder's discretion: the attack strategy and the …
Automatic Verification Of Multi-Threaded Programs By Inference Of Rely-Guarantee Specifications, Xuan-Bach Le, David Sanan, Jun Sun, Shang-Wei Lin
Automatic Verification Of Multi-Threaded Programs By Inference Of Rely-Guarantee Specifications, Xuan-Bach Le, David Sanan, Jun Sun, Shang-Wei Lin
Research Collection School Of Computing and Information Systems
Rely-Guarantee is a comprehensive technique that supports compositional reasoning for concurrent programs. However, specifications of the Rely condition - environment interference, and Guarantee condition - local transformation of thread state - are challenging to establish. Thus the construction of these conditions becomes bottleneck in automating the technique. To tackle the above problem, we propose a verification framework that, based on Rely-Guarantee principles, constructs the correctness proof of concurrent program through inferring suitable Rely -Guarantee conditions automatically. Our framework first constructs a Hoare-style sequential proof for each thread and then applies abstraction refinement to elevate these proofs into concurrent ones with …
Towards K-Vertex Connected Component Discovery From Large Networks, Li Yuan, Guoren Wang, Yuhai Zhao, Feida Zhu
Towards K-Vertex Connected Component Discovery From Large Networks, Li Yuan, Guoren Wang, Yuhai Zhao, Feida Zhu
Research Collection School Of Computing and Information Systems
In many real life network-based applications such as social relation analysis, Web analysis, collaborative network, road network and bioinformatics, the discovery of components with high connectivity is an important problem. In particular, k-edge connected component (k-ECC) has recently been extensively studied to discover disjoint components. Yet many real scenarios present more needs and challenges for overlapping components. In this paper, we propose a k-vertex connected component (k-VCC) model, which is much more cohesive, and thus supports overlapping between components very well. To discover k-VCCs, we propose three frameworks including top-down, bottom-up and hybrid …
Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh
Bounding Regret In Empirical Games, Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh
Research Collection School Of Computing and Information Systems
Empirical game-theoretic analysis refers to a set of models and techniques for solving large-scale games. However, there is a lack of a quantitative guarantee about the quality of output approximate Nash equilibria (NE). A natural quantitative guarantee for such an approximate NE is the regret in the game (i.e. the best deviation gain). We formulate this deviation gain computation as a multi-armed bandit problem, with a new optimization goal unlike those studied in prior work. We propose an efficient algorithm Super-Arm UCB (SAUCB) for the problem and a number of variants. We present sample complexity results as well as extensive …
Structure-Priority Image Restoration Through Genetic Algorithm Optimization, Zhaoxia Wang, Haibo Pen, Ting Yang, Quan Wang
Structure-Priority Image Restoration Through Genetic Algorithm Optimization, Zhaoxia Wang, Haibo Pen, Ting Yang, Quan Wang
Research Collection School Of Computing and Information Systems
With the significant increase in the use of image information, image restoration has been gaining much attention by researchers. Restoring the structural information as well as the textural information of a damaged image to produce visually plausible restorations is a challenging task. Genetic algorithm (GA) and its variants have been applied in many fields due to their global optimization capabilities. However, the applications of GA to the image restoration domain still remain an emerging discipline. It is still challenging and difficult to restore a damaged image by leveraging GA optimization. To address this problem, this paper proposes a novel GA-based …
Spatial Multi-Objective Land Use Optimization Toward Livability Based On Boundary-Based Genetic Algorithm: A Case Study In Singapore, Kai Cao, Muyang Liu, Shu Wang, Mengqi Liu, Wenting Zhang, Qiang Meng, Bo Huang
Spatial Multi-Objective Land Use Optimization Toward Livability Based On Boundary-Based Genetic Algorithm: A Case Study In Singapore, Kai Cao, Muyang Liu, Shu Wang, Mengqi Liu, Wenting Zhang, Qiang Meng, Bo Huang
Research Collection School Of Computing and Information Systems
In this research, the concept of livability has been quantitatively and comprehensively reviewed and interpreted to contribute to spatial multi-objective land use optimization modelling. In addition, a multi-objective land use optimization model was constructed using goal programming and a weighted-sum approach, followed by a boundary-based genetic algorithm adapted to help address the spatial multi-objective land use optimization problem. Furthermore, the model is successfully and effectively applied to the case study in the Central Region of Queenstown Planning Area of Singapore towards livability. In the case study, the experiments based on equal weights and experiments based on different weights combination have …
An Exact Single-Agent Task Selection Algorithm For The Crowdsourced Logistics, Chung-Kyun Han, Shih-Fen Cheng
An Exact Single-Agent Task Selection Algorithm For The Crowdsourced Logistics, Chung-Kyun Han, Shih-Fen Cheng
Research Collection School Of Computing and Information Systems
The trend of moving online in the retail industry has created great pressure for the logistics industry to catch up both in terms of volume and response time. On one hand, volume is fluctuating at greater magnitude, making peaks higher; on the other hand, customers are also expecting shorter response time. As a result, logistics service providers are pressured to expand and keep up with the demands. Expanding fleet capacity, however, is not sustainable as capacity built for the peak seasons would be mostly vacant during ordinary days. One promising solution is to engage crowdsourced workers, who are not employed …
A Review Of Emotion Sensing: Categorization Models And Algorithms, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria
A Review Of Emotion Sensing: Categorization Models And Algorithms, Zhaoxia Wang, Seng-Beng Ho, Erik Cambria
Research Collection School Of Computing and Information Systems
Sentiment analysis consists in the identification of the sentiment polarity associated with a target object, such as a book, a movie or a phone. Sentiments reflect feelings and attitudes, while emotions provide a finer characterization of the sentiments involved. With the huge number of comments generated daily on the Internet, besides sentiment analysis, emotion identification has drawn keen interest from different researchers, businessmen and politicians for polling public opinions and attitudes. This paper reviews and discusses existing emotion categorization models for emotion analysis and proposes methods that enhance existing emotion research. We carried out emotion analysis by inviting experts from …