Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Deep Learning (7)
- Task analysis (7)
- Deep learning (6)
- Knowledge Graph (5)
- Machine learning (5)
-
- Contrastive Learning (4)
- Graph neural networks (4)
- Representation learning (4)
- Anomaly detection (3)
- Blockchain (3)
- COVID-19 (3)
- Multimodal (3)
- Singapore (3)
- Visualization (3)
- Adversarial Attack (2)
- Attention (2)
- Attention mechanism (2)
- Cloud computing (2)
- Contrastive learning (2)
- Correlation analysis (2)
- Crowdsourcing (2)
- Cryptocurrency (2)
- Cryptography (2)
- Data governance (2)
- Data mining (2)
- Data structures (2)
- Data visualization (2)
- Embeddings (2)
- Empirical Study (2)
- Empirical study (2)
Articles 1 - 30 of 212
Full-Text Articles in Physical Sciences and Mathematics
R2f: A General Retrieval, Reading And Fusion Framework For Document-Level Natural Language Inference, Hao Wang, Yixin Cao, Yangguang Li, Zhen Huang, Kun Wang, Jing Shao
R2f: A General Retrieval, Reading And Fusion Framework For Document-Level Natural Language Inference, Hao Wang, Yixin Cao, Yangguang Li, Zhen Huang, Kun Wang, Jing Shao
Research Collection School Of Computing and Information Systems
Document-level natural language inference (DocNLI) is a new challenging task in natural language processing, aiming at judging the entailment relationship between a pair of hypothesis and premise documents. Current datasets and baselines largely follow sentence-level settings, but fail to address the issues raised by longer documents. In this paper, we establish a general solution, named Retrieval, Reading and Fusion (R2F) framework, and a new setting, by analyzing the main challenges of DocNLI: interpretability, long-range dependency, and cross-sentence inference. The basic idea of the framework is to simplify document-level task into a set of sentence-level tasks, and improve both performance and …
What Should Streamers Communicate In Livestream E-Commerce? The Effects Of Social Interactions On Live Streaming Performance, Danyang Song, Xi Chen, Zhiling Guo, Xiao Liu Liu, Ruijin. Jin
What Should Streamers Communicate In Livestream E-Commerce? The Effects Of Social Interactions On Live Streaming Performance, Danyang Song, Xi Chen, Zhiling Guo, Xiao Liu Liu, Ruijin. Jin
Research Collection School Of Computing and Information Systems
Compared with traditional e-commerce, livestreaming e-commerce is characterized by direct and intimate communication between streamers and consumers that stimulates instant social interactions. This study focuses on streamers’ three types of information exchange (i.e., product information, social conversation, and social solicitation) and examines their roles in driving both short-term and long-term livestreaming performance (i.e., sales and customer base growth). We find that the informational role of product information (nonpromotional and promotional) is beneficial not only to sales performance, but also to the growth of the customer base. We also find that social conversation has a relationship-building effect that positively impacts both …
Dialogconv: A Lightweight Fully Convolutional Network For Multi-View Response Selection, Yongkang Liu, Shi Feng, Wei Gao, Daling Wang, Yifei Zhang
Dialogconv: A Lightweight Fully Convolutional Network For Multi-View Response Selection, Yongkang Liu, Shi Feng, Wei Gao, Daling Wang, Yifei Zhang
Research Collection School Of Computing and Information Systems
Current end-to-end retrieval-based dialogue systems are mainly based on Recurrent Neural Networks or Transformers with attention mechanisms. Although promising results have been achieved, these models often suffer from slow inference or huge number of parameters. In this paper, we propose a novel lightweight fully convolutional architecture, called DialogConv, for response selection. DialogConv is exclusively built on top of convolution to extract matching features of context and response. Dialogues are modeled in 3D views, where DialogConv performs convolution operations on embedding view, word view and utterance view to capture richer semantic information from multiple contextual views. On the four benchmark datasets, …
Mining Competitively-Priced Bundle Configurations, Ezekiel Ong Young, Hady W. Lauw
Mining Competitively-Priced Bundle Configurations, Ezekiel Ong Young, Hady W. Lauw
Research Collection School Of Computing and Information Systems
We examine the bundle configuration problem in the presence of competition. Given a competitor's bundle configuration and pricing, we determine what to bundle together, and at what prices, to maximize the target firm's revenue. We highlight the difficulty in pricing bundles and propose a scalable alternative and an efficient search heuristic to refine the approximate prices. Furthermore, we extend the heuristics proposed by previous work to accommodate the presence of a competitor. We analyze the effectiveness of our proposed models through experimentation on real-life ratings-based preference data.
Singlish Checker: A Tool For Understanding And Analysing An English Creole Language, Lee-Hsun Hsieh, Nam Chew Chua, Agus Trisnajaya Kwee, Pei-Chi Lo, Yang-Yin Lee, Ee-Peng Lim
Singlish Checker: A Tool For Understanding And Analysing An English Creole Language, Lee-Hsun Hsieh, Nam Chew Chua, Agus Trisnajaya Kwee, Pei-Chi Lo, Yang-Yin Lee, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
As English is a widely used language in many countries of different cultures, variants of English also known as English creoles have also been created. Singlish is one such English creole used by people in Singapore. Nevertheless, unlike English, Singlish is not taught in schools nor encouraged to be used in formal communications. Hence, it remains to be a low resource language with a lack of up-to-date Singlish word dictionary and computational tools to analyse the language. In this paper, we therefore propose Singlish Checker, a tool that is able to help detecting Singlish text, Singlish words and phrases. To …
Question-Attentive Review-Level Recommendation Explanation, Trung Hoang Le, Hady Wirawan Lauw
Question-Attentive Review-Level Recommendation Explanation, Trung Hoang Le, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Recommendation explanations help to improve their acceptance by end users. The form of explanation of interest here is presenting an existing review of the recommended item. The challenge is in selecting a suitable review, which is customarily addressed by assessing the relative importance of each review to the recommendation objective. Our focus is on improving review-level explanation by leveraging additional information in the form of questions and answers (QA). The proposed framework employs QA in an attention mechanism that aligns reviews to various QAs of an item and assesses their contribution jointly to the recommendation objective. The benefits are two-fold. …
Learning Dynamic Multimodal Implicit And Explicit Networks For Multiple Financial Tasks, Meng Kiat Gary Ang, Ee-Peng Lim
Learning Dynamic Multimodal Implicit And Explicit Networks For Multiple Financial Tasks, Meng Kiat Gary Ang, Ee-Peng Lim
Research Collection School Of Computing and Information Systems
Many financial f orecasting d eep l earning w orks focus on the single task of predicting stock returns for trading with unimodal numerical inputs. Investment and risk management however involves multiple financial t asks - f orecasts o f expected returns, risks and correlations of multiple stocks in portfolios, as well as important events affecting different stocks - to support decision making. Moreover, stock returns are influenced by large volumes of non-stationary time-series information from a variety of modalities and the propagation of such information across inter-company relationship networks. Such networks could be explicit - observed co-occurrences in online …
Coresets For Vertical Federated Learning: Regularized Linear Regression And K-Means Clustering, Lingxiao Huang, Zhize Li, Jialin Sun, Haoyu Zhao
Coresets For Vertical Federated Learning: Regularized Linear Regression And K-Means Clustering, Lingxiao Huang, Zhize Li, Jialin Sun, Haoyu Zhao
Research Collection School Of Computing and Information Systems
Vertical federated learning (VFL), where data features are stored in multiple parties distributively, is an important area in machine learning. However, the communication complexity for VFL is typically very high. In this paper, we propose a unified framework by constructing coresets in a distributed fashion for communication-efficient VFL. We study two important learning tasks in the VFL setting: regularized linear regression and $k$-means clustering, and apply our coreset framework to both problems. We theoretically show that using coresets can drastically alleviate the communication complexity, while nearly maintain the solution quality. Numerical experiments are conducted to corroborate our theoretical findings.
On The Robustness Of Diffusion In A Network Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras
On The Robustness Of Diffusion In A Network Under Node Attacks, Alvis Logins, Yuchen Li, Panagiotis Karras
Research Collection School Of Computing and Information Systems
How can we assess a network's ability to maintain its functionality under attacks Network robustness has been studied extensively in the case of deterministic networks. However, applications such as online information diffusion and the behavior of networked public raise a question of robustness in probabilistic networks. We propose three novel robustness measures for networks hosting a diffusion under the Independent Cascade or Linear Threshold model, susceptible to attacks by an adversarial attacker who disables nodes. The outcome of such a process depends on the selection of its initiators, or seeds, by the seeder, as well as on two factors outside …
Soteriafl: A Unified Framework For Private Federated Learning With Communication Compression, Zhize Li, Haoyu Zhao, Boyue Li, Yuejie Chi
Soteriafl: A Unified Framework For Private Federated Learning With Communication Compression, Zhize Li, Haoyu Zhao, Boyue Li, Yuejie Chi
Research Collection School Of Computing and Information Systems
To enable large-scale machine learning in bandwidth-hungry environments such as wireless networks, significant progress has been made recently in designing communication-efficient federated learning algorithms with the aid of communication compression. On the other end, privacy-preserving, especially at the client level, is another important desideratum that has not been addressed simultaneously in the presence of advanced communication compression techniques yet. In this paper, we propose a unified framework that enhances the communication efficiency of private federated learning with communication compression. Exploiting both general compression operators and local differential privacy, we first examine a simple algorithm that applies compression directly to differentially-private …
End-To-End Hierarchical Reinforcement Learning With Integrated Subgoal Discovery, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek
End-To-End Hierarchical Reinforcement Learning With Integrated Subgoal Discovery, Shubham Pateria, Budhitama Subagdja, Ah-Hwee Tan, Chai Quek
Research Collection School Of Computing and Information Systems
Hierarchical reinforcement learning (HRL) is a promising approach to perform long-horizon goal-reaching tasks by decomposing the goals into subgoals. In a holistic HRL paradigm, an agent must autonomously discover such subgoals and also learn a hierarchy of policies that uses them to reach the goals. Recently introduced end-to-end HRL methods accomplish this by using the higher-level policy in the hierarchy to directly search the useful subgoals in a continuous subgoal space. However, learning such a policy may be challenging when the subgoal space is large. We propose integrated discovery of salient subgoals (LIDOSS), an end-to-end HRL method with an integrated …
Segment-Wise Time-Varying Dynamic Bayesian Network With Graph Regularization, Xing Yang, Chen Zhang, Baihua Zheng
Segment-Wise Time-Varying Dynamic Bayesian Network With Graph Regularization, Xing Yang, Chen Zhang, Baihua Zheng
Research Collection School Of Computing and Information Systems
Time-varying dynamic Bayesian network (TVDBN) is essential for describing time-evolving directed conditional dependence structures in complex multivariate systems. In this article, we construct a TVDBN model, together with a score-based method for its structure learning. The model adopts a vector autoregressive (VAR) model to describe inter-slice and intra-slice relations between variables. By allowing VAR parameters to change segment-wisely over time, the time-varying dynamics of the network structure can be described. Furthermore, considering some external information can provide additional similarity information of variables. Graph Laplacian is further imposed to regularize similar nodes to have similar network structures. The regularized maximum a …
Conversation Disentanglement With Bi-Level Contrastive Learning, Chengyu Huang, Zheng Zhang, Hao Fei, Lizi Liao
Conversation Disentanglement With Bi-Level Contrastive Learning, Chengyu Huang, Zheng Zhang, Hao Fei, Lizi Liao
Research Collection School Of Computing and Information Systems
Conversation disentanglement aims to group utterances into detached sessions, which is a fundamental task in processing multi-party conversations. Existing methods have two main drawbacks. First, they overemphasize pairwise utterance relations but pay inadequate attention to the utterance-to-context relation modeling. Second, a huge amount of human annotated data is required for training, which is expensive to obtain in practice. To address these issues, we propose a general disentangle model based on bi-level contrastive learning. It brings closer utterances in the same session while encourages each utterance to be near its clustered session prototypes in the representation space. Unlike existing approaches, our …
Appearance-Preserved Portrait-To-Anime Translation Via Proxy-Guided Domain Adaptation, Wenpeng Xiao, Cheng Xu, Jiajie Mai, Xuemiao Xu, Yue Li, Chengze Li, Xueting Liu, Shengfeng He
Appearance-Preserved Portrait-To-Anime Translation Via Proxy-Guided Domain Adaptation, Wenpeng Xiao, Cheng Xu, Jiajie Mai, Xuemiao Xu, Yue Li, Chengze Li, Xueting Liu, Shengfeng He
Research Collection School Of Computing and Information Systems
Converting a human portrait to anime style is a desirable but challenging problem. Existing methods fail to resolve this problem due to the large inherent gap between two domains that cannot be overcome by a simple direct mapping. For this reason, these methods struggle to preserve the appearance features in the original photo. In this paper, we discover an intermediate domain, the coser portrait (portraits of humans costuming as anime characters), that helps bridge this gap. It alleviates the learning ambiguity and loosens the mapping difficulty in a progressive manner. Specifically, we start from learning the mapping between coser and …
A Unified Dialogue User Simulator For Few-Shot Data Augmentation, Dazhen Wan, Zheng Zhang, Qi Zhu, Lizi Liao, Minlie Huang
A Unified Dialogue User Simulator For Few-Shot Data Augmentation, Dazhen Wan, Zheng Zhang, Qi Zhu, Lizi Liao, Minlie Huang
Research Collection School Of Computing and Information Systems
Pre-trained language models have shown superior performance in task-oriented dialogues. However, existing datasets are on limited scales, which cannot support large-scale pre-training. Fortunately, various data augmentation methods have been developed to augment largescale task-oriented dialogue corpora. However, they heavily rely on annotated data in the target domain, which require a tremendous amount of data collection and human labeling work. In this paper, we build a unified dialogue user simulation model by pre-training on several publicly available datasets. The model can then be tuned on a target domain with fewshot data. The experiments on a target dataset across multiple domains show …
Learning Generalizable Models For Vehicle Routing Problems Via Knowledge Distillation, Jieyi Bi, Yining Ma, Jiahai Wang, Zhiguang Cao, Jinbiao Chen, Yuan Sun, Yeow Meng Chee
Learning Generalizable Models For Vehicle Routing Problems Via Knowledge Distillation, Jieyi Bi, Yining Ma, Jiahai Wang, Zhiguang Cao, Jinbiao Chen, Yuan Sun, Yeow Meng Chee
Research Collection School Of Computing and Information Systems
Recent neural methods for vehicle routing problems always train and test the deep models on the same instance distribution (i.e., uniform). To tackle the consequent cross-distribution generalization concerns, we bring the knowledge distillation to this field and propose an Adaptive Multi-Distribution Knowledge Distillation (AMDKD) scheme for learning more generalizable deep models. Particularly, our AMDKD leverages various knowledge from multiple teachers trained on exemplar distributions to yield a light-weight yet generalist student model. Meanwhile, we equip AMDKD with an adaptive strategy that allows the student to concentrate on difficult distributions, so as to absorb hard-to-master knowledge more effectively. Extensive experimental results …
Gamified Online Industry Learning Platform For Teaching Of Foundational Computing Skills, Yi Meng Lau, Rafael Jose Barros Barrios, Gottipati Swapna, Kyong Jin Shim
Gamified Online Industry Learning Platform For Teaching Of Foundational Computing Skills, Yi Meng Lau, Rafael Jose Barros Barrios, Gottipati Swapna, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
Online industry learning platforms are widely used by organizations for employee training and upskilling. Courses or lessons offered by these platforms can be generic or specific to an enterprise application. The increased demand of new hires to learn these platforms or who are already certified in some of these courses has led universities to look at the opportunities for integrating online industry learning platforms into their curricula. Universities hope to use these platforms to aid students in their learning of concepts and theories. At the same time, these platforms can equip students with industryrecognized certifications or digital badges. This paper …
Beer: Fast O(1/T) Rate For Decentralized Nonconvex Optimization With Communication Compression, Haoyu Zhao, Boyue Li, Zhize Li, Peter Richtarik, Yuejie Chi
Beer: Fast O(1/T) Rate For Decentralized Nonconvex Optimization With Communication Compression, Haoyu Zhao, Boyue Li, Zhize Li, Peter Richtarik, Yuejie Chi
Research Collection School Of Computing and Information Systems
Communication efficiency has been widely recognized as the bottleneck for large-scale decentralized machine learning applications in multi-agent or federated environments. To tackle the communication bottleneck, there have been many efforts to design communication-compressed algorithms for decentralized nonconvex optimization, where the clients are only allowed to communicate a small amount of quantized information (aka bits) with their neighbors over a predefined graph topology. Despite significant efforts, the state-of-the-art algorithm in the nonconvex setting still suffers from a slower rate of convergence $O((G/T)^{2/3})$ compared with their uncompressed counterpart, where $G$ measures the data heterogeneity across different clients, and $T$ is the number …
Prompting For Multimodal Hateful Meme Classification, Rui Cao, Roy Ka-Wei Lee, Wen-Haw Chong, Jing Jiang
Prompting For Multimodal Hateful Meme Classification, Rui Cao, Roy Ka-Wei Lee, Wen-Haw Chong, Jing Jiang
Research Collection School Of Computing and Information Systems
Hateful meme classification is a challenging multimodal task that requires complex reasoning and contextual background knowledge. Ideally, we could leverage an explicit external knowledge base to supplement contextual and cultural information in hateful memes. However, there is no known explicit external knowledge base that could provide such hate speech contextual information. To address this gap, we propose PromptHate, a simple yet effective prompt-based model that prompts pre-trained language models (PLMs) for hateful meme classification. Specifically, we construct simple prompts and provide a few in-context examples to exploit the implicit knowledge in the pretrained RoBERTa language model for hateful meme classification. …
A Recommendation On How To Teach K-Means In Introductory Analytics Courses, Manoj Thulasidas
A Recommendation On How To Teach K-Means In Introductory Analytics Courses, Manoj Thulasidas
Research Collection School Of Computing and Information Systems
We teach K-Means clustering in introductory data analytics courses because it is one of the simplest and most widely used unsupervised machine learning algorithms. However, one drawback of this algorithm is that it does not offer a clear method to determine the appropriate number of clusters; it does not have a built-in mechanism for K selection. What is usually taught as the solution for the K Selection problem is the so-called elbow method, where we look at the incremental changes in some quality metric (usually, the sum of squared errors, SSE), trying to find a sudden change. In addition to …
Curiosity-Driven And Victim-Aware Adversarial Policies, Chen Gong, Zhou Yang, Yunpeng Bai, Jieke Shi, Arunesh Sinha, Bowen Xu, David Lo, Xinwen Hou, Guoliang Fan
Curiosity-Driven And Victim-Aware Adversarial Policies, Chen Gong, Zhou Yang, Yunpeng Bai, Jieke Shi, Arunesh Sinha, Bowen Xu, David Lo, Xinwen Hou, Guoliang Fan
Research Collection School Of Computing and Information Systems
Recent years have witnessed great potential in applying Deep Reinforcement Learning (DRL) in various challenging applications, such as autonomous driving, nuclear fusion control, complex game playing, etc. However, recently researchers have revealed that deep reinforcement learning models are vulnerable to adversarial attacks: malicious attackers can train adversarial policies to tamper with the observations of a well-trained victim agent, the latter of which fails dramatically when faced with such an attack. Understanding and improving the adversarial robustness of deep reinforcement learning is of great importance in enhancing the quality and reliability of a wide range of DRL-enabled systems. In this paper, …
Bank Error In Whose Favor? A Case Study Of Decentralized Finance Misgovernance, Ping Fan Ke, Ka Chung Boris Ng
Bank Error In Whose Favor? A Case Study Of Decentralized Finance Misgovernance, Ping Fan Ke, Ka Chung Boris Ng
Research Collection School Of Computing and Information Systems
Decentralized Finance (DeFi) emerged rapidly in recent years and provided open and transparent financial services to the public. Due to its popularity, it is not uncommon to see cybersecurity incidents in the DeFi landscape, yet the impact of such incidents is under-studied. In this paper, we examine two incidents in DeFi protocol that are mainly caused by misgovernance and mistake in the smart contract. By using the synthetic control method, we found that the incident in Alchemix did not have a significant effect on the total value locked (TVL) in the protocol, whereas the incident in Compound caused a 6.13% …
Mitigating Popularity Bias In Recommendation With Unbalanced Interactions: A Gradient Perspective, Weijieying Ren, Lei Wang, Kunpeng Liu, Ruocheng Guo, Ee-Peng Lim, Yanjie Fu
Mitigating Popularity Bias In Recommendation With Unbalanced Interactions: A Gradient Perspective, Weijieying Ren, Lei Wang, Kunpeng Liu, Ruocheng Guo, Ee-Peng Lim, Yanjie Fu
Research Collection School Of Computing and Information Systems
Recommender systems learn from historical user-item interactions to identify preferred items for target users. These observed interactions are usually unbalanced following a long-tailed distribution. Such long-tailed data lead to popularity bias to recommend popular but not personalized items to users. We present a gradient perspective to understand two negative impacts of popularity bias in recommendation model optimization: (i) the gradient direction of popular item embeddings is closer to that of positive interactions, and (ii) the magnitude of positive gradient for popular items are much greater than that of unpopular items. To address these issues, we propose a simple yet efficient …
Cold Calls To Enhance Class Participation And Student Engagement, Manoj Thulasidas, Aldy Gunawan
Cold Calls To Enhance Class Participation And Student Engagement, Manoj Thulasidas, Aldy Gunawan
Research Collection School Of Computing and Information Systems
The question whether cold calls increase student engagement in the classroom has not been conclusively answered in the literature. This study describes the automated system to implement unbiased, randomized cold calling by posing a question, allowing all students to think first and then calling on a particular student to respond. Since we already have a measure of the level of student engagement as the self-reported classparticipation entries from the students, its correlation to cold calling is also further studied. The results show that there is a statistically significant increase in the class participation reported, and therefore in student engagement, in …
S-Prompts Learning With Pre-Trained Transformers: An Occam's Razor For Domain Incremental Learning, Yabin Wang, Zhiwu Huang, Xiaopeng. Hong
S-Prompts Learning With Pre-Trained Transformers: An Occam's Razor For Domain Incremental Learning, Yabin Wang, Zhiwu Huang, Xiaopeng. Hong
Research Collection School Of Computing and Information Systems
State-of-the-art deep neural networks are still struggling to address the catastrophic forgetting problem in continual learning. In this paper, we propose one simple paradigm (named as S-Prompting) and two concrete approaches to highly reduce the forgetting degree in one of the most typical continual learning scenarios, i.e., domain increment learning (DIL). The key idea of the paradigm is to learn prompts independently across domains with pre-trained transformers, avoiding the use of exemplars that commonly appear in conventional methods. This results in a win-win game where the prompting can achieve the best for each domain. The independent prompting across domains only …
Deep Just-In-Time Defect Localization, Fangcheng Qiu, Zhipeng Gao, Xin Xia, David Lo, John Grundy, Xinyu Wang
Deep Just-In-Time Defect Localization, Fangcheng Qiu, Zhipeng Gao, Xin Xia, David Lo, John Grundy, Xinyu Wang
Research Collection School Of Computing and Information Systems
During software development and maintenance, defect localization is an essential part of software quality assurance. Even though different techniques have been proposed for defect localization, i.e., information retrieval (IR)-based techniques and spectrum-based techniques, they can only work after the defect has been exposed, which can be too late and costly to adapt to the newly introduced bugs in the daily development. There are also many JIT defect prediction tools that have been proposed to predict the buggy commit. But these tools do not locate the suspicious buggy positions in the buggy commit. To assist developers to detect bugs in time …
Photovoltaic Cells For Energy Harvesting And Indoor Positioning, Hamada Rizk, Dong Ma, Mahbub Hassan, Moustafa Youssef
Photovoltaic Cells For Energy Harvesting And Indoor Positioning, Hamada Rizk, Dong Ma, Mahbub Hassan, Moustafa Youssef
Research Collection School Of Computing and Information Systems
We propose SoLoc, a lightweight probabilistic fingerprinting-based technique for energy-free device-free indoor localization. The system harnesses photovoltaic currents harvested by the photovoltaic cells in smart environments for simultaneously powering digital devices and user positioning. The basic principle is that the location of the human interferes with the lighting received by the photovoltaic cells, thus producing a location fingerprint on the generated photocurrents. To ensure resilience to noisy measurements, SoLoc constructs probability distributions as a photovoltaic fingerprint at each location. Then, we employ a probabilistic graphical model for estimating the user location in the continuous space. Results show that SoLoc can …
Investigating Bloom's Cognitive Skills In Foundation And Advanced Programming Courses From Students' Discussions, Joel Jer Wei Lim, Gottipati Swapna, Kyong Jin Shim
Investigating Bloom's Cognitive Skills In Foundation And Advanced Programming Courses From Students' Discussions, Joel Jer Wei Lim, Gottipati Swapna, Kyong Jin Shim
Research Collection School Of Computing and Information Systems
Programming courses provide students with the skills to develop complex business applications. Teaching and learning programming is challenging, and collaborative learning is proposed to help with this challenge. Online discussion forums promote networking with other learners such that they can build knowledge collaboratively. It aids students open their horizons of thought processes to acquire cognitive skills. Cognitive analysis of discussion is critical to understand students' learning process. In this paper, we propose Bloom's taxonomy based cognitive model for programming discussion forums. We present machine learning (ML) based solution to extract students' cognitive skills. Our evaluations on compupting courses show that …
What Motivates Software Practitioners To Contribute To Inner Source?, Zhiyuan Wan, Xin Xia, Yun Zhang, David Lo, Daibing Zhou, Qiuyuan Chen, Ahmed E. Hassan
What Motivates Software Practitioners To Contribute To Inner Source?, Zhiyuan Wan, Xin Xia, Yun Zhang, David Lo, Daibing Zhou, Qiuyuan Chen, Ahmed E. Hassan
Research Collection School Of Computing and Information Systems
Software development organizations have adopted open source development practices to support or augment their software development processes, a phenomenon referred to as inner source. Given the rapid adoption of inner source, we wonder what motivates software practitioners to contribute to inner source projects. We followed a mixed-methods approach--a qualitative phase of interviews with 20 interviewees, followed by a quantitative phase of an exploratory survey with 124 respondents from 13 countries across four continents. Our study uncovers practitioners' motivation to contribute to inner source projects, as well as how the motivation differs from what motivates practitioners to participate in open source …
Meta-Complementing The Semantics Of Short Texts In Neural Topic Models, Ce Zhang, Hady Wirawan Lauw
Meta-Complementing The Semantics Of Short Texts In Neural Topic Models, Ce Zhang, Hady Wirawan Lauw
Research Collection School Of Computing and Information Systems
Topic models infer latent topic distributions based on observed word co-occurrences in a text corpus. While typically a corpus contains documents of variable lengths, most previous topic models treat documents of different lengths uniformly, assuming that each document is sufficiently informative. However, shorter documents may have only a few word co-occurrences, resulting in inferior topic quality. Some other previous works assume that all documents are short, and leverage external auxiliary data, e.g., pretrained word embeddings and document connectivity. Orthogonal to existing works, we remedy this problem within the corpus itself by proposing a Meta-Complement Topic Model, which improves topic quality …