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 2251 - 2280 of 3560

Full-Text Articles in Databases and Information Systems

Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li Aug 2014

Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li

Research Collection School Of Computing and Information Systems

Kernel-based regression represents an important family of learning techniques for solving challenging regression tasks with non-linear patterns. Despite being studied extensively, most of the existing work suffers from two major drawbacks: (i) they are often designed for solving regression tasks in a batch learning setting, making them not only computationally inefficient and but also poorly scalable in real-world applications where data arrives sequentially; and (ii) they usually assume a fixed kernel function is given prior to the learning task, which could result in poor performance if the chosen kernel is inappropriate. To overcome these drawbacks, this paper presents a novel …

Go to article

Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao Aug 2014

Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao

Research Collection School Of Computing and Information Systems

In this paper we study how to summarize travel-related information in forum threads to generate supplementary travel guides. Such summaries presumably can provide additional and more up-to-date information to tourists. Existing multi-document summarization methods have limitations for this task because (1) they do not generate structured summaries but travel guides usually follow a certain template, and (2) they do not put emphasis on named entities but travel guides often recommend points of interest to travelers. To overcome these limitations, we propose to use a latent variable model to align forum threads with the section structure of well-written travel guides. The …

Go to article

Jointly Modeling Aspects, Ratings And Sentiments For Movie Recommendation (Jmars), Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J. Smola, Jing Jiang, Chong Wang Aug 2014

Jointly Modeling Aspects, Ratings And Sentiments For Movie Recommendation (Jmars), Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J. Smola, Jing Jiang, Chong Wang

Research Collection School Of Computing and Information Systems

Recommendation and review sites offer a wealth of information beyond ratings. For instance, on IMDb users leave reviews, commenting on different aspects of a movie (e.g. actors, plot, visual effects), and expressing their sentiments (positive or negative) on these aspects in their reviews. This suggests that uncovering aspects and sentiments will allow us to gain a better understanding of users, movies, and the process involved in generating ratings. The ability to answer questions such as “Does this user care more about the plot or about the special effects?” or ”What is the quality of the movie in terms of acting?” …

Go to article

On Macro And Micro Exploration Of Hashtag Diffusion In Twitter, Yazhe Wang, Baihua Zheng Aug 2014

On Macro And Micro Exploration Of Hashtag Diffusion In Twitter, Yazhe Wang, Baihua Zheng

Research Collection School Of Computing and Information Systems

This exploratory work studies hashtag diffusion in Twitter. The analysis is conducted from two aspects. From the macro perspective, we study general properties of hashtag diffusion, and classify hashtags into three main classes based on their temporal dynamics referred as 'single spike', 'multi-spikes', and 'fluctuation', and find that each of these classes has some unique characteristics. From the micro perspective, we investigate individual diffusion.We adopt Edelman's 'topology of influence' theory to identify four type of users with different influence levels in diffusion based on their dynamic retweet behaviors. The results of our study are useful for gaining more insights of …

Go to article

Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu Aug 2014

Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu

Research Collection School Of Computing and Information Systems

For better viral marketing, there has been a lot of research on social influence maximization. However, the problem that who is influenced and how diverse the influenced population is, which is important in real-world marketing, has largely been neglected. To that end, in this paper, we propose to consider the magnitude of influence and the diversity of the influenced crowd simultaneously. Specifically, we formulate it as an optimization problem, i.e., diversified social influence maximization. First, we present a general framework for this problem, under which we construct a class of diversity measures to quantify the diversity of the influenced crowd. …

Go to article

Ranking Model Selection And Fusion For Effective Microblog Search, Zhongyu Wei, Wei Gao, Tarek El-Ganainy, Walid Magdy, Kam-Fai Wong Jul 2014

Ranking Model Selection And Fusion For Effective Microblog Search, Zhongyu Wei, Wei Gao, Tarek El-Ganainy, Walid Magdy, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Re-ranking was shown to have positive impact on the effectiveness for microblog search. Yet existing approaches mostly focused on using a single ranker to learn some better ranking function with respect to various relevance features. Given various available rank learners (such as learning to rank algorithms), in this work, we mainly study an orthogonal problem where multiple learned ranking models form an ensemble for re-ranking the retrieved tweets than just using a single ranking model in order to achieve higher search effectiveness. We explore the use of query-sensitive model selection and rank fusion methods based on the result lists produced …

Go to article

Multi-Cost And Upgradable Spatial Network Databases, Yimin Lin Jul 2014

Multi-Cost And Upgradable Spatial Network Databases, Yimin Lin

Dissertations and Theses Collection (Open Access)

In this dissertation, we first consider data processing problems in multi-cost networks and in upgradable networks. These network types are motivated by real-life situations, which do not fall under the standard spatial network formulation and have not received much attention from database researchers. In a multi-cost network (MCN), each edge is associated with more than one weight type that may affect the user-specific perception of distance. We study two query types on MCNs, namely, the MCN skyline and the MCN top-k query. In an upgradable network, a subset of the edges are amenable to weight reduction, at a cost (e.g., …

Go to article

User Daily Activity Pattern Learning: A Multi-Memory Modeling Approach, Shan Gao, Ah-Hwee Tan Jul 2014

User Daily Activity Pattern Learning: A Multi-Memory Modeling Approach, Shan Gao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

In this paper, we propose a multi-memory model, ADLART model, to discover the daily activity pattern of a sensor monitored user from his/her activities of daily living (ADL). The proposed model mimics the human multiple memory system which comprises a working memory, an episodic memory, and a semantic memory. Through encoding user's daily activities patterns in episodic memory and extracting the regularities of activity routines in semantic memory, the ADLART system is able to learn, recognize, compare, and retrieve daily ADL patterns of the user. Experiments are presented to show the performance of the ADLART model using different parameter settings …

Go to article

Mobile Humanoid Agent With Mood Awareness For Elderly Care, Di Wang, Ah-Hwee Tan Jul 2014

Mobile Humanoid Agent With Mood Awareness For Elderly Care, Di Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Human, especially elderly, require frequent attention, continuous companionship, and deep understanding from the others. To provide more specific and appropriate tender care to the elderly, knowing their affective states is a great advantage. Recent work on human emotion recognition shows promising results that the expressive emotion can be successfully captured through visual, audio, and keyboard or touchpad stroke pattern signals. Furthermore, human activities are shown to be accurately recognizable with context by nonintrusive sensors within or connected to the smartphones. In this paper, we propose a computational model to characterize the affective states of the elderly based on the recognizable …

Go to article

Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang Jul 2014

Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang

Research Collection School Of Computing and Information Systems

A big challenge in text classification is to perform classification on a large-scale and high-dimensional text corpus in the presence of imbalanced class distributions and a large number of irrelevant or noisy term features. A number of techniques have been proposed to handle this challenge with varying degrees of success. In this paper, by combining the strengths of two widely used text classification techniques, K-Nearest-Neighbor (KNN) and centroid based (Centroid) classifiers, we propose a scalable and effective flat classifier, called CenKNN, to cope with this challenge. CenKNN projects high-dimensional (often hundreds of thousands) documents into a low-dimensional (normally a few …

Go to article

A Retail Bank's Bpm Experience, Shankararaman, Venky, Gottipati Swapna, Randall E. Duran Jul 2014

A Retail Bank's Bpm Experience, Shankararaman, Venky, Gottipati Swapna, Randall E. Duran

Research Collection School Of Computing and Information Systems

This real-life case study, which was undertaken by a leading financial services group in the Asia-Pacific region, is used to demonstrate the innovative use of BPM (Business Process Management) technology in a competitive business area. It describes how a BPM project, within the Application Verification and Capture (AVC), was conceived, designed and implemented in order to deliver strategic value to the organization. Hereafter, the financial services group will be referred to as “the bank”. The AVC project was targeted at one of the bank's processes called the Application Verification and Capture (AVC) process for unit trust products. This process involved …

Go to article

Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow Jul 2014

Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Most non-trivial problems require the coordinated performance of multiple goal-oriented and time-critical tasks. Coordinating the performance of the tasks is required due to the dependencies among the tasks and the sharing of resources. In this work, an agent learns to perform a task using reinforcement learning with a self-organizing neural network as the function approximator. We propose a novel coordination strategy integrating Motivated Learning (ML) and a self-organizing neural network for multi-agent reinforcement learning (MARL). Specifically, we adapt the ML idea of using pain signal to overcome the resource competition issue. Dependency among the agents is resolved using domain knowledge …

Go to article

Predicting The Popularity Of Web 2.0 Items Based On User Comments, Xiangnan He, Ming Gao, Min-Yen Kan, Yiqun Liu, Kazunari Sugiyama Jul 2014

Predicting The Popularity Of Web 2.0 Items Based On User Comments, Xiangnan He, Ming Gao, Min-Yen Kan, Yiqun Liu, Kazunari Sugiyama

Research Collection School Of Computing and Information Systems

In the current Web 2.0 era, the popularity of Web resources fluctuates ephemerally, based on trends and social interest. As a result, content-based relevance signals are insufficient to meet users' constantly evolving information needs in searching for Web 2.0 items. Incorporating future popularity into ranking is one way to counter this. However, predicting popularity as a third party (as in the case of general search engines) is difficult in practice, due to their limited access to item view histories. To enable popularity prediction externally without excessive crawling, we propose an alternative solution by leveraging user comments, which are more accessible …

Go to article

Board Interlock Networks And The Use Of Relative Performance Evaluation, Qian Hao, Nan Hu, Ling Liu, Lee J. Yao Jul 2014

Board Interlock Networks And The Use Of Relative Performance Evaluation, Qian Hao, Nan Hu, Ling Liu, Lee J. Yao

Research Collection School Of Computing and Information Systems

Purpose - The purpose of this paper is to explore how networks of boards of directors affect relative performance evaluation (RPE) in chief executive officer (CEO) compensation. Design/methodology/approach - In this study, the authors propose that an interlocking network is an important inter-corporate setting, which has a bearing on whether boards decide to use RPE in CEO compensation. They adopt four typical graph measures to depict the centrality/position of each board in the interlock network: degree, betweenness, eigenvector and closeness, and study their impacts on RPE use. Findings - The authors find that firms that have more connected board members …

Go to article

Manifold Learning For Jointly Modeling Topic And Visualization, Tuan Minh Van Le, Hady W. Lauw Jul 2014

Manifold Learning For Jointly Modeling Topic And Visualization, Tuan Minh Van Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Classical approaches to visualization directly reduce a document's high-dimensional representation into visualizable two or three dimensions, using techniques such as multidimensional scaling. More recent approaches consider an intermediate representation in topic space, between word space and visualization space, which preserves the semantics by topic modeling. We call the latter semantic visualization problem, as it seeks to jointly model topic and visualization. While previous approaches aim to preserve the global consistency, they do not consider the local consistency in terms of the intrinsic geometric structure of the document manifold. We therefore propose an unsupervised probabilistic model, called Semafore, which aims to …

Go to article

Learning Relative Similarity By Stochastic Dual Coordinate Ascent, Pengcheng Wu, Ding Yi, Peilin Zhao, Chunyan Miao, Steven C. H. Hoi Jul 2014

Learning Relative Similarity By Stochastic Dual Coordinate Ascent, Pengcheng Wu, Ding Yi, Peilin Zhao, Chunyan Miao, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Learning relative similarity from pairwise instances is an important problem in machine learning and has a wide range of applications. Despite being studied for years, some existing methods solved by Stochastic Gradient Descent (SGD) techniques generally suffer from slow convergence. In this paper, we investigate the application of Stochastic Dual Coordinate Ascent (SDCA) technique to tackle the optimization task of relative similarity learning by extending from vector to matrix parameters. Theoretically, we prove the optimal linear convergence rate for the proposed SDCA algorithm, beating the well-known sublinear convergence rate by the previous best metric learning algorithms. Empirically, we conduct extensive …

Go to article

Soml: Sparse Online Metric Learning With Application To Image Retrieval, Xingyu Gao, Steven C. H. Hoi, Yongdong Zhang, Ji Wan, Jintao Li Jul 2014

Soml: Sparse Online Metric Learning With Application To Image Retrieval, Xingyu Gao, Steven C. H. Hoi, Yongdong Zhang, Ji Wan, Jintao Li

Research Collection School Of Computing and Information Systems

Image similarity search plays a key role in many multimedia applications, where multimedia data (such as images and videos) are usually represented in high-dimensional feature space. In this paper, we propose a novel Sparse Online Metric Learning (SOML) scheme for learning sparse distance functions from large-scale high-dimensional data and explore its application to image retrieval. In contrast to many existing distance metric learning algorithms that are often designed for low-dimensional data, the proposed algorithms are able to learn sparse distance metrics from high-dimensional data in an efficient and scalable manner. Our experimental results show that the proposed method achieves better …

Go to article

Lifetime Lexical Variation In Social Media, Lizi Liao, Jing Jiang, Ying Ding, Heyan Huang, Ee Peng Lim Jul 2014

Lifetime Lexical Variation In Social Media, Lizi Liao, Jing Jiang, Ying Ding, Heyan Huang, Ee Peng Lim

Research Collection School Of Computing and Information Systems

As the rapid growth of online social media attracts a large number of Internet users, the large volume of content generated by these users also provides us with an opportunity to study the lexical variation of people of different ages. In this paper, we present a latent variable model that jointly models the lexical content of tweets and Twitter users’ ages. Our model inherently assumes that a topic has not only a word distribution but also an age distribution. We propose a Gibbs-EM algorithm to perform inference on our model. Empirical evaluation shows that our model can learn meaningful age-specific …

Go to article

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li Jul 2014

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li

Research Collection School Of Computing and Information Systems

Spectral hashing (SpH) is an efficient and simple binary hashing method, which assumes that data are sampled from a multidimensional uniform distribution. However, this assumption is too restrictive in practice. In this paper we propose an improved method, fitted spectral hashing (FSpH), to relax this distribution assumption. Our work is based on the fact that one-dimensional data of any distribution could be mapped to a uniform distribution without changing the local neighbor relations among data items. We have found that this mapping on each PCA direction has certain regular pattern, and could be fitted well by S-curve function (Sigmoid function). …

Go to article

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li Jul 2014

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li

Research Collection School Of Computing and Information Systems

Spectral hashing (SpH) is an efficient and simple binary hashing method, which assumes that data are sampled from a multidimensional uniform distribution. However, this assumption is too restrictive in practice. In this paper we propose an improved method, fitted spectral hashing (FSpH), to relax this distribution assumption. Our work is based on the fact that one-dimensional data of any distribution could be mapped to a uniform distribution without changing the local neighbor relations among data items. We have found that this mapping on each PCA direction has certain regular pattern, and could be fitted well by S-curve function (Sigmoid function). …

Go to article

On Predicting Religion Labels In Microblogging Networks, Minh Thap Nguyen, Ee Peng Lim Jul 2014

On Predicting Religion Labels In Microblogging Networks, Minh Thap Nguyen, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Religious belief plays an important role in how people behave, influencing how they form preferences, interpret events around them, and develop relationships with others. Traditionally, the religion labels of user population are obtained by conducting a large scale census study. Such an approach is both high cost and time consuming. In this paper, we study the problem of predicting users' religion labels using their microblogging data. We formulate religion label prediction as a classification task, and identify content, structure and aggregate features considering their self and social variants for representing a user. We introduce the notion of representative user to …

Go to article

Influences Of Influential Users: An Empirical Study Of Music Social Network, Jing Ren, Zhiyong Cheng, Jialie Shen, Feida Zhu Jul 2014

Influences Of Influential Users: An Empirical Study Of Music Social Network, Jing Ren, Zhiyong Cheng, Jialie Shen, Feida Zhu

Research Collection School Of Computing and Information Systems

Influential user can play a crucial role in online social networks. This paper documents an empirical study aiming at exploring the effects of influential users in the context of music social network. To achieve this goal, music diffusion graph is developed to model how information propagates over network. We also propose a heuristic method to measure users' influences. Using the real data from Last. fm, our empirical test demonstrates key effects of influential users and reveals limitations of existing influence identification/characterization schemes.

Go to article

Recommendation Support For Multi-Attribute Databases, Jilian Zhang Jun 2014

Recommendation Support For Multi-Attribute Databases, Jilian Zhang

Dissertations and Theses Collection (Open Access)

This dissertation studies the subject of providing recommendation support for multi-attribute databases. Recommendation is an important and very useful information evaluation mechanism that explores a database of huge volume, and retrieves from it the interesting data items (tuples) for users based on their preferences.

Go to article

Learning Euclidean-To-Riemannian Metric For Point-To-Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Chen Jun 2014

Learning Euclidean-To-Riemannian Metric For Point-To-Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Chen

Research Collection School Of Computing and Information Systems

In this paper, we focus on the problem of point-to-set classification, where single points are matched against sets of correlated points. Since the points commonly lie in Euclidean space while the sets are typically modeled as elements on Riemannian manifold, they can be treated as Euclidean points and Riemannian points respectively. To learn a metric between the heterogeneous points, we propose a novel Euclidean-to-Riemannian metric learning framework. Specifically, by exploiting typical Riemannian metrics, the Riemannian manifold is first embedded into a high dimensional Hilbert space to reduce the gaps between the heterogeneous spaces and meanwhile respect the Riemannian geometry of …

Go to article

Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng Jun 2014

Air Indexing For On-Demand Xml Data Broadcast, Weiwei Sun, Rongrui Qin, Jinjin Wu, Baihua Zheng

Research Collection School Of Computing and Information Systems

XML data broadcast is an efficient way to disseminate semi-structured information in wireless mobile environments. In this paper, we propose a novel two-tier index structure to facilitate the access of XML document in an on-demand broadcast system. It provides the clients with an overall image of all the XML documents available at the server side and hence enables the clients to locate complete result sets accordingly. A pruning strategy is developed to cut down the index size and a two-tier structure is proposed to further remove any redundant information. In addition, two index distribution strategies, namely naive distribution and partial …

Go to article

On Efficient Reverse Skyline Query Processing, Yunjun Gao, Qing Liu, Baihua Zheng, Gang Chen Jun 2014

On Efficient Reverse Skyline Query Processing, Yunjun Gao, Qing Liu, Baihua Zheng, Gang Chen

Research Collection School Of Computing and Information Systems

Given a D-dimensional data set P and a query point q, a reverse skyline query (RSQ) returns all the data objects in P whose dynamic skyline contains q. It is important for many real life applications such as business planning and environmental monitoring. Currently, the state-of-the-art algorithm for answering the RSQ is the reverse skyline using skyline approximations (RSSA) algorithm, which is based on the precomputed approximations of the skylines. Although RSSA has some desirable features, e.g., applicability to arbitrary data distributions and dimensions, it needs for multiple accesses of the same nodes, incurring redundant I/O and CPU costs. In …

Go to article

Global Immutable Region Computation, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang Jun 2014

Global Immutable Region Computation, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

A top-k query shortlists the k records in a dataset that best match the user's preferences. To indicate her preferences, the user typically determines a numeric weight for each data dimension (i.e., attribute). We refer to these weights collectively as the query vector. Based on this vector, each data record is implicitly mapped to a score value (via a weighted sum function). The records with the k largest scores are reported as the result. In this paper we propose an auxiliary feature to standard top-k query processing. Specifically, we compute the maximal locus within which the query vector incurs no …

Go to article

Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw Jun 2014

Graph-Based Semi-Supervised Learning: Realizing Pointwise Smoothness Probabilistically, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

As the central notion in semi-supervised learning, smoothness is often realized on a graph representation of the data. In this paper, we study two complementary dimensions of smoothness: its pointwise nature and probabilistic modeling. While no existing graph-based work exploits them in conjunction, we encompass both in a novel framework of Probabilistic Graph-based Pointwise Smoothness (PGP), building upon two foundational models of data closeness and label coupling. This new form of smoothness axiomatizes a set of probability constraints, which ultimately enables class prediction. Theoretically, we provide an error and robustness analysis of PGP. Empirically, we conduct extensive experiments to show …

Go to article

Ar-Miner: Mining Informative Reviews For Developers From Mobile App Marketplace, Ning Chen, Jialiu Lin, Steven C. H. Hoi, Xiaokui Xiao, Boshen Zhang Jun 2014

Ar-Miner: Mining Informative Reviews For Developers From Mobile App Marketplace, Ning Chen, Jialiu Lin, Steven C. H. Hoi, Xiaokui Xiao, Boshen Zhang

Research Collection School Of Computing and Information Systems

With the popularity of smartphones and mobile devices, mobile application (a.k.a. “app”) markets have been growing exponentially in terms of number of users and downloads. App developers spend considerable effort on collecting and exploiting user feedback to improve user satisfaction, but suffer from the absence of effective user review analytics tools. To facilitate mobile app developers discover the most “informative” user reviews from a large and rapidly increasing pool of user reviews, we present “AR-Miner” — a novel computational framework for App Review Mining, which performs comprehensive analytics from raw user reviews by (i) first extracting informative user reviews by …

Go to article

Socio-Physical Analytics: Challenges & Opportunities, Archan Misra, Kasthuri Jayarajah, Shriguru Nayak, Philips Kokoh Prasetyo, Ee-Peng Lim Jun 2014

Socio-Physical Analytics: Challenges & Opportunities, Archan Misra, Kasthuri Jayarajah, Shriguru Nayak, Philips Kokoh Prasetyo, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

In this paper, we argue for expanded research into an area called Socio-Physical Analytics, that focuses on combining the behavioral insight gained from mobile-sensing based monitoring of physical behavior with the inter-personal relationships and preferences deduced from online social networks. We highlight some of the research challenges in combining these heterogeneous data sources and then describe some examples of our ongoing work (based on real-world data being collected at SMU) that illustrate two aspects of socio-physical analytics: (a) how additional demographic and online analytics based attributes can potentially provide better insights into the preferences and behaviors of individuals or groups …

Go to article

First Prev Next Last