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

Databases and Information Systems Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 871 - 900 of 3555

Full-Text Articles in Databases and Information Systems

Channel Integration Services In Online Healthcare Communities, Anqi Zhao, Qian Tang Dec 2021

Channel Integration Services In Online Healthcare Communities, Anqi Zhao, Qian Tang

Research Collection School Of Computing and Information Systems

In online healthcare communities, channel integration services have become the bridge between online and offline channels, enabling patients to easily migrate across channels. Different from pure online services, online-to-offline (On2Off) and offline-to-online (Off2On) channel integration services involve both channels. This study examines the interrelationships between pure online services and channel integration services. Using a panel dataset composed of data from an online healthcare community, we find that pure online services decrease patients’ demand for On2Off integration services but increase their use of Off2On integration services. Our findings suggest that providing healthcare services online can reduce online patients’ needs to visit …

Go to article

Imon: Appearance-Based Gaze Tracking System On Mobile Devices, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko Dec 2021

Imon: Appearance-Based Gaze Tracking System On Mobile Devices, Sinh Huynh, Rajesh Krishna Balan, Jeonggil Ko

Research Collection School Of Computing and Information Systems

Gaze tracking is a key building block used in many mobile applications including entertainment, personal productivity, accessibility, medical diagnosis, and visual attention monitoring. In this paper, we present iMon, an appearance-based gaze tracking system that is both designed for use on mobile phones and has significantly greater accuracy compared to prior state-of-the-art solutions. iMon achieves this by comprehensively considering the gaze estimation pipeline and then overcoming three different sources of errors. First, instead of assuming that the user's gaze is fixed to a single 2D coordinate, we construct each gaze label using a probabilistic 2D heatmap gaze representation input to …

Go to article

Spurring Digital Transformation In Singapore's Legal Industry, Xin Juan Chua, Steven M. Miller Dec 2021

Spurring Digital Transformation In Singapore's Legal Industry, Xin Juan Chua, Steven M. Miller

Research Collection School Of Computing and Information Systems

COVID-19 has transformed the way we live and work. It has caused the processes and operations of businesses and organisations to be restructured, as well as transformed business models. A 2020 McKinsey Global survey reported that companies all over the world claim they have accelerated the digitalisation of their customer and supply-chain interactions, as well as their internal operations, by three to four years. They also said they thought the share of digital or digitally enabled products in their portfolios has advanced by seven years. While technology transformation is not new to the legal profession, COVID-19 has cemented the importance …

Go to article

Context-Aware Graph Convolutional Network For Dynamic Origin-Destination Prediction, Juan Nathaniel, Baihua Zheng Dec 2021

Context-Aware Graph Convolutional Network For Dynamic Origin-Destination Prediction, Juan Nathaniel, Baihua Zheng

Research Collection School Of Computing and Information Systems

A robust Origin-Destination (OD) prediction is key to urban mobility. A good forecasting model can reduce operational risks and improve service availability, among many other upsides. Here, we examine the use of Graph Convolutional Net-work (GCN) and its hybrid Markov-Chain (GCN-MC) variant to perform a context-aware OD prediction based on a large-scale public transportation dataset in Singapore. Compared with the baseline Markov-Chain algorithm and GCN, the proposed hybrid GCN-MC model improves the prediction accuracy by 37% and 12% respectively. Lastly, the addition of temporal and historical contextual information further improves the performance of the proposed hybrid model by 4 –12%.

Go to article

Canita: Faster Rates For Distributed Convex Optimization With Communication Compression, Zhize Li, Peter Richtarik Dec 2021

Canita: Faster Rates For Distributed Convex Optimization With Communication Compression, Zhize Li, Peter Richtarik

Research Collection School Of Computing and Information Systems

Due to the high communication cost in distributed and federated learning, methods relying on compressed communication are becoming increasingly popular. Besides, the best theoretically and practically performing gradient-type methods invariably rely on some form of acceleration/momentum to reduce the number of communications (faster convergence), e.g., Nesterov's accelerated gradient descent (Nesterov, 1983, 2004) and Adam (Kingma and Ba, 2014). In order to combine the benefits of communication compression and convergence acceleration, we propose a \emph{compressed and accelerated} gradient method based on ANITA (Li, 2021) for distributed optimization, which we call CANITA. Our CANITA achieves the \emph{first accelerated rate} $O\bigg(\sqrt{\Big(1+\sqrt{\frac{\omega^3}{n}}\Big)\frac{L}{\epsilon}} + \omega\big(\frac{1}{\epsilon}\big)^{\frac{1}{3}}\bigg)$, …

Go to article

Self-Supervised Learning Disentangled Group Representation As Feature, Tan Wang, Zhongqi Yue, Jianqiang Huang, Qianru Sun, Hanwang Zhang Dec 2021

Self-Supervised Learning Disentangled Group Representation As Feature, Tan Wang, Zhongqi Yue, Jianqiang Huang, Qianru Sun, Hanwang Zhang

Research Collection School Of Computing and Information Systems

A good visual representation is an inference map from observations (images) to features (vectors) that faithfully reflects the hidden modularized generative factors (semantics). In this paper, we formulate the notion of “good” representation from a group-theoretic view using Higgins’ definition of disentangled representation [38], and show that existing Self-Supervised Learning (SSL) only disentangles simple augmentation features such as rotation and colorization, thus unable to modularize the remaining semantics. To break the limitation, we propose an iterative SSL algorithm: Iterative Partition-based Invariant Risk Minimization (IP-IRM), which successfully grounds the abstract semantics and the group acting on them into concrete contrastive learning. …

Go to article

Incbl: Incremental Bug Localization, Zhou Yang, Jieke Shi, Wang Shaowei, David Lo Nov 2021

Incbl: Incremental Bug Localization, Zhou Yang, Jieke Shi, Wang Shaowei, David Lo

Research Collection School Of Computing and Information Systems

Numerous efforts have been invested in improving the effectiveness of bug localization techniques, whereas little attention is paid to making these tools run more efficiently in continuously evolving software repositories. This paper first analyzes the information retrieval model behind a classic bug localization tool, BugLocator, and builds a mathematical foundation illustrating that the model can be updated incrementally when codebase or bug reports evolve. Then, we present IncBL, a tool for Incremental Bug Localization in evolving software repositories. IncBL is evaluated on the Bugzbook dataset, and the results show that IncBL can significantly reduce the running time by 77.79% on …

Go to article

Transforming Businesses With E-Commerce Intelligence, Yuanto Kusnadi, Gary Pan Nov 2021

Transforming Businesses With E-Commerce Intelligence, Yuanto Kusnadi, Gary Pan

Research Collection School Of Accountancy

2020 had been an extraordinary year as the Covid-19 pandemic struck almost all countries in the world and created an extraordinary impact on businesses worldwide. Singapore and many other Southeast Asian countries were not spared and had to implement lockdowns swiftly. To cope with physical store closures and the increased volume of online transactions, most businesses tried to revamp their business models and set up online stores to capitalise on the rise of the e-commerce wave. With the growing trend of online transactions, it has become imperative for companies operating in the Fast Moving Consumer Goods (FMCG) industry to track …

Go to article

Factual Consistency Evaluation For Text Summarization Via Counterfactual Estimation, Yuexiang Xie, Fei Sun, Yang Deng, Yaliang Li, Bolin Ding Nov 2021

Factual Consistency Evaluation For Text Summarization Via Counterfactual Estimation, Yuexiang Xie, Fei Sun, Yang Deng, Yaliang Li, Bolin Ding

Research Collection School Of Computing and Information Systems

Despite significant progress has been achieved in text summarization, factual inconsistency in generated summaries still severely limits its practical applications. Among the key factors to ensure factual consistency, a reliable automatic evaluation metric is the first and the most crucial one. However, existing metrics either neglect the intrinsic cause of the factual inconsistency or rely on auxiliary tasks, leading to an unsatisfied correlation with human judgments or increasing the inconvenience of usage in practice. In light of these challenges, we propose a novel metric to evaluate the factual consistency in text summarization via counterfactual estimation, which formulates the causal relationship …

Go to article

K-Sums Clustering: A Stochastic Optimization Approach, Zhao Wan-Lei, Shi Ying Lan, Run-Qing Chen, Chong-Wah Ngo Nov 2021

K-Sums Clustering: A Stochastic Optimization Approach, Zhao Wan-Lei, Shi Ying Lan, Run-Qing Chen, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

In this paper, we revisit the decades-old clustering method k-means. The egg-chicken loop in traditional k-means has been replaced by a pure stochastic optimization procedure. The optimization is undertaken from the perspective of each individual sample. Different from existing incremental k-means, an individual sample is tentatively joined into a new cluster to evaluate its distance to the corresponding new centroid, in which the contribution from this sample is accounted. The sample is moved to this new cluster concretely only after we find the reallocation makes the sample closer to the new centroid than it is to the current one. Compared …

Go to article

On A Multistage Discrete Stochastic Optimization Problem With Stochastic Constraints And Nested Sampling, Thuy Anh Ta, Tien Mai, Fabian Bastin, Pierre L'Ecuyer Nov 2021

On A Multistage Discrete Stochastic Optimization Problem With Stochastic Constraints And Nested Sampling, Thuy Anh Ta, Tien Mai, Fabian Bastin, Pierre L'Ecuyer

Research Collection School Of Computing and Information Systems

We consider a multistage stochastic discrete program in which constraints on any stage might involve expectations that cannot be computed easily and are approximated by simulation. We study a sample average approximation (SAA) approach that uses nested sampling, in which at each stage, a number of scenarios are examined and a number of simulation replications are performed for each scenario to estimate the next-stage constraints. This approach provides an approximate solution to the multistage problem. To establish the consistency of the SAA approach, we first consider a two-stage problem and show that in the second-stage problem, given a scenario, the …

Go to article

Information Technology And Organizational Learning: Managing Behavioral Change In The Digital Age By Arthur M. Langer, Siu Loon Hoe Nov 2021

Information Technology And Organizational Learning: Managing Behavioral Change In The Digital Age By Arthur M. Langer, Siu Loon Hoe

Research Collection School Of Computing and Information Systems

As the world battles yet another crisis because of the spread of COVID-19, the idea of digitalization brings about a whole new meaning. Many professionals and information technology (IT) managers have remarked that the spread of the coronavirus has accelerated the pace of digital transformation much more so than any effort put forth by C-suite executives. While it is true that most organizations do not accept new technology readily because of embedded legacy systems, changing the corporate cultures does play an important role in affecting the rate of IT adoption. Very often, leaders and senior executives focus on the technological …

Go to article

Can We Make It Better? Assessing And Improving Quality Of Github Repositories, Gede Artha Azriadi Prana Nov 2021

Can We Make It Better? Assessing And Improving Quality Of Github Repositories, Gede Artha Azriadi Prana

Dissertations and Theses Collection (Open Access)

The code hosting platform GitHub has gained immense popularity worldwide in recent years, with over 200 million repositories hosted as of June 2021. Due to its popularity, it has great potential to facilitate widespread improvements across many software projects. Naturally, GitHub has attracted much research attention, and the source code in the various repositories it hosts also provide opportunity to apply techniques and tools developed by software engineering researchers over the years. However, much of existing body of research applicable to GitHub focuses on code quality of the software projects and ways to improve them. Fewer work focus on potential …

Go to article

Learning To Teach And Learn For Semi-Supervised Few-Shot Image Classification, Xinzhe Li, Jianqiang Huang, Yaoyao Liu, Qin Zhou, Shibao Zheng, Bernt Schiele, Qianru Sun Nov 2021

Learning To Teach And Learn For Semi-Supervised Few-Shot Image Classification, Xinzhe Li, Jianqiang Huang, Yaoyao Liu, Qin Zhou, Shibao Zheng, Bernt Schiele, Qianru Sun

Research Collection School Of Computing and Information Systems

This paper presents a novel semi-supervised few-shot image classification method named Learning to Teach and Learn (LTTL) to effectively leverage unlabeled samples in small-data regimes. Our method is based on self-training, which assigns pseudo labels to unlabeled data. However, the conventional pseudo-labeling operation heavily relies on the initial model trained by using a handful of labeled data and may produce many noisy labeled samples. We propose to solve the problem with three steps: firstly, cherry-picking searches valuable samples from pseudo-labeled data by using a soft weighting network; and then, cross-teaching allows the classifiers to teach mutually for rejecting more noisy …

Go to article

Expediting The Accuracy-Improving Process Of Svms For Class Imbalance Learning, Bin Cao, Yuqi Liu, Chenyu Hou, Jing Fan, Baihua Zheng, Jianwei Jin Nov 2021

Expediting The Accuracy-Improving Process Of Svms For Class Imbalance Learning, Bin Cao, Yuqi Liu, Chenyu Hou, Jing Fan, Baihua Zheng, Jianwei Jin

Research Collection School Of Computing and Information Systems

To improve the classification performance of support vector machines (SVMs) on imbalanced datasets, cost-sensitive learning methods have been proposed, e.g., DEC (Different Error Costs) and FSVM-CIL (Fuzzy SVM for Class Imbalance Learning). They relocate the hyperplane by adjusting the costs associated with misclassifying samples. However, the error costs are determined either empirically or by performing an exhaustive search in the parameter space. Both strategies can not guarantee effectiveness and efficiency simultaneously. In this paper, we propose ATEC, a solution that can efficiently find a preferable hyperplane by automatically tuning the error cost for between-class samples. ATEC distinguishes itself from all …

Go to article

Automating Developer Chat Mining, Shengyi Pan, Lingfeng Bao, Xiaoxue Ren, Xin Xia, David Lo, Shanping Li Nov 2021

Automating Developer Chat Mining, Shengyi Pan, Lingfeng Bao, Xiaoxue Ren, Xin Xia, David Lo, Shanping Li

Research Collection School Of Computing and Information Systems

Online chatrooms are gaining popularity as a communication channel between widely distributed developers of Open Source Software (OSS) projects. Most discussion threads in chatrooms follow a Q&A format, with some developers (askers) raising an initial question and others (respondents) joining in to provide answers. These discussion threads are embedded with rich information that can satisfy the diverse needs of various OSS stakeholders. However, retrieving information from threads is challenging as it requires a thread-level analysis to understand the context. Moreover, the chat data is transient and unstructured, consisting of entangled informal conversations. In this paper, we address this challenge by …

Go to article

Protein Deep Profile And Model Predictions For Identifying The Causal Genes Of Male Infertility Based On Deep Learning, Fang Xu, Ganggang Guo, Feida Zhu, Xiaojun Tan, Liqing Fan Nov 2021

Protein Deep Profile And Model Predictions For Identifying The Causal Genes Of Male Infertility Based On Deep Learning, Fang Xu, Ganggang Guo, Feida Zhu, Xiaojun Tan, Liqing Fan

Research Collection School Of Computing and Information Systems

A principal task in dissecting the genetics of complex traits is to identify causal genes for disease phenotypes. Millions of genes have been sequenced in data-driven genomics era, but their causal relationships with disease phenotypes remain limited, due to the difficulty of elucidating underlying causal genes by laboratory-based strategies. Here, we proposed an innovative deep learning computational modeling alternative (DPPCG framework) for identifying causal (coding) genes for a specific disease phenotype. In terms of male infertility, we introduced proteins as intermediate cell variables, leveraging integrated deep knowledge representations (Word2vec, ProtVec, Node2vec, and Space2vec) quantitatively represented as ‘protein deep profiles’. We …

Go to article

Aspect Sentiment Quad Prediction As Paraphrase Generation, Wenxuan Zhang, Yang Deng, Xin Li, Yifei Yuan, Lidong Bing, Wai Lam Nov 2021

Aspect Sentiment Quad Prediction As Paraphrase Generation, Wenxuan Zhang, Yang Deng, Xin Li, Yifei Yuan, Lidong Bing, Wai Lam

Research Collection School Of Computing and Information Systems

Aspect-based sentiment analysis (ABSA) has been extensively studied in recent years, which typically involves four fundamental sentiment elements, including the aspect category, aspect term, opinion term, and sentiment polarity. Existing studies usually consider the detection of partial sentiment elements, instead of predicting the four elements in one shot. In this work, we introduce the Aspect Sentiment Quad Prediction (ASQP) task, aiming to jointly detect all sentiment elements in quads for a given opinionated sentence, which can reveal a more comprehensive and complete aspect-level sentiment structure. We further propose a novel Paraphrase modeling paradigm to cast the ASQP task to a …

Go to article

Does Active Service Intervention Drive More Complaints On Social Media? The Roles Of Service Quality And Awareness, Shujing Sun, Yang Gao, Huaxia Rui Nov 2021

Does Active Service Intervention Drive More Complaints On Social Media? The Roles Of Service Quality And Awareness, Shujing Sun, Yang Gao, Huaxia Rui

Research Collection School Of Computing and Information Systems

Despite many advantages of social media as a customer service channel, there is a concern that active service intervention encourages excessive service complaints. Our paper casts doubt on this misconception by examining the dynamics between social media customer complaints and brand service interventions. We find service interventions indeed cause more complaints, yet this increase is driven by service awareness rather than chronic complaining. Due to the publicity and connectivity of social media, customers learn about the new service channel by observing customer service delivery to others – a mechanism that is unique to social media customer service and does not …

Go to article

Representation Learning On Multi-Layered Heterogeneous Network, Delvin Ce Zhang, Hady W. Lauw Nov 2021

Representation Learning On Multi-Layered Heterogeneous Network, Delvin Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Network data can often be represented in a multi-layered structure with rich semantics. One example is e-commerce data, containing user-user social network layer and item-item context layer, with cross-layer user-item interactions. Given the dual characters of homogeneity within each layer and heterogeneity across layers, we seek to learn node representations from such a multi-layered heterogeneous network while jointly preserving structural information and network semantics. In contrast, previous works on network embedding mainly focus on single-layered or homogeneous networks with one type of nodes and links. In this paper we propose intra- and cross-layer proximity concepts. Intra-layer proximity simulates propagation along …

Go to article

Investigating The Effects Of Dimension-Specific Sentiments On Product Sales: The Perspective Of Sentiment Preferences, Cuiqing Jiang, Jianfei Wang, Qian Tang, Xiaozhong Lyu Nov 2021

Investigating The Effects Of Dimension-Specific Sentiments On Product Sales: The Perspective Of Sentiment Preferences, Cuiqing Jiang, Jianfei Wang, Qian Tang, Xiaozhong Lyu

Research Collection School Of Computing and Information Systems

While literature has reached a consensus on the awareness effect of online word-of-mouth (eWOM), this paper studies its persuasive effect, specifically, the dimension-specific sentiment effects on product sales. We allow the sentiment information in eWOM along different product dimensions to have different persuasive effects on consumers’ purchase decisions. This occurs because of consumers’ sentiment preference, which is defined as the relative importance consumers place on various dimension-specific sentiments. We use an aspect-level sentiment analysis to derive the dimension-specific sentiments and PVAR (panel vector auto-regression) models to estimate their effects on product sales using a movie panel dataset. The findings show …

Go to article

Exploiting Reasoning Chains For Multi-Hop Science Question Answering, Weiwen Xu, Yang Deng, Huihui Zhang, Deng Cai, Wai Lam Nov 2021

Exploiting Reasoning Chains For Multi-Hop Science Question Answering, Weiwen Xu, Yang Deng, Huihui Zhang, Deng Cai, Wai Lam

Research Collection School Of Computing and Information Systems

We propose a novel Chain Guided Retriever reader (CGR) framework to model the reasoning chain for multi-hop Science Question Answering. Our framework is capable of performing explainable reasoning without the need of any corpus-specific annotations, such as the ground-truth reasoning chain, or human annotated entity mentions. Specifically, we first generate reasoning chains from a semantic graph constructed by Abstract Meaning Representation of retrieved evidence facts. A Chain-aware loss, concerning both local and global chain information, is also designed to enable the generated chains to serve as distant supervision signals for training the retriever, where reinforcement learning is also adopted to …

Go to article

A Bert-Based Two-Stage Model For Chinese Chengyu Recommendation, Minghuan Tan, Jing Jiang, Bingtian Dai Nov 2021

A Bert-Based Two-Stage Model For Chinese Chengyu Recommendation, Minghuan Tan, Jing Jiang, Bingtian Dai

Research Collection School Of Computing and Information Systems

In Chinese, Chengyu are fixed phrases consisting of four characters. As a type of idioms, their meanings usually cannot be derived from their component characters. In this paper, we study the task of recommending a Chengyu given a textual context. Observing some of the limitations with existing work, we propose a two-stage model, where during the first stage we re-train a Chinese BERT model by masking out Chengyu from a large Chinese corpus with a wide coverage of Chengyu. During the second stage, we fine-tune the retrained, Chengyu-oriented BERT on a specific Chengyu recommendation dataset. We evaluate this method on …

Go to article

Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability, Xin Lv, Yixin Cao, Lei Hou, Juanzi Li, Zhiyuan Liu, Yichi Zhang, Zelin Dai Nov 2021

Is Multi-Hop Reasoning Really Explainable? Towards Benchmarking Reasoning Interpretability, Xin Lv, Yixin Cao, Lei Hou, Juanzi Li, Zhiyuan Liu, Yichi Zhang, Zelin Dai

Research Collection School Of Computing and Information Systems

Multi-hop reasoning has been widely studied in recent years to obtain more interpretable link prediction. However, we find in experiments that many paths given by these models are actually unreasonable, while little work has been done on interpretability evaluation for them. In this paper, we propose a unified framework to quantitatively evaluate the interpretability of multi-hop reasoning models so as to advance their development. In specific, we define three metrics, including path recall, local interpretability, and global interpretability for evaluation, and design an approximate strategy to calculate these metrics using the interpretability scores of rules. We manually annotate all possible …

Go to article

Binary Classifiers For Noisy Datasets: A Comparative Study Of Existing Quantum Machine Learning Frameworks And Some New Approaches, Nikolaos Schetakis, Davit Aghamalyan, Paul Robert Griffin, Michael Boguslavsky Nov 2021

Binary Classifiers For Noisy Datasets: A Comparative Study Of Existing Quantum Machine Learning Frameworks And Some New Approaches, Nikolaos Schetakis, Davit Aghamalyan, Paul Robert Griffin, Michael Boguslavsky

Research Collection School Of Computing and Information Systems

This technology offer is a quantum machine learning algorithm applied to binary classification models for noisy datasets which are prevalent in financial and other datasets. By combining hybrid-neural networks, quantum parametric circuits, and data re-uploading we have improved the classification of non-convex 2-dimensional figures by understanding learning stability as noise increases in the dataset. The metric we use for assessing the performance of our quantum classifiers is the area under the receiver operator curve (ROC AUC). We are interested to collaborate with partners with use cases for binary classification of noisy data. Also, as quantum technology is still insufficient for …

Go to article

Topic Modeling For Multi-Aspect Listwise Comparison, Delvin Ce Zhang, Hady W. Lauw Nov 2021

Topic Modeling For Multi-Aspect Listwise Comparison, Delvin Ce Zhang, Hady W. Lauw

Research Collection School Of Computing and Information Systems

As a well-established probabilistic method, topic models seek to uncover latent semantics from plain text. In addition to having textual content, we observe that documents are usually compared in listwise rankings based on their content. For instance, world-wide countries are compared in an international ranking in terms of electricity production based on their national reports. Such document comparisons constitute additional information that reveal documents' relative similarities. Incorporating them into topic modeling could yield comparative topics that help to differentiate and rank documents. Furthermore, based on different comparison criteria, the observed document comparisons usually cover multiple aspects, each expressing a distinct …

Go to article

An Economic Analysis Of Rebates Conditional On Positive Reviews, Jianqing Chen, Zhiling Guo, Jian Huang Nov 2021

An Economic Analysis Of Rebates Conditional On Positive Reviews, Jianqing Chen, Zhiling Guo, Jian Huang

Research Collection School Of Computing and Information Systems

Strategic sellers on some online selling platforms have recently been using a conditional-rebate strategy to manipulate product reviews under which only purchasing consumers who post positive reviews online are eligible to redeem the rebate. A key concern for the conditional rebate is that it can easily induce fake reviews, which might be harmful to consumers and society. We develop a microbehavioral model capturing consumers’ review-sharing benefit, review-posting cost, and moral cost of lying to examine the seller’s optimal pricing and rebate decisions. We derive three equilibria: the no-rebate, organic-review equilibrium; the low-rebate, boosted-authentic-review equilibrium; and the high-rebate, partially-fake-review equilibrium. We …

Go to article

On Aggregating Salaries Of Occupations From Job Post And Review Data, Chih-Chieh Hung, Ee-Peng Lim Nov 2021

On Aggregating Salaries Of Occupations From Job Post And Review Data, Chih-Chieh Hung, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

The popularity of job websites has significantly changed the way people learn about different occupations. Among the insights offered by these websites are the statistics of occupation salaries which are useful information for job seekers, career coaches, graduating students, and labor related government agencies. Such statistics include the distribution of job salaries of each occupation, such as average or quantiles. However, significant variability in salary (and review salary) can be found among jobs of the same occupation as we gather job post and review data from job websites. Such variability shows the existence of biases, including salary competitiveness in job …

Go to article

Flip & Slack – Active Flipped Classroom Learning With Collaborative Slack Interactions, Kyong Jin Shim, Gottipati Swapna, Yi Meng Lau Nov 2021

Flip & Slack – Active Flipped Classroom Learning With Collaborative Slack Interactions, Kyong Jin Shim, Gottipati Swapna, Yi Meng Lau

Research Collection School Of Computing and Information Systems

Active flipped classroom learning is stipulated with faculty structuring the activities involving constructive interactions, either formal or informal. Sharing ideas and responding to ideas improve the cognitive skills of the students. Encouraging peers to contribute to class activities and respecting peers contribute to the development of affective skills. We present an integrated platform for cognitive and affective skills development. A flipped classroom arrangement allows the faculty to focus more on in-class activities such as programming and lab exercises to support active learning in computing courses. We share the design of an innovative flipped classroom model integrated with Slack and present …

Go to article

Topic-Aware Heterogeneous Graph Neural Network For Link Prediction, Siyong Xu, Cheng Yang, Yuan Fang, Yuan Fang, Yang Tianchi, Luhao Zhang Nov 2021

Topic-Aware Heterogeneous Graph Neural Network For Link Prediction, Siyong Xu, Cheng Yang, Yuan Fang, Yuan Fang, Yang Tianchi, Luhao Zhang

Research Collection School Of Computing and Information Systems

Heterogeneous graphs (HGs), consisting of multiple types of nodes and links, can characterize a variety of real-world complex systems. Recently, heterogeneous graph neural networks (HGNNs), as a powerful graph embedding method to aggregate heterogeneous structure and attribute information, has earned a lot of attention. Despite the ability of HGNNs in capturing rich semantics which reveal different aspects of nodes, they still stay at a coarse-grained level which simply exploits structural characteristics. In fact, rich unstructured text content of nodes also carries latent but more fine-grained semantics arising from multi-facet topic-aware factors, which fundamentally manifest why nodes of different types would …

Go to article

First Prev Next Last