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

Databases and Information Systems Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 1561 - 1590 of 3441

Full-Text Articles in Databases and Information Systems

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

Attributed Social Network Embedding, Lizi Liao, Xiangnan He, Hanwang Zhang, Tat-Seng Chua Mar 2018

Attributed Social Network Embedding, Lizi Liao, Xiangnan He, Hanwang Zhang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Embedding network data into a low-dimensional vector space has shown promising performance for many real-world applications, such as node classification and entity retrieval. However, most existing methods focused only on leveraging network structure. For social networks, besides the network structure, there also exists rich information about social actors, such as user profiles of friendship networks and textual content of citation networks. These rich attribute information of social actors reveal the homophily effect, exerting huge impacts on the formation of social networks. In this paper, we explore the rich evidence source of attributes in social networks to improve network embedding. We …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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 …

Go to article

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

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.

Go to article

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 Feb 2018

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), …

Go to article

Attribute-Based Cloud Storage With Secure Provenance Over Encrypted Data, Hui Cui, Robert H. Deng, Yingjiu Li Feb 2018

Attribute-Based Cloud Storage With Secure Provenance Over Encrypted Data, Hui Cui, Robert H. Deng, Yingjiu Li

Research Collection School Of Computing and Information Systems

To securely and conveniently enjoy the benefits of cloud storage, it is desirable to design a cloud data storage system which protects data privacy from storage servers through encryption, allows fine-grained access control such that data providers can expressively specify who are eligible to access the encrypted data, enables dynamic user management such that the total number of data users is unbounded and user revocation can be carried out conveniently, supports data provider anonymity and traceability such that a data provider’s identity is not disclosed to data users in normal circumstances but can be traced by a trusted authority if …

Go to article

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 Feb 2018

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 …

Go to article

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

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 …

Go to article

R3: Reinforced Ranker-Reader For Open-Domain Question Answering, Shuohang Wang, Mo Yu, Xiaoxiao Guo, Zhiguo Wang, Tim Klinger, Wei Zhang, Shiyu Chang, Gerald Tesauro, Bowen Zhou, Jing Jiang Feb 2018

R3: Reinforced Ranker-Reader For Open-Domain Question Answering, Shuohang Wang, Mo Yu, Xiaoxiao Guo, Zhiguo Wang, Tim Klinger, Wei Zhang, Shiyu Chang, Gerald Tesauro, Bowen Zhou, Jing Jiang

Research Collection School Of Computing and Information Systems

In recent years researchers have achieved considerable success applying neural network methods to question answering (QA). These approaches have achieved state of the art results in simplified closed-domain settings such as the SQuAD (Rajpurkar et al. 2016) dataset, which provides a pre-selected passage, from which the answer to a given question may be extracted. More recently, researchers have begun to tackle open-domain QA, in which the model is given a question and access to a large corpus (e.g., wikipedia) instead of a pre-selected passage (Chen et al. 2017a). This setting is more complex as it requires large-scale search for relevant …

Go to article

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

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. …

Go to article

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

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 …

Go to article

Enhanced Vireo Kis At Vbs 2018, Phuong Anh Nguyen, Yi-Jie Lu, Hao Zhang, Chong-Wah Ngo Feb 2018

Enhanced Vireo Kis At Vbs 2018, Phuong Anh Nguyen, Yi-Jie Lu, Hao Zhang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

The VIREO Known-Item Search (KIS) system has joined the Video Browser Showdown (VBS) [1] evaluation benchmark for the first time in year 2017. With experiences learned, the second version of VIREO KIS is presented in this paper. Considering the color-sketch based retrieval, we propose a simple grid-based approach for color query. This method allows the aggregation of color distributions in video frames into a shot representation, and generates the pre-computed rank list for all available queries which reduces computational resources and favors a recommendation module. With focusing on concept based retrieval, we modify our multimedia event detection system at TRECVID …

Go to article

Compressive Representation For Device-Free Activity Recognition With Passive Rfid Signal Strength, Lina Yao, Quan Z. Sheng, Xue Li, Tao Gu, Mingkui Tan, Xianzhi Wang, Sen Wang, Wenjie Ruan Feb 2018

Compressive Representation For Device-Free Activity Recognition With Passive Rfid Signal Strength, Lina Yao, Quan Z. Sheng, Xue Li, Tao Gu, Mingkui Tan, Xianzhi Wang, Sen Wang, Wenjie Ruan

Research Collection School Of Computing and Information Systems

Understanding and recognizing human activities is a fundamental research topic for a wide range of important applications such as fall detection and remote health monitoring and intervention. Despite active research in human activity recognition over the past years, existing approaches based on computer vision or wearable sensor technologies present several significant issues such as privacy (e.g., using video camera to monitor the elderly at home) and practicality (e.g., not possible for an older person with dementia to remember wearing devices). In this paper, we present a low-cost, unobtrusive, and robust system that supports independent living of older people. The system …

Go to article

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 Feb 2018

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 …

Go to article

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

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 …

Go to article

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

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, …

Go to article

Food Photo Recognition For Dietary Tracking: System And Experiment, Zhao-Yan Ming, Jingjing Chen, Yu Cao, Ciarán Forde, Chong-Wah Ngo, Tat Seng Chua Feb 2018

Food Photo Recognition For Dietary Tracking: System And Experiment, Zhao-Yan Ming, Jingjing Chen, Yu Cao, Ciarán Forde, Chong-Wah Ngo, Tat Seng Chua

Research Collection School Of Computing and Information Systems

Tracking dietary intake is an important task for health management especially for chronic diseases such as obesity, diabetes, and cardiovascular diseases. Given the popularity of personal hand-held devices, mobile applications provide a promising low-cost solution to tackle the key risk factor by diet monitoring. In this work, we propose a photo based dietary tracking system that employs deep-based image recognition algorithms to recognize food and analyze nutrition. The system is beneficial for patients to manage their dietary and nutrition intake, and for the medical institutions to intervene and treat the chronic diseases. To the best of our knowledge, there are …

Go to article

Sparse Modeling-Based Sequential Ensemble Learning For Effective Outlier Detection In High-Dimensional Numeric Data, Guansong Pang, Longbing Cao, Ling Chen, Defu Lian, Huan Liu Feb 2018

Sparse Modeling-Based Sequential Ensemble Learning For Effective Outlier Detection In High-Dimensional Numeric Data, Guansong Pang, Longbing Cao, Ling Chen, Defu Lian, Huan Liu

Research Collection School Of Computing and Information Systems

The large proportion of irrelevant or noisy features in reallife high-dimensional data presents a significant challenge to subspace/feature selection-based high-dimensional outlier detection (a.k.a. outlier scoring) methods. These methods often perform the two dependent tasks: relevant feature subset search and outlier scoring independently, consequently retaining features/subspaces irrelevant to the scoring method and downgrading the detection performance. This paper introduces a novel sequential ensemble-based framework SEMSE and its instance CINFO to address this issue. SEMSE learns the sequential ensembles to mutually refine feature selection and outlier scoring by iterative sparse modeling with outlier scores as the pseudo target feature. CINFO instantiates SEMSE …

Go to article

Two Birds With One Stone: Classifying Positive And Unlabeled Examples On Uncertain Data Streams, Donghong Han, Shuoru Li, Fulin Wei, Yuying Tang, Feida Zhu, Guoren Wang Feb 2018

Two Birds With One Stone: Classifying Positive And Unlabeled Examples On Uncertain Data Streams, Donghong Han, Shuoru Li, Fulin Wei, Yuying Tang, Feida Zhu, Guoren Wang

Research Collection School Of Computing and Information Systems

An important feature characteristic of the data streams in many of today's big data applications is the intrinsic uncertainty, which could happen for both item occurrence and attribute value. While this has already posed great challenges for fundamental data mining tasks such as classification, things are made even more complicated by the fact that completely-labeled examples are usually unavailable in such settings, leaving researchers the only option to learn classifiers on partially-labeled examples on uncertain data streams. Furthermore, there will be concept drift on evolving data streams. To address these challenges, this paper therefore focuses on the study of learning …

Go to article

Smart Monitoring Via Participatory Ble Relaying, Meeralakshmi Radhakrishnan, Sougata Sen, Archan Misra, Youngki Lee, Rajesh Krishna Balan Jan 2018

Smart Monitoring Via Participatory Ble Relaying, Meeralakshmi Radhakrishnan, Sougata Sen, Archan Misra, Youngki Lee, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

We espouse the vision of a smart object/campus architecture where sensors attached to smart objects use BLE as communication interface, and where smartphones act as opportunistic relays to transfer the data. We explore the feasibility of the vision with real-world Wi-Fi based location traces from our university campus. Our feasibility studies establish that redundancy exists in user movement within the indoor spaces, and that this redundancy can be exploited for collecting sensor data in an opportunistic, yet fair manner. We develop a couple of alternative heuristics that address the BLE energy asymmetry challenge by intelligently duty-cycling the scanning actions of …

Go to article

Multi-Target Deep Neural Networks: Theoretical Analysis And Implementation, Zeng Zeng, Nanying Liang, Xulei Yang, Steven C. H. Hoi Jan 2018

Multi-Target Deep Neural Networks: Theoretical Analysis And Implementation, Zeng Zeng, Nanying Liang, Xulei Yang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

In this work, we propose a novel deep neural network referred to as Multi-Target Deep Neural Network (MT-DNN). We theoretically prove that different stable target models with shared learning paths are stable and can achieve optimal solutions respectively. Based on GoogleNet, we design a single model with three different targets, one for classification, one for regression, and one for masks that is composed of 256  ×  256 sub-models. Unlike bounding boxes used in ImageNet, our single model can draw the shapes of target objects, and in the meanwhile, classify the objects and calculate their sizes. We validate our single MT-DNN …

Go to article

Collaboration Patterns In Software Developer Network, Didi Surian, Ee-Peng Lim, David Lo Jan 2018

Collaboration Patterns In Software Developer Network, Didi Surian, Ee-Peng Lim, David Lo

Research Collection School Of Computing and Information Systems

In this entry, we mine collaboration patterns from a large software developer network (Surian et al. 2010). We consider high- and low-level patterns. High-level patterns correspond to various network-level statistics that we observe to hold in this network. Low-level patterns are topological subgraph patterns that are frequently observed among developers collaborating in the network. Mining topological subgraph patterns are difficult as it is an NP-hard problem. To address this issue, we use a combination of frequent subgraph mining and graph matching by leveraging the power law property exhibited by a large collaboration graph. The technique is applicable to any software …

Go to article

User-Friendly Deniable Storage For Mobile Devices, Bing Chang, Yao Cheng, Bo Chen, Fengwei Zhang, Wen-Tao Zhu, Yingjiu Li, Zhan. Wang Jan 2018

User-Friendly Deniable Storage For Mobile Devices, Bing Chang, Yao Cheng, Bo Chen, Fengwei Zhang, Wen-Tao Zhu, Yingjiu Li, Zhan. Wang

Research Collection School Of Computing and Information Systems

Mobile devices are prevalently used to process sensitive data, but traditional encryption may not work when an adversary is able to coerce the device owners to disclose the encryption keys. Plausibly Deniable Encryption (PDE) is thus designed to protect sensitive data against this powerful adversary. In this paper, we present MobiPluto, a user-friendly PDE scheme for denying the existence of sensitive data stored on mobile devices. A salient difference between MobiPluto and the existing PDE systems is that any block-based file systems can be deployed on top of it. To further improve usability and deniability of MobiPluto, we introduce a …

Go to article

Anatomy Of Online Hate: Developing A Taxonomy And Machine Learning Models For Identifying And Classifying Hate In Online News Media, Joni Salminen, Hind Almerekhi, Milica Milenkovic, Soon-Gyu Jung, Haewoon Kwak, Haewoon Kwak, Bernard J. Jansen Jan 2018

Anatomy Of Online Hate: Developing A Taxonomy And Machine Learning Models For Identifying And Classifying Hate In Online News Media, Joni Salminen, Hind Almerekhi, Milica Milenkovic, Soon-Gyu Jung, Haewoon Kwak, Haewoon Kwak, Bernard J. Jansen

Research Collection School Of Computing and Information Systems

Online social media platforms generally attempt to mitigate hateful expressions, as these comments can be detrimental to the health of the community. However, automatically identifying hateful comments can be challenging. We manually label 5,143 hateful expressions posted to YouTube and Facebook videos among a dataset of 137,098 comments from an online news media. We then create a granular taxonomy of different types and targets of online hate and train machine learning models to automatically detect and classify the hateful comments in the full dataset. Our contribution is twofold: 1) creating a granular taxonomy for hateful online comments that includes both …

Go to article

Code: Coherence Based Decision Boundaries For Feature Correspondence, Wen-Yan Lin, Fan Wang, Ming-Ming Cheng, Sai-Kit Yeung, Philip H. S. Torr, Jiangbo Lu Jan 2018

Code: Coherence Based Decision Boundaries For Feature Correspondence, Wen-Yan Lin, Fan Wang, Ming-Ming Cheng, Sai-Kit Yeung, Philip H. S. Torr, Jiangbo Lu

Research Collection School Of Computing and Information Systems

A key challenge in feature correspondence is the difficulty in differentiating true and false matches at a local descriptor level. This forces adoption of strict similarity thresholds that discard many true matches. However, if analyzed at a global level, false matches are usually randomly scattered while true matches tend to be coherent (clustered around a few dominant motions), thus creating a coherence based separability constraint. This paper proposes a non-linear regression technique that can discover such a coherence based separability constraint from highly noisy matches and embed it into a correspondence likelihood model. Once computed, the model can filter the …

Go to article

First Prev Next Last