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

Databases and Information Systems Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 2041 - 2070 of 3560

Full-Text Articles in Databases and Information Systems

Friendship Maintenance And Prediction In Multiple Social Networks, Roy Ka-Wei Lee, Ee-Peng Lim Jan 2016

Friendship Maintenance And Prediction In Multiple Social Networks, Roy Ka-Wei Lee, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Due to the proliferation of online social networks (OSNs), users find themselves participating in multiple OSNs. These users leave their activity traces as they maintain friendships and interact with other users in these OSNs. In this work, we analyze how users maintain friendship in multiple OSNs by studying users who have accounts in both Twitter and Instagram. Specifically, we study the similarity of a user's friendship and the evenness of friendship distribution in multiple OSNs. Our study shows that most users in Twitter and Instagram prefer to maintain different friendships in the two OSNs, keeping only a small clique of …


Fast Reinforcement Learning Under Uncertainties With Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan Dec 2015

Fast Reinforcement Learning Under Uncertainties With Self-Organizing Neural Networks, Teck-Hou Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Using feedback signals from the environment, a reinforcement learning (RL) system typically discovers action policies that recommend actions effective to the states based on a Q-value function. However, uncertainties over the estimation of the Q-values can delay the convergence of RL. For fast RL convergence by accounting for such uncertainties, this paper proposes several enhancements to the estimation and learning of the Q-value using a self-organizing neural network. Specifically, a temporal difference method known as Q-learning is complemented by a Q-value Polarization procedure, which contrasts the Q-values using feedback signals on the effect of the recommended actions. The polarized Q-values …


Coordinated Persuasion With Dynamic Group Formation For Collaborative Elderly Care, Budhitama Subagdja, Ah-Hwee Tan Dec 2015

Coordinated Persuasion With Dynamic Group Formation For Collaborative Elderly Care, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Ageing in place demands a new paradigm of inhouse caregiving allowing many aspects of daily lives to be tackled by smart appliances and technologies. The important challenges include the effective provision of recommendations by multiple parties of caregiver constituting changes of the user’s behavior. In this multiagent environment, interdependencies between agents become major issues to tackle. This paper presents an approach of dynamic group formation for autonomous caregiving agents to collaborate in recommending different aspects of well-being. The approach supports the agents to regulate the timing of their recommendations, prevent conflicting messages, and cooperate to make more effective persuasions. A …


A Benchmark And Comparative Study Of Video-Based Face Recognition On Cox Face Database, Zhiwu Huang, S. Shan, R. Wang, H. Zhang, S. Lao, A. Kuerban, X. Chen Dec 2015

A Benchmark And Comparative Study Of Video-Based Face Recognition On Cox Face Database, Zhiwu Huang, S. Shan, R. Wang, H. Zhang, S. Lao, A. Kuerban, X. Chen

Research Collection School Of Computing and Information Systems

Face recognition with still face images has been widely studied, while the research on video-based face recognition is inadequate relatively, especially in terms of benchmark datasets and comparisons. Real-world video-based face recognition applications require techniques for three distinct scenarios: 1) Videoto-Still (V2S); 2) Still-to-Video (S2V); and 3) Video-to-Video (V2V), respectively, taking video or still image as query or target. To the best of our knowledge, few datasets and evaluation protocols have benchmarked for all the three scenarios. In order to facilitate the study of this specific topic, this paper contributes a benchmarking and comparative study based on a newly collected …


Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch Dec 2015

Adaptive Scaling Of Cluster Boundaries For Large-Scale Social Media Data Clustering, Lei Meng, Ah-Hwee Tan, Donald C. Wunsch

Research Collection School Of Computing and Information Systems

The large scale and complex nature of social media data raises the need to scale clustering techniques to big data and make them capable of automatically identifying data clusters with few empirical settings. In this paper, we present our investigation and three algorithms based on the fuzzy adaptive resonance theory (Fuzzy ART) that have linear computational complexity, use a single parameter, i.e., the vigilance parameter to identify data clusters, and are robust to modest parameter settings. The contribution of this paper lies in two aspects. First, we theoretically demonstrate how complement coding, commonly known as a normalization method, changes the …


A Misspecification Test For Logit Based Route Choice Models, Tien Mai, Emma Frejinger, Fabian Bastin Dec 2015

A Misspecification Test For Logit Based Route Choice Models, Tien Mai, Emma Frejinger, Fabian Bastin

Research Collection School Of Computing and Information Systems

The multinomial logit (MNL) model is often used for analyzing route choices in real networks in spite of the fact that path utilities are believed to be correlated. Yet, statistical tests for model misspecification are rarely used. This paper shows how the information matrix test for model misspecification proposed byWhite (1982) can be applied to test path-based and link-based MNL route choice models.We present a Monte Carlo experiment using simulated data to assess the size and the power of the test and to compare its performance with the IIA (Hausman and McFadden, 1984) and McFadden–Train Lagrange multiplier (McFadden and Train, …


Mylife: An Online Personal Memory Album, Di Wang, Ah-Hwee Tan Dec 2015

Mylife: An Online Personal Memory Album, Di Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

In this demo, we illustrate the formation, retrieval, and playback of autobiographical memory in an online personal memory album named MyLife. The memory in MyLife consists of pictorial snapshots of one's life together with the associated context, namely time, location, people, activity, imagery, and emotion. MyLife allows direct import of memories from other online personal photo repositories. For memory retrieval, users can use not only exact cues, but also partial, vague, inaccurate, and random ones. The retrieved memories are then played back as a movie-like slide show with various visual effects and background music. MyLife holds high potential in both …


Preface: Wi 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, Jie Zhang, Dell Zhang, Julita Vassileva Dec 2015

Preface: Wi 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, Jie Zhang, Dell Zhang, Julita Vassileva

Research Collection School Of Computing and Information Systems

This volume contains the papers selected for presentation at the 2015 IEEE/WIC/ACM International Conference on Web Intelligence (WI’15), which was held from 6 to 9 December 2015 in Singapore, a city which welcomes people from different parts of the world to work and play. Following the tradition of WI conference in previous years, WI’15 was collocated with 2015 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT’15). Both WI’15 and IAT’15 were sponsored by the IEEE Computer Society, Web Intelligence Consortium (WIC), Association for Computing Machinery (ACM), and the Memetic Computing Society. The two collocated conferences were hosted by the Joint …


Preface Iat 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, An Bo, Anita Raja, Sarvapali Ramchurn Dec 2015

Preface Iat 2015, Ah-Hwee Tan, Yuefeng Li, Ee-Peng Lim, An Bo, Anita Raja, Sarvapali Ramchurn

Research Collection School Of Computing and Information Systems

This volume contains the papers selected for presentation at the 2015 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT’15), which was held from 6 to 9 December 2015 in Singapore, a city which welcomes people from different parts of the world to work and play. Following the tradition of IAT conference in previous years, IAT’15 was collocated with 2015 IEEE/WIC/ACM International Conference on Web Intelligence (WI’15). Both WI’15 and IAT’15 were sponsored by the IEEE Computer Society, Web Intelligence Consortium (WIC), Association for Computing Machinery (ACM), and the Memetic Computing Society. The two collocated conferences were hosted by the Joint …


Preface To Wi-Iat 2015 Workshops And Demo/Posters, Ah-Hwee Tan, Yuefeng Li Dec 2015

Preface To Wi-Iat 2015 Workshops And Demo/Posters, Ah-Hwee Tan, Yuefeng Li

Research Collection School Of Computing and Information Systems

This volume contains the papers selected for presentation at the workshops and demonstration/poster track as part of the 2015 IEEE/WIC/ACM International Conference on Web Intelligence (WI’15) and 2015 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT’15) held from 6 to 9 December 2015 in Singapore.


Progressive Sequence Matching For Adl Plan Recommendation, Shan Gao, Di Wang, Ah-Hwee Tan, Chunyan Miao Dec 2015

Progressive Sequence Matching For Adl Plan Recommendation, Shan Gao, Di Wang, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

Activities of Daily Living (ADLs) are indicatives of a person’s lifestyle. In particular, daily ADL routines closely relate to a person’s well-being. With the objective of promoting active lifestyles, this paper presents an agent system that provides recommendations of suitable ADL plans (i.e., selected ADL sequences) to individual users based on the more active lifestyles of the others. Specifically, we develop a set of quantitative measures, named wellness scores, spanning the evaluation across the physical, cognitive, emotion, and social aspects based on his or her ADL routines. Then we propose an ADL sequence learning model, named Recommendation ADL ART, or …


Silver Assistants For Aging-In-Place, Di Wang, Budhitama Subagdja, Yilin Kang, Ah-Hwee Tan Dec 2015

Silver Assistants For Aging-In-Place, Di Wang, Budhitama Subagdja, Yilin Kang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

In this demo, we present an assembly of silver assistants for supporting Aging-In-Place (AIP). The virtual agents are designed to serve around the clock to complement human care within the intelligent home environment. Residing in different platforms with ubiquitous access, the agents collaboratively provide holistic care to the elderly users. The demonstration is shown in a 3-D virtual home replicating a typical 5-room apartment in Singapore. Sensory inputs are stored in a knowledge base named Situation Awareness Model (SAM). Therefore, the capabilities of the agents can always be extended by expanding the knowledge defined in SAM. Using the simulation system, …


Non-Intrusive Robust Human Activity Recognition For Diverse Age Groups, Di Wang, Ah-Hwee Tan, Daqing Zhang Dec 2015

Non-Intrusive Robust Human Activity Recognition For Diverse Age Groups, Di Wang, Ah-Hwee Tan, Daqing Zhang

Research Collection School Of Computing and Information Systems

—Many elderly prefer to live independently at their own homes. However, how to use modern technologies to ensure their safety presents vast challenges and opportunities. Being able to non-intrusively sense the activities performed by the elderly definitely has great advantages in various circumstances. Non-intrusive activity recognition can be performed using the embedded sensors in modern smartphones. However, not many activity recognition models are robust enough that allow the subjects to carry the smartphones in different pockets with unrestricted orientations and varying deviations. Moreover, to the best of our knowledge, no existing literature studied the difference between the youth and the …


Supercnn: A Superpixelwise Convolutional Neural Network For Salient Object Detection, Shengfeng He, Rynson W.H. Lau, Wenxi Liu, Zhe Huang, Qingxiong Yang Dec 2015

Supercnn: A Superpixelwise Convolutional Neural Network For Salient Object Detection, Shengfeng He, Rynson W.H. Lau, Wenxi Liu, Zhe Huang, Qingxiong Yang

Research Collection School Of Computing and Information Systems

Existing computational models for salient object detection primarily rely on hand-crafted features, which are only able to capture low-level contrast information. In this paper, we learn the hierarchical contrast features by formulating salient object detection as a binary labeling problem using deep learning techniques. A novel superpixelwise convolutional neural network approach, called SuperCNN, is proposed to learn the internal representations of saliency in an efficient manner. In contrast to the classical convolutional networks, SuperCNN has four main properties. First, the proposed method is able to learn the hierarchical contrast features, as it is fed by two meaningful superpixel sequences, which …


On Top-K Selection In Multi-Armed Bandits And Hidden Bipartite Graphs, Wei Cao, Jian Li, Yufei Tao, Zhize Li Dec 2015

On Top-K Selection In Multi-Armed Bandits And Hidden Bipartite Graphs, Wei Cao, Jian Li, Yufei Tao, Zhize Li

Research Collection School Of Computing and Information Systems

This paper discusses how to efficiently choose from $n$ unknown distributions the $k$ ones whose means are the greatest by a certain metric, up to a small relative error. We study the topic under two standard settings---multi-armed bandits and hidden bipartite graphs---which differ in the nature of the input distributions. In the former setting, each distribution can be sampled (in the i.i.d. manner) an arbitrary number of times, whereas in the latter, each distribution is defined on a population of a finite size $m$ (and hence, is fully revealed after m samples). For both settings, we prove lower bounds on …


On Neighborhood Effects In Location-Based Social Networks, Thanh-Nam Doan, Freddy Chong-Tat Chua, Ee-Peng Lim Dec 2015

On Neighborhood Effects In Location-Based Social Networks, Thanh-Nam Doan, Freddy Chong-Tat Chua, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we analyze factors that determine the check-in decisions of users on venues using a location-based social network dataset. Based on a Foursquare dataset constructed from Singapore-based users, we devise a stringent criteria to identify the actual home locations of a subset of users. Using these users' check-ins, we aim to ascertain the neighborhood effect on the venues visited, compared with the activity level of users. We further formulate the check-in count prediction and check-in prediction tasks. A comprehensive set of features have been defined and they encompass information from users, venues, their neighbors, and friendship networks. We …


A Bayesian Recommender Model For User Rating And Review Profiling, Mingming Jiang, Dandan Song, Lejian Liao, Feida Zhu Dec 2015

A Bayesian Recommender Model For User Rating And Review Profiling, Mingming Jiang, Dandan Song, Lejian Liao, Feida Zhu

Research Collection School Of Computing and Information Systems

Intuitively, not only do ratings include abundant information for learning user preferences, but also reviews accompanied by ratings. However, most existing recommender systems take rating scores for granted and discard the wealth of information in accompanying reviews. In this paper, in order to exploit user profiles' information embedded in both ratings and reviews exhaustively, we propose a Bayesian model that links a traditional Collaborative Filtering (CF) technique with a topic model seamlessly. By employing a topic model with the review text and aligning user review topics with "user attitudes" (i.e., abstract rating patterns) over the same distribution, our method achieves …


Adaptive Duty Cycling In Sensor Networks With Energy Harvesting Using Continuous-Time Markov Chain And Fluid Models, Ronald Wai Hong Chan, Pengfei Zhang, Ido Nevat, Sai Ganesh Nagarajan, Alvin Cerdena Valera, Hwee Xian Tan Dec 2015

Adaptive Duty Cycling In Sensor Networks With Energy Harvesting Using Continuous-Time Markov Chain And Fluid Models, Ronald Wai Hong Chan, Pengfei Zhang, Ido Nevat, Sai Ganesh Nagarajan, Alvin Cerdena Valera, Hwee Xian Tan

Research Collection School Of Computing and Information Systems

The dynamic and unpredictable nature of energy harvesting sources available for wireless sensor networks, and the time variation in network statistics like packet transmission rates and link qualities, necessitate the use of adaptive duty cycling techniques. Such adaptive control allows sensor nodes to achieve long-run energy neutrality, where energy supply and demand are balanced in a dynamic environment such that the nodes function continuously. In this paper, we develop a new framework enabling an adaptive duty cycling scheme for sensor networks that takes into account the node battery level, ambient energy that can be harvested, and application-level QoS requirements. We …


A Cooperative Coevolution Framework For Parallel Learning To Rank, Shuaiqiang Wang, Yun Wu, Byron J. Gao, Ke Wang, Hady W. Lauw, Jun Ma Dec 2015

A Cooperative Coevolution Framework For Parallel Learning To Rank, Shuaiqiang Wang, Yun Wu, Byron J. Gao, Ke Wang, Hady W. Lauw, Jun Ma

Research Collection School Of Computing and Information Systems

We propose CCRank, the first parallel framework for learning to rank based on evolutionary algorithms (EA), aiming to significantly improve learning efficiency while maintaining accuracy. CCRank is based on cooperative coevolution (CC), a divide-and-conquer framework that has demonstrated high promise in function optimization for problems with large search space and complex structures. Moreover, CC naturally allows parallelization of sub-solutions to the decomposed sub-problems, which can substantially boost learning efficiency. With CCRank, we investigate parallel CC in the context of learning to rank. We implement CCRank with three EA-based learning to rank algorithms for demonstration. Extensive experiments on benchmark datasets in …


Modeling Social Media Content With Word Vectors For Recommendation, Ying Ding, Jing Jiang Dec 2015

Modeling Social Media Content With Word Vectors For Recommendation, Ying Ding, Jing Jiang

Research Collection School Of Computing and Information Systems

In social media, recommender systems are becoming more and more important. Different techniques have been designed for recommendations under various scenarios, but many of them do not use user-generated content, which potentially reflects users’ opinions and interests. Although a few studies have tried to combine user-generated content with rating or adoption data, they mostly reply on lexical similarity to calculate textual similarity. However, in social media, a diverse range of words is used. This renders the traditional ways of calculating textual similarity ineffective. In this work, we apply vector representation of words to measure the semantic similarity between text. We …


Aesthetic Experience And Acceptance Of Human Computation Games, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim, Adrian Wei Liang Vu Dec 2015

Aesthetic Experience And Acceptance Of Human Computation Games, Xiaohui Wang, Dion Hoe-Lian Goh, Ee-Peng Lim, Adrian Wei Liang Vu

Research Collection School Of Computing and Information Systems

Human computation games (HCGs) are applications that leverage games to solve computational problems that are out reach of the capacity of computers. Game aesthetics are critical for HCG acceptance, and the game elements should motivate users to contribute time and effort. In this paper, we examine the effect of aesthetic experience on intention to use HCGs. A between-subjects experiment was conducted to compare a HCG and a human computation system (HCS). Results demonstrated that HCGs provided a greater sense of aesthetic experience and attracted more intentional usage than HCSs. Implications of this study are discussed.


Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig Dec 2015

Incremental Dcop Search Algorithms For Solving Dynamic Dcop Problems, William Yeoh, Pradeep Varakantham, Xiaoxun Sun, Sven Koenig

Research Collection School Of Computing and Information Systems

Distributed constraint optimization (DCOP) problems are well-suited for modeling multi-agent coordination problems. However, it only models static problems, which do not change over time. Consequently, researchers have introduced the Dynamic DCOP (DDCOP) model to model dynamic problems. In this paper, we make two key contributions: (a) a procedure to reason with the incremental changes in DDCOPs and (b) an incremental pseudo-tree construction algorithm that can be used by DCOP algorithms such as any-space ADOPT and any-space BnB-ADOPT to solve DDCOPs. Due to the incremental reasoning employed, our experimental results show that any-space ADOPT and any-space BnB-ADOPT are up to 42% …


Active Crowdsourcing For Annotation, Shuji Hao, Chunyan Miao, Steven C. H. Hoi, Peilin Zhao Dec 2015

Active Crowdsourcing For Annotation, Shuji Hao, Chunyan Miao, Steven C. H. Hoi, Peilin Zhao

Research Collection School Of Computing and Information Systems

Crowdsourcing has shown great potential in obtaining large-scale and cheap labels for different tasks. However, obtaining reliable labels is challenging due to several reasons, such as noisy annotators, limited budget and so on. The state-of-the-art approaches, either suffer in some noisy scenarios, or rely on unlimited resources to acquire reliable labels. In this article, we adopt the learning with expert~(AKA worker in crowdsourcing) advice framework to robustly infer accurate labels by considering the reliability of each worker. However, in order to accurately predict the reliability of each worker, traditional learning with expert advice will consult with external oracles~(AKA domain experts) …


Understanding Psychophysiological Correlates Of User Experience Using Electroencephalogram (Eeg), Fiona Fui-Hoon Nah, Keng Siau, Randall Minas, Nathan W. Twyman, Nicholas A. Rollins, Wenbo Wang, Xi Wang Dec 2015

Understanding Psychophysiological Correlates Of User Experience Using Electroencephalogram (Eeg), Fiona Fui-Hoon Nah, Keng Siau, Randall Minas, Nathan W. Twyman, Nicholas A. Rollins, Wenbo Wang, Xi Wang

Research Collection School Of Computing and Information Systems

The objective of this research is to understand psychophysiological correlates of user experience using electroencephalogram (EEG). We will conduct an experimental study to assess the psychophysiological differences across three states of user experience – flow, boredom, and anxiety – and compare them with the neutral state as a baseline. EEG measurement provides a plethora of data that can be decomposed using different analytical procedures. We will utilize one type of analysis, timefrequency decomposition, to examine changes in frequency (e.g., alpha/beta/theta band) over time. These frequency bands correlate with different cognitive states. In this study, we will use Event Related Spectral …


Flow Experience In Virtual Worlds: Individuals Versus Dyads, Fiona Fui-Hoon Nah, Brenda Eschenbrenner Dec 2015

Flow Experience In Virtual Worlds: Individuals Versus Dyads, Fiona Fui-Hoon Nah, Brenda Eschenbrenner

Research Collection School Of Computing and Information Systems

Flow is a state of mind in which one is deeply absorbed and immersed in an activity to the point where nothing else matters. Although flow can occur in solitary and social contexts, which context fosters greater flow is unclear. Consistent with self-determination theory, dyads working collaboratively achieved higher states of flow than individuals working alone. In other words, dyads achieved higher states of focused concentration and experienced greater temporal dissociation than individuals working alone. Surprisingly and contradictory to previous findings, dyads did not experience greater enjoyment than individuals working alone. We attributed this surprising finding to the hedonic nature …


Bring-Your-Own-Application (Byoa): Optimal Stochastic Application Migration In Mobile Cloud Computing, Jonathan David Chase, Dusit Niyato, Sivadon Chaisiri Dec 2015

Bring-Your-Own-Application (Byoa): Optimal Stochastic Application Migration In Mobile Cloud Computing, Jonathan David Chase, Dusit Niyato, Sivadon Chaisiri

Research Collection School Of Computing and Information Systems

The increasing popularity of using mobile devices in a work context, has led to the need to be able to support more powerful computation. Users no longer remain in an office or at home to conduct their activities, preferring libraries and cafes. In this paper, we consider a mobile cloud computing scenario in which users bring their own mobile devices and are offered a variety of equipment, e.g., desktop computer, smart- TV, or projector, to migrate their applications to, so as to save battery life, improve usability and performance. We formulate a stochastic optimization problem to optimize the allocation of …


Content-Based Visual Landmark Search Via Multimodal Hypergraph Learning, Lei Zhu, Jialie Shen, Hai Jin, Ran Zheng, Liang Xie Dec 2015

Content-Based Visual Landmark Search Via Multimodal Hypergraph Learning, Lei Zhu, Jialie Shen, Hai Jin, Ran Zheng, Liang Xie

Research Collection School Of Computing and Information Systems

While content-based landmark image search has recently received a lot of attention and became a very active domain, it still remains a challenging problem. Among the various reasons, high diverse visual content is the most significant one. It is common that for the same landmark, images with a wide range of visual appearances can be found from different sources and different landmarks may share very similar sets of images. As a consequence, it is very hard to accurately estimate the similarities between the landmarks purely based on single type of visual feature. Moreover, the relationships between landmark images can be …


Lesinn: Detecting Anomalies By Identifying Least Similar Nearest Neighbours, Guansong Pang, Kai Ming Ting, David Albrecht Nov 2015

Lesinn: Detecting Anomalies By Identifying Least Similar Nearest Neighbours, Guansong Pang, Kai Ming Ting, David Albrecht

Research Collection School Of Computing and Information Systems

We introduce the concept of Least Similar Nearest Neighbours (LeSiNN) and use LeSiNN to detect anomalies directly. Although there is an existing method which is a special case of LeSiNN, this paper is the first to clearly articulate the underlying concept, as far as we know. LeSiNN is the first ensemble method which works well with models trained using samples of one instance. LeSiNN has linear time complexity with respect to data size and the number of dimensions, and it is one of the few anomaly detectors which can apply directly to both numeric and categorical data sets. Our extensive …


Intelligshop: Enabling Intelligent Shopping In Malls Through Location-Based Augmented Reality, Aditi Adhikari, Vincent W. Zheng, Hong Cao, Miao Lin, Yuan Fang, Kevin Chen-Chuan Chang Nov 2015

Intelligshop: Enabling Intelligent Shopping In Malls Through Location-Based Augmented Reality, Aditi Adhikari, Vincent W. Zheng, Hong Cao, Miao Lin, Yuan Fang, Kevin Chen-Chuan Chang

Research Collection School Of Computing and Information Systems

Shopping experience is important for both citizens and tourists. We present IntelligShop, a novel location-based augmented reality application that supports intelligent shopping experience in malls. As the key functionality, IntelligShop provides an augmented reality interface-people can simply use ubiquitous smartphones to face mall retailers, then IntelligShop will automatically recognize the retailers and fetch their online reviews from various sources (including blogs, forums and publicly accessible social media) to display on the phones. Technically, IntelligShop addresses two challenging data mining problems, including robust feature learning to support heterogeneous smartphones in localization and learning to query for automatically gathering the retailer content …


Cost-Sensitive Online Classification With Adaptive Regularization And Its Applications, Peilin Zhao, Furen Zhuang, Min Wu, Xiao-Li Li, Hoi, Steven C. H. Nov 2015

Cost-Sensitive Online Classification With Adaptive Regularization And Its Applications, Peilin Zhao, Furen Zhuang, Min Wu, Xiao-Li Li, Hoi, Steven C. H.

Research Collection School Of Computing and Information Systems

Cost-Sensitive Online Classification is recently proposed to directly online optimize two well-known cost-sensitive measures: (i) maximization of weighted sum of sensitivity and specificity, and (ii) minimization of weighted misclassification cost. However, the previous existing learning algorithms only utilized the first order information of the data stream. This is insufficient, as recent studies have proved that incorporating second order information could yield significant improvements on the prediction model. Hence, we propose a novel cost-sensitive online classification algorithm with adaptive regularization. We theoretically analyzed the proposed algorithm and empirically validated its effectiveness with extensive experiments. We also demonstrate the application of the …