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

Computer Sciences Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 6181 - 6210 of 9024

Full-Text Articles in Computer Sciences

Verifiable Computation On Outsourced Encrypted Data, Junzuo Lai, Robert H. Deng, Hwee Hwa Pang, Jian Weng Sep 2014

Verifiable Computation On Outsourced Encrypted Data, Junzuo Lai, Robert H. Deng, Hwee Hwa Pang, Jian Weng

Research Collection School Of Computing and Information Systems

On one hand, homomorphic encryption allows a cloud server to perform computation on outsourced encrypted data but provides no verifiability that the computation is correct. On the other hand, homomorphic authenticator, such as homomorphic signature with public verifiability and homomorphic MAC with private verifiability, guarantees authenticity of computation over outsourced data but does not provide data confidentiality. Since cloud servers are usually operated by third-party providers which are almost certain to be outside the trust domain of cloud users, neither homomorphic encryption nor homomorphic authenticator suffices for verifiable computation on outsourced encrypted data in the cloud. In this paper, we …

Go to article

Graph Matching By Simplified Convex-Concave Relaxation Procedure, Zhiyong Liu, Hong Qiao, Xu Yang, Steven C. H. Hoi Sep 2014

Graph Matching By Simplified Convex-Concave Relaxation Procedure, Zhiyong Liu, Hong Qiao, Xu Yang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The convex and concave relaxation procedure (CCRP) was recently proposed and exhibited state-of-the-art performance on the graph matching problem. However, CCRP involves explicitly both convex and concave relaxations which typically are difficult to find, and thus greatly limit its practical applications. In this paper we propose a simplified CCRP scheme, which can be proved to realize exactly CCRP, but with a much simpler formulation without needing the concave relaxation in an explicit way, thus significantly simplifying the process of developing CCRP algorithms. The simplified CCRP can be generally applied to any optimizations over the partial permutation matrix, as long as …

Go to article

A Study Of Age Gaps Between Online Friends, Lizi Liao, Jing Jiang, Ee Peng Lim, Heyan Huang Sep 2014

A Study Of Age Gaps Between Online Friends, Lizi Liao, Jing Jiang, Ee Peng Lim, Heyan Huang

Research Collection School Of Computing and Information Systems

User attribute extraction on social media has gain considerable attention, while existing methods are mostly supervised which suffer great diffi- culty in insufficient gold standard data. In this paper, we validate a strong hypothesis based on homophily and adapt it to ensure the certainty of user attribute we extracted via weakly supervised propagation. Homophily, the theory which states that people who are similar tend to become friends, has been well studied in the setting of online social networks. When we focus on age attribute, based on this theory, online friends tend to have similar age. In this work, we take …

Go to article

Active Code Search: Incorporating User Feedback To Improve Code Search Relevance, Shaowei Wang, David Lo, Lingxiao Jiang Sep 2014

Active Code Search: Incorporating User Feedback To Improve Code Search Relevance, Shaowei Wang, David Lo, Lingxiao Jiang

Research Collection School Of Computing and Information Systems

Code search techniques return relevant code fragments given a user query. They typically work in a passive mode: given a user query, a static list of code fragments sorted by the relevance scores decided by a code search technique is returned to the user. A user will go through the sorted list of returned code fragments from top to bottom. As the user checks each code fragment one by one, he or she will naturally form an opinion about the true relevance of the code fragment. In an active model, those opinions will be taken as feedbacks to the search …

Go to article

Dupfinder: Integrated Tool Support For Duplicate Bug Report Detection, Ferdian Thung, Pavneet Singh Kochhar, David Lo Sep 2014

Dupfinder: Integrated Tool Support For Duplicate Bug Report Detection, Ferdian Thung, Pavneet Singh Kochhar, David Lo

Research Collection School Of Computing and Information Systems

To track bugs that appear in a software, developers often make use of a bug tracking system. Users can report bugs that they encounter in such a system. Bug reporting is inherently an uncoordinated distributed process though and thus when a user submits a new bug report, there might be cases when another bug report describing exactly the same problem is already present in the system. Such bug reports are duplicate of each other and these duplicate bug reports need to be identified. A number of past studies have proposed a number of automated approaches to detect duplicate bug reports. …

Go to article

Crossnavi: Enabling Real-Time Crossroad Navigation For The Blind With Commodity Phones, Longfei Shangguan, Zheng Yang, Zimu Zhou, Xiaolong Zheng, Chenshu Wu, Yunhao Liu Sep 2014

Crossnavi: Enabling Real-Time Crossroad Navigation For The Blind With Commodity Phones, Longfei Shangguan, Zheng Yang, Zimu Zhou, Xiaolong Zheng, Chenshu Wu, Yunhao Liu

Research Collection School Of Computing and Information Systems

Crossroad is among the most dangerous parts outside for the visually impaired people. Numerous studies have exploited navigating systems for the visually impaired community, providing services ranging from block detection, route planning to realtime localization. However, none of them have addressed the safety issue in crossroad and integrated three key factors necessary for a practical crossroad navigation system: detecting the crossroad, locating zebra patterns, and guiding the user within zebra crossing when passing the road. Our CrossNavi application responds to these needs, providing an integrated crossroad navigation service that incorporates all the essential functionalities mentioned above. The overall service is …

Go to article

Efficient Data Compression With Error Bound Guarantee In Wireless Sensor Networks, Mohammad Abu Alsheikh, P. K. Poh, S. Lin, Hwee-Pink Tan, D. Niyato Sep 2014

Efficient Data Compression With Error Bound Guarantee In Wireless Sensor Networks, Mohammad Abu Alsheikh, P. K. Poh, S. Lin, Hwee-Pink Tan, D. Niyato

Research Collection School Of Computing and Information Systems

We present a data compression and dimensionality reduction scheme for data fusion and aggregation applications to prevent data congestion and reduce energy consumption at network connecting points such as cluster heads and gateways. Our in-network approach can be easily tuned to analyze the data temporal or spatial correlation using an unsupervised neural network scheme, namely the autoencoders. In particular, our algorithm extracts intrinsic data features from previously collected historical samples to transform the raw data into a low dimensional representation. Moreover, the proposed framework provides an error bound guarantee mechanism. We evaluate the proposed solution using real-world data sets and …

Go to article

Privatedroid: Private Browsing Mode For Android, Su Mon Kywe, Christopher Landis, Yutong Pei, Justin Satterfield, Yuan Tian, Patrick Tague Sep 2014

Privatedroid: Private Browsing Mode For Android, Su Mon Kywe, Christopher Landis, Yutong Pei, Justin Satterfield, Yuan Tian, Patrick Tague

Research Collection School Of Computing and Information Systems

Private browsing mode is a privacy feature adopted by many modern computer browsers. With the increased use of mobile devices and escalating privacy concerns for mobile users, browser applications on mobile devices have also started incorporating private browsing mode. Even so, the use of private browsing mode is limited to the browser applications and cannot be applied directly on other third-party mobile applications. In this paper, we propose PrivateDroid, which provides a private browsing mode for third-party applications on the Android platform. First, we discuss three possible approaches of implementing mobile private browsing mode: code instrumentation, an extra sandbox, and …

Go to article

Interestingness-Driven Diffussion Process Summarization In Dynamic Networks, Qiang Qu, Siyuan Liu, Christian Jensen, Feida Zhu, Christos Faloutsos Sep 2014

Interestingness-Driven Diffussion Process Summarization In Dynamic Networks, Qiang Qu, Siyuan Liu, Christian Jensen, Feida Zhu, Christos Faloutsos

Research Collection School Of Computing and Information Systems

The widespread use of social networks enables the rapid diffusion of information, e.g., news, among users in very large communities. It is a substantial challenge to be able to observe and understand such diffusion processes, which may be modeled as networks that are both large and dynamic. A key tool in this regard is data summarization. However, few existing studies aim to summarize graphs/networks for dynamics. Dynamic networks raise new challenges not found in static settings, including time sensitivity and the needs for online interestingness evaluation and summary traceability, which render existing techniques inapplicable. We study the topic of dynamic …

Go to article

Control Flow Obfuscation Using Neural Network To Fight Concolic Testing, Haoyu Ma, Xinjie Ma, Weijie Liu, Zhipeng Huang, Debin Gao, Chunfu Jia Sep 2014

Control Flow Obfuscation Using Neural Network To Fight Concolic Testing, Haoyu Ma, Xinjie Ma, Weijie Liu, Zhipeng Huang, Debin Gao, Chunfu Jia

Research Collection School Of Computing and Information Systems

Concolic testing is widely regarded as the state-of-the-art technique in dynamic discovering and analyzing trigger-based behavior in software programs. It uses symbolic execution and an automatic theorem prover to generate new concrete test cases to maximize code coverage for scenarios like software verification and malware analysis. While malicious developers usually try their best to hide malicious executions, there are also circumstances in which legitimate reasons are presented for a program to conceal trigger-based conditions and the corresponding behavior, which leads to the demand of control flow obfuscation techniques. We propose a novel control flow obfuscation design based on the incomprehensibility …

Go to article

An Exploratory Study On Software Microblogger Behaviors, Yuan Tian, David Lo Sep 2014

An Exploratory Study On Software Microblogger Behaviors, Yuan Tian, David Lo

Research Collection School Of Computing and Information Systems

Microblogging services are growing rapidly in the recent years. Twitter, one of the most popular microblogging sites, has gained more than 500 millions users. Thousands of developers are also using Twitter to communicate with one another and microblog about software-related topics such as programming languages, code libraries, etc. Understanding the behaviors of software microbloggers is one of the needed first steps toward building automated tools to encourage software microblogging activities and harness software microblogging to improve various software engineering activities. In this paper, we investigate the behaviors of software microbloggers in terms of their microblogging frequency, generated contents, and interactions …

Go to article

Sharing Political News: The Balancing Act Of Intimacy And Socialization In Selective Exposure, Jisun An, Daniele Quercia, Meeyoung Cha, Krishna Gummadi, Jon Crowcroft Sep 2014

Sharing Political News: The Balancing Act Of Intimacy And Socialization In Selective Exposure, Jisun An, Daniele Quercia, Meeyoung Cha, Krishna Gummadi, Jon Crowcroft

Research Collection School Of Computing and Information Systems

One might think that, compared to traditional media, social media sites allow people to choose more freely what to read and what to share, especially for politically oriented news. However, reading and sharing habits originate from deeply ingrained behaviors that might be hard to change. To test the extent to which this is true, we propose a Political News Sharing (PoNS) model that holistically captures four key aspects of social psychology: gratification, selective exposure, socialization, and trust & intimacy. Using real instances of political news sharing in Twitter, we study the predictive power of these features. As one might expect, …

Go to article

Efficient Hidden Vector Encryption With Constant-Size Ciphertext, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo Sep 2014

Efficient Hidden Vector Encryption With Constant-Size Ciphertext, Tran Viet Xuan Phuong, Guomin Yang, Willy Susilo

Research Collection School Of Computing and Information Systems

A Hidden Vector Encryption (HVE) scheme is a special type of anonymous identity-based encryption (IBE) scheme where the attribute string associated with the ciphertext or the user secret key can contain wildcards. In this paper, we introduce two constant-size ciphertext-policy hidden vector encryption (CP-HVE) schemes. Our first scheme is constructed on composite order bilinear groups, while the second one is built on prime order bilinear groups. Both schemes are proven secure in a selective security model which captures plaintext (or payload) and attribute hiding. To the best of our knowledge, our schemes are the first HVE constructions that can achieve …

Go to article

Linking Lightweight And Heavyweight Systems Analysis By Converting Service Responsibility Tables Into Uml Diagrams, X. Tan, S. Alter, Keng Siau Sep 2014

Linking Lightweight And Heavyweight Systems Analysis By Converting Service Responsibility Tables Into Uml Diagrams, X. Tan, S. Alter, Keng Siau

Research Collection School Of Computing and Information Systems

Heavyweight systems analysis approaches such as the use of Unified Modeling Language (UML) are inappropriate for business professionals who nonetheless need to participate actively in systems analysis and design processes to ensure that the system requirements reflect their needs. This paper proposes the use of a lightweight analysis approach based on Service Responsibility Tables (SRTs) to serve as a front-end to UML diagrams. Business professionals (with or without the help of IT professionals) can use this lightweight approach to specify at least part of system requirements. Subsequently, IT professionals can perform heavyweight analysis for the design and implementation of hardware …

Go to article

Opinion Mining Of Sociopolitical Comments From Social Media, Swapna Gottipati Aug 2014

Opinion Mining Of Sociopolitical Comments From Social Media, Swapna Gottipati

Dissertations and Theses Collection (Open Access)

Opinions are central to almost all human activities by influencing greatly the decision making process. In this thesis, we present the problems of mining issues, extracting entities and suggestive opinions towards the entities, detecting thoughtful comments, and extracting stances and ideological expressions from online comments in the sociopolitical domain. This study is essential for opinion mining applications that are beneficial for policy makers, government sectors and social organizations. Much work has been done to try to uncover consumer sentiments from online comments to help businesses improve their products and services. However, sociopolitical opinion mining poses new challenges due to complex …

Go to article

Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang Aug 2014

Direct Neighbor Search, Jilian Zhang, Kyriakos Mouratidis, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

In this paper we study a novel query type, called direct neighbor query. Two objects in a dataset are direct neighbors (DNs) if a window selection may exclusively retrieve these two objects. Given a source object, a DN search computes all of its direct neighbors in the dataset. The DNs define a new type of affinity that differs from existing formulations (e.g., nearest neighbors, nearest surrounders, reverse nearest neighbors, etc.) and finds application in domains where user interests are expressed in the form of windows, i.e., multi-attribute range selections. Drawing on key properties of the DN relationship, we develop an …

Go to article

Semantic Visualization For Spherical Representation, Tuan M. V. Le, Hady W. Lauw Aug 2014

Semantic Visualization For Spherical Representation, Tuan M. V. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Visualization of high-dimensional data such as text documents is widely applicable. The traditional means is to find an appropriate embedding of the high-dimensional representation in a low-dimensional visualizable space. As topic modeling is a useful form of dimensionality reduction that preserves the semantics in documents, recent approaches aim for a visualization that is consistent with both the original word space, as well as the semantic topic space. In this paper, we address the semantic visualization problem. Given a corpus of documents, the objective is to simultaneously learn the topic distributions as well as the visualization coordinates of documents. We propose …

Go to article

Gta-M: Greedy Trajectory-Aware (M Copies) Routing For Airborne Networks, Xiaoping Ma, Hwee Xian Tan, Alvin C. Valera Aug 2014

Gta-M: Greedy Trajectory-Aware (M Copies) Routing For Airborne Networks, Xiaoping Ma, Hwee Xian Tan, Alvin C. Valera

Research Collection School Of Computing and Information Systems

Airborne networks have potential applications in both civilian and military domains - such as passenger in-flight Internet connectivity, air traffic control and in intelligence, surveillance and reconnaissance (ISR) activities. However, airborne networks suffer from frequent disruptions due to high node mobility, ad hoc connectivity and line-of-sight blockages. These challenges can be alleviated through the use of disruption-tolerant networking (DTN) techniques. In this paper, we propose GTA-m, a multi-copy greedy trajectory-aware routing protocol for airborne networks. GTA-m employs DTN capabilities and exploits the use of flight information to forwarded bundles greedily to intended destination(s). To alleviate the local minima issues that …

Go to article

A Fast Decomposition Approach For Traffic Control, Xiaocheng Tang, Sébastien Blandin, Laura Wynter Aug 2014

A Fast Decomposition Approach For Traffic Control, Xiaocheng Tang, Sébastien Blandin, Laura Wynter

Research Collection School Of Computing and Information Systems

Real-time road traffic control has been the subject of active research efforts for more than fifty years. In recent years, however, the convergence of ubiquitous sensing with seamless communication technologies has motivated the development of more computationally efficient control methods, able to operate in real-time in a live environment. In this work, we present a fast decomposition method for network optimization problems, with application to real-time traffic control. Our approach is based on a nonlinear programming formulation of the network control problem and consists of an alternating directions method using forward numerical simulation in place of one of the optimization …

Go to article

Utilizing Microblogs For Improving Automatic News High-Lights Extraction, Zhongyu Wei, Wei Gao Aug 2014

Utilizing Microblogs For Improving Automatic News High-Lights Extraction, Zhongyu Wei, Wei Gao

Research Collection School Of Computing and Information Systems

Story highlights form a succinct single-document summary consisting of 3-4 highlight sentences that reflect the gist of a news article. Automatically producing news highlights is very challenging. We propose a novel method to improve news highlights extraction by using microblogs. The hypothesis is that microblog posts, although noisy, are not only indicative of important pieces of information in the news story, but also inherently “short and sweet” resulting from the artificial compression effect due to the length limit. Given a news article, we formulate the problem as two rank-then-extract tasks: (1) we find a set of indicative tweets and use …

Go to article

Unleashing Dec-Mdps In Security Games: Enabling Effective Defender Teamwork, Eric Shieh, Albert Jiang, Amulya Yadav, Pradeep Reddy Varakantham, Milind Tambe Aug 2014

Unleashing Dec-Mdps In Security Games: Enabling Effective Defender Teamwork, Eric Shieh, Albert Jiang, Amulya Yadav, Pradeep Reddy Varakantham, Milind Tambe

Research Collection School Of Computing and Information Systems

Multiagent teamwork and defender-attacker security games are two areas that are currently receiving significant attention within multiagent systems research. Unfortunately, despite the need for effective teamwork among multiple defenders, little has been done to harness the teamwork research in security games. This paper is the first to remedy this situation by integrating the powerful teamwork mechanisms offered by Dec-MDPs into security games. We offer the following novel contributions in this paper: (i) New models of security games where a defender team’s pure strategy is defined as a DecMDP policy for addressing coordination under uncertainty; (ii) New algorithms based on column …

Go to article

Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu Aug 2014

Diversified Social Influence Maximization, Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, Feida Zhu

Research Collection School Of Computing and Information Systems

For better viral marketing, there has been a lot of research on social influence maximization. However, the problem that who is influenced and how diverse the influenced population is, which is important in real-world marketing, has largely been neglected. To that end, in this paper, we propose to consider the magnitude of influence and the diversity of the influenced crowd simultaneously. Specifically, we formulate it as an optimization problem, i.e., diversified social influence maximization. First, we present a general framework for this problem, under which we construct a class of diversity measures to quantify the diversity of the influenced crowd. …

Go to article

Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau Aug 2014

Diversity-Oriented Bi-Objective Hyper-Heuristics For Patrol Scheduling, Mustafa Misir, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

The patrol scheduling problem is concerned with assigning security teams to different stations for distinct time intervals while respecting a limited number of contractual constraints. The objective is to minimise the total distance travelled while maximising the coverage of the stations with respect to their security requirement levels. This paper introduces a hyper-heuristic strategy focusing on generating diverse solutions for a bi-objective patrol scheduling problem. While a variety of hyper-heuristics have been applied to a large suite of problem domains usually in the form of single-objective optimisation, we suggest an alternative approach for solving the patrol scheduling problem with two …

Go to article

Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau Aug 2014

Hybrid Metaheuristics For Solving The Quadratic Assignment Problem And The Generalized Quadratic Assignment Problem, Aldy Gunawan, Kien Ming Ng, Kim Leng Poh, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP). The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) to construct an initial solution, and then using a hybrid Simulated Annealing and Tabu Search (SA-TS) algorithm to further improve the solution. Experimental results show that the hybrid metaheuristic is able to obtain good quality solutions for QAPLIB test problems within reasonable computation time. The proposed algorithm is extended to solve the Generalized Quadratic Assignment Problem (GQAP), with an emphasis on modelling and solving a practical problem, namely an examination timetabling problem. We found that …

Go to article

Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow Aug 2014

Integrating Motivated Learning And K-Winner-Take-All To Coordinate Multi-Agent Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan, Janusz Starzyk, Yuan-Sin Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the tasks for large DOPs, the multi-agent reinforcement learning (MARL) framework is adopted wherein an agent is used to learn the performance of each distinct task using reinforcement learning. To coordinate MARL, we propose a novel coordination strategy integrating Motivated Learning (ML) …

Go to article

Video Event Detection Using Motion Relativity And Feature Selection, Feng Wang, Zhanhu Sun, Yu-Gang Jiang, Chong-Wah Ngo Aug 2014

Video Event Detection Using Motion Relativity And Feature Selection, Feng Wang, Zhanhu Sun, Yu-Gang Jiang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Event detection plays an essential role in video content analysis. In this paper, we present our approach based on motion relativity and feature selection for video event detection. First, we propose a new motion feature, namely Expanded Relative Motion Histogram of Bag-of-Visual-Words (ERMH-BoW) to employ motion relativity for event detection. In ERMH-BoW, by representing what aspect of an event with Bag-of-Visual-Words (BoW), we construct relative motion histograms between different visual words to depict the objects' activities or how aspect of the event. ERMH-BoW thus integrates both what and how aspects for a complete event description. Meanwhile, we show that by …

Go to article

Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain Aug 2014

Collaborative Online Multitask Learning, Guangxia Li, Steven C. H. Hoi, Kuiyu Chang, Wenting Liu, Ramesh Jain

Research Collection School Of Computing and Information Systems

We study the problem of online multitask learning for solving multiple related classification tasks in parallel, aiming at classifying every sequence of data received by each task accurately and efficiently. One practical example of online multitask learning is the micro-blog sentiment detection on a group of users, which classifies micro-blog posts generated by each user into emotional or non-emotional categories. This particular online learning task is challenging for a number of reasons. First of all, to meet the critical requirements of online applications, a highly efficient and scalable classification solution that can make immediate predictions with low learning cost is …

Go to article

Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao Aug 2014

Generating Supplementary Travel Guides From Social Media, Liu Yang, Jing Jiang, Lifu Huang, Minghui Qiu, Lizi Liao

Research Collection School Of Computing and Information Systems

In this paper we study how to summarize travel-related information in forum threads to generate supplementary travel guides. Such summaries presumably can provide additional and more up-to-date information to tourists. Existing multi-document summarization methods have limitations for this task because (1) they do not generate structured summaries but travel guides usually follow a certain template, and (2) they do not put emphasis on named entities but travel guides often recommend points of interest to travelers. To overcome these limitations, we propose to use a latent variable model to align forum threads with the section structure of well-written travel guides. The …

Go to article

Jointly Modeling Aspects, Ratings And Sentiments For Movie Recommendation (Jmars), Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J. Smola, Jing Jiang, Chong Wang Aug 2014

Jointly Modeling Aspects, Ratings And Sentiments For Movie Recommendation (Jmars), Qiming Diao, Minghui Qiu, Chao-Yuan Wu, Alexander J. Smola, Jing Jiang, Chong Wang

Research Collection School Of Computing and Information Systems

Recommendation and review sites offer a wealth of information beyond ratings. For instance, on IMDb users leave reviews, commenting on different aspects of a movie (e.g. actors, plot, visual effects), and expressing their sentiments (positive or negative) on these aspects in their reviews. This suggests that uncovering aspects and sentiments will allow us to gain a better understanding of users, movies, and the process involved in generating ratings. The ability to answer questions such as “Does this user care more about the plot or about the special effects?” or ”What is the quality of the movie in terms of acting?” …

Go to article

Automatic Fine-Grained Issue Report Reclassification, Pavneet Singh Kochhar, Ferdian Thung, David Lo Aug 2014

Automatic Fine-Grained Issue Report Reclassification, Pavneet Singh Kochhar, Ferdian Thung, David Lo

Research Collection School Of Computing and Information Systems

Issue tracking systems are valuable resources during software maintenance activities. These systems contain different categories of issue reports such as bug, request for improvement (RFE), documentation, refactoring, task etc. While logging issue reports into a tracking system, reporters can indicate the category of the reports. Herzig et al. Recently reported that more than 40% of issue reports are given wrong categories in issue tracking systems. Among issue reports that are marked as bugs, more than 30% of them are not bug reports. The misclassification of issue reports can adversely affects developers as they then need to manually identify the categories …

Go to article

First Prev Next Last