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

Computer Sciences Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year
File Type

Articles 5731 - 5760 of 8479

Full-Text Articles in Computer Sciences

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

An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau Aug 2014

An Empirical Study Of Off-Line Configuration And On-Line Adaptation In Operator Selection, Zhi Yuan, Stephanus Daniel Handoko, Duc Thien Nguyen, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

Automating the process of finding good parameter settings is important in the design of high-performing algorithms. These automatic processes can generally be categorized into off-line and on-line methods. Off-line configuration consists in learning and selecting the best setting in a training phase, and usually fixes it while solving an instance. On-line adaptation methods on the contrary vary the parameter setting adaptively during each algorithm run. In this work, we provide an empirical study of both approaches on the operator selection problem, explore the possibility of varying parameter value by a non-adaptive distribution tuned off-line, and incorporate the off-line with on-line …

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

A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau Aug 2014

A Mathematical Model And Metaheuristics For Time Dependent Orienteering Problem, Aldy Gunawan, Zhi Yuan, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper presents a generalization of the Orienteering Problem, the Time-Dependent Orienteering Problem (TDOP) which is based on the real-life application of providing automatic tour guidance to a large leisure facility such as a theme park. In this problem, the travel time between two nodes depends on the time when the trip starts. We formulate the problem as an integer linear programming (ILP) model. We then develop various heuristics in a step by step fashion: greedy construction, local search and variable neighborhood descent, and two versions of iterated local search. The proposed metaheuristics were tested on modified benchmark instances, randomly …

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

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

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

Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li Aug 2014

Online Multiple Kernel Regression, Doyen Sahoo, Steven C. H. Hoi, Bin Li

Research Collection School Of Computing and Information Systems

Kernel-based regression represents an important family of learning techniques for solving challenging regression tasks with non-linear patterns. Despite being studied extensively, most of the existing work suffers from two major drawbacks: (i) they are often designed for solving regression tasks in a batch learning setting, making them not only computationally inefficient and but also poorly scalable in real-world applications where data arrives sequentially; and (ii) they usually assume a fixed kernel function is given prior to the learning task, which could result in poor performance if the chosen kernel is inappropriate. To overcome these drawbacks, this paper presents a novel …

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

Reducing Carbon Emission Of Ocean Shipments By Optimizing Container Size Selection, Edwin Lik Ming Chong, Nang Laik Ma, Kar Way Tan Aug 2014

Reducing Carbon Emission Of Ocean Shipments By Optimizing Container Size Selection, Edwin Lik Ming Chong, Nang Laik Ma, Kar Way Tan

Research Collection School Of Computing and Information Systems

Human’s impact on earth through global warming is more or less an accepted fact. Ocean freight is estimated to contribute 4-5% of global carbon emissions and manufacturing companies can aid in reducing this amount. Many companies that ship goods through full container loads do not have the capabilities to ensure the containers they are using minimizes their carbon footprint. One of the reasons is the choice of non-ideal container sizes for their shipments. This paper provides a mathematical model to minimize companies’ shipping carbon footprints by selecting the ideal container sizes appropriate for their shipment volumes. Using data from a …

Go to article

A Palm Vein Identification System Based On Gabor Wavelet Features, Ran Wang, Guoyou Wang, Zhong Chen, Zhigang Zeng, Yong Wang Aug 2014

A Palm Vein Identification System Based On Gabor Wavelet Features, Ran Wang, Guoyou Wang, Zhong Chen, Zhigang Zeng, Yong Wang

Research Collection School Of Computing and Information Systems

As a new and promising biometric feature, thermal palm vein pattern has drawn lots of attention in research and application areas. Many algorithms have been proposed for authentication since palm vein has special characteristics, such as liveness detection and hard to forgery. However, the detection accuracy of palm vein quite depends on the preprocessing and feature representation, which is supposed to be translation and rotation invariant to some extent. In this paper, we proposed an effective method for palm vein identification based on Gabor wavelet features which contains five steps: image acquisition, ROI detection, image preprocessing, features extraction, and matching. …

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

Ranking Model Selection And Fusion For Effective Microblog Search, Zhongyu Wei, Wei Gao, Tarek El-Ganainy, Walid Magdy, Kam-Fai Wong Jul 2014

Ranking Model Selection And Fusion For Effective Microblog Search, Zhongyu Wei, Wei Gao, Tarek El-Ganainy, Walid Magdy, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Re-ranking was shown to have positive impact on the effectiveness for microblog search. Yet existing approaches mostly focused on using a single ranker to learn some better ranking function with respect to various relevance features. Given various available rank learners (such as learning to rank algorithms), in this work, we mainly study an orthogonal problem where multiple learned ranking models form an ensemble for re-ranking the retrieved tweets than just using a single ranking model in order to achieve higher search effectiveness. We explore the use of query-sensitive model selection and rank fusion methods based on the result lists produced …

Go to article

Symbolic Analysis Of An Electric Vehicle Charging Protocol, Li Li, Jun Pang, Yang Liu, Jun Sun, Jin Song Dong Jul 2014

Symbolic Analysis Of An Electric Vehicle Charging Protocol, Li Li, Jun Pang, Yang Liu, Jun Sun, Jin Song Dong

Research Collection School Of Computing and Information Systems

In this paper, we describe our analysis of a recently proposed electric vehicle charing protocol. The protocol builds on complex cryptographic primitives such as commitment, zeroknowledge proofs, BBS+ signature and etc. Moreover, interesting properties such as secrecy, authentication, anonymity, and location privacy are claimed on this protocol. It thus presents a challenge for formal verification, as no single existing tool for security protocol analysis support for all the required features. In our analysis, we employ and combine the strength of two stateof-the-art symbolic verifiers, Tamarin and ProVerif, to check all important properties of the protocol.

Go to article

Detecting Differences Across Multiple Instances Of Code Clones, Yun Lin, Zhenchang Xing, Yinxing Xue, Yang Liu, Xin Peng, Jun Sun, Wenyun Zhao Jul 2014

Detecting Differences Across Multiple Instances Of Code Clones, Yun Lin, Zhenchang Xing, Yinxing Xue, Yang Liu, Xin Peng, Jun Sun, Wenyun Zhao

Research Collection School Of Computing and Information Systems

Clone detectors find similar code fragments (i.e., instances of code clones) and report large numbers of them for industrial systems. To maintain or manage code clones, developers often have to investigate differences of multiple cloned code fragments. However,existing program differencing techniques compare only two code fragments at a time. Developers then have to manually combine several pairwise differencing results. In this paper, we present an approach to automatically detecting differences across multiple clone instances. We have implemented our approach as an Eclipse plugin and evaluated its accuracy with three Java software systems. Our evaluation shows that our algorithm has precision …

Go to article

Collaborative Error Reduction For Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo Jul 2014

Collaborative Error Reduction For Hierarchical Classification, Shiai Zhu, Xiao-Yong Wei, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Hierarchical classification (HC) is a popular and efficient way for detecting the semantic concepts from the images. The conventional method always selects the branch with the highest classification response. This branch selection strategy has a risk of propagating classification errors from higher levels of the hierarchy to the lower levels. We argue that the local strategy is too arbitrary, because the candidate nodes are considered individually, which ignores the semantic and context relationships among concepts. In this paper, we first propose a novel method for HC, which is able to utilize the semantic relationship among candidate nodes and their children …

Go to article

Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow Jul 2014

Integrating Self-Organizing Neural Network And Motivated Learning For Coordinated Multi-Agent Reinforcement Learning In Multi-Stage Stochastic Game, Teck-Hou Teng, Ah-Hwee Tan, Janusz A. Starzyk, Yuan-Sin Tan, Loo-Nin Teow

Research Collection School Of Computing and Information Systems

Most non-trivial problems require the coordinated performance of multiple goal-oriented and time-critical tasks. Coordinating the performance of the tasks is required due to the dependencies among the tasks and the sharing of resources. In this work, an agent learns to perform a task using reinforcement learning with a self-organizing neural network as the function approximator. We propose a novel coordination strategy integrating Motivated Learning (ML) and a self-organizing neural network for multi-agent reinforcement learning (MARL). Specifically, we adapt the ML idea of using pain signal to overcome the resource competition issue. Dependency among the agents is resolved using domain knowledge …

Go to article

Click-Through-Based Cross-View Learning For Image Search, Yingwei Pan, Ting Yao, Tao Mei, Houqiang Li, Chong-Wah Ngo, Yong Rui Jul 2014

Click-Through-Based Cross-View Learning For Image Search, Yingwei Pan, Ting Yao, Tao Mei, Houqiang Li, Chong-Wah Ngo, Yong Rui

Research Collection School Of Computing and Information Systems

One of the fundamental problems in image search is to rank image documents according to a given textual query. Existing search engines highly depend on surrounding texts for ranking images, or leverage the query-image pairs annotated by human labelers to train a series of ranking functions. However, there are two major limitations: 1) the surrounding texts are often noisy or too few to accurately describe the image content, and 2) the human annotations are resourcefully expensive and thus cannot be scaled up. We demonstrate in this paper that the above two fundamental challenges can be mitigated by jointly exploring the …

Go to article

User Daily Activity Pattern Learning: A Multi-Memory Modeling Approach, Shan Gao, Ah-Hwee Tan Jul 2014

User Daily Activity Pattern Learning: A Multi-Memory Modeling Approach, Shan Gao, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

In this paper, we propose a multi-memory model, ADLART model, to discover the daily activity pattern of a sensor monitored user from his/her activities of daily living (ADL). The proposed model mimics the human multiple memory system which comprises a working memory, an episodic memory, and a semantic memory. Through encoding user's daily activities patterns in episodic memory and extracting the regularities of activity routines in semantic memory, the ADLART system is able to learn, recognize, compare, and retrieve daily ADL patterns of the user. Experiments are presented to show the performance of the ADLART model using different parameter settings …

Go to article

Mobile Humanoid Agent With Mood Awareness For Elderly Care, Di Wang, Ah-Hwee Tan Jul 2014

Mobile Humanoid Agent With Mood Awareness For Elderly Care, Di Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Human, especially elderly, require frequent attention, continuous companionship, and deep understanding from the others. To provide more specific and appropriate tender care to the elderly, knowing their affective states is a great advantage. Recent work on human emotion recognition shows promising results that the expressive emotion can be successfully captured through visual, audio, and keyboard or touchpad stroke pattern signals. Furthermore, human activities are shown to be accurately recognizable with context by nonintrusive sensors within or connected to the smartphones. In this paper, we propose a computational model to characterize the affective states of the elderly based on the recognizable …

Go to article

Verifying Monadic Second-Order Properties Of Graph Programs, Christopher M. Poskitt, Detlef Plump Jul 2014

Verifying Monadic Second-Order Properties Of Graph Programs, Christopher M. Poskitt, Detlef Plump

Research Collection School Of Computing and Information Systems

The core challenge in a Hoare- or Dijkstra-style proof system for graph programs is in defining a weakest liberal precondition construction with respect to a rule and a postcondition. Previous work addressing this has focused on assertion languages for first-order properties, which are unable to express important global properties of graphs such as acyclicity, connectedness, or existence of paths. In this paper, we extend the nested graph conditions of Habel, Pennemann, and Rensink to make them equivalently expressive to monadic second-order logic on graphs. We present a weakest liberal precondition construction for these assertions, and demonstrate its use in verifying …

Go to article

Diamonds Are A Girl's Best Friend: Partial Order Reduction For Timed Automata With Abstractions, Henri Hansen, Shang-Wei Lin, Yang Liu, Truong Khanh Nguyen, Jun Sun Jul 2014

Diamonds Are A Girl's Best Friend: Partial Order Reduction For Timed Automata With Abstractions, Henri Hansen, Shang-Wei Lin, Yang Liu, Truong Khanh Nguyen, Jun Sun

Research Collection School Of Computing and Information Systems

A major obstacle for using partial order reduction in the context of real time verification is that the presence of clocks and clock constraints breaks the usual diamond structure of otherwise independent transitions. This is especially true when information of the relative values of clocks is preserved in the form of diagonal constraints. However, when diagonal constraints are relaxed by a suitable abstraction, some diamond structure is re-introduced in the zone graph. In this article, we introduce a variant of the stubborn set method for reducing an abstracted zone graph. Our method works with all abstractions, but especially targets situations …

Go to article

Creating Autonomous Adaptive Agents In A Real-Time First-Person Shooter Computer Game, Di Wang, Ah-Hwee Tan Jul 2014

Creating Autonomous Adaptive Agents In A Real-Time First-Person Shooter Computer Game, Di Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Games are good test-beds to evaluate AI methodologies. In recent years, there has been a vast amount of research dealing with real-time computer games other than the traditional board games or card games. This paper illustrates how we create agents by employing FALCON, a self-organizing neural network that performs reinforcement learning, to play a well-known first-person shooter computer game called Unreal Tournament. Rewards used for learning are either obtained from the game environment or estimated using the temporal difference learning scheme. In this way, the agents are able to acquire proper strategies and discover the effectiveness of different weapons without …

Go to article

Influences Of Influential Users: An Empirical Study Of Music Social Network, Jing Ren, Zhiyong Cheng, Jialie Shen, Feida Zhu Jul 2014

Influences Of Influential Users: An Empirical Study Of Music Social Network, Jing Ren, Zhiyong Cheng, Jialie Shen, Feida Zhu

Research Collection School Of Computing and Information Systems

Influential user can play a crucial role in online social networks. This paper documents an empirical study aiming at exploring the effects of influential users in the context of music social network. To achieve this goal, music diffusion graph is developed to model how information propagates over network. We also propose a heuristic method to measure users' influences. Using the real data from Last. fm, our empirical test demonstrates key effects of influential users and reveals limitations of existing influence identification/characterization schemes.

Go to article

A Simple Polynomial-Time Randomized Distributed Algorithm For Connected Row Convex Constraints, T. K. Satish Kumar, Nguyen Duc Thien, William Yeoh, Sven Koenig Jul 2014

A Simple Polynomial-Time Randomized Distributed Algorithm For Connected Row Convex Constraints, T. K. Satish Kumar, Nguyen Duc Thien, William Yeoh, Sven Koenig

Research Collection School Of Computing and Information Systems

In this paper, we describe a simple randomized algorithm that runs in polynomial time and solves connected row convex (CRC) constraints in distributed settings. CRC constraints generalize many known tractable classes of constraints like 2-SAT and implicational constraints. They can model problems in many domains including temporal reasoning and geometric reasoning, and generally speaking, play the role of "Gaussians" in the logical world. Our simple randomized algorithm for solving them in distributed settings, therefore, has a number of important applications. We support our claims through a theoretical analysis and empirical results.

Go to article

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li Jul 2014

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li

Research Collection School Of Computing and Information Systems

Spectral hashing (SpH) is an efficient and simple binary hashing method, which assumes that data are sampled from a multidimensional uniform distribution. However, this assumption is too restrictive in practice. In this paper we propose an improved method, fitted spectral hashing (FSpH), to relax this distribution assumption. Our work is based on the fact that one-dimensional data of any distribution could be mapped to a uniform distribution without changing the local neighbor relations among data items. We have found that this mapping on each PCA direction has certain regular pattern, and could be fitted well by S-curve function (Sigmoid function). …

Go to article

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li Jul 2014

Fsph: Fitted Spectral Hashing For Efficient Similarity Search, Yong-Dong Zhang, Yu Wang, Sheng Tang, Steven C. H. Hoi, Jin-Tao Li

Research Collection School Of Computing and Information Systems

Spectral hashing (SpH) is an efficient and simple binary hashing method, which assumes that data are sampled from a multidimensional uniform distribution. However, this assumption is too restrictive in practice. In this paper we propose an improved method, fitted spectral hashing (FSpH), to relax this distribution assumption. Our work is based on the fact that one-dimensional data of any distribution could be mapped to a uniform distribution without changing the local neighbor relations among data items. We have found that this mapping on each PCA direction has certain regular pattern, and could be fitted well by S-curve function (Sigmoid function). …

Go to article

First Prev Next Last