Databases and Information Systems Commons^™

Urlnet: Learning A Url Representation With Deep Learning For Malicious Url Detection, Hung Le, Hong Quang Pham, Doyen Sahoo, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Malicious URLs host unsolicited content and are used to perpetrate cybercrimes. It is imperative to detect them in a timely manner. Traditionally, this is done through the usage of blacklists, which cannot be exhaustive, and cannot detect newly generated malicious URLs. To address this, recent years have witnessed several efforts to perform Malicious URL Detection using Machine Learning. The most popular and scalable approaches use lexical properties of the URL string by extracting Bag-of-words like features, followed by applying machine learning models such as SVMs. There are also other features designed by experts to improve the prediction performance of the …

Automatic Persona Generation (Apg): A Rationale And Demonstration, Soon-Gyo Jung, Joni Salminen, Haewoon Kwak, Jisun An, Bernard J Jansen

Research Collection School Of Computing and Information Systems

We present Automatic Persona Generation (APG), a methodology and system for quantitative persona generation using large amounts of online social media data. The system is operational, beta deployed with several client organizations in multiple industry verticals and ranging from small-to-medium sized enterprises to large multi-national corporations. Using a robust web framework and stable back-end database, APG is currently processing tens of millions of user interactions with thousands of online digital products on multiple social media platforms, such as Facebook and YouTube. APG identifies both distinct and impactful user segments and then creates persona descriptions by automatically adding pertinent features, such …

Mining Sandboxes: Are We There Yet?, Lingfeng Bao, Tien Duy B. Le, David Lo

Research Collection School Of Computing and Information Systems

The popularity of Android platform on mobile devices has attracted much attention from many developers and researchers, as well as malware writers. Recently, Jamrozik et al. proposed a technique to secure Android applications referred to as mining sandboxes. They used an automated test case generation technique to explore the behavior of the app under test and then extracted a set of sensitive APIs that were called. Based on the extracted sensitive APIs, they built a sandbox that can block access to APIs not used during testing. However, they only evaluated the proposed technique with benign apps but not investigated whether …

A Model Of Competition Between Perpetual Software And Software As A Service, Zhiling Guo, Dan Ma

Research Collection School Of Computing and Information Systems

Duplicate record, see https://ink.library.smu.edu.sg/sis_research/3744/. Software as a service (SaaS) has grown to be a significant segment of many software product markets. SaaS vendors, which charge customers based on use and continuously improve the quality of their products, have put competitive pressure on traditional perpetual software vendors, which charge a licensing fee and periodically upgrade the quality of their software. We develop an analytical model to study the competitive pricing strategies of an incumbent perpetual software vendor in the presence of a SaaS competitor. We find that, depending on both the SaaS quality improvement rate and the network effect, the …

A Model Of Competition Between Perpetual Software And Software As A Service, Zhiling Guo, Dan Ma

Research Collection School Of Computing and Information Systems

Software as a service (SaaS) has grown to be a significant segment of many software product markets. SaaS vendors, which charge customers based on use and continuously improve the quality of their products, have put competitive pressure on traditional perpetual software vendors, which charge a licensing fee and periodically upgrade the quality of their software. We develop an analytical model to study the competitive pricing strategies of an incumbent perpetual software vendor in the presence of a SaaS competitor. We find that, depending on both the SaaS quality improvement rate and the network effect, the perpetual software vendor adopts one …

Do Your Friends Make You Buy This Brand?: Modeling Social Recommendation With Topics And Brands, Minh Duc Luu, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Consumer behavior and marketing research have shown that brand has significant influence on product reviews and product purchase decisions. However, there is very little work on incorporating brand related factors into product recommender systems. Meanwhile, the similarity in brand preference between a user and other socially connected users also affects her adoption decisions. To integrate seamlessly the individual and social brand related factors into the recommendation process, we propose a novel model called Social Brand–Item–Topic (SocBIT). As the original SocBIT model does not enforce non-negativity, which poses some difficulty in result interpretation, we also propose a non-negative version, called SocBIT(Formula …

The Pharmacogene Variation (Pharmvar) Consortium: Incorporation Of The Human Cytochrome P450 (Cyp) Allele Nomenclature Database, Andrea Gaedigk, Magnus Ingelman-Sundberg, Neil A. Miller, J Steven Leeder, Michelle Whirl-Carrillo, Teri E. Klein

Manuscripts, Articles, Book Chapters and Other Papers

The Human Cytochrome P450 (CYP) Allele Nomenclature Database, a critical resource to the pharmacogenetics and genomics communities, will be transitioning to the Pharmacogene Variation (PharmVar) Consortium. In this report we provide a summary of the current database, provide an overview of the PharmVar consortium and highlight the PharmVar database which will serve as the new home for pharmacogene nomenclature.

The Cybher Program Supported By Cisse Framework To Engage And Anchor Middle-School Girls In Cybersecurity, Pamela Rowland

Masters Theses & Doctoral Dissertations

There is a piercing shortage of personnel in the cybersecurity field that will take several decades to accommodate. Despite being 50 percent of the workforce, females only account for 11 percent of the cybersecurity personnel. While efforts have been made to encourage more females into the field, more needs to be done. Reality shows that a change in the statistics is not taking place. Women remain seriously under-represented in cybersecurity degree programs and the workforce.

Prior research shows that elementary girls are equally as interested in the cyber path as boys. It is in middle school that this interest shifts, …

An Lstm Model For Cloze-Style Machine Comprehension, Shuohang Wang, Jing Jiang

Research Collection School Of Computing and Information Systems

Machine comprehension is concerned with teaching machines to answer reading comprehension questions. In this paper we adopt an LSTM-based model we designed earlier for textual entailment and propose two new models for cloze-style machine comprehension. In our first model, we treat the document as a premise and the question as a hypothesis, and use an LSTM with attention mechanisms to match the question with the document. This LSTM remembers the best answer token found in the document while processing the question. Furthermore, we observe some special properties of machine comprehension and propose a two-layer LSTM model. In this model, we …

Building Trust In Artificial Intelligence, Machine Learning, And Robotics, Keng Siau, Weiyu Wang

Research Collection School Of Computing and Information Systems

In this article, we look at trust in artificial intelligence, machine learning (ML), and robotics. We first review the concept of trust in AI and examine how trust in AI may be different from trust in other technologies. We then discuss the differences between interpersonal trust and trust in technology and suggest factors that are crucial in building initial trust and developing continuous trust in artificial intelligence.

Visualizing Research Impact Through Citation Data, Yong Wang, Conglei Shi, Liangyue Li, Hanghang Tong, Huamin Qu

Research Collection School Of Computing and Information Systems

Research impact plays a critical role in evaluating the research quality and influence of a scholar, a journal, or a conference. Many researchers have attempted to quantify research impact by introducing different types of metrics based on citation data, such as h-index, citation count, and impact factor. These metrics are widely used in the academic community. However, quantitative metrics are highly aggregated in most cases and sometimes biased, which probably results in the loss of impact details that are important for comprehensively understanding research impact. For example, which research area does a researcher have great research impact on? How does …

A Modified Balcik Last Mile Distribution Model For Relief Operations Using Open Road Networks, Lance L. Putong, Marlene M. De Leon

Department of Information Systems & Computer Science Faculty Publications

The last mile in disaster relief distribution chain is the delivery of goods from a central warehouse to the evacuation centers assigned for a given area. Its effectiveness relies on the proper allocation of each kind of relief good amongst the demand areas on a given frequency. Because these operations involve a limited supply of relief goods, vehicles, and time, it is important to optimize these operations to satisfy as much demand as possible. The study aims to create a linear programming model which provides a set of recommendations on how the current disaster relief supply chain may be carried …

Things You May Not Know About Android (Un)Packers: A Systematic Study Based On Whole-System Emulation, Yue Duan, Mu Zhang, Abhishek Vasist Bhaskar, Heng Yin, Xiaorui Pan, Tongxin Li, Xueqiang Wang, Xiaofeng Wang

Research Collection School Of Computing and Information Systems

The prevalent usage of runtime packers has complicated Android malware analysis, as both legitimate and malicious apps are leveraging packing mechanisms to protect themselves against reverse engineer. Although recent efforts have been made to analyze particular packing techniques, little has been done to study the unique characteristics of Android packers. In this paper, we report the first systematic study on mainstream Android packers, in an attempt to understand their security implications. For this purpose, we developed DROIDUNPACK, a whole-system emulation based Android packing analysis framework, which compared with existing tools, relies on intrinsic characteristics of Android runtime (rather than heuristics), …

Upping The Game Of Taxi Driving In The Age Of Uber, Shashi Shekhar Jha, Shih-Fen Cheng, Meghna Lowalekar, Wai Hin Wong, Rajendram Rishikeshan Rajendram, Trong Khiem Tran, Pradeep Varakantham, Nghia Truong Trong, Firmansyah Abd Rahman

Research Collection School Of Computing and Information Systems

In most cities, taxis play an important role in providing point-to-point transportation service. If the taxi service is reliable, responsive, and cost-effective, past studies show that taxi-like services can be a viable choice in replacing a significant amount of private cars. However, making taxi services efficient is extremely challenging, mainly due to the fact that taxi drivers are self-interested and they operate with only local information. Although past research has demonstrated how recommendation systems could potentially help taxi drivers in improving their performance, most of these efforts are not feasible in practice. This is mostly due to the lack of …

Integrated Cooperation And Competition In Multi-Agent Decision-Making, Kyle Hollins Wray, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Observing that many real-world sequential decision problems are not purely cooperative or purely competitive, we propose a new model—cooperative-competitive process (CCP)—that can simultaneously encapsulate both cooperation and competition.First, we discuss how the CCP model bridges the gap between cooperative and competitive models. Next, we investigate a specific class of group-dominant CCPs, in which agents cooperate to achieve a common goal as their primary objective, while also pursuing individual goals as a secondary objective. We provide an approximate solution for this class of problems that leverages stochastic finite-state controllers.The model is grounded in two multi-robot meeting and box pushing domains that …

Unified Locally Linear Classifiers With Diversity-Promoting Anchor Points, Chenghao Liu, Teng Zhang, Peilin Zhao, Jianling Sun, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Locally Linear Support Vector Machine (LLSVM) has been actively used in classification tasks due to its capability of classifying nonlinear patterns. However, existing LLSVM suffers from two drawbacks: (1) a particular and appropriate regularization for LLSVM has not yet been addressed; (2) it usually adopts a three-stage learning scheme composed of learning anchor points by clustering, learning local coding coordinates by a predefined coding scheme, and finally learning for training classifiers. We argue that this decoupled approaches oversimplifies the original optimization problem, resulting in a large deviation due to the disparate purpose of each step. To address the first issue, …

Identifying Self-Admitted Technical Debt In Open Source Projects Using Text Mining, Qiao Huang, Emad Shihab, Xin Xia, David Lo, Shanping Li

Research Collection School Of Computing and Information Systems

Technical debt is a metaphor to describe the situation in which long-term code quality is traded for short-term goals in software projects. Recently, the concept of self-admitted technical debt (SATD) was proposed, which considers debt that is intentionally introduced, e.g., in the form of quick or temporary fixes. Prior work on SATD has shown that source code comments can be used to successfully detect SATD, however, most current state-of-the-art classification approaches of SATD rely on manual inspection of the source code comments. In this paper, we proposed an automated approach to detect SATD in source code comments using text mining. …

Sequential Recommendation With User Memory Networks, Xu Chen, Hongteng Xu, Yongfeng Zhang, Jiaxi Tang, Yixin Cao, Zheng Qin, Hongyuan Zha

Research Collection School Of Computing and Information Systems

User preferences are usually dynamic in real-world recommender systems, and a user»s historical behavior records may not be equally important when predicting his/her future interests. Existing recommendation algorithms -- including both shallow and deep approaches -- usually embed a user»s historical records into a single latent vector/representation, which may have lost the per item- or feature-level correlations between a user»s historical records and future interests. In this paper, we aim to express, store, and manipulate users» historical records in a more explicit, dynamic, and effective manner. To do so, we introduce the memory mechanism to recommender systems. Specifically, we design …

Modelling Domain Relationships For Transfer Learning On Retrieval-Based Question Answering Systems In E-Commerce, Jianfei Yu, Minghui Qiu, Jing Jiang, Jun Huang, Shuangyong Song, Wei Chu, Haiqing Chen

Research Collection School Of Computing and Information Systems

Nowadays, it is a heated topic for many industries to build automatic question-answering (QA) systems. A key solution to these QA systems is to retrieve from a QA knowledge base the most similar question of a given question, which can be reformulated as a paraphrase identification (PI) or a natural language inference (NLI) problem. However, most existing models for PI and NLI have at least two problems: They rely on a large amount of labeled data, which is not always available in real scenarios, and they may not be efficient for industrial applications. In this paper, we study transfer learning …

Sparse Passive-Aggressive Learning For Bounded Online Kernel Methods, Jing Lu, Doyen Sahoo, Peilin Zhao, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

One critical deficiency of traditional online kernel learning methods is their unbounded and growing number of support vectors in the online learning process, making them inefficient and non-scalable for large-scale applications. Recent studies on scalable online kernel learning have attempted to overcome this shortcoming, e.g., by imposing a constant budget on the number of support vectors. Although they attempt to bound the number of support vectors at each online learning iteration, most of them fail to bound the number of support vectors for the final output hypothesis, which is often obtained by averaging the series of hypotheses over all the …