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 3931 - 3960 of 9025

Full-Text Articles in Computer Sciences

Inferring Accurate Bus Trajectories From Noisy Estimated Arrival Time Records, Lakmal Meegahapola, Noel Athaide, Kasthuri Jayarajah, Shili Xiang, Archan Misra Oct 2019

Inferring Accurate Bus Trajectories From Noisy Estimated Arrival Time Records, Lakmal Meegahapola, Noel Athaide, Kasthuri Jayarajah, Shili Xiang, Archan Misra

Research Collection School Of Computing and Information Systems

Urban commuting data has long been a vital source of understanding population mobility behaviour and has been widely adopted for various applications such as transport infrastructure planning and urban anomaly detection. While individual-specific transaction records (such as smart card (tap-in, tap-out) data or taxi trip records) hold a wealth of information, these are often private data available only to the service provider (e.g., taxicab operator). In this work, we explore the utility in harnessing publicly available, albeit noisy, transportation datasets, such as noisy “Estimated Time of Arrival" (ETA) records (commonly available to commuters through transit Apps or electronic signages). We …


Towards Generating Transformation Rules Without Examples For Android Api Replacement, Ferdian Thung, Hong Jin Kang, Lingxiao Jiang, David Lo Oct 2019

Towards Generating Transformation Rules Without Examples For Android Api Replacement, Ferdian Thung, Hong Jin Kang, Lingxiao Jiang, David Lo

Research Collection School Of Computing and Information Systems

Deprecation of APIs in software libraries is common when library maintainers make changes to a library and will no longer support certain APIs in the future. When deprecation occurs, developers whose programs depend on the APIs need to replace the usages of the deprecated APIs sooner or later. Often times, software documentation specifies which new APIs the developers should use in place of a deprecated API. However, replacing the usages of a deprecated API remains a challenge since developers may not know exactly how to use the new APIs. The developers would first need to understand the API changes before …


New Challenges In Display-Saturated Environments, Mateusz Andrzej Mikusz, Tsu Wei Kenny Choo, Rajesh Krishna Balan, Nigel Davies, Youngki Lee Oct 2019

New Challenges In Display-Saturated Environments, Mateusz Andrzej Mikusz, Tsu Wei Kenny Choo, Rajesh Krishna Balan, Nigel Davies, Youngki Lee

Research Collection School Of Computing and Information Systems

We live in a world in which our physical spaces are becoming increasingly enriched with computing technology. Pervasive displays have been at the forefront of this progression and are now commonplace. In this paper, we focus on the natural end-point of this trend and consider the case when displays become truly ubiquitous and saturate our physical environments. We use as motivation a state-of-the-art display deployment in which mobile users navigating the space are simultaneously exposed to many hundreds of displays within their field of view and we highlight a number of new research challenges.


Knowledge Base Question Answering With A Matching-Aggregation Model And Question-Specific Contextual Relations, Yunshi Lan, Shuohang Wang, Jing Jiang Oct 2019

Knowledge Base Question Answering With A Matching-Aggregation Model And Question-Specific Contextual Relations, Yunshi Lan, Shuohang Wang, Jing Jiang

Research Collection School Of Computing and Information Systems

Making use of knowledge bases to answer questions (KBQA) is a key direction in question answering systems. Researchers have developed a diverse range of methods to address this problem, but there are still some limitations with the existing methods. Specifically, the existing neural network-based methods for KBQA have not taken advantage of the recent “matching-aggregation” framework for the sequence matching, and when representing a candidate answer entity, they may not choose the most useful context of the candidate for matching. In this paper, we explore the use of a “matching-aggregation” framework to match candidate answers with questions. We further make …


Parametric Timed Model Checking For Guaranteeing Timed Opacity, Étienne André, Jun Sun Oct 2019

Parametric Timed Model Checking For Guaranteeing Timed Opacity, Étienne André, Jun Sun

Research Collection School Of Computing and Information Systems

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage is the ability for an attacker to deduce internal information depending on the system execution time. We address the following problem: given a timed system, synthesize the execution times for which one cannot deduce whether the system performed some secret behavior. We solve this problem in the setting of timed automata (TAs). We first provide a general solution, and then extend the problem to parametric TAs, by synthesizing internal timings making the TA secure. We study decidability, devise algorithms, and show that our …


Collaborative Online Ranking Algorithms For Multitask Learning, Guangxia Li, Peilin Zhao, Tao Mei, Peng Yang, Yulong Shen, Julian K. Y. Chang, Steven C. H. Hoi Oct 2019

Collaborative Online Ranking Algorithms For Multitask Learning, Guangxia Li, Peilin Zhao, Tao Mei, Peng Yang, Yulong Shen, Julian K. Y. Chang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

There are many applications in which it is desirable to rank or order instances that belong to several different but related problems or tasks. Although unique, the individual ranking problem often shares characteristics with other problems in the group. Conventional ranking methods treat each task independently without considering the latent commonalities. In this paper, we study the problem of learning to rank instances that belong to multiple related tasks from the multitask learning perspective. We consider a case in which the information that is learned for a task can be used to enhance the learning of other tasks and propose …


Detecting Cyberattacks In Industrial Control Systems Using Online Learning Algorithms, Guangxia Li, Yulong Shen, Peilin Zhao, Xiao Lu, Jia Liu, Yangyang Liu, Steven C. H. Hoi Oct 2019

Detecting Cyberattacks In Industrial Control Systems Using Online Learning Algorithms, Guangxia Li, Yulong Shen, Peilin Zhao, Xiao Lu, Jia Liu, Yangyang Liu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Industrial control systems are critical to the operation of industrial facilities, especially for critical infrastructures, such as refineries, power grids, and transportation systems. Similar to other information systems, a significant threat to industrial control systems is the attack from cyberspace-the offensive maneuvers launched by "anonymous" in the digital world that target computer-based assets with the goal of compromising a system's functions or probing for information. Owing to the importance of industrial control systems, and the possibly devastating consequences of being attacked, significant endeavors have been attempted to secure industrial control systems from cyberattacks. Among them are intrusion detection systems that …


Generic Construction Of Elgamal-Type Attribute-Based Encryption Schemes With Revocability And Dual-Policy, Shengmin Xu, Yinghui Zhang, Yingjiu Li, Ximeng Liu, Guomin Yang Oct 2019

Generic Construction Of Elgamal-Type Attribute-Based Encryption Schemes With Revocability And Dual-Policy, Shengmin Xu, Yinghui Zhang, Yingjiu Li, Ximeng Liu, Guomin Yang

Research Collection School Of Computing and Information Systems

Cloud is a computing paradigm for allowing data owners to outsource their data to enjoy on-demand services and mitigate the burden of local data storage. However, secure sharing of data via cloud remains an essential issue since the cloud service provider is untrusted. Fortunately, asymmetric-key encryption, such as identity-based encryption (IBE) and attribute-based encryption (ABE), provides a promising tool to offer data confidentiality and has been widely applied in cloud-based applications. In this paper, we summarize the common properties of most of IBE and ABE and introduce a cryptographic primitive called ElGamal type cryptosystem. This primitive can be used to …


Esdra: An Efficient And Secure Distributed Remote Attestation Scheme For Iot Swarms, Boyu Kuang, Anmin Fu, Shui Yu, Guomin Yang, Mang Su, Yuqing Zhang Oct 2019

Esdra: An Efficient And Secure Distributed Remote Attestation Scheme For Iot Swarms, Boyu Kuang, Anmin Fu, Shui Yu, Guomin Yang, Mang Su, Yuqing Zhang

Research Collection School Of Computing and Information Systems

An Internet of Things (IoT) system generally contains thousands of heterogeneous devices which often operate in swarms-large, dynamic, and self-organizing networks. Remote attestation is an important cornerstone for the security of these IoT swarms, as it ensures the software integrity of swarm devices and protects them from attacks. However, current attestation schemes suffer from single point of failure verifier. In this paper, we propose an Efficient and Secure Distributed Remote Attestation (ESDRA) scheme for IoT swarms. We present the first many-to-one attestation scheme for device swarms, which reduces the possibility of single point of failure verifier. Moreover, we utilize distributed …


Who, Where, And What To Wear?: Extracting Fashion Knowledge From Social Media, Yunshan Ma, Xun Yang, Lizi Liao, Yixin Cao, Tat-Seng Chua Oct 2019

Who, Where, And What To Wear?: Extracting Fashion Knowledge From Social Media, Yunshan Ma, Xun Yang, Lizi Liao, Yixin Cao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Fashion knowledge helps people to dress properly and addresses not only physiological needs of users, but also the demands of social activities and conventions. It usually involves three mutually related aspects of: occasion, person and clothing. However, there are few works focusing on extracting such knowledge, which will greatly benefit many downstream applications, such as fashion recommendation. In this paper, we propose a novel method to automatically harvest fashion knowledge from social media. We unify three tasks of occasion, person and clothing discovery from multiple modalities of images, texts and metadata. For person detection and analysis, we use the off-the-shelf …


Automatic Fashion Knowledge Extraction From Social Media, Yunshan Ma, Lizi Liao, Tat-Seng Chua Oct 2019

Automatic Fashion Knowledge Extraction From Social Media, Yunshan Ma, Lizi Liao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Fashion knowledge plays a pivotal role in helping people in their dressing. In this paper, we present a novel system to automatically harvest fashion knowledge from social media. It unifies three tasks of occasion, person and clothing discovery from multiple modalities of images, texts and metadata. A contextualized fashion concept learning model is applied to leverage the rich contextual information for improving the fashion concept learning performance. At the same time, to counter the label noise within training data, we employ a weak label modeling method to further boost the performance. We build a website to demonstrate the quality of …


Who, Where, And What To Wear?: Extracting Fashion Knowledge From Social Media, Yunshan Ma, Xun Yang, Lizi Liao, Yixin Cao, Tat-Seng Chua Oct 2019

Who, Where, And What To Wear?: Extracting Fashion Knowledge From Social Media, Yunshan Ma, Xun Yang, Lizi Liao, Yixin Cao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Fashion knowledge helps people to dress properly and addresses not only physiological needs of users, but also the demands of social activities and conventions. It usually involves three mutually related aspects of: occasion, person and clothing. However, there are few works focusing on extracting such knowledge, which will greatly benefit many downstream applications, such as fashion recommendation. In this paper, we propose a novel method to automatically harvest fashion knowledge from social media. We unify three tasks of occasion, person and clothing discovery from multiple modalities of images, texts and metadata. For person detection and analysis, we use the off-the-shelf …


Who, Where, And What To Wear?: Extracting Fashion Knowledge From Social Media, Yunshan Ma, Xun Yang, Lizi Liao, Yixin Cao, Tat-Seng Chua Oct 2019

Who, Where, And What To Wear?: Extracting Fashion Knowledge From Social Media, Yunshan Ma, Xun Yang, Lizi Liao, Yixin Cao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Fashion knowledge helps people to dress properly and addresses not only physiological needs of users, but also the demands of social activities and conventions. It usually involves three mutually related aspects of: occasion, person and clothing. However, there are few works focusing on extracting such knowledge, which will greatly benefit many downstream applications, such as fashion recommendation. In this paper, we propose a novel method to automatically harvest fashion knowledge from social media. We unify three tasks of occasion, person and clothing discovery from multiple modalities of images, texts and metadata. For person detection and analysis, we use the off-the-shelf …


Automatic Fashion Knowledge Extraction From Social Media, Yunshan Ma, Lizi Liao, Tat-Seng Chua Oct 2019

Automatic Fashion Knowledge Extraction From Social Media, Yunshan Ma, Lizi Liao, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Fashion knowledge plays a pivotal role in helping people in their dressing. In this paper, we present a novel system to automatically harvest fashion knowledge from social media. It unifies three tasks of occasion, person and clothing discovery from multiple modalities of images, texts and metadata. A contextualized fashion concept learning model is applied to leverage the rich contextual information for improving the fashion concept learning performance. At the same time, to counter the label noise within training data, we employ a weak label modeling method to further boost the performance. We build a website to demonstrate the quality of …


Mixed-Dish Recognition With Contextual Relation Networks, Lixi Deng, Jingjing Chen, Qianru Sun, Xiangnan He, Sheng Tang, Zhaoyan Ming, Yongdong Zhang, Tat-Seng Chua Oct 2019

Mixed-Dish Recognition With Contextual Relation Networks, Lixi Deng, Jingjing Chen, Qianru Sun, Xiangnan He, Sheng Tang, Zhaoyan Ming, Yongdong Zhang, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Mixed dish is a food category that contains different dishes mixed in one plate, and is popular in Eastern and Southeast Asia. Recognizing individual dishes in a mixed dish image is important for health related applications, e.g. calculating the nutrition values. However, most existing methods that focus on single dish classification are not applicable to mixed-dish recognition. The new challenge in recognizing mixed-dish images are the complex ingredient combination and severe overlap among different dishes. In order to tackle these problems, we propose a novel approach called contextual relation networks (CR-Nets) that encodes the implicit and explicit contextual relations among …


Sieve: Helping Developers Sift Wheat From Chaff Via Cross-Platform Analysis, Agus Sulistya, Gede A. A. P. Prana, David Lo, Christoph Treude Oct 2019

Sieve: Helping Developers Sift Wheat From Chaff Via Cross-Platform Analysis, Agus Sulistya, Gede A. A. P. Prana, David Lo, Christoph Treude

Research Collection School Of Computing and Information Systems

Software developers have benefited from various sources of knowledge such as forums, question-and-answer sites, and social media platforms to help them in various tasks. Extracting software-related knowledge from different platforms involves many challenges. In this paper, we propose an approach to improve the effectiveness of knowledge extraction tasks by performing cross-platform analysis. Our approach is based on transfer representation learning and word embedding, leveraging information extracted from a source platform which contains rich domain-related content. The information extracted is then used to solve tasks in another platform (considered as target platform) with less domain-related content. We first build a word …


Cognitive And Social Interaction Analysis In Graduate Discussion Forums, Mallika Gokarn Nitin, Swapna Gottipati, Venky Shankararaman Oct 2019

Cognitive And Social Interaction Analysis In Graduate Discussion Forums, Mallika Gokarn Nitin, Swapna Gottipati, Venky Shankararaman

Research Collection School Of Computing and Information Systems

Discussion forums play a key role in building knowledge repositories in an education institute. Asynchronous discussion forums enable part-time graduate professionals to have a better learning experience. This paper reports how a carefully curated discussion forum enhances the cognitive and social interactions among students in a graduate information systems course. In particular, we analyse the cognitive and social interactions and their impact on the student grades. To our surprise, the graduate students with their limited time resources, have higher order cognitive contributions and reasonable amount of social posts. We present the discussion forum design, cognitive and social behaviour analysis, grade …


Topicsummary: A Tool For Analyzing Class Discussion Forums Using Topic Based Summarizations, Swapna Gottipati, Venky Shankararaman, Renjini Ramesh Oct 2019

Topicsummary: A Tool For Analyzing Class Discussion Forums Using Topic Based Summarizations, Swapna Gottipati, Venky Shankararaman, Renjini Ramesh

Research Collection School Of Computing and Information Systems

This Innovative Practice full paper, describes the application of text mining techniques for extracting insights from a course based online discussion forum through generation of topic based summaries. Discussions, either in classroom or online provide opportunity for collaborative learning through exchange of ideas that leads to enhanced learning through active participation. Online discussions offer a number of benefits namely providing additional time to reflect and synthesize information before writing, providing a natural platform for students to voice their ideas without any one student dominating the conversation, and providing a record of the student’s thoughts. An online discussion forum provides a …


On Analysing Supply And Demand In Labor Markets: Framework, Model And System, Hendrik Santoso Sugiarto, Ee-Peng Lim, Ngak Leng Sim Oct 2019

On Analysing Supply And Demand In Labor Markets: Framework, Model And System, Hendrik Santoso Sugiarto, Ee-Peng Lim, Ngak Leng Sim

Research Collection School Of Computing and Information Systems

The labor market refers to the market between job seekers and employers. As much of job seeking and talent hiring activities are now performed online, a large amount of job posting and application data have been collected and can be re-purposed for labor market analysis. In the labor market, both supply and demand are the key factors in determining an appropriate salary for both job applicants and employers in the market. However, it is challenging to discover the supply and demand for any labor market. In this paper, we propose a novel framework to built a labor market model using …


Tighter Security Proofs For Post-Quantum Key Encapsulation Mechanism In The Multi-Challenge Setting, Zhengyu Zhang, Puwen Wei, Haiyang Xue Oct 2019

Tighter Security Proofs For Post-Quantum Key Encapsulation Mechanism In The Multi-Challenge Setting, Zhengyu Zhang, Puwen Wei, Haiyang Xue

Research Collection School Of Computing and Information Systems

Due to the threat posed by quantum computers, a series of works investigate the security of cryptographic schemes in the quantum-accessible random oracle model (QROM) where the adversary can query the random oracle in superposition. In this paper, we present tighter security proofs of a generic transformations for key encapsulation mechanism (KEM) in the QROM in the multi-challenge setting, where the reduction loss is independent of the number of challenge ciphertexts. In particular, we introduce the notion of multi-challenge OW-CPA (mOW-CPA) security, which captures the one-wayness of the underlying public key encryption (PKE) under chosen plaintext attack in the multi-challenge …


Multi-Label Thoracic Disease Image Classification With Cross-Attention Networks, Congbo Ma, Hu Wang, Steven C. H. Hoi Oct 2019

Multi-Label Thoracic Disease Image Classification With Cross-Attention Networks, Congbo Ma, Hu Wang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Automated disease classification of radiology images has been emerging as a promising technique to support clinical diagnosis and treatment planning. Unlike generic image classification tasks, a real-world radiology image classification task is significantly more challenging as it is far more expensive to collect the training data where the labeled data is in nature multi-label; and more seriously samples from easy classes often dominate; training data is highly class-imbalanced problem exists in practice as well. To overcome these challenges, in this paper, we propose a novel scheme of Cross-Attention Networks (CAN) for automated thoracic disease classification from chest x-ray images, which …


Semi-Supervised Deep Quantization For Cross-Modal Search, Xin Wang, Wenwu Zhu, Chenghao Liu Oct 2019

Semi-Supervised Deep Quantization For Cross-Modal Search, Xin Wang, Wenwu Zhu, Chenghao Liu

Research Collection School Of Computing and Information Systems

The problem of cross-modal similarity search, which aims at making efficient and accurate queries across multiple domains, has become a significant and important research topic. Composite quantization, a compact coding solution superior to hashing techniques, has shown its effectiveness for similarity search. However, most existing works utilizing composite quantization to search multi-domain content only consider either pairwise similarity information or class label information across different domains, which fails to tackle the semi-supervised problem in composite quantization. In this paper, we address the semi-supervised quantization problem by considering: (i) pairwise similarity information (without class label information) across different domains, which captures …


Duplicate Pull Request Detection: When Time Matters, Qingye Wang, Bowen Xu, Xin Xia, Ting Wang, Shanping Li Oct 2019

Duplicate Pull Request Detection: When Time Matters, Qingye Wang, Bowen Xu, Xin Xia, Ting Wang, Shanping Li

Research Collection School Of Computing and Information Systems

In open source communities (e.g., GitHub), developers frequently submit pull requests to fix bugs or add new features during development process. Since the process of pull request is uncoordinated and distributed, it causes massive duplication. Usually, only the first pull request qualified by reviewers can be merged to the main branch of the repository, and the others are regarded as duplication by maintainers. Since the duplication largely aggravates workloads of project reviewers and maintainers, the evolutionary process of open source repositories is delayed. To identify the duplicate pull requests automatically, Ren et al. proposed a state-of-the-art approach that models a …


Comprehending Test Code: An Empirical Study, Chak Shun Yu, Christoph Treude, Maurício Aniche Oct 2019

Comprehending Test Code: An Empirical Study, Chak Shun Yu, Christoph Treude, Maurício Aniche

Research Collection School Of Computing and Information Systems

Developers spend a large portion of their time and effort on comprehending source code. While many studies have investigated how developers approach these comprehension tasks and what factors influence their success, less is known about how developers comprehend test code specifically, despite the undisputed importance of testing. In this paper, we report on the results of an empirical study with 44 developers to understand which factors influence developers when comprehending Java test code. We measured three dependent variables: the total time spent reading a test suite, the ability to identify the overall purpose of a test suite, and the ability …


Supporting Software Architecture Maintenance By Providing Task-Specific Recommendations, Matthias Galster, Christoph Treude, Kelly Blincoe Oct 2019

Supporting Software Architecture Maintenance By Providing Task-Specific Recommendations, Matthias Galster, Christoph Treude, Kelly Blincoe

Research Collection School Of Computing and Information Systems

During software maintenance, developers have different information needs (e.g., to understand what type of maintenance activity to perform, the impact of a maintenance activity and its effort). However, information to support developers may be distributed across various sources. Furthermore, information captured in formal architecture documentation may be outdated. In this paper, we put forward a late breaking idea and outline a solution to improve the productivity of developers by providing task-specific recommendations based on concrete information needs that arise during software maintenance.


Tracy: A Business-Driven Technical Debt Prioritization Framework, Rodrigo Rebouças De Almeida, Christoph Treude, Uirá Kulesza Oct 2019

Tracy: A Business-Driven Technical Debt Prioritization Framework, Rodrigo Rebouças De Almeida, Christoph Treude, Uirá Kulesza

Research Collection School Of Computing and Information Systems

Technical debt is a pervasive problem in software development. Software development teams have to prioritize debt items and determine whether they should address debt or develop new features at any point in time. This paper presents "Tracy", a framework for the prioritization of technical debt using a business-driven approach built on top of business processes. The current stage of the proposed framework is at the beginning of the third phase of Design Science Research, which is usually divided into the phases of exploration, engineering, and evaluation. The exploration and engineering phases involved the participation of 49 professionals from 12 different …


Solargest: Ubiquitous And Battery-Free Gesture Recognition Using Solar Cells, Dong Ma, Guohao Lan, Mahbub Hassan, Wen Hu, B. Mushfika Upama, Ashraf Uddin, Youseef, Moustafa Oct 2019

Solargest: Ubiquitous And Battery-Free Gesture Recognition Using Solar Cells, Dong Ma, Guohao Lan, Mahbub Hassan, Wen Hu, B. Mushfika Upama, Ashraf Uddin, Youseef, Moustafa

Research Collection School Of Computing and Information Systems

We design a system, SolarGest, which can recognize hand gestures near a solar-powered device by analyzing the patterns of the photocurrent. SolarGest is based on the observation that each gesture interferes with incident light rays on the solar panel in a unique way, leaving its distinguishable signature in harvested photocurrent. Using solar energy harvesting laws, we develop a model to optimize design and usage of SolarGest. To further improve the robustness of SolarGest under non-deterministic operating conditions, we combine dynamic time warping with Z-score transformation in a signal processing pipeline to pre-process each gesture waveform before it is analyzed for …


Weakly-Supervised Deep Anomaly Detection With Pairwise Relation Learning, Guansong Pang, Anton Van Den Hengel, Chuanhua Shen Oct 2019

Weakly-Supervised Deep Anomaly Detection With Pairwise Relation Learning, Guansong Pang, Anton Van Den Hengel, Chuanhua Shen

Research Collection School Of Computing and Information Systems

This paper studies a rarely explored but critical anomaly detection problem: weakly-supervised anomaly detection with limited labeled anomalies and a large unlabeled data set. This problem is very important because it (i) enables anomalyinformed modeling which helps identify anomalies of interests and address the notorious high false positives in unsupervised anomaly detection, and (ii) eliminates the reliance on large-scale and complete labeled anomaly data in fullysupervised settings. However, the problem is especially challenging since we have only limited labeled data for a single class, and moreover, the seen anomalies often cannot cover all types of anomalies (i.e., unseen anomalies). We …


Deep Hashing By Discriminating Hard Examples, Cheng Yan, Guansong Pang, Xiao Bai, Chunhua Shen, Jun Zhou, Edwin Hancock Oct 2019

Deep Hashing By Discriminating Hard Examples, Cheng Yan, Guansong Pang, Xiao Bai, Chunhua Shen, Jun Zhou, Edwin Hancock

Research Collection School Of Computing and Information Systems

This paper tackles a rarely explored but critical problem within learning to hash, i.e., to learn hash codes that effectively discriminate hard similar and dissimilar examples, to empower large-scale image retrieval. Hard similar examples refer to image pairs from the same semantic class that demonstrate some shared appearance but have different fine-grained appearance. Hard dissimilar examples are image pairs that come from different semantic classes but exhibit similar appearance. These hard examples generally have a small distance due to the shared appearance. Therefore, effective encoding of the hard examples can well discriminate the relevant images within a small Hamming distance, …


Nonuniform Timeslicing Of Dynamic Graphs Based On Visual Complexity, Yong Wang, Daniel Archambault, Hammad Haleem, Torsten Moeller, Yanhong Wu, Huamin Qu Oct 2019

Nonuniform Timeslicing Of Dynamic Graphs Based On Visual Complexity, Yong Wang, Daniel Archambault, Hammad Haleem, Torsten Moeller, Yanhong Wu, Huamin Qu

Research Collection School Of Computing and Information Systems

Uniform timeslicing of dynamic graphs has been used due to its convenience and uniformity across the time dimension. However, uniform timeslicing does not take the data set into account, which can generate cluttered timeslices with edge bursts and empty timeslices with few interactions. The graph mining filed has explored nonuniform timeslicing methods specifically designed to preserve graph features for mining tasks. In this paper, we propose a nonuni-form timeslicing approach for dynamic graph visualization. Our goal is to create timeslices of equal visual complexity. To this end, we adapt histogram equalization to create timeslices with a similar number of events, …