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

Physical Sciences and Mathematics Commons™

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

Research Collection School Of Computing and Information Systems

Series

2014

Articles 31 - 60 of 335

Full-Text Articles in Physical Sciences and Mathematics

Online Passive Aggressive Active Learning And Its Applications, Jing Lu, Peilin Zhao, Steven C. H. Hoi Nov 2014

Online Passive Aggressive Active Learning And Its Applications, Jing Lu, Peilin Zhao, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

We investigate online active learning techniques for classification tasks in data stream mining applications. Unlike traditional learning approaches (either batch or online learning) that often require to request the class label of each incoming instance, online active learning queries only a subset of informative incoming instances to update the classification model, which aims to maximize classification performance using minimal human labeling effort during the entire online stream data mining task. In this paper, we present a new family of algorithms for online active learning called Passive-Aggressive Active (PAA) learning algorithms by adapting the popular Passive-Aggressive algorithms in an online active …

Go to article

Combining Multiple Kernel Methods On Riemannian Manifold For Emotion Recognition In The Wild, M. Liu, R. Wang, S. Li, S. Shan, Zhiwu Huang, X. Chen Nov 2014

Combining Multiple Kernel Methods On Riemannian Manifold For Emotion Recognition In The Wild, M. Liu, R. Wang, S. Li, S. Shan, Zhiwu Huang, X. Chen

Research Collection School Of Computing and Information Systems

In this paper, we present the method for our submission to the Emotion Recognition in the Wild Challenge (EmotiW 2014). The challenge is to automatically classify the emotions acted by human subjects in video clips under realworld environment. In our method, each video clip can be represented by three types of image set models (i.e. linear subspace, covariance matrix, and Gaussian distribution) respectively, which can all be viewed as points residing on some Riemannian manifolds. Then different Riemannian kernels are employed on these set models correspondingly for similarity/distance measurement. For classification, three types of classifiers, i.e. kernel SVM, logistic regression, …

Go to article

Celelabel: An Interactive System For Annotating Celebrities In Web Videos, Zhineng Chen, Jinfeng Bai, Chong-Wah Ngo, Bailan Feng, Bo Xu Nov 2014

Celelabel: An Interactive System For Annotating Celebrities In Web Videos, Zhineng Chen, Jinfeng Bai, Chong-Wah Ngo, Bailan Feng, Bo Xu

Research Collection School Of Computing and Information Systems

Manual annotation of celebrities in Web videos is an essential task in many people-related Web services. The task, however, poses a significant challenge even to skillful annotators, mainly due to the large quantity of unfamiliar and greatly varied celebrities, and the lack of a customized system for it. This work develops CeleLabel, an interactive system for manually annotating celebrities in the Web video domain. The peculiarity of CeleLabel is to exploit and display multiple types of information that could assist the annotation, including video content, context surrounding and within a video, celebrity images on the Web, and human factors. Using …

Go to article

Organizing Video Search Results To Adapted Semantic Hierarchies For Topic-Based Browsing, Jiajun Wang, Yu-Gang Jiang, Qiang Wang, Kuiyuan Yang, Chong-Wah Ngo Nov 2014

Organizing Video Search Results To Adapted Semantic Hierarchies For Topic-Based Browsing, Jiajun Wang, Yu-Gang Jiang, Qiang Wang, Kuiyuan Yang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Organizing video search results into semantically structured hierarchies can greatly improve the efficiency of browsing complex query topics. Traditional hierarchical clustering techniques are inadequate since they lack the ability to generate semantically interpretable structures. In this paper, we introduce an approach to organize video search results to an adapted semantic hierarchy. As many hot search topics such as celebrities and famous cities have Wikipedia pages where hierarchical topic structures are available, we start from the Wikipedia hierarchies and adjust the structures according to the characteristics of the returned videos from a search engine. Ordinary clustering based on textual information of …

Go to article

Vireo @ Trecvid 2014: Instance Search And Semantic Indexing, Wei Zhang, Hao Zhang, Ting Yao, Yijie Lu, Jingjing Chen, Chong-Wah Ngo Nov 2014

Vireo @ Trecvid 2014: Instance Search And Semantic Indexing, Wei Zhang, Hao Zhang, Ting Yao, Yijie Lu, Jingjing Chen, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

This paper summarizes the following two tasks participated by VIREO group: instance search and semantic indexing. We will present our approaches and analyze the results obtained in TRECVID 2014 benchmark evaluation

Go to article

Vireo-Tno @ Trecvid 2014: Multimedia Event Detection And Recounting (Med And Mer), Chong-Wah Ngo, Yi-Jie Lu, Hao Zhang, Ting Yao, Chun-Chet Tan, Lei Pang, Maaike De Boer, John Schavemaker, Klamer Schutte, Wessel Kraaij Nov 2014

Vireo-Tno @ Trecvid 2014: Multimedia Event Detection And Recounting (Med And Mer), Chong-Wah Ngo, Yi-Jie Lu, Hao Zhang, Ting Yao, Chun-Chet Tan, Lei Pang, Maaike De Boer, John Schavemaker, Klamer Schutte, Wessel Kraaij

Research Collection School Of Computing and Information Systems

This paper presents an overview and comparative analysis of our systems designed for TRECVID 2014 [1] multimedia event detection (MED) and recounting (MER) tasks, including all sub-tasks for Pre-Specified (PS) event detection, all sub-tasks except 100Ex for Ad-Hoc (AH) event detection, and 010Ex sub-task for both PS and AH event recounting. Multimedia Event Detection (MED) : Our main focus for the MED task is on the study of a new zero-example system, which aims to solve the 000Ex and SQ problems. The system can run either fully automatically or semi-automatically. Specifically, we test the automatic run in 000Ex submission and …

Go to article

Web Application Vulnerability Prediction Using Hybrid Program Analysis And Machine Learning, Lwin Khin Shar, Lionel Briand, Hee Beng Kuan Tan Nov 2014

Web Application Vulnerability Prediction Using Hybrid Program Analysis And Machine Learning, Lwin Khin Shar, Lionel Briand, Hee Beng Kuan Tan

Research Collection School Of Computing and Information Systems

Due to limited time and resources, web software engineers need support in identifying vulnerable code. A practical approach to predicting vulnerable code would enable them to prioritize security auditing efforts. In this paper, we propose using a set of hybrid (staticþdynamic) code attributes that characterize input validation and input sanitization code patterns and are expected to be significant indicators of web application vulnerabilities. Because static and dynamic program analyses complement each other, both techniques are used to extract the proposed attributes in an accurate and scalable way. Current vulnerability prediction techniques rely on the availability of data labeled with vulnerability …

Go to article

Perspectives On Task Ownership In Mobile Operating System Development [Invited Talk], Subhajit Datta Nov 2014

Perspectives On Task Ownership In Mobile Operating System Development [Invited Talk], Subhajit Datta

Research Collection School Of Computing and Information Systems

There can be little contention about Stroustrup's epigrammatic remark: our civilization runs on software. However a caveat is increasingly due, much of the software that runs our civilization, runs on mobile devices today. Mobile operating systems have come to play a preeminent role in the ubiquity and utility of such devices. The development ecosystem of Android - one of the most popular mobile operating systems - presents an interesting context for studying whether and how collaboration dynamics in mobile development differ from conventional software development. In this paper, we examine factors that influence task ownership in Android development. Our results …

Go to article

Modloc: Localizing Multiple Objects In Dynamic Indoor Environment, Xiaonan Guo, Dian Zhang, Kaishun Wu, Lionel M. Ni Nov 2014

Modloc: Localizing Multiple Objects In Dynamic Indoor Environment, Xiaonan Guo, Dian Zhang, Kaishun Wu, Lionel M. Ni

Research Collection School Of Computing and Information Systems

Radio frequency (RF) based technologies play an important role in indoor localization, since Radio Signal Strength (RSS) can be easily measured by various wireless devices without additional cost. Among these, radio map based technologies (also referred as fingerprinting technologies) are attractive due to high accuracy and easy deployment. However, these technologies have not been extensively applied on real environment for two fatal limitations. First, it is hard to localize multiple objects. When the number of target objects is unknown, constructing a radio map of multiple objects is almost impossible. Second, environment changes will generate different multipath signals and severely disturb …

Go to article

Exploiting Geographical Neighborhood Characteristics For Location Recommendation, Yong Liu, Wei Wei, Aixin Sun, Chunyan Miao Nov 2014

Exploiting Geographical Neighborhood Characteristics For Location Recommendation, Yong Liu, Wei Wei, Aixin Sun, Chunyan Miao

Research Collection School Of Computing and Information Systems

Geographical characteristics derived from the historical check-in data have been reported effective in improving location recommendation accuracy. However, previous studies mainly exploit geographical characteristics from a user’s perspective, via modeling the geographical distribution of each individual user’s check-ins. In this paper, we are interested in exploiting geographical characteristics from a location perspective, by modeling the geographical neighborhood of a location. The neighborhood is modeled at two levels: the instance-level neighborhood defined by a few nearest neighbors of the location, and the region-level neighborhood for the geographical region where the location exists. We propose a novel recommendation approach, namely Instance-Region Neighborhood …

Go to article

Deep Learning For Content-Based Image Retrieval: A Comprehensive Study, Ji Wan, Dayong Wang, Steven C. H. Hoi, Pengcheng Wu, Jianke Zhu, Yongdong Zhang, Jintao Li Nov 2014

Deep Learning For Content-Based Image Retrieval: A Comprehensive Study, Ji Wan, Dayong Wang, Steven C. H. Hoi, Pengcheng Wu, Jianke Zhu, Yongdong Zhang, Jintao Li

Research Collection School Of Computing and Information Systems

Learning effective feature representations and similarity measures are crucial to the retrieval performance of a content-based image retrieval (CBIR) system. Despite extensive research efforts for decades, it remains one of the most challenging open problems that considerably hinders the successes of real-world CBIR systems. The key challenge has been attributed to the well-known "semantic gap" issue that exists between low-level image pixels captured by machines and high-level semantic concepts perceived by human. Among various techniques, machine learning has been actively investigated as a possible direction to bridge the semantic gap in the long term. Inspired by recent successes of deep …

Go to article

Historical Traffic-Tolerant Paths In Road Networks, Pui Hang Li, Man Lung Yiu, Kyriakos Mouratidis Nov 2014

Historical Traffic-Tolerant Paths In Road Networks, Pui Hang Li, Man Lung Yiu, Kyriakos Mouratidis

Research Collection School Of Computing and Information Systems

Historical traffic information is valuable for transportation analysis and planning, as well as for route search services. In view of these applications, we propose the k traffic-tolerant paths problem (TTP) on road networks, which takes a source-destination pair and historical traffic information as input, and returns k paths that minimize the aggregate (historical) travel time. Unlike the shortest path problem, the TTP problem has a combinatorial search space that renders the optimal solution expensive to compute. We propose an exact algorithm and a heuristic algorithm for this problem. Experiments on real traffic data demonstrate the effectiveness of TTP paths and …

Go to article

Dynamic Clustering Of Contextual Multi-Armed Bandits, Trong T. Nguyen, Hady W. Lauw Nov 2014

Dynamic Clustering Of Contextual Multi-Armed Bandits, Trong T. Nguyen, Hady W. Lauw

Research Collection School Of Computing and Information Systems

With the prevalence of the Web and social media, users increasingly express their preferences online. In learning these preferences, recommender systems need to balance the trade-off between exploitation, by providing users with more of the "same", and exploration, by providing users with something "new" so as to expand the systems' knowledge. Multi-armed bandit (MAB) is a framework to balance this trade-off. Most of the previous work in MAB either models a single bandit for the whole population, or one bandit for each user. We propose an algorithm to divide the population of users into multiple clusters, and to customize the …

Go to article

Generative Modeling Of Entity Comparisons In Text, Maksim Tkachenko, Hady W. Lauw Nov 2014

Generative Modeling Of Entity Comparisons In Text, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Users frequently rely on online reviews for decision making. In addition to allowing users to evaluate the quality of individual products, reviews also support comparison shopping. One key user activity is to compare two (or more) products based on a specific aspect. However, making a comparison across two different reviews, written by different authors, is not always equitable due to the different standards and preferences of individual authors. Therefore, we focus instead on comparative sentences, whereby two products are compared directly by a review author within a single sentence. We study the problem of comparative relation mining. Given a set …

Go to article

Buglocalizer: Integrated Tool Support For Bug Localization, Ferdian Thung, Tien-Duy B. Le, Pavneet Singh Kochhar, David Lo Nov 2014

Buglocalizer: Integrated Tool Support For Bug Localization, Ferdian Thung, Tien-Duy B. Le, Pavneet Singh Kochhar, David Lo

Research Collection School Of Computing and Information Systems

To manage bugs that appear in a software, developers often make use of a bug tracking system such as Bugzilla. Users can report bugs that they encounter in such a system. Whenever a user reports a new bug report, developers need to read the summary and description of the bug report and manually locate the buggy files based on this information. This manual process is often time consuming and tedious. Thus, a number of past studies have proposed bug localization techniques to automatically recover potentially buggy files from bug reports. Unfortunately, none of these techniques are integrated to bug tracking …

Go to article

A First Look At Global News Coverage Of Disasters By Using The Gdelt Dataset, Haewoon Kwak, Jisun. An Nov 2014

A First Look At Global News Coverage Of Disasters By Using The Gdelt Dataset, Haewoon Kwak, Jisun. An

Research Collection School Of Computing and Information Systems

In this work, we reveal the structure of global news coverage of disasters and its determinants by using a large-scale news coverage dataset collected by the GDELT (Global Data on Events, Location, and Tone) project that monitors news media in over 100 languages from the whole world. Significant variables in our hierarchical (mixed-effect) regression model, such as population, political stability, damage, and more, are well aligned with a series of previous research. However, we find strong regionalism in news geography, highlighting the necessity of comprehensive datasets for the study of global news coverage.

Go to article

Scalable Visual Instance Mining With Threads Of Features, Wei Zhang, Hongzhi Li, Chong-Wah Ngo, Shih-Fu Chang Nov 2014

Scalable Visual Instance Mining With Threads Of Features, Wei Zhang, Hongzhi Li, Chong-Wah Ngo, Shih-Fu Chang

Research Collection School Of Computing and Information Systems

We address the problem of visual instance mining, which is to extract frequently appearing visual instances automatically from a multimedia collection. We propose a scalable mining method by exploiting Thread of Features (ToF). Specifically, ToF, a compact representation that links consistent features across images, is extracted to reduce noises, discover patterns, and speed up processing. Various instances, especially small ones, can be discovered by exploiting correlated ToFs. Our approach is significantly more effective than other methods in mining small instances. At the same time, it is also more efficient by requiring much fewer hash tables. We compared with several state-of-the-art …

Go to article

Semantics-Aware Android Malware Classification Using Weighted Contextual Api Dependency Graphs, Mu Zhang, Yue Duan, Heng Yin, Zhiruo Zhao Nov 2014

Semantics-Aware Android Malware Classification Using Weighted Contextual Api Dependency Graphs, Mu Zhang, Yue Duan, Heng Yin, Zhiruo Zhao

Research Collection School Of Computing and Information Systems

The drastic increase of Android malware has led to a strong interest in developing methods to automate the malware analysis process. Existing automated Android malware detection and classification methods fall into two general categories: 1) signature-based and 2) machine learning-based. Signature-based approaches can be easily evaded by bytecode-level transformation attacks. Prior learning-based works extract features from application syntax, rather than program semantics, and are also subject to evasion. In this paper, we propose a novel semantic-based approach that classifies Android malware via dependency graphs. To battle transformation attacks, we extract a weighted contextual API dependency graph as program semantics to …

Go to article

The Evolution Of Research On Multimedia Travel Guide Search And Recommender Systems, Junge Shen, Zhiyong Cheng, Jialie Shen, Tao Mei, Xinbo Gao Nov 2014

The Evolution Of Research On Multimedia Travel Guide Search And Recommender Systems, Junge Shen, Zhiyong Cheng, Jialie Shen, Tao Mei, Xinbo Gao

Research Collection School Of Computing and Information Systems

The importance of multimedia travel guide search and recommender systems has led to a substantial amount of research spanning different computer science and information system disciplines in recent years. The five core research streams we identify here incorporate a few multimedia computing and information retrieval problems that relate to the alternative perspectives of algorithm design for optimizing search/recommendation quality and different methodological paradigms to assess system performance at large scale. They include (1) query analysis, (2) diversification based on different criteria, (3) ranking and reranking, (4) personalization and (5) evaluation. Based on a comprehensive discussion and analysis of these streams, …

Go to article

Stopwatch: A Cloud Architecture For Timing Channel Mitigation, Peng Li, Debin Gao, Michael K Reiter Nov 2014

Stopwatch: A Cloud Architecture For Timing Channel Mitigation, Peng Li, Debin Gao, Michael K Reiter

Research Collection School Of Computing and Information Systems

This article presents StopWatch, a system that defends against timing-based side-channel attacks that arise from coresidency of victims and attackers in infrastructure-as-a-service clouds. StopWatch triplicates each cloud-resident guest virtual machine (VM) and places replicas so that the three replicas of a guest VM are coresident with nonoverlapping sets of (replicas of) other VMs. StopWatch uses the timing of I/O events at a VM’s replicas collectively to determine the timings observed by each one or by an external observer, so that observable timing behaviors are similarly likely in the absence of any other individual, coresident VMs. We detail the design and …

Go to article

Cama: Efficient Modeling Of The Capture Effect For Low Power Wireless Networks, Behnam Dezfouli, Marjan Radi, Kamin Whitehouse, Shukor Abd Razak, Hwee-Pink Tan Nov 2014

Cama: Efficient Modeling Of The Capture Effect For Low Power Wireless Networks, Behnam Dezfouli, Marjan Radi, Kamin Whitehouse, Shukor Abd Razak, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

Network simulation is an essential tool for the design and evaluation of wireless network protocols, and realistic channel modeling is essential for meaningful analysis. Recently, several network protocols have demonstrated substantial network performance improvements by exploiting the capture effect, but existing models of the capture effect are still not adequate for protocol simulation and analysis. Physical-level models that calculate the signal-to-interference-plus-noise ratio (SINR) for every incoming bit are too slow to be used for large-scale or long-term networking experiments, and link-level models such as those currently used by the NS2 simulator do not accurately predict protocol performance. In this article, …

Go to article

Managing Seller Heterogeneity In A Competitive Marketplace, R. Wu, Mei Lin Nov 2014

Managing Seller Heterogeneity In A Competitive Marketplace, R. Wu, Mei Lin

Research Collection School Of Computing and Information Systems

The growth of online marketplaces is accompanied by significant heterogeneity of the third-party sellers. The marketplace owner often applies policies that favor the sellers who offer higher values to buyers, which puts the lower-value sellers at an even greater disadvantage. This leads to the phenomenon of Matthew Effect. Our study focuses on a marketplace owner’s policy in managing seller heterogeneity and analyzes Matthew Effect in a competitive market environment. By extending the circular city model, we analytically examine the price competition among a large number of sellers that differ both in variety and in their value offerings. We present the …

Go to article

K-Sketch: Digital Storytelling With Animation Sketches, Richard Christopher Davis, Nur Camellia Binte Zakaria Nov 2014

K-Sketch: Digital Storytelling With Animation Sketches, Richard Christopher Davis, Nur Camellia Binte Zakaria

Research Collection School Of Computing and Information Systems

K-Sketch gives novice animators an easy way to tell stories with animation sketches. It relies on users’ intuitive sense of space and time, and makes animation easy through the use of sketching and demonstration. Our studies have shown that people take naturally to telling stories with K-Sketch, and it is particularly helpful for exploring the timing of events. We also found that K-Sketch is a good collaborative medium for telling stories. In this demonstration we will show how K-Sketch works and explain how these advantages are realized in practice.

Go to article

Imagespirit: Verbal Guided Image Parsing, Ming-Ming Cheng, Shuai Zheng, Wen-Yan Lin, Vibhav Vineet, Paul Sturgess, Nigel Crook, Niloy J. Mitra, Philip Torr Nov 2014

Imagespirit: Verbal Guided Image Parsing, Ming-Ming Cheng, Shuai Zheng, Wen-Yan Lin, Vibhav Vineet, Paul Sturgess, Nigel Crook, Niloy J. Mitra, Philip Torr

Research Collection School Of Computing and Information Systems

Humans describe images in terms of nouns and adjectives while algorithms operate on images represented as sets of pixels. Bridging this gap between how humans would like to access images versus their typical representation is the goal of image parsing, which involves assigning object and attribute labels to pixels. In this article we propose treating nouns as object labels and adjectives as visual attribute labels. This allows us to formulate the image parsing problem as one of jointly estimating per-pixel object and attribute labels from a set of training images. We propose an efficient (interactive time) solution. Using the extracted …

Go to article

Rapid: A Toolkit For Reliability Analysis Of Non-Deterministic Systems, Lin Gui, Jun Sun, Yang Liu, Truong Khanh Nguyen, Jin Song Dong Dong Nov 2014

Rapid: A Toolkit For Reliability Analysis Of Non-Deterministic Systems, Lin Gui, Jun Sun, Yang Liu, Truong Khanh Nguyen, Jin Song Dong Dong

Research Collection School Of Computing and Information Systems

Non-determinism in concurrent or distributed software systems (i.e., various possible execution orders among different distributed components) presents new challenges to the existing reliability analysis methods based on Markov chains. In this work, we present a toolkit RaPiD for the reliability analysis of non-deterministic systems. Taking Markov decision process as reliability model, RaPiD can help in the analysis of three fundamental and rewarding aspects regarding software reliability. First, to have reliability assurance on a system, RaPiD can synthesize the overall system reliability given the reliability values of system components. Second, given a requirement on the overall system reliability, RaPiD can distribute …

Go to article

An Ecological Model For Digital Platforms Maintenance And Evolution, Paolo Rocchi, Paolo Spagnoletti, Subhajit Datta Nov 2014

An Ecological Model For Digital Platforms Maintenance And Evolution, Paolo Rocchi, Paolo Spagnoletti, Subhajit Datta

Research Collection School Of Computing and Information Systems

The maintenance of software products has been studied extensively in both software engineering and management information systems. Such studies are mainly focused on the activities that take place prior to starting the maintenance phase. Their contribution is either related to the improvement of software quality or to validating contingency models for reducing maintenance efforts. The continuous maintenance philosophy suggests to shift the attention within the maintenance phase for better coping with the evolutionary trajectories of digital platforms. In this paper, we examine the maintenance process of a digital platform from the perspective of the software vendor. Based on our empirical …

Go to article

Player Acceptance Of Human Computation Games: An Aesthetic Perspective, Xiaohui Wang, Dion Hoe Lian Goh, Ee Peng Lim, Adrian Wei Liang Vu Nov 2014

Player Acceptance Of Human Computation Games: An Aesthetic Perspective, Xiaohui Wang, Dion Hoe Lian Goh, Ee Peng Lim, Adrian Wei Liang Vu

Research Collection School Of Computing and Information Systems

Human computation games (HCGs) are applications that use games to harness human intelligence to perform computations that cannot be effectively done by software systems alone. Despite their increasing popularity, insufficient research has been conducted to examine the predictors of player acceptance for HCGs. In particular, prior work underlined the important role of game enjoyment in predicting acceptance of entertainment technology without specifying its driving factors. This study views game enjoyment through a taxonomy of aesthetic experiences and examines the effect of aesthetic experience, usability and information quality on player acceptance of HCGs. Results showed that aesthetic experience and usability were …

Go to article

Grumon: Fast And Accurate Group Monitoring For Heterogeneous Urban Spaces, Rijurekha Sen, Youngki Lee, Kasthuri Jayarajah, Rajesh Krishna Balan, Archan Misra Nov 2014

Grumon: Fast And Accurate Group Monitoring For Heterogeneous Urban Spaces, Rijurekha Sen, Youngki Lee, Kasthuri Jayarajah, Rajesh Krishna Balan, Archan Misra

Research Collection School Of Computing and Information Systems

Real-time monitoring of groups and their rich contexts will be a key building block for futuristic, group-aware mobile services. In this paper, we propose GruMon, a fast and accurate group monitoring system for dense and complex urban spaces. GruMon meets the performance criteria of precise group detection at low latencies by overcoming two critical challenges of practical urban spaces, namely (a) the high density of crowds, and (b) the imprecise location information available indoors. Using a host of novel features extracted from commodity smartphone sensors, GruMon can detect over 80% of the groups, with 97% precision, using 10 minutes latency …

Go to article

Band Selection For Hyperspectral Images Using Probabilistic Memetic Algorithm, Liang Feng, Ah-Hwee Tan, Meng-Hiot Lim, Si Wei Jiang Nov 2014

Band Selection For Hyperspectral Images Using Probabilistic Memetic Algorithm, Liang Feng, Ah-Hwee Tan, Meng-Hiot Lim, Si Wei Jiang

Research Collection School Of Computing and Information Systems

Band selection plays an important role in identifying the most useful and valuable information contained in the hyperspectral images for further data analysis such as classification, clustering, etc. Memetic algorithm (MA), among other metaheuristic search methods, has been shown to achieve competitive performances in solving the NP-hard band selection problem. In this paper, we propose a formal probabilistic memetic algorithm for band selection, which is able to adaptively control the degree of global exploration against local exploitation as the search progresses. To verify the effectiveness of the proposed probabilistic mechanism, empirical studies conducted on five well-known hyperspectral images against two …

Go to article

Online Transfer Learning, Peilin Zhao, Steven C. H. Hoi, Jialei Wang, Bin Li Nov 2014

Online Transfer Learning, Peilin Zhao, Steven C. H. Hoi, Jialei Wang, Bin Li

Research Collection School Of Computing and Information Systems

This paper investigates a new machine learning framework of Online Transfer Learning (OTL), which aims to attack an online learning task on a target domain by transferring knowledge from some source domain. We do not assume data in the target domain follows the same distribution as that in the source domain, and the motivation of our work is to enhance a supervised online learning task on a target domain by exploiting the existing knowledge that had been learnt from training data in source domains. OTL is in general a challenging problem since data in both source and target domains not …

Go to article

First Prev Next Last