Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (3560)
- Software Engineering (2204)
- Artificial Intelligence and Robotics (1897)
- Information Security (1107)
- Numerical Analysis and Scientific Computing (1060)
-
- Graphics and Human Computer Interfaces (947)
- Engineering (884)
- Social and Behavioral Sciences (808)
- Business (748)
- Theory and Algorithms (513)
- Computer Engineering (449)
- Programming Languages and Compilers (413)
- Operations Research, Systems Engineering and Industrial Engineering (407)
- OS and Networks (345)
- Communication (326)
- Social Media (264)
- Public Affairs, Public Policy and Public Administration (230)
- Medicine and Health Sciences (197)
- Education (194)
- Transportation (194)
- Management Information Systems (176)
- Data Storage Systems (167)
- E-Commerce (154)
- International and Area Studies (147)
- Technology and Innovation (146)
- Asian Studies (145)
- Health Information Technology (118)
- Higher Education (105)
- Keyword
-
- Machine learning (145)
- Deep learning (129)
- Artificial intelligence (123)
- Social media (82)
- Singapore (73)
-
- Reinforcement learning (72)
- Data mining (70)
- Privacy (67)
- Security (62)
- Cloud computing (60)
- Deep Learning (58)
- Empirical study (55)
- Software engineering (55)
- Optimization (54)
- Online learning (51)
- Visualization (51)
- Neural networks (50)
- Anomaly detection (49)
- Training (49)
- Twitter (49)
- Task analysis (48)
- Blockchain (47)
- Large Language Models (47)
- Natural language processing (47)
- Collaboration (46)
- Feature extraction (45)
- Algorithms (44)
- Access control (43)
- Machine Learning (43)
- Semantics (43)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (8479)
- Dissertations and Theses Collection (Open Access) (189)
- Research Collection Lee Kong Chian School Of Business (59)
- Research Collection Yong Pung How School Of Law (49)
- Research Collection School of Social Sciences (27)
-
- Asian Management Insights (26)
- Research Collection College of Integrative Studies (23)
- Perspectives@SMU (21)
- Research Collection School Of Accountancy (18)
- Dissertations and Theses Collection (15)
- FORCE 2026 (14)
- SMU Press Releases and News (12)
- MITB Thought Leadership Series (11)
- Research Collection Library (10)
- Research Collection School of Computing and Information Systems (10)
- Research@SMU: Connecting the Dots (10)
- PhD Student’s Publications Collection (8)
- LARC Research Publications (7)
- Research Collection School Of Economics (6)
- CCX Research (4)
- SMU Research Data (4)
- Student Publications (4)
- 2024 AI for Research Week (3)
- SCIS Student Publications (3)
- Centre for AI & Data Governance (2019-2025) (2)
- Research Collection Office of Research (2)
- CASTLe: Collection of Articles on Scholarship for Teaching and Learning (1)
- Centre for Computational Law (2022-2025) (1)
- Library Events (1)
- ROSA Journal Articles and Publications (1)
- Publication Type
- File Type
Articles 6241 - 6270 of 9024
Full-Text Articles in Computer Sciences
Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li
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). …
Near-Optimal Nonmyopic Contact Center Planning Using Dual Decomposition, Akshat Kumar, Sudhanshu Singh, Pranav Gupta, Gyana Parija
Near-Optimal Nonmyopic Contact Center Planning Using Dual Decomposition, Akshat Kumar, Sudhanshu Singh, Pranav Gupta, Gyana Parija
Research Collection School Of Computing and Information Systems
We address the problem of minimizing staffing cost in a contact center subject to service level requirements over multiple weeks. We handle both the capacity planning and agent schedule generation aspect of this problem. Our work incorporates two unique business requirements. First, we develop techniques that can provide near-optimal staffing for 247 contact centers over long term, upto eight weeks, rather than planning myopically on a week-on-week basis. Second, our approach is usable in an online interactive setting in which staffing managers using our system expect high quality plans within a short time period. Results on large real world and …
Streets: Game-Theoretic Traffic Patrolling With Exploration And Exploitation, Matthew Brown, Sandhya Saisubramanian, Pradeep Varakantham, Milind Tambe
Streets: Game-Theoretic Traffic Patrolling With Exploration And Exploitation, Matthew Brown, Sandhya Saisubramanian, Pradeep Varakantham, Milind Tambe
Research Collection School Of Computing and Information Systems
To dissuade reckless driving and mitigate accidents, cities deploy resources to patrol roads. In this paper, we present STREETS, an application developed for the city of Singapore, which models the problem of computing randomized traffic patrol strategies as a defenderattacker Stackelberg game. Previous work on Stackelberg security games has focused extensively on counterterrorism settings. STREETS moves beyond counterterrorism and represents the first use of Stackelberg games for traffic patrolling, in the process providing a novel algorithm for solving such games that addresses three major challenges in modeling and scale-up. First, there exists a high degree of unpredictability in travel times …
Creating Autonomous Adaptive Agents In A Real-Time First-Person Shooter Computer Game, Di Wang, Ah-Hwee Tan
Creating Autonomous Adaptive Agents In A Real-Time First-Person Shooter Computer Game, Di Wang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Games are good test-beds to evaluate AI methodologies. In recent years, there has been a vast amount of research dealing with real-time computer games other than the traditional board games or card games. This paper illustrates how we create agents by employing FALCON, a self-organizing neural network that performs reinforcement learning, to play a well-known first-person shooter computer game called Unreal Tournament. Rewards used for learning are either obtained from the game environment or estimated using the temporal difference learning scheme. In this way, the agents are able to acquire proper strategies and discover the effectiveness of different weapons without …
Board Interlock Networks And The Use Of Relative Performance Evaluation, Qian Hao, Nan Hu, Ling Liu, Lee J. Yao
Board Interlock Networks And The Use Of Relative Performance Evaluation, Qian Hao, Nan Hu, Ling Liu, Lee J. Yao
Research Collection School Of Computing and Information Systems
Purpose - The purpose of this paper is to explore how networks of boards of directors affect relative performance evaluation (RPE) in chief executive officer (CEO) compensation. Design/methodology/approach - In this study, the authors propose that an interlocking network is an important inter-corporate setting, which has a bearing on whether boards decide to use RPE in CEO compensation. They adopt four typical graph measures to depict the centrality/position of each board in the interlock network: degree, betweenness, eigenvector and closeness, and study their impacts on RPE use. Findings - The authors find that firms that have more connected board members …
Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow
Research Collection School Of Computing and Information Systems
Most non-trivial problems require the coordinated performance of multiple goal-oriented and time-critical tasks. Coordinating the performance of the tasks is required due to the dependencies among the tasks and the sharing of resources. In this work, an agent learns to perform a task using reinforcement learning with a self-organizing neural network as the function approximator. We propose a novel coordination strategy integrating Motivated Learning (ML) and a self-organizing neural network for multi-agent reinforcement learning (MARL). Specifically, we adapt the ML idea of using pain signal to overcome the resource competition issue. Dependency among the agents is resolved using domain knowledge …
Click-Through-Based Cross-View Learning For Image Search, Yingwei Pan, Ting Yao, Tao Mei, Houqiang Li, Chong-Wah Ngo, Yong Rui
Click-Through-Based Cross-View Learning For Image Search, Yingwei Pan, Ting Yao, Tao Mei, Houqiang Li, Chong-Wah Ngo, Yong Rui
Research Collection School Of Computing and Information Systems
One of the fundamental problems in image search is to rank image documents according to a given textual query. Existing search engines highly depend on surrounding texts for ranking images, or leverage the query-image pairs annotated by human labelers to train a series of ranking functions. However, there are two major limitations: 1) the surrounding texts are often noisy or too few to accurately describe the image content, and 2) the human annotations are resourcefully expensive and thus cannot be scaled up. We demonstrate in this paper that the above two fundamental challenges can be mitigated by jointly exploring the …
Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang
Cenknn: A Scalable And Effective Text Classifier, Guansong Pang, Huidong Jin, Shengyi Jiang
Research Collection School Of Computing and Information Systems
A big challenge in text classification is to perform classification on a large-scale and high-dimensional text corpus in the presence of imbalanced class distributions and a large number of irrelevant or noisy term features. A number of techniques have been proposed to handle this challenge with varying degrees of success. In this paper, by combining the strengths of two widely used text classification techniques, K-Nearest-Neighbor (KNN) and centroid based (Centroid) classifiers, we propose a scalable and effective flat classifier, called CenKNN, to cope with this challenge. CenKNN projects high-dimensional (often hundreds of thousands) documents into a low-dimensional (normally a few …
A Retail Bank's Bpm Experience, Shankararaman, Venky, Gottipati Swapna, Randall E. Duran
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 …
A Simple Polynomial-Time Randomized Distributed Algorithm For Connected Row Convex Constraints, T. K. Satish Kumar, Nguyen Duc Thien, William Yeoh, Sven Koenig
A Simple Polynomial-Time Randomized Distributed Algorithm For Connected Row Convex Constraints, T. K. Satish Kumar, Nguyen Duc Thien, William Yeoh, Sven Koenig
Research Collection School Of Computing and Information Systems
In this paper, we describe a simple randomized algorithm that runs in polynomial time and solves connected row convex (CRC) constraints in distributed settings. CRC constraints generalize many known tractable classes of constraints like 2-SAT and implicational constraints. They can model problems in many domains including temporal reasoning and geometric reasoning, and generally speaking, play the role of "Gaussians" in the logical world. Our simple randomized algorithm for solving them in distributed settings, therefore, has a number of important applications. We support our claims through a theoretical analysis and empirical results.
Decentralized Stochastic Planning With Anonymity In Interactions, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet
Decentralized Stochastic Planning With Anonymity In Interactions, Pradeep Varakantham, Yossiri Adulyasak, Patrick Jaillet
Research Collection School Of Computing and Information Systems
In this paper, we solve cooperative decentralized stochastic planning problems, where the interactions between agents (specified using transition and reward functions) are dependent on the number of agents (and not on the identity of the individual agents) involved in the interaction. A collision of robots in a narrow corridor, defender teams coordinating patrol activities to secure a target, etc. are examples of such anonymous interactions. Formally, we consider problems that are a subset of the well known Decentralized MDP (DEC-MDP) model, where the anonymity in interactions is specified within the joint reward and transition functions. In this paper, not only …
Manifold Learning For Jointly Modeling Topic And Visualization, Tuan Minh Van Le, Hady W. Lauw
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 …
Learning Relative Similarity By Stochastic Dual Coordinate Ascent, Pengcheng Wu, Ding Yi, Peilin Zhao, Chunyan Miao, Steven C. H. Hoi
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 …
Soml: Sparse Online Metric Learning With Application To Image Retrieval, Xingyu Gao, Steven C. H. Hoi, Yongdong Zhang, Ji Wan, Jintao Li
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 …
Lifetime Lexical Variation In Social Media, Lizi Liao, Jing Jiang, Ying Ding, Heyan Huang, Ee Peng Lim
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 …
Mobile Humanoid Agent With Mood Awareness For Elderly Care, Di Wang, Ah-Hwee Tan
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 …
Diamonds Are A Girl's Best Friend: Partial Order Reduction For Timed Automata With Abstractions, Henri Hansen, Shang-Wei Lin, Yang Liu, Truong Khanh Nguyen, Jun Sun
Diamonds Are A Girl's Best Friend: Partial Order Reduction For Timed Automata With Abstractions, Henri Hansen, Shang-Wei Lin, Yang Liu, Truong Khanh Nguyen, Jun Sun
Research Collection School Of Computing and Information Systems
A major obstacle for using partial order reduction in the context of real time verification is that the presence of clocks and clock constraints breaks the usual diamond structure of otherwise independent transitions. This is especially true when information of the relative values of clocks is preserved in the form of diagonal constraints. However, when diagonal constraints are relaxed by a suitable abstraction, some diamond structure is re-introduced in the zone graph. In this article, we introduce a variant of the stubborn set method for reducing an abstracted zone graph. Our method works with all abstractions, but especially targets situations …
A Novel Algorithm Based On Visual Saliency Attention For Localization And Segmentation In Rapidly-Stained Leukocyte Images, Xin Zheng, Yong Wang, Guoyou Wang, Zhong Chen
A Novel Algorithm Based On Visual Saliency Attention For Localization And Segmentation In Rapidly-Stained Leukocyte Images, Xin Zheng, Yong Wang, Guoyou Wang, Zhong Chen
Research Collection School Of Computing and Information Systems
In this paper, we propose a fast hierarchical framework of leukocyte localization and segmentation in rapidly-stained leukocyte images (RSLI) with complex backgrounds and varying illumination. The proposed framework contains two main steps. First, a nucleus saliency model based on average absolute difference is built, which locates each leukocyte precisely while effectively removes dyeing impurities and erythrocyte fragments. Secondly, two different schemes are presented for segmenting the nuclei and cytoplasm respectively. As for nuclei segmentation, to solve the overlap problem between leukocytes, we extract the nucleus lobes first and further group them. The lobes extraction is realized by the histogram-based contrast …
Understanding The Paradigm Shift To Computational Social Science In The Presence Of Big Data, Ray M. Chang, Robert J. Kauffman, Young Ok Kwon
Understanding The Paradigm Shift To Computational Social Science In The Presence Of Big Data, Ray M. Chang, Robert J. Kauffman, Young Ok Kwon
Research Collection School Of Computing and Information Systems
The era of big data has created new opportunities for researchers to achieve high relevance and impact amid changes and transformations in how we study social science phenomena. With the emergence of new data collection technologies, advanced data mining and analytics support, there seems to be fundamental changes that are occurring with the research questions we can ask, and the research methods we can apply. The contexts include social networks and blogs, political discourse, corporate announcements, digital journalism, mobile telephony, home entertainment, online gaming, financial services, online shopping, social advertising, and social commerce. The changing costs of data collection and …
New A*Star-Smu Centre Combines High-Powered Computing And Behavioural Sciences To Study People-Centric Issues, Singapore Management University
New A*Star-Smu Centre Combines High-Powered Computing And Behavioural Sciences To Study People-Centric Issues, Singapore Management University
SMU Press Releases and News
The Agency for Science, Technology and Research (A*STAR) and the Singapore Management University (SMU) will establish a Centre for Technology and Social-Behavioural Insights (CTSBI) to tap on high performance computing technology, big data analytics and behavioural sciences to study people-centric issues and human behaviour including how people think, feel and act in different settings. Such information can be used to enhance planning and address issues in different areas such as retail, logistics, urban planning, education and community development.
Recommendation Support For Multi-Attribute Databases, Jilian Zhang
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.
Ar-Miner: Mining Informative Reviews For Developers From Mobile App Marketplace, Ning Chen, Jialiu Lin, Steven C. H. Hoi, Xiaokui Xiao, Boshen Zhang
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 …
Learning Euclidean-To-Riemannian Metric For Point-To-Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Chen
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 …
Ranking-Based Approaches For Localizing Faults, Lucia Lucia
Ranking-Based Approaches For Localizing Faults, Lucia Lucia
Dissertations and Theses Collection (Open Access)
A fault is the root cause of program failures where a program behaves differently from the intended behavior. Finding or localizing faults is often laborious (especially so for complex programs), yet it is an important task in the software lifecycle. An automated technique that can accurately and quickly identify the faulty code is greatly needed to alleviate the costs of software debugging. Many fault localization techniques assume that faults are localizable, i.e., each fault manifests only in a single or a few lines of code that are close to one another. To verify this assumption, we study how faults spread …
Flow In Gaming: Literature Synthesis And Framework Development, Fiona Fui-Hoon Nah, B. Eschenbrenner, Q. Zeng, V. Telaprolu, S. Sepehr
Flow In Gaming: Literature Synthesis And Framework Development, Fiona Fui-Hoon Nah, B. Eschenbrenner, Q. Zeng, V. Telaprolu, S. Sepehr
Research Collection School Of Computing and Information Systems
Flow, a state of optimal experience where one is completely absorbed and immersed in an activity, is an important phenomenon for studying and designing games. In this article, we synthesise the literature on flow in gaming to discern existing research streams, and identify the antecedents, dimensions, and outcomes of flow which are then integrated into a framework. Based on the findings, we provide suggestions for game design elements that practitioners, such as game designers, may find useful for creating or inducing flow in gaming. We also discuss implications for research and practice as well as provide suggestions for future research.
Hydra: Large-Scale Social Identity Linkage Via Heterogeneous Behavior Modeling, Siyuan Liu, Shuhui Wang, Feida Zhu, Jinbo Zhang, Ramayya Krishnan
Hydra: Large-Scale Social Identity Linkage Via Heterogeneous Behavior Modeling, Siyuan Liu, Shuhui Wang, Feida Zhu, Jinbo Zhang, Ramayya Krishnan
Research Collection School Of Computing and Information Systems
We study the problem of large-scale social identity linkage across different social media platforms, which is of critical importance to business intelligence by gaining from social data a deeper understanding and more accurate profiling of users. This paper proposes HYDRA, a solution framework which consists of three key steps: (I) modeling heterogeneous behavior by long-term behavior distribution analysis and multi-resolution temporal information matching; (II) constructing structural consistency graph to measure the high-order structure consistency on users' core social structures across different platforms; and (III) learning the mapping function by multi-objective optimization composed of both the supervised learning on pair-wise ID …
Socio-Physical Analytics: Challenges & Opportunities, Archan Misra, Kasthuri Jayarajah, Shriguru Nayak, Philips Kokoh Prasetyo, Ee-Peng Lim
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 …
Gamification Of Education: A Review Of Literature, Fiona Fui-Hoon Nah, Qing Zeng, Venkata R. Telaprolu, Abhishek Padmanabhuni Ayyappa, Brenda Eschenbrenner
Gamification Of Education: A Review Of Literature, Fiona Fui-Hoon Nah, Qing Zeng, Venkata R. Telaprolu, Abhishek Padmanabhuni Ayyappa, Brenda Eschenbrenner
Research Collection School Of Computing and Information Systems
We synthesized the literature on gamification of education by conducting a review of the literature on gamification in the educational and learning context. Based on our review, we identified several game design elements that are used in education. These game design elements include points, levels/stages, badges, leaderboards, prizes, progress bars, storyline, and feedback. We provided examples from the literature to illustrate the application of gamification in the educational context.
Paths Of Influence For Innovations In Financial Is And Technology Ecosystems, Jun Liu, Robert John Kauffman, Dan Ma
Paths Of Influence For Innovations In Financial Is And Technology Ecosystems, Jun Liu, Robert John Kauffman, Dan Ma
Research Collection School Of Computing and Information Systems
Predicting technological innovations in financial information systems (IS) and technology ecosystems has been challenging for technology forecasters and industry analysts due to their underlying complexity. Technology-based financial innovations over the past four decades, such as programmed trading in the 1980s, risk-adjusted return on capital-based financial risk management systems in the 1990s, high-frequency trading and Internet banking in 2000s, and now mobile payments in the 2010s, have all led to transformations in the financial services industry. What basis can be identified to predict such new innovations? And what areas of financial services will they affect? This study applies the technology ecosystem …
Technology Investment Decision-Making Under Uncertainty In Mobile Payment Systems, Robert J. Kauffman, Jun Liu, Dan Ma
Technology Investment Decision-Making Under Uncertainty In Mobile Payment Systems, Robert J. Kauffman, Jun Liu, Dan Ma
Research Collection School Of Computing and Information Systems
Innovations in the mobile payments industry provide potentially profitable investment opportunities for banks. Nonetheless, significant uncertainties are associated with decision-making for this IT investment context, regarding future market conditions, technology standards, and consumer and merchant responses, especially their willingness to adopt. As a result, traditional capital budgeting approach and experienced intuition have not been effective. We develop a model to support a bank’s mobile payment systems adoption decision-making at the firm level when it faces endogenous technological risks and exogenous market conditions. This study applies theory and modeling from financial economics for decision-making under uncertainty to investments in m-payment systems …