Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Numerical Analysis and Scientific Computing (671)
- Social and Behavioral Sciences (374)
- Artificial Intelligence and Robotics (360)
- Graphics and Human Computer Interfaces (313)
- Business (253)
-
- Software Engineering (239)
- Communication (234)
- Social Media (202)
- Engineering (199)
- Theory and Algorithms (178)
- Computer Engineering (171)
- Information Security (148)
- OS and Networks (116)
- Programming Languages and Compilers (98)
- E-Commerce (84)
- Data Storage Systems (75)
- Medicine and Health Sciences (70)
- Public Affairs, Public Policy and Public Administration (60)
- Education (55)
- Management Information Systems (53)
- International and Area Studies (51)
- Asian Studies (50)
- Health Information Technology (48)
- Transportation (47)
- Finance and Financial Management (43)
- Digital Communications and Networking (32)
- Technology and Innovation (32)
- Keyword
-
- Social media (59)
- Machine learning (56)
- Online learning (46)
- Deep learning (43)
- Data mining (42)
-
- Artificial intelligence (36)
- Twitter (30)
- Query processing (29)
- Classification (26)
- Neural networks (25)
- Reinforcement learning (25)
- Deep Learning (24)
- Algorithms (23)
- Clustering (21)
- Social network (21)
- Algorithm (20)
- Graph neural networks (20)
- Machine Learning (20)
- Natural language processing (20)
- Recommender systems (20)
- Semantics (20)
- Task analysis (20)
- Anomaly detection (19)
- Cloud computing (19)
- Visualization (19)
- Image retrieval (18)
- Performance (18)
- Sentiment analysis (18)
- Singapore (18)
- Social networks (17)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (3441)
- Dissertations and Theses Collection (Open Access) (58)
- Research Collection Lee Kong Chian School Of Business (11)
- Asian Management Insights (8)
- Research Collection School Of Accountancy (7)
-
- Dissertations and Theses Collection (5)
- PhD Student’s Publications Collection (5)
- Research Collection College of Integrative Studies (5)
- Research Collection Yong Pung How School Of Law (5)
- MITB Thought Leadership Series (3)
- LARC Research Publications (2)
- Perspectives@SMU (2)
- Research Collection School of Computing and Information Systems (2)
- 2024 AI for Research Week (1)
- CCX Research (1)
- Research Collection School Of Economics (1)
- Research Collection School of Accountancy (1)
- Research Collection School of Social Sciences (1)
- Research@SMU Infographics (1)
- Publication Type
Articles 2371 - 2400 of 3560
Full-Text Articles in Databases and Information Systems
A Unified Model For Topics, Events And Users On Twitter, Qiming Diao, Jing Jiang
A Unified Model For Topics, Events And Users On Twitter, Qiming Diao, Jing Jiang
Research Collection School Of Computing and Information Systems
With the rapid growth of social media, Twitter has become one of the most widely adopted platforms for people to post short and instant message. On the one hand, people tweets about their daily lives, and on the other hand, when major events happen, people also follow and tweet about them. Moreover, people’s posting behaviors on events are often closely tied to their personal interests. In this paper, we try to model topics, events and users on Twitter in a unified way. We propose a model which combines an LDA-like topic model and the Recurrent Chinese Restaurant Process to capture …
Learning Topics And Positions From Debatepedia, Swapna Gottopati, Minghui Qiu, Yanchuan Sim, Jing Jiang, Noah Smith
Learning Topics And Positions From Debatepedia, Swapna Gottopati, Minghui Qiu, Yanchuan Sim, Jing Jiang, Noah Smith
Research Collection School Of Computing and Information Systems
We explore Debatepedia, a communityauthored encyclopedia of sociopolitical debates, as evidence for inferring a lowdimensional, human-interpretable representation in the domain of issues and positions. We introduce a generative model positing latent topics and cross-cutting positions that gives special treatment to person mentions and opinion words. We evaluate the resulting representation’s usefulness in attaching opinionated documents to arguments and its consistency with human judgments about positions.
Modeling Interaction Features For Debate Side Clustering, Minghui Qiu, Liu Yang, Jing Jiang
Modeling Interaction Features For Debate Side Clustering, Minghui Qiu, Liu Yang, Jing Jiang
Research Collection School Of Computing and Information Systems
Online discussion forums are popular social media platforms for users to express their opinions and discuss controversial issues with each other. To automatically identify the sides/stances of posts or users from textual content in forums is an important task to help mine online opinions. To tackle the task, it is important to exploit user posts that implicitly contain support and dispute (interaction) information. The challenge we face is how to mine such interaction information from the content of posts and how to use them to help identify stances. This paper proposes a two-stage solution based on latent variable models: an …
Predictive Handling Of Asynchronous Concept Drifts In Distributed Environments, Hock Hee Ang, Vivek Gopalkrishnan, Indre Zliobaite, Mykola Pechenizkiy, Steven C. H. Hoi
Predictive Handling Of Asynchronous Concept Drifts In Distributed Environments, Hock Hee Ang, Vivek Gopalkrishnan, Indre Zliobaite, Mykola Pechenizkiy, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
In a distributed computing environment, peers collaboratively learn to classify concepts of interest from each other. When external changes happen and their concepts drift, the peers should adapt to avoid increase in misclassification errors. The problem of adaptation becomes more difficult when the changes are asynchronous, i.e., when peers experience drifts at different times. We address this problem by developing an ensemble approach, PINE, that combines reactive adaptation via drift detection, and proactive handling of upcoming changes via early warning and adaptation across the peers. With empirical study on simulated and real-world data sets, we show that PINE handles asynchronous …
Online Multimodal Distance Metric Learning With Application To Image Retrieval, Pengcheng Wu, Steven C. H. Hoi, Hao Xia, Peilin Zhao, Dayong Wang, Chunyan Miao
Online Multimodal Distance Metric Learning With Application To Image Retrieval, Pengcheng Wu, Steven C. H. Hoi, Hao Xia, Peilin Zhao, Dayong Wang, Chunyan Miao
Research Collection School Of Computing and Information Systems
Recent years have witnessed extensive studies on distance metric learning (DML) for improving similarity search in multimedia information retrieval tasks. Despite their successes, most existing DML methods suffer from two critical limitations: (i) they typically attempt to learn a linear distance function on the input feature space, in which the assumption of linearity limits their capacity of measuring the similarity on complex patterns in real-world applications; (ii) they are often designed for learning distance metrics on uni-modal data, which may not effectively handle the similarity measures for multimedia objects with multimodal representations. To address these limitations, in this paper, we …
Online Multi-Task Collaborative Filtering For On-The-Fly Recommender Systems, Jialei Wang, Steven C. H. Hoi, Peilin Zhao, Zhi-Yong Liu
Online Multi-Task Collaborative Filtering For On-The-Fly Recommender Systems, Jialei Wang, Steven C. H. Hoi, Peilin Zhao, Zhi-Yong Liu
Research Collection School Of Computing and Information Systems
Traditional batch model-based Collaborative Filtering (CF) approaches typically assume a collection of users' rating data is given a priori for training the model. They suffer from a common yet critical drawback, i.e., the model has to be re-trained completely from scratch whenever new training data arrives, which is clearly non-scalable for large real recommender systems where users' rating data often arrives sequentially and frequently. In this paper, we investigate a novel efficient and scalable online collaborative filtering technique for on-the-fly recommender systems, which is able to effectively online update the recommendation model from a sequence of rating observations. Specifically, we …
The Myths Of G-Tech For Business Decision Making, Tin Seong Kam
The Myths Of G-Tech For Business Decision Making, Tin Seong Kam
Research Collection School Of Computing and Information Systems
More than 80% of organisation data are location related - the locations where transactions are done, where retailers are found, and of customers who buy their products. Since the early 2005, there has been an increasing interest among the business community to use geospatial technology to enhance decision making process at both strategic and operational levels. Millions of dollars and man-hours have been invested into driving their geo-technology development and implementation. The use of geospatial technology in business, however, tends to confine to simple mapping. Many of these failures are the victims of misperception. Some of the perpetrators are practitioners. …
Riga: A Rich Internet Geospatial Analytics Application For Area-Based Data, Tin Seong Kam
Riga: A Rich Internet Geospatial Analytics Application For Area-Based Data, Tin Seong Kam
Research Collection School Of Computing and Information Systems
In this information age, more and more public statistical data such as population census, household living, local economy and business establishment are distributed over the internet within the framework of spatial data infrastructure. By and large, these data are organized geographically such as region, province as well as district. Usually, they are published in the form of digital maps over the internet as simple points, lines and polygons markers limited or no analytical function available to transform these data into useful information. To meet the analytical needs of casual public data users, we contribute RIGA, a rich internet geospatial analytics …
Making Sense Of Trends And Data, Singapore Management University
Making Sense Of Trends And Data, Singapore Management University
Perspectives@SMU
How do you make sense of data when it is all unpredictable?
Web-Scale Near-Duplicate Search: Techniques And Applications, Chong-Wah Ngo, Changsheng Xu, Wessel Kraaij, Abdulmotaleb El Saddik
Web-Scale Near-Duplicate Search: Techniques And Applications, Chong-Wah Ngo, Changsheng Xu, Wessel Kraaij, Abdulmotaleb El Saddik
Research Collection School Of Computing and Information Systems
This paper presents some of the most recent advances in the research on Web-scale near-duplicate search and explores the potential for bringing this research a substantial step further. It contains high-quality contributions addressing various aspects of the Web-scale near-duplicate search problem in a number of relevant domains. The topics range from feature representation, matching, and indexing from different novel aspects to the adaptation of current technologies for mobile media search and photo archaeology mining.
Generative Models For Item Adoptions Using Social Correlation, Freddy Chong Tat Chua, Hady Wirawan Lauw, Ee Peng Lim
Generative Models For Item Adoptions Using Social Correlation, Freddy Chong Tat Chua, Hady Wirawan Lauw, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Users face many choices on the Web when it comes to choosing which product to buy, which video to watch, etc. In making adoption decisions, users rely not only on their own preferences, but also on friends. We call the latter social correlation which may be caused by the homophily and social influence effects. In this paper, we focus on modeling social correlation on users’ item adoptions. Given a user-user social graph and an item-user adoption graph, our research seeks to answer the following questions: whether the items adopted by a user correlate to items adopted by her friends, and …
The Impact Of Ineffective Internal Control On The Value Relevance Of Accounting Information, Nan Hu, Baolei Qi, Gaoliang Tian, Lee Yao, Zhen Zeng
The Impact Of Ineffective Internal Control On The Value Relevance Of Accounting Information, Nan Hu, Baolei Qi, Gaoliang Tian, Lee Yao, Zhen Zeng
Research Collection School Of Computing and Information Systems
This paper investigates the value relevance of accounting information in the presence of ineffective internal control (IIC). Based on Ohlson's valuation model, this paper first documents that IIC can directly affect a firm's market value after control cost of capital, corporate governance, and other, value-relevant variables. Second, this paper finds that the value relevance of earnings and book value in determining a firm's market value are significantly reduced. Collectively, the results of this paper indicate that the effectiveness of internal controls can directly affect a firm's market value and the value relevance of accounting information.
An Empirical Study On Uncertainty Identification In Social Media Context, Zhongyu Wei, Junwen Chen, Wei Gao, Binyang Li, Lanjun Zhou, Yulan He, Kam-Fai Wong
An Empirical Study On Uncertainty Identification In Social Media Context, Zhongyu Wei, Junwen Chen, Wei Gao, Binyang Li, Lanjun Zhou, Yulan He, Kam-Fai Wong
Research Collection School Of Computing and Information Systems
Uncertainty text detection is important to many social-media-based applications since more and more users utilize social media platforms (e.g., Twitter, Facebook, etc.) as information source to produce or derive interpretations based on them. However, existing uncertainty cues are ineffective in social media context because of its specific characteristics. In this paper, we propose a variant of annotation scheme for uncertainty identification and construct the first uncertainty corpus based on tweets. We then conduct experiments on the generated tweets corpus to study the effectiveness of different types of features for uncertainty text identification.
Multi-View Discriminant Transfer Learning, Pei Yang Yang, Wei Gao
Multi-View Discriminant Transfer Learning, Pei Yang Yang, Wei Gao
Research Collection School Of Computing and Information Systems
We study to incorporate multiple views of data in a perceptive transfer learning framework and propose a Multi-view Discriminant Transfer (MDT) learning approach for domain adaptation. The main idea is to find the optimal discriminant weight vectors for each view such that the correlation between the two-view projected data is maximized, while both the domain discrepancy and the view disagreement are minimized simultaneously. Furthermore, we analyze MDT theoretically from discriminant analysis perspective to explain the condition and reason, under which the proposed method is not applicable. The analytical results allow us to investigate whether there exist within-view and/or betweenview conflicts, …
Open Source Software Development Process Model – A Grounded Theory Approach, Keng Siau, Y. Tian
Open Source Software Development Process Model – A Grounded Theory Approach, Keng Siau, Y. Tian
Research Collection School Of Computing and Information Systems
The open source movement has provided software users with more choices, lower software acquisition cost, more flexible software customization, and possibly higher quality software product. Although the development of open source software is dynamic and it encourages innovations, the process can be chaotic. An Open Source Software Development (OSSD) process model to enhance the survivability of OSSD projects is needed. This research uses the grounded theory approach to derive a Phase-Role-Skill-Responsibility (PRSR) OSSD process model. The three OSSD process phases -- Launch Stage, Before the First Release, and Between Releases -- address the characteristics of the OSSD process as well …
Vigilance Adaptation In Adaptive Resonance Theory, Lei Meng, Ah-Hwee Tan, Donald C. Winsch
Vigilance Adaptation In Adaptive Resonance Theory, Lei Meng, Ah-Hwee Tan, Donald C. Winsch
Research Collection School Of Computing and Information Systems
Despite the advantages of fast and stable learning, Adaptive Resonance Theory (ART) still relies on an empirically fixed vigilance parameter value to determine the vigilance regions of all of the clusters in the category field (F 2 ), causing its performance to depend on the vigilance value. It would be desirable to use different values of vigilance for different category field nodes, in order to fit the data with a smaller number of categories. We therefore introduce two methods, the Activation Maximization Rule (AMR) and the Confliction Minimization Rule (CMR). Despite their differences, both ART with AMR (AM-ART) and with …
Self-Organizing Cognitive Models For Virtual Agents, Yilin Kang, Ah-Hwee Tan
Self-Organizing Cognitive Models For Virtual Agents, Yilin Kang, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Three key requirements of realistic characters or agents in virtual world can be identified as autonomy, interactivity, and personification. Working towards these challenges, this paper proposes a brain inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personification. Based on self-organizing neural models, the agent architecture maintains explicit mental representation of desires, intention, personalities, self-awareness, situation awareness and user awareness. Autonomous behaviors are generated via evaluating the current situation with active goals and learning the most appropriate social or goal-directed rule from the available knowledge, in accordance with the personality of each individual agent. We have built …
Delayflow Centrality For Identifying Critical Nodes In Transportation Networks, Yew-Yih Cheng, Roy Ka Wei Lee, Ee-Peng Lim, Feida Zhu
Delayflow Centrality For Identifying Critical Nodes In Transportation Networks, Yew-Yih Cheng, Roy Ka Wei Lee, Ee-Peng Lim, Feida Zhu
Research Collection School Of Computing and Information Systems
In an urban city, its transportation network supports efficient flow of people between different parts of the city. Failures in the network can cause major disruptions to commuter and business activities which can result in both significant economic and time losses. In this paper, we investigate the use of centrality measures to determine critical nodes in a transportation network so as to improve the design of the network as well as to devise plans for coping with network failures. Most centrality measures in social network analysis research unfortunately consider only topological structure of the network and are oblivious of transportation …
An Empirical Analysis Of A Network Of Expertise, Le Truc Viet, Minh Thap Nguyen
An Empirical Analysis Of A Network Of Expertise, Le Truc Viet, Minh Thap Nguyen
Research Collection School Of Computing and Information Systems
In this paper, we analyze the network of expertise constructed from the interactions of users on the online questionanswering (QA) community of Stack Overflow. This community was built with the intention of helping users with their programming tasks and, thus, questions are expected to be highly factual. This also indicates that the answers one provides may be highly indicative of one's level of expertise on the subject matter. Therefore, our main concern is how to model and characterize the user's expertise based on the constructed network and its centrality measures. We used the user's reputation established on Stack Overflow as …
Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models, Siyuan Liu, Yisong Yue, Ramayya Krishnan
Adaptive Collective Routing Using Gaussian Process Dynamic Congestion Models, Siyuan Liu, Yisong Yue, Ramayya Krishnan
Research Collection School Of Computing and Information Systems
We consider the problem of adaptively routing a fleet of cooperative vehicles within a road network in the presence of uncertain and dynamic congestion conditions. To tackle this problem, we first propose a Gaussian Process Dynamic Congestion Model that can effectively characterize both the dynamics and the uncertainty of congestion conditions. Our model is efficient and thus facilitates real-time adaptive routing in the face of uncertainty. Using this congestion model, we develop an efficient algorithm for non-myopic adaptive routing to minimize the collective travel time of all vehicles in the system. A key property of our approach is the ability …
Computing Immutable Regions For Subspace Top-K Queries, Kyriakos Mouratidis, Hwee Hwa Pang
Computing Immutable Regions For Subspace Top-K Queries, Kyriakos Mouratidis, Hwee Hwa Pang
Research Collection School Of Computing and Information Systems
Given a high-dimensional dataset, a top-k query can be used to shortlist the k tuples that best match the user’s preferences. Typically, these preferences regard a subset of the available dimensions (i.e., attributes) whose relative significance is expressed by user-specified weights. Along with the query result, we propose to compute for each involved dimension the maximal deviation to the corresponding weight for which the query result remains valid. The derived weight ranges, called immutable regions, are useful for performing sensitivity analysis, for finetuning the query weights, etc. In this paper, we focus on top-k queries with linear preference functions over …
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Best Upgrade Plans For Large Road Networks, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, which if spent, the weight of the edge can be reduced to a specific new value. Given a source and a destination in G, and a budget (resource constraint) B, the BUP problem is to identify which upgradable edges should be upgraded so that the shortest path distance between source and …
Incremental And Accuracy-Aware Personalized Pagerank Through Scheduled Approximation, Fanwei Zhu, Yuan Fang, Kevin Chen-Chuan Chang, Jing Ying
Incremental And Accuracy-Aware Personalized Pagerank Through Scheduled Approximation, Fanwei Zhu, Yuan Fang, Kevin Chen-Chuan Chang, Jing Ying
Research Collection School Of Computing and Information Systems
As Personalized PageRank has been widely leveraged for ranking on a graph, the efficient computation of Personalized PageRank Vector (PPV) becomes a prominent issue. In this paper, we propose FastPPV, an approximate PPV computation algorithm that is incremental and accuracy-aware. Our approach hinges on a novel paradigm of scheduled approximation: the computation is partitioned and scheduled for processing in an "organized" way, such that we can gradually improve our PPV estimation in an incremental manner, and quantify the accuracy of our approximation at query time. Guided by this principle, we develop an efficient hub based realization, where we adopt the …
Politics, Sharing And Emotion In Microblogs, Tuan-Anh Hoang, William Cohen, Ee Peng Lim, Doug Pierce, David Redlawsk
Politics, Sharing And Emotion In Microblogs, Tuan-Anh Hoang, William Cohen, Ee Peng Lim, Doug Pierce, David Redlawsk
Research Collection School Of Computing and Information Systems
In political contexts, it is known that people act as "motivated reasoners", i.e., information is evaluated first for emotional affect, and this emotional reaction influences later deliberative reasoning steps. As social media becomes a more and more prevalent way of receiving political information, it becomes important to understand more completely the interaction between information, emotion, social community, and information-sharing behavior. In this paper, we describe a high-precision classifier for politically-oriented tweets, and an accurate classifier of a Twitter user's political affiliation. Coupled with existing sentiment-analysis tools for microblogs, these methods enable us to systematically study the interaction of emotion and …
Cost-Sensitive Online Active Learning With Application To Malicious Url Detection, Peilin Zhao, Steven C. H. Hoi
Cost-Sensitive Online Active Learning With Application To Malicious Url Detection, Peilin Zhao, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Malicious Uniform Resource Locator (URL) detection is an important problem in web search and mining, which plays a critical role in internet security. In literature, many existing studies have attempted to formulate the problem as a regular supervised binary classification task, which typically aims to optimize the prediction accuracy. However, in a real-world malicious URL detection task, the ratio between the number of malicious URLs and legitimate URLs is highly imbalanced, making it very inappropriate for simply optimizing the prediction accuracy. Besides, another key limitation of the existing work is to assume a large amount of training data is available, …
Large Scale Online Kernel Classification, Jialei Wang, Peilin Zhao, Steven C. H. Hoi, Jinfeng Zhuang, Zhi-Yong Liu
Large Scale Online Kernel Classification, Jialei Wang, Peilin Zhao, Steven C. H. Hoi, Jinfeng Zhuang, Zhi-Yong Liu
Research Collection School Of Computing and Information Systems
In this work, we present a new framework for large scale online kernel classification, making kernel methods efficient and scalable for large-scale online learning tasks. Unlike the regular budget kernel online learning scheme that usually uses different strategies to bound the number of support vectors, our framework explores a functional approximation approach to approximating a kernel function/matrix in order to make the subsequent online learning task efficient and scalable. Specifically, we present two different online kernel machine learning algorithms: (i) the Fourier Online Gradient Descent (FOGD) algorithm that applies the random Fourier features for approximating kernel functions; and (ii) the …
Robust Median Reversion Strategy For On-Line Portfolio Selection, Dingjiang Huang, Junlong Zhou, Bin Li, Steven Hoi, Shuigeng Zhou
Robust Median Reversion Strategy For On-Line Portfolio Selection, Dingjiang Huang, Junlong Zhou, Bin Li, Steven Hoi, Shuigeng Zhou
Research Collection School Of Computing and Information Systems
On-line portfolio selection has been attracting increasing interests from artificial intelligence community in recent decades. Mean reversion, as one most frequent pattern in financial markets, plays an important role in some state-of-the-art strategies. Though successful in certain datasets, existing mean reversion strategies do not fully consider noises and outliers in the data, leading to estimation error and thus non-optimal portfolios, which results in poor performance in practice. To overcome the limitation, we propose to exploit the reversion phenomenon by robust L1-median estimator, and design a novel on-line portfolio selection strategy named "Robust Median Reversion" (RMR), which makes optimal …
Learning To Name Faces: A Multimodal Learning Scheme For Search-Based Face Annotation, Dayong Wang, Steven C. H. Hoi, Pengcheng Wu, Jianke Zhu, Ying He, Chunyan Miao
Learning To Name Faces: A Multimodal Learning Scheme For Search-Based Face Annotation, Dayong Wang, Steven C. H. Hoi, Pengcheng Wu, Jianke Zhu, Ying He, Chunyan Miao
Research Collection School Of Computing and Information Systems
Automated face annotation aims to automatically detect human faces from a photo and further name the faces with the corresponding human names. In this paper, we tackle this open problem by investigating a search-based face annotation (SBFA) paradigm for mining large amounts of web facial images freely available on the WWW. Given a query facial image for annotation, the idea of SBFA is to first search for top-n similar facial images from a web facial image database and then exploit these top-ranked similar facial images and their weak labels for naming the query facial image. To fully mine those information, …
Gamification Of Education Using Computer Games, Fiona Fui-Hoon Nah, Venkata Telaprolu, Shashank Rallapalli, Pavani R. Venkata
Gamification Of Education Using Computer Games, Fiona Fui-Hoon Nah, Venkata Telaprolu, Shashank Rallapalli, Pavani R. Venkata
Research Collection School Of Computing and Information Systems
We review the literature on gamification and identify principles of gamification and system design elements for gamifying computer educational games. Gamification of education is expected to increase learners’ engagement, which in turn increases learning achievement. We propose a gamification framework that synthesizes findings from the literature. The gamification framework is comprised of principles of gamification, system design elements for gamification, and dimensions of user engagement.
Usability Of Performance Dashboards, Usefulness Of Operational And Tactical Support, And Quality Of Strategic Support: A Research Framework, Bih-Ru Lea, Fiona Fui-Hoon Nah
Usability Of Performance Dashboards, Usefulness Of Operational And Tactical Support, And Quality Of Strategic Support: A Research Framework, Bih-Ru Lea, Fiona Fui-Hoon Nah
Research Collection School Of Computing and Information Systems
Performance dashboards are used as a strategic decision support tool in organizations. In this research, we examine the relationships between the usability of performance dashboards, the usefulness of operational and tactical support, and the quality of strategic support that they provide. We hypothesize that usability of performance dashboards will influence user perceptions of the usefulness of the operational and tactical support provided by the dashboards, which in turn influence the perceived quality of strategic support provided.