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 1291 - 1320 of 3560
Full-Text Articles in Databases and Information Systems
Scalable, Adaptable And Fast Estimation Of Transient Downtime In Virtual Infrastructures Using Convex Decomposition And Sample Path Randomization, Zhiling Guo, Jin Li, Ram Ramesh
Scalable, Adaptable And Fast Estimation Of Transient Downtime In Virtual Infrastructures Using Convex Decomposition And Sample Path Randomization, Zhiling Guo, Jin Li, Ram Ramesh
Research Collection School Of Computing and Information Systems
Network function virtualization enables efficient cloud-resource planning by virtualizing network services and applications into software running on commodity servers. A cloud-service provider needs to manage and ensure service availability of a network of concurrent virtualized network functions (VNFs). The downtime distribution of a network of VNFs can be estimated using sample-path randomization on the underlying birth–death process. An integrated modeling approach for this purpose is limited by its scalability and computational load because of the high dimensionality of the integrated birth–death process. We propose a generalized convex decomposition of the integrated birth-death process, which transforms the high-dimensional multi-VNF process into …
Optimal Feature Selection For Learning-Based Algorithms For Sentiment Classification, Zhaoxia Wang, Zhiping Lin
Optimal Feature Selection For Learning-Based Algorithms For Sentiment Classification, Zhaoxia Wang, Zhiping Lin
Research Collection School Of Computing and Information Systems
Sentiment classification is an important branch of cognitive computation—thus the further studies of properties of sentiment analysis is important. Sentiment classification on text data has been an active topic for the last two decades and learning-based methods are very popular and widely used in various applications. For learning-based methods, a lot of enhanced technical strategies have been used to improve the performance of the methods. Feature selection is one of these strategies and it has been studied by many researchers. However, an existing unsolved difficult problem is the choice of a suitable number of features for obtaining the best sentiment …
Entity-Sensitive Attention And Fusion Network For Entity-Level Multimodal Sentiment Classification, Jianfei Yu, Jing Jiang
Entity-Sensitive Attention And Fusion Network For Entity-Level Multimodal Sentiment Classification, Jianfei Yu, Jing Jiang
Research Collection School Of Computing and Information Systems
Entity-level (aka target-dependent) sentiment analysis of social media posts has recently attracted increasing attention, and its goal is to predict the sentiment orientations over individual target entities mentioned in users' posts. Most existing approaches to this task primarily rely on the textual content, but fail to consider the other important data sources (e.g., images, videos, and user profiles), which can potentially enhance these text-based approaches. Motivated by the observation, we study entity-level multimodal sentiment classification in this article, and aim to explore the usefulness of images for entity-level sentiment detection in social media posts. Specifically, we propose an Entity-Sensitive Attention …
Aateam: Achieving The Ad Hoc Teamwork By Employing The Attention Mechanism, Shuo Chen, Ewa Andrejczuk, Zhiguang Cao, Jie Zhang
Aateam: Achieving The Ad Hoc Teamwork By Employing The Attention Mechanism, Shuo Chen, Ewa Andrejczuk, Zhiguang Cao, Jie Zhang
Research Collection School Of Computing and Information Systems
In the ad hoc teamwork setting, a team of agents needs to perform a task without prior coordination. The most advanced approach learns policies based on previous experiences and reuses one of the policies to interact with new teammates. However, the selected policy in many cases is sub-optimal. Switching between policies to adapt to new teammates' behaviour takes time, which threatens the successful performance of a task. In this paper, we propose AATEAM – a method that uses the attention-based neural networks to cope with new teammates' behaviour in real-time. We train one attention network per teammate type. The attention …
Coupled Rain Streak And Background Estimation Via Separable Element-Wise Attention, Yinjie Tan, Qiang Wen, Jing Qin, Jianbo Jiao, Guoqiang Han, Shengfeng He
Coupled Rain Streak And Background Estimation Via Separable Element-Wise Attention, Yinjie Tan, Qiang Wen, Jing Qin, Jianbo Jiao, Guoqiang Han, Shengfeng He
Research Collection School Of Computing and Information Systems
Single image de-raining is challenging especially in the scenarios with dense rain streaks. Existing methods resolve this problem by predicting the rain streaks of the image, which constrains the network to focus on local rain streaks features. However, dense rain streaks are visually similar to mist or fog (with large intensities), in this case, the training objective should be shifted to image recovery instead of extracting rain streaks. In this paper, we propose a coupled rain streak and background estimation network that explores the intrinsic relations between two tasks. In particular, our network produces task-dependent feature maps, each part of …
Synthesizing Aspect-Driven Recommendation Explanations From Reviews, Trung-Hoang Le, Hady W. Lauw
Synthesizing Aspect-Driven Recommendation Explanations From Reviews, Trung-Hoang Le, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Explanations help to make sense of recommendations, increasing the likelihood of adoption. However, existing approaches to explainable recommendations tend to rely on rigid, standardized templates, customized only via fill-in-the-blank aspect sentiments. For more flexible, literate, and varied explanations covering various aspects of interest, we synthesize an explanation by selecting snippets from reviews, while optimizing for representativeness and coherence. To fit target users' aspect preferences, we contextualize the opinions based on a compatible explainable recommendation model. Experiments on datasets of several product categories showcase the efficacies of our method as compared to baselines based on templates, review summarization, selection, and text …
Structure-Priority Image Restoration Through Genetic Algorithm Optimization, Zhaoxia Wang, Haibo Pen, Ting Yang, Quan Wang
Structure-Priority Image Restoration Through Genetic Algorithm Optimization, Zhaoxia Wang, Haibo Pen, Ting Yang, Quan Wang
Research Collection School Of Computing and Information Systems
With the significant increase in the use of image information, image restoration has been gaining much attention by researchers. Restoring the structural information as well as the textural information of a damaged image to produce visually plausible restorations is a challenging task. Genetic algorithm (GA) and its variants have been applied in many fields due to their global optimization capabilities. However, the applications of GA to the image restoration domain still remain an emerging discipline. It is still challenging and difficult to restore a damaged image by leveraging GA optimization. To address this problem, this paper proposes a novel GA-based …
The Topicality Of The Learning Organization: Is The Concept Still Relevant Today?, Siu Loon Hoe
The Topicality Of The Learning Organization: Is The Concept Still Relevant Today?, Siu Loon Hoe
Research Collection School Of Computing and Information Systems
This chapter introduces the current level of interest in the learning organization and usefulness of the concept at the present time. It reviews authors who have recently and explicitly commented on the topicality of the learning organization, offers a qualitative content analysis of recent journal publications on learning organizations justifying the need for the concept, and uses quantitative research using print media indicators and Google Trends to identify the number of publications related to the learning organization over time. The results suggest that while the level of interest in the learning organization among scientific researchers has grown, the level of …
Teacher-Student Networks With Multiple Decoders For Solving Math Word Problem, Jipeng Zhang, Roy Ka-Wei Lee, Ee-Peng Lim, Wei Qin, Lei Wang, Jie Shao, Qianru Sun
Teacher-Student Networks With Multiple Decoders For Solving Math Word Problem, Jipeng Zhang, Roy Ka-Wei Lee, Ee-Peng Lim, Wei Qin, Lei Wang, Jie Shao, Qianru Sun
Research Collection School Of Computing and Information Systems
Math word problem (MWP) is challenging due to the limitation in training data where only one “standard” solution is available. MWP models often simply fit this solution rather than truly understand or solve the problem. The generalization of models (to diverse word scenarios) is thus limited. To address this problem, this paper proposes a novel approach, TSN-MD, by leveraging the teacher network to integrate the knowledge of equivalent solution expressions and then to regularize the learning behavior of the student network. In addition, we introduce the multiple-decoder student network to generate multiple candidate solution expressions by which the final answer …
Designing Learning Activities For Experiential Learning In A Design Thinking Course, Benjamin Gan, Eng Lieh Ouh
Designing Learning Activities For Experiential Learning In A Design Thinking Course, Benjamin Gan, Eng Lieh Ouh
Research Collection School Of Computing and Information Systems
One experiential learning design challenge is the duration of learning activities. These learning activities take up time and effort for teachers to design and student to perform. Another design challenge is the minimum instructional guidance of these learning activities which potentially impact the learning effectiveness of novice students. In this paper, we describe our findings of applying experiential learning method in a design thinking course with a list of learning activities performed iteratively. Each of the learning activity varies in their duration required and level of instructional guidance. Our survey seeks to find out which of the learning activities are …
Optimal Management Of Virtual Infrastructures Under Flexible Cloud Service Agreements, Zhiling Guo, Jin Li, Ram Ramesh
Optimal Management Of Virtual Infrastructures Under Flexible Cloud Service Agreements, Zhiling Guo, Jin Li, Ram Ramesh
Research Collection School Of Computing and Information Systems
A cloud service agreement entails the provisioning of a required set of virtual infrastructure resources at a specified level of availability to a client. The agreement also lays out the price charged to the client and a penalty to the provider when the assured availability is not met. The availability assurance involves backup resource provisioning, and the provider needs to allocate backups cost-effectively by balancing the resource-provisioning costs with the potential penalty costs. We develop stochastic dynamic optimization models of the backup resource-provisioning problem, leading to cost-effective resource-management policies in different practical settings. We present two sets of dynamic provisioning …
Optimal Design And Ownership Structures Of Innovative Retail Payment Systems, Zhiling Guo, Dan Ma
Optimal Design And Ownership Structures Of Innovative Retail Payment Systems, Zhiling Guo, Dan Ma
Research Collection School Of Computing and Information Systems
In response to the Fintech trend, an ongoing debate in the banking industry is how to design the new-generation interbank retail payment and settlement system. We propose a two-stage analytical model that takes into account the value-risk tradeoff in the new payment system design, as well as banks’ participation incentives and adoption timing decisions. We find that, as the system base value increases, banks tend to synchronize their investment and adoption decisions. When the system base value is low and banks are heterogeneous, bank association ownership maximizes social welfare. When both the system base value and bank heterogeneity are moderate, …
Self-Organizing Neural Networks For Universal Learning And Multimodal Memory Encoding, Ah-Hwee Tan, Budhitama Subagdja, Di Wang, Lei Meng
Self-Organizing Neural Networks For Universal Learning And Multimodal Memory Encoding, Ah-Hwee Tan, Budhitama Subagdja, Di Wang, Lei Meng
Research Collection School Of Computing and Information Systems
Learning and memory are two intertwined cognitive functions of the human brain. This paper shows how a family of biologically-inspired self-organizing neural networks, known as fusion Adaptive Resonance Theory (fusion ART), may provide a viable approach to realizing the learning and memory functions. Fusion ART extends the single-channel Adaptive Resonance Theory (ART) model to learn multimodal pattern associative mappings. As a natural extension of ART, various forms of fusion ART have been developed for a myriad of learning paradigms, ranging from unsupervised learning to supervised learning, semi-supervised learning, multimodal learning, reinforcement learning, and sequence learning. In addition, fusion ART models …
Happy Toilet: A Social Analytics Approach To The Study Of Public Toilet Cleanliness, Eugene W. J. Choy, Winston M. K. Ho, Xiaohang Li, Ragini Verma, Li Jin Sim, Kyong Jin Shim
Happy Toilet: A Social Analytics Approach To The Study Of Public Toilet Cleanliness, Eugene W. J. Choy, Winston M. K. Ho, Xiaohang Li, Ragini Verma, Li Jin Sim, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
This study presents a social analytics approach to the study of public toilet cleanliness in Singapore. From popular social media platforms, our system automatically gathers and analyzes relevant public posts that mention about toilet cleanliness in highly frequented locations across the Singapore island - from busy shopping malls to food 'hawker' centers.
Quantum Consensus, Jorden Seet, Paul Griffin
Quantum Consensus, Jorden Seet, Paul Griffin
Research Collection School Of Computing and Information Systems
In this paper, we propose a novel consensus mechanism utilizing the quantum properties of qubits. This move from classical computing to quantum computing is shown to theoretically enhance the scalability and speed of distributed consensus as well as improve security and be a potential solution for the problem of blockchain interoperability. Using this method may circumvent the common problem known as the Blockchain Trilemma, enhancing scalability and speed without sacrificing de-centralization or byzantine fault tolerance. Consensus speed and scalability is shown by removing the need for multicast responses and exploiting quantum properties to ensure that only a single multicast is …
Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta
Influence, Information And Team Outcomes In Large Scale Software Development, Subhajit Datta
Research Collection School Of Computing and Information Systems
It is widely perceived that the egalitarian ecosystems of large scale open source software development foster effective team outcomes. In this study, we question this conventional wisdom by examining whether and how the centralization of information and influence in a software development team relate to the quality of the team's work products. Analyzing data from more than a hundred real world projects that include development activities over close to a decade, involving 2000+ developers, who collectively resolve more than two hundred thousand defects through discussions covering more than six hundred thousand comments, we arrive at statistically significant evidence indicating that …
Clustering Models For Topic Analysis In Graduate Discussion Forums, Mallika Gokarn Nitin, Swapna Gottipati, Venky Shankararaman
Clustering Models For Topic Analysis In Graduate Discussion Forums, Mallika Gokarn Nitin, Swapna Gottipati, Venky Shankararaman
Research Collection School Of Computing and Information Systems
Discussion forums provide the base content for creating a knowledge repository. It contains discussion threads related to key course topics that are debated by the students. In order to better understand the student learning experience, the instructor needs to analyse these discussion threads. This paper proposes the use of clustering models and interactive visualizations to conduct a qualitative analysis of graduate discussion forums. Our goal is to identify the sub-topics and topic evolutions in the discussion forums by applying text mining techniques. Our approach generates insights into the topic analysis in the forums and discovers the students’ cognitive understanding within …
Study Group Travel Behaviour Patterns From Large-Scale Smart Card Data, Xiancai Tian, Baihua Zheng
Study Group Travel Behaviour Patterns From Large-Scale Smart Card Data, Xiancai Tian, Baihua Zheng
Research Collection School Of Computing and Information Systems
In this paper, we aim at studying the group travel behaviour (GTB) patterns from large-scale auto fare collection (AFC) data. GTB is defined as two or more commuters intentionally and regularly traveling together from an origin to a destination. We propose a method to identify GTB accurately and efficiently and apply our method to the Singapore AFC dataset to reveal the GTB patterns of Singapore commuters. The case study proves that our method is able to identify GTB patterns more accurately and efficiently than the state-of-the-art.
Improved Generalisation Bounds For Deep Learning Through L∞ Covering Numbers, Antoine Ledent, Yunwen Lei, Marius Kloft
Improved Generalisation Bounds For Deep Learning Through L∞ Covering Numbers, Antoine Ledent, Yunwen Lei, Marius Kloft
Research Collection School Of Computing and Information Systems
Using proof techniques involving L∞ covering numbers, we show generalisation error bounds for deep learning with two main improvements over the state of the art. First, our bounds have no explicit dependence on the number of classes except for logarithmic factors. This holds even when formulating the bounds in terms of the L 2 norm of the weight matrices, while previous bounds exhibit at least a square-root dependence on the number of classes in this case. Second, we adapt the Rademacher analysis of DNNs to incorporate weight sharing—a task of fundamental theoretical importance which was previously attempted only under very …
Twenty Years Of Open Source Software: From Skepticism To Mainstream, Gregorio Robles, Igor Steinmacher, Paul Adams, Christoph Treude
Twenty Years Of Open Source Software: From Skepticism To Mainstream, Gregorio Robles, Igor Steinmacher, Paul Adams, Christoph Treude
Research Collection School Of Computing and Information Systems
Open source software (OSS) has conquered the software world. You can see it nearly everywhere, from Internet infrastructure to mobile phones to the desktop. In addition to that, although many OSS practices were viewed with skepticism 20 years ago, several have become mainstream in software engineering today: from development tools such as Git to practices such as modern code reviews.
The Dynamic Impacts Of Online Healthcare Community On Physician Altruism: A Hidden Markov Model, Kai Luo, Qiu-Hong Wang, Hock Hai Teo
The Dynamic Impacts Of Online Healthcare Community On Physician Altruism: A Hidden Markov Model, Kai Luo, Qiu-Hong Wang, Hock Hai Teo
Research Collection School Of Computing and Information Systems
Physician altruism is not only a key foundation of modern medical professionalism, but also a critical component in the theoretical health economics study. There is considerable interest in understanding the impacts of contemporary healthcare technology on physician altruism. In this paper, we investigate the dynamic influence of multiple incentive mechanisms developed by an online healthcare community (OHC) on physician altruism. We model physician altruism as the degree of tendency to benefit the patients at the cost of oneself and focus on the incentive mechanisms that give physicians social and economic returns. The dynamics of physician altruism is characterized via a …
Examining The Theoretical Mechanisms Underlying Health Information Exchange Impact On Healthcare Outcomes: A Physician Agency Perspective, Fang Zhou, Qiu-Hong Wang, Hock Hai Teo
Examining The Theoretical Mechanisms Underlying Health Information Exchange Impact On Healthcare Outcomes: A Physician Agency Perspective, Fang Zhou, Qiu-Hong Wang, Hock Hai Teo
Research Collection School Of Computing and Information Systems
Health information exchange (HIE) is presumed to reduce medical costs by facilitating information sharing across healthcare providers. Existing studies focused on different medical costs or one set of costs, and resulted in mixed findings. We examine the effects of patient access to HIE on two of the most important medical costs of a hospitalization episode - test costs and medication costs - through a natural experiment and the discharge data of a hospital. Besides the negative direct effect of access to HIT on tests costs, we also find its positive spillover effect on medication costs, such that more patients having …
Strongly Leakage Resilient Authenticated Key Exchange, Revisited, Guomin Yang, Rongmao Chen, Yi Mu, Willy Susilo, Guo Fuchun, Jie Li
Strongly Leakage Resilient Authenticated Key Exchange, Revisited, Guomin Yang, Rongmao Chen, Yi Mu, Willy Susilo, Guo Fuchun, Jie Li
Research Collection School Of Computing and Information Systems
Authenticated Key Exchange (AKE) protocols allow two (or multiple) parties to authenticate each other and agree on a common secret key, which is essential for establishing a secure communication channel over a public network. AKE protocols form a central component in many network security standards such as IPSec, TLS/SSL, and SSH. However, it has been demonstrated that many standardized AKE protocols are vulnerable to side-channel and key leakage attacks. In order to defend against such attacks, leakage resilient (LR-) AKE protocols have been proposed in the literature. Nevertheless, most of the existing LR-AKE protocols only focused on the resistance to …
A Unified Variance-Reduced Accelerated Gradient Method For Convex Optimization, Guanghui Lan, Zhize Li, Yi Zhou
A Unified Variance-Reduced Accelerated Gradient Method For Convex Optimization, Guanghui Lan, Zhize Li, Yi Zhou
Research Collection School Of Computing and Information Systems
We propose a novel randomized incremental gradient algorithm, namely, VAriance-Reduced Accelerated Gradient (Varag), for finite-sum optimization. Equipped with a unified step-size policy that adjusts itself to the value of the conditional number, Varag exhibits the unified optimal rates of convergence for solving smooth convex finite-sum problems directly regardless of their strong convexity. Moreover, Varag is the first accelerated randomized incremental gradient method that benefits from the strong convexity of the data-fidelity term to achieve the optimal linear convergence. It also establishes an optimal linear rate of convergence for solving a wide class of problems only satisfying a certain error bound …
Ssrgd: Simple Stochastic Recursive Gradient Descent For Escaping Saddle Points, Zhize Li
Ssrgd: Simple Stochastic Recursive Gradient Descent For Escaping Saddle Points, Zhize Li
Research Collection School Of Computing and Information Systems
We analyze stochastic gradient algorithms for optimizing nonconvex problems. In particular, our goal is to find local minima (second-order stationary points) instead of just finding first-order stationary points which may be some bad unstable saddle points. We show that a simple perturbed version of stochastic recursive gradient descent algorithm (called SSRGD) can find an $(\epsilon,\delta)$-second-order stationary point with $\widetilde{O}(\sqrt{n}/\epsilon^2 + \sqrt{n}/\delta^4 + n/\delta^3)$ stochastic gradient complexity for nonconvex finite-sum problems. As a by-product, SSRGD finds an $\epsilon$-first-order stationary point with $O(n+\sqrt{n}/\epsilon^2)$ stochastic gradients. These results are almost optimal since Fang et al. [2018] provided a lower bound $\Omega(\sqrt{n}/\epsilon^2)$ for finding …
Objective Sleep Quality As A Predictor Of Mild Cognitive Impairment In Seniors Living Alone, Brian Chen, Hwee-Pink Tan, Irus Rawtaer, Hwee Xian Tan
Objective Sleep Quality As A Predictor Of Mild Cognitive Impairment In Seniors Living Alone, Brian Chen, Hwee-Pink Tan, Irus Rawtaer, Hwee Xian Tan
Research Collection School Of Computing and Information Systems
Singapore has the fastest ageing population in the Asia Pacific region, with an estimated 82,000 seniors living with dementia. These figures are projected to increase to more than 130,000 by 2030. The challenge is to identify more community dwelling seniors with Mild Cognitive Impairment (MCI), a prodromal state, as it provides an opportunity for evidence-based early intervention to delay the onset of dementia. In this paper, we explore the use of Internet of Things (IoT) systems in detecting MCI symptoms in seniors who are living alone, and accurately grouping them into MCI positive and negative subjects. We present feature extraction …
Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao
Salience-Aware Adaptive Resonance Theory For Large-Scale Sparse Data Clustering, Lei Meng, Ah-Hwee Tan, Chunyan Miao
Research Collection School Of Computing and Information Systems
Sparse data is known to pose challenges to cluster analysis, as the similarity between data tends to be ill-posed in the high-dimensional Hilbert space. Solutions in the literature typically extend either k-means or spectral clustering with additional steps on representation learning and/or feature weighting. However, adding these usually introduces new parameters and increases computational cost, thus inevitably lowering the robustness of these algorithms when handling massive ill-represented data. To alleviate these issues, this paper presents a class of self-organizing neural networks, called the salience-aware adaptive resonance theory (SA-ART) model. SA-ART extends Fuzzy ART with measures for cluster-wise salient feature modeling. …
Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell
Identifying Regional Trends In Avatar Customization, Peter Mawhorter, Sercan Sengun, Haewoon Kwak, D. Fox Harrell
Research Collection School Of Computing and Information Systems
Since virtual identities such as social media profiles and avatars have become a common venue for self-expression, it has become important to consider the ways in which existing systems embed the values of their designers. In order to design virtual identity systems that reflect the needs and preferences of diverse users, understanding how the virtual identity construction differs between groups is important. This paper presents a new methodology that leverages deep learning and differential clustering for comparative analysis of profile images, with a case study of almost 100 000 avatars from a large online community using a popular avatar creation …
Gms: Grid-Based Motion Statistics For Fast, Ultra-Robust Feature Correspondence, Jia-Wang Bian, Wen-Yan Lin, Yun Liu, Le Zhang, Sai-Kit Yeung, Ming-Ming Cheng, Ian Reid
Gms: Grid-Based Motion Statistics For Fast, Ultra-Robust Feature Correspondence, Jia-Wang Bian, Wen-Yan Lin, Yun Liu, Le Zhang, Sai-Kit Yeung, Ming-Ming Cheng, Ian Reid
Research Collection School Of Computing and Information Systems
Feature matching aims at generating correspondences across images, which is widely used in many computer vision tasks. Although considerable progress has been made on feature descriptors and fast matching for initial correspondence hypotheses, selecting good ones from them is still challenging and critical to the overall performance. More importantly, existing methods often take a long computational time, limiting their use in real-time applications. This paper attempts to separate true correspondences from false ones at high speed. We term the proposed method (GMS) grid-based motion Statistics, which incorporates the smoothness constraint into a statistic framework for separation and uses a grid-based …
Using Customer Service Dialogues For Satisfaction Analysis With Context-Assisted Multiple Instance Learning, Kaisong Song, Lidong Bing, Wei Gao, Jun Lin, Lujun Zhao, Jiancheng Wang, Changlong Sun, Xiaozhong Liu, Qiong Zhang
Using Customer Service Dialogues For Satisfaction Analysis With Context-Assisted Multiple Instance Learning, Kaisong Song, Lidong Bing, Wei Gao, Jun Lin, Lujun Zhao, Jiancheng Wang, Changlong Sun, Xiaozhong Liu, Qiong Zhang
Research Collection School Of Computing and Information Systems
Customers ask questions and customer service staffs answer their questions, which is the basic service model via multi-turn customer service (CS) dialogues on E-commerce platforms. Existing studies fail to provide comprehensive service satisfaction analysis, namely satisfaction polarity classification (e.g., well satisfied, met and unsatisfied) and sentimental utterance identification (e.g., positive, neutral and negative). In this paper, we conduct a pilot study on the task of service satisfaction analysis (SSA) based on multi-turn CS dialogues. We propose an extensible Context-Assisted Multiple Instance Learning (CAMIL) model to predict the sentiments of all the customer utterances and then aggregate those sentiments into service …