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

Artificial Intelligence and Robotics Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 1291 - 1320 of 1664

Full-Text Articles in Artificial Intelligence and Robotics

Lexicons In Sentiment Analytics, B. Yuan, Keng Siau May 2017

Lexicons In Sentiment Analytics, B. Yuan, Keng Siau

Research Collection School Of Computing and Information Systems

With the increasing amount of text data, sentiment analytics (SA) is becoming an important tool for text miners. An automated approach is needed to parse the online reviews and comments, and analyze their sentiments. Since lexicon is the most important component in SA, enhancing the quality of lexicons will improve the efficiency and accuracy of sentiment analysis. In this research, we study the effect of coupling a general lexicon with a specialized lexicon (for a specific domain) and its impact on sentiment analysis. Two special domains and one general domain were used. The two special domains are the petroleum domain …

Go to article

Machine Learning Approaches To Sentiment Analytics, W. Zhao, Keng Siau May 2017

Machine Learning Approaches To Sentiment Analytics, W. Zhao, Keng Siau

Research Collection School Of Computing and Information Systems

One key aspect of sentiment analytics is emotion classification. This research studies the use of machine learning approaches to classify human emotion. Two different machine learning approaches were compared in an experimental study. In one approach, emotions from both genders were used to train the machine. In another approach, genders were separated and two separate machines were used to learn the emotions of the two genders. We also manipulated the training sample sizes and study the effect of training sample sizes on the two machine learning approaches. Our preliminary results show that the approach where the genders were separated produces …

Go to article

A Compare-Aggregate Model For Matching Text Sequences, Shuohang Wang, Jing Jiang Apr 2017

A Compare-Aggregate Model For Matching Text Sequences, Shuohang Wang, Jing Jiang

Research Collection School Of Computing and Information Systems

Many NLP tasks including machine comprehension, answer selection and text entailment require the comparison between sequences. Matching the important units between sequences is a key to solve these problems. In this paper, we present a general "compare-aggregate" framework that performs word-level matching followed by aggregation using Convolutional Neural Networks. We particularly focus on the different comparison functions we can use to match two vectors. We use four different datasets to evaluate the model. We find that some simple comparison functions based on element-wise operations can work better than standard neural network and neural tensor network.

Go to article

Machine Comprehension Using Match-Lstm And Answer Pointer, Shuohang Wang, Jing Jiang Apr 2017

Machine Comprehension Using Match-Lstm And Answer Pointer, Shuohang Wang, Jing Jiang

Research Collection School Of Computing and Information Systems

Machine comprehension of text is an important problem in natural language processing. A recently released dataset, the Stanford Question Answering Dataset (SQuAD), offers a large number of real questions and their answers created by humans through crowdsourcing. SQuAD provides a challenging testbed for evaluating machine comprehension algorithms, partly because compared with previous datasets, in SQuAD the answers do not come from a small set of candidate answers and they have variable lengths. We propose an end-to-end neural architecture for the task. The architecture is based on match-LSTM, a model we proposed previously for textual entailment, and Pointer Net, a sequence-to-sequence …

Go to article

Discovering Anomalous Events From Urban Informatics Data, Kasthuri Jayarajah, Vigneshwaran Subbaraju, Dulanga Kaveesha Weerakoon Mudiyanselage, Archan Misra, La Thanh Tam, Noel Athaide Apr 2017

Discovering Anomalous Events From Urban Informatics Data, Kasthuri Jayarajah, Vigneshwaran Subbaraju, Dulanga Kaveesha Weerakoon Mudiyanselage, Archan Misra, La Thanh Tam, Noel Athaide

Research Collection School Of Computing and Information Systems

Singapore's "smart city" agenda is driving the government to provide public access to a broader variety of urban informatics sources, such as images from traffic cameras and information about buses servicing different bus stops. Such informatics data serves as probes of evolving conditions at different spatiotemporal scales. This paper explores how such multi-modal informatics data can be used to establish the normal operating conditions at different city locations, and then apply appropriate outlier-based analysis techniques to identify anomalous events at these selected locations. We will introduce the overall architecture of sociophysical analytics, where such infrastructural data sources can be combined …

Go to article

Privacy In Context-Aware Mobile Crowdsourcing Systems, Thivya Kandappu, Archan Misra, Shih-Fen Cheng, Hoong Chuin Lau Mar 2017

Privacy In Context-Aware Mobile Crowdsourcing Systems, Thivya Kandappu, Archan Misra, Shih-Fen Cheng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Mobile crowd-sourcing can become as a strategy to perform time-sensitive urban tasks (such as municipal monitoring and last mile logistics) by effectively coordinating smartphone users. The success of the mobile crowd-sourcing platform depends mainly on its effectiveness in engaging crowd-workers, and recent studies have shown that compared to the pull-based approach, which relies on crowd-workers to browse and commit to tasks they would want to perform, the push-based approach can take into consideration of worker’s daily routine, and generate highly effective recommendations. As a result, workers waste less time on detours, plan more in advance, and require much less planning …

Go to article

The Wonders Of The Spreadsheet Tool For Data Management And Insights, Michelle L. F. Cheong Mar 2017

The Wonders Of The Spreadsheet Tool For Data Management And Insights, Michelle L. F. Cheong

Research Collection School Of Computing and Information Systems

Ask any student at the Singapore Management University (SMU) toname one of the most practical and useful courses offered by theuniversity. The answer would inevitably include CAT. CAT stands forthe "Computer as an Analysis Tool" course. Originally based on acourse of the same title offered by the Wharton Business School, thefocus of CAT was shifted to provide business students the essentialpractical skills and necessary “real-world” exposure to better usepersonal computers for resolving business problems. The course isbasically centred on using the Excel spreadsheet to work onambiguous ill-defined problems (Leong & Cheong, 2009). Over theyears, three editions of a textbook have …

Go to article

Feature Learning Via Partial Differential Equation With Applications To Face Recognition, Cong Fang, Zhenyu Zhao, Pan Zhou, Zhouchen Lin Mar 2017

Feature Learning Via Partial Differential Equation With Applications To Face Recognition, Cong Fang, Zhenyu Zhao, Pan Zhou, Zhouchen Lin

Research Collection School Of Computing and Information Systems

Feature learning is a critical step in pattern recognition, such as image classification. However, most of the existing methods cannot extract features that are discriminative and at the same time invariant under some transforms. This limits the classification performance, especially in the case of small training sets. To address this issue, in this paper we propose a novel Partial Differential Equation (PDE) based method for feature learning. The feature learned by our PDE is discriminative, also translationally and rotationally invariant, and robust to illumination variation. To our best knowledge, this is the first work that applies PDE to feature learning …

Go to article

A Riemannian Network For Spd Matrix Learning, Zhiwu Huang, Gool L. Van Feb 2017

A Riemannian Network For Spd Matrix Learning, Zhiwu Huang, Gool L. Van

Research Collection School Of Computing and Information Systems

Symmetric Positive Definite (SPD) matrix learning methods have become popular in many image and video processing tasks, thanks to their ability to learn appropriate statistical representations while respecting Riemannian geometry of underlying SPD manifolds. In this paper we build a Riemannian network architecture to open up a new direction of SPD matrix non-linear learning in a deep model. In particular, we devise bilinear mapping layers to transform input SPD matrices to more desirable SPD matrices, exploit eigenvalue rectification layers to apply a non-linear activation function to the new SPD matrices, and design an eigenvalue logarithm layer to perform Riemannian computing …

Go to article

Collective Multiagent Sequential Decision Making Under Uncertainty, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau Feb 2017

Collective Multiagent Sequential Decision Making Under Uncertainty, Duc Thien Nguyen, Akshat Kumar, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Multiagent sequential decision making has seen rapid progress with formal models such as decentralized MDPs and POMDPs. However, scalability to large multiagent systems and applicability to real world problems remain limited. To address these challenges, we study multiagent planning problems where the collective behavior of a population of agents affects the joint-reward and environment dynamics. Our work exploits recent advances in graphical models for modeling and inference with a population of individuals such as collective graphical models and the notion of finite partial exchangeability in lifted inference. We develop a collective decentralized MDP model where policies can be computed based …

Go to article

Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang Feb 2017

Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang

Research Collection School Of Computing and Information Systems

Opinion target extraction is a fundamental task in opinion mining. In recent years, neural network based supervised learning methods have achieved competitive performance on this task. However, as with any supervised learning method, neural network based methods for this task cannot work well when the training data comes from a different domain than the test data. On the other hand, some rule-based unsupervised methods have shown to be robust when applied to different domains. In this work, we use rule-based unsupervised methods to create auxiliary labels and use neural network models to learn a hidden representation that works well for …

Go to article

Decentralized Planning In Stochastic Environments With Submodular Rewards, Rajiv Ranjan Kumar, Pradeep Varakantham, Akshat Kumar Feb 2017

Decentralized Planning In Stochastic Environments With Submodular Rewards, Rajiv Ranjan Kumar, Pradeep Varakantham, Akshat Kumar

Research Collection School Of Computing and Information Systems

Decentralized Markov Decision Process (Dec-MDP) providesa rich framework to represent cooperative decentralizedand stochastic planning problems under transition uncertainty.However, solving a Dec-MDP to generate coordinatedyet decentralized policies is NEXP-Hard. Researchershave made significant progress in providing approximate approachesto improve scalability with respect to number ofagents. However, there has been little or no research devotedto finding guarantees on solution quality for approximateapproaches considering multiple (more than 2 agents)agents. We have a similar situation with respect to the competitivedecentralized planning problem and the StochasticGame (SG) model. To address this, we identify models in thecooperative and competitive case that rely on submodular rewards,where we show …

Go to article

Dynamic Repositioning To Reduce Lost Demand In Bike Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet Feb 2017

Dynamic Repositioning To Reduce Lost Demand In Bike Sharing Systems, Supriyo Ghosh, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet

Research Collection School Of Computing and Information Systems

Bike Sharing Systems (BSSs) are widely adopted in major cities of the world due to concerns associated with extensive private vehicle usage, namely, increased carbon emissions, traffic congestion and usage of nonrenewable resources. In a BSS, base stations are strategically placed throughout a city and each station is stocked with a pre-determined number of bikes at the beginning of the day. Customers hire the bikes from one station and return them at another station. Due to unpredictable movements of customers hiring bikes, there is either congestion (more than required) or starvation (fewer than required) of bikes at base stations. Existing …

Go to article

Toward A Collaborative Ai Framework For Assistive Dementia Care, Tze-Yun Leong Feb 2017

Toward A Collaborative Ai Framework For Assistive Dementia Care, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

We envision an integrated framework for supporting the development and deployment of human-aware, general artificial intelligence (AI) that needs to collaborate in uncertain, changing environments. We examine the technology and system requirements of building assistive care agents for dementia or cognitive impaired patients through the continuum of care. We summarize the new AI capabilities and show examples of how an evolving, adaptive development approach would be able to support the basic functionalities and applications in a sound, practical, and scalable manner. We highlight the challenges and the opportunities involved in realizing the proposed framework, and call for future research and …

Go to article

An Efficient Approach To Model-Based Hierarchical Reinforcement Learning, Zhuoru Li, Akshay Narayan, Tze-Yun Leong Feb 2017

An Efficient Approach To Model-Based Hierarchical Reinforcement Learning, Zhuoru Li, Akshay Narayan, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

We propose a model-based approach to hierarchical reinforcement learning that exploits shared knowledge and selective execution at different levels of abstraction, to efficiently solve large, complex problems. Our framework adopts a new transition dynamics learning algorithm that identifies the common action-feature combinations of the subtasks, and evaluates the subtask execution choices through simulation. The framework is sample efficient, and tolerates uncertain and incomplete problem characterization of the subtasks. We test the framework on common benchmark problems and complex simulated robotic environments. It compares favorably against the stateof-the-art algorithms, and scales well in very large problems.

Go to article

Optimizing Expectation With Guarantees In Pomdps, Krishnendu Chatterjee, Guillermo A. Perez, Jean-François Raskin, Dorde Zikelic Feb 2017

Optimizing Expectation With Guarantees In Pomdps, Krishnendu Chatterjee, Guillermo A. Perez, Jean-François Raskin, Dorde Zikelic

Research Collection School Of Computing and Information Systems

A standard objective in partially-observable Markov decision processes (POMDPs) is to find a policy that maximizes the expected discounted-sum payoff. However, such policies may still permit unlikely but highly undesirable outcomes, which is problematic especially in safety-critical applications. Recently, there has been a surge of interest in POMDPs where the goal is to maximize the probability to ensure that the payoff is at least a given threshold, but these approaches do not consider any optimization beyond satisfying this threshold constraint. In this work we go beyond both the "expectation" and "threshold" approaches and consider a "guaranteed payoff optimization (GPO)" problem …

Go to article

Validating Social Media Data For Automatic Persona Generation, Jisun An, Haewoon Kwak, Bernard J Jansen Dec 2016

Validating Social Media Data For Automatic Persona Generation, Jisun An, Haewoon Kwak, Bernard J Jansen

Research Collection School Of Computing and Information Systems

Using personas during interactive design has considerable potential for product and content development. Unfortunately, personas have typically been a fairly static technique. In this research, we validate an approach for creating personas in real time, based on analysis of actual social media data in an effort to automate the generation of personas. We validate that social media data can be implemented as an approach for automating generating personas in real time using actual YouTube social media data from a global media corporation that produces online digital content. Using the organization's YouTube channel, we collect demographic data, customer interactions, and topical …

Go to article

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen Dec 2016

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the Generalized OP, the Arc OP, …

Go to article

Managing Egress Of Crowd During Infrastructure Disruption, Teck Hou Teng, Shih-Fen Cheng, Trong-Nghia Truong, Hoong Chuin Lau Dec 2016

Managing Egress Of Crowd During Infrastructure Disruption, Teck Hou Teng, Shih-Fen Cheng, Trong-Nghia Truong, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In a large indoor environment such as a sports arena or convention center, smooth egress of crowd after an event can be seriously affected if infrastructure such as elevators and escalators break down. In this paper, we propose a novel crowd simulator known as SIM-DISRUPT for simulating egress scenarios in non-emergency situations. To surface the impact of disrupted infrastructure on the egress of crowd, SIM-DISRUPT includes features that allow users to specify selective disruptions as well as strategies for controlling the distribution and egress choices of crowd. Using SIM-DISRUPT, we investigate effects of crowd distribution, egress choices and infrastructure disruptions …

Go to article

An Agent-Based Approach To Human Migration Movement, Larry Lin, Kathleen M. Carley, Shih-Fen Cheng Dec 2016

An Agent-Based Approach To Human Migration Movement, Larry Lin, Kathleen M. Carley, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

How are the populations of the world likely to shift? Which countries will be impacted by sea-level rise? This paper uses a country-level agent-based dynamic network model to examine shifts in population given network relations among countries, which influences overall population change. Some of the networks considered include: alliance networks, shared language networks, economic influence networks, and proximity networks. Validation of model is done for migration probabilities between countries, as well as for country populations and distributions. The proposed framework provides a way to explore the interaction between climate change and policy factors at a global scale.

Go to article

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen Dec 2016

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen

Research Collection School Of Computing and Information Systems

Duplicate record, see https://ink.library.smu.edu.sg/sis_research/3271. The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the …

Go to article

Lexicon Knowledge Extraction With Sentiment Polarity Computation, Zhaoxia Wang, Vincent Joo Chuan Tong, Pingcheng Ruan, Fang Li Dec 2016

Lexicon Knowledge Extraction With Sentiment Polarity Computation, Zhaoxia Wang, Vincent Joo Chuan Tong, Pingcheng Ruan, Fang Li

Research Collection School Of Computing and Information Systems

Sentiment analysis is one of the most popular natural language processing techniques. It aims to identify the sentiment polarity (positive, negative, neutral or mixed) within a given text. The proper lexicon knowledge is very important for the lexicon-based sentiment analysis methods since they hinge on using the polarity of the lexical item to determine a text's sentiment polarity. However, it is quite common that some lexical items appear positive in the text of one domain but appear negative in another. In this paper, we propose an innovative knowledge building algorithm to extract sentiment lexicon knowledge through computing their polarity value …

Go to article

Zero++: Harnessing The Power Of Zero Appearances To Detect Anomalies In Large-Scale Data Sets, Guansong Pang, Kai Ming Ting, David Albrecht, Huidong Jin Dec 2016

Zero++: Harnessing The Power Of Zero Appearances To Detect Anomalies In Large-Scale Data Sets, Guansong Pang, Kai Ming Ting, David Albrecht, Huidong Jin

Research Collection School Of Computing and Information Systems

This paper introduces a new unsupervised anomaly detector called ZERO++ which employs the number of zero appearances in subspaces to detect anomalies in categorical data. It is unique in that it works in regions of subspaces that are not occupied by data; whereas existing methods work in regions occupied by data. ZERO++ examines only a small number of low dimensional subspaces to successfully identify anomalies. Unlike existing frequencybased algorithms, ZERO++ does not involve subspace pattern searching. We show that ZERO++ is better than or comparable with the state-of-the-art anomaly detection methods over a wide range of real-world categorical and numeric …

Go to article

Reducing Adaptation Latency For Multi-Concept Visual Perception In Outdoor Environments, Maggie Wigness, John G. Rogers, Luis Ernesto Navarro-Serment, Arne Suppe, Bruce A. Draper Nov 2016

Reducing Adaptation Latency For Multi-Concept Visual Perception In Outdoor Environments, Maggie Wigness, John G. Rogers, Luis Ernesto Navarro-Serment, Arne Suppe, Bruce A. Draper

Research Collection School Of Computing and Information Systems

Multi-concept visual classification is emerging as a common environment perception technique, with applications in autonomous mobile robot navigation. Supervised visual classifiers are typically trained with large sets of images, hand annotated by humans with region boundary outlines followed by label assignment. This annotation is time consuming, and unfortunately, a change in environment requires new or additional labeling to adapt visual perception. The time is takes for a human to label new data is what we call adaptation latency. High adaptation latency is not simply undesirable but may be infeasible for scenarios with limited labeling time and resources. In this paper, …

Go to article

A Decomposition Method For Estimating Recursive Logit Based Route Choice Models, Tien Mai, Fabian Bastin, Emma Frejinger Nov 2016

A Decomposition Method For Estimating Recursive Logit Based Route Choice Models, Tien Mai, Fabian Bastin, Emma Frejinger

Research Collection School Of Computing and Information Systems

Fosgerau et al. (2013) recently proposed the recursive logit (RL) model for route choice problems, that can be consistently estimated and easily used for prediction without any sampling of choice sets. Its estimation however requires solving many large-scale systems of linear equations, which can be computationally costly for real data sets. We design a decomposition (DeC) method in order to reduce the number of linear systems to be solved, opening the possibility to estimate more complex RL based models, for instance mixed RL models. We test the performance of the DeC method by estimating the RL model on two networks …

Go to article

Achieving Economic And Environmental Sustainabilities In Urban Consolidation Center With Bicriteria Auction, Stephanus Daniel Handoko, Hoong Chuin Lau, Shih-Fen Cheng Oct 2016

Achieving Economic And Environmental Sustainabilities In Urban Consolidation Center With Bicriteria Auction, Stephanus Daniel Handoko, Hoong Chuin Lau, Shih-Fen Cheng

Research Collection School Of Computing and Information Systems

Consolidation lies at the heart of the last-mile logistics problem. Urban consolidation centers (UCCs) have been set up to facilitate such consolidation all over the world. To the best of our knowledge, most-if not all-of the UCCs operate on volume-based fixed-rate charges. To achieve environmental sustainability while ensuring economic sustainability in urban logistics, we propose, in this paper, a bicriteria auction mechanism for the automated assignment of last-mile delivery orders to transport resources. We formulate and solve the winner determination problem of the auction as a biobjective programming model. We then present a systematic way to generate the Pareto frontier …

Go to article

Bilevel Model-Based Discriminative Dictionary Learning For Recognition, Pan Zhou, Chao Zhang, Lin Zhouchen Oct 2016

Bilevel Model-Based Discriminative Dictionary Learning For Recognition, Pan Zhou, Chao Zhang, Lin Zhouchen

Research Collection School Of Computing and Information Systems

Most supervised dictionary learning methods optimize the combinations of reconstruction error, sparsity prior, and discriminative terms. Thus, the learnt dictionaries may not be optimal for recognition tasks. Also, the sparse codes learning models in the training and the testing phases are inconsistent. Besides, without utilizing the intrinsic data structure, many dictionary learning methods only employ the 0 or 1 norm to encode each datum independently, limiting the performance of the learnt dictionaries. We present a novel bilevel model-based discriminative dictionary learning method for recognition tasks. The upper level directly minimizes the classification error, while the lower level uses the sparsity …

Go to article

Human-Centred Design For Silver Assistants, Zhiwei Zheng, Di Wang, Ailiya Borjigin, Chunyan Miao, Ah-Hwee Tan, Cyril Leung Sep 2016

Human-Centred Design For Silver Assistants, Zhiwei Zheng, Di Wang, Ailiya Borjigin, Chunyan Miao, Ah-Hwee Tan, Cyril Leung

Research Collection School Of Computing and Information Systems

To alleviate the rapidly increasing need of the healthcare workforce to serve the enormous ageing population, leveraging intelligent and autonomous caring agents is one promising way. Working towards the design and development of dedicated personal silver assistants for older adults, we follow the human-centred design approach. Specifically, we identify a number of human factors that affect the user experience of the older adults and develop an agent named Mobile Intelligent Silver Assistant (MISA) by applying these human factors. Integrating multiple reusable services onto one platform, MISA acts as a single point of contact while simultaneously providing easy and convenient access …

Go to article

Tasker: Behavioral Insights Via Campus-Based Experimental Mobile Crowd-Sourcing, Thivya Kandappu, Nikita Jaiman, Randy Tandriansyah Daratan, Archan Misra, Shih-Fen Cheng, Cen Chen, Hoong Chuin Lau, Deepthi Chander, Koustuv Dasgupta Sep 2016

Tasker: Behavioral Insights Via Campus-Based Experimental Mobile Crowd-Sourcing, Thivya Kandappu, Nikita Jaiman, Randy Tandriansyah Daratan, Archan Misra, Shih-Fen Cheng, Cen Chen, Hoong Chuin Lau, Deepthi Chander, Koustuv Dasgupta

Research Collection School Of Computing and Information Systems

While mobile crowd-sourcing has become a game-changer for many urban operations, such as last mile logistics and municipal monitoring, we believe that the design of such crowdsourcing strategies must better accommodate the real-world behavioral preferences and characteristics of users. To provide a real-world testbed to study the impact of novel mobile crowd-sourcing strategies, we have designed, developed and experimented with a real-world mobile crowd-tasking platform on the SMU campus, called TA$Ker. We enhanced the TA$Ker platform to support several new features (e.g., task bundling, differential pricing and cheating analytics) and experimentally investigated these features via a two-month deployment of TA$Ker, …

Go to article

An Intelligent System For Personalized Conference Event Recommendation And Scheduling, Aldy Gunawan, Hoong Chuin Lau, Pradeep Varakantham, Wenjie Wang Sep 2016

An Intelligent System For Personalized Conference Event Recommendation And Scheduling, Aldy Gunawan, Hoong Chuin Lau, Pradeep Varakantham, Wenjie Wang

Research Collection School Of Computing and Information Systems

Many conference mobile apps today lack the intelligent feature to automatically generates optimal schedules based on delegates' preferences. This entails two major challenges: (a) identifying preferences of users; and (b) given the preferences, generating a schedule that optimizes his preferences. In this paper, we specifically focus on academic conferences, where users are prompted to input their preferred keywords. Our key contribution is an integrated conference scheduling agent that automatically recognizes user preferences based on keywords, provides a list of recommended talks and optimizes user schedule based on these preferences. To demonstrate the utility of our integrated conference scheduling agent, we …

Go to article

First Prev Next Last