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

Discipline
Keyword
Publication Year
File Type

Articles 5431 - 5460 of 6891

Full-Text Articles in Physical Sciences and Mathematics

Revisiting Address Space Randomization, Zhi Wang, Renquan Cheng, Debin Gao Dec 2010

Revisiting Address Space Randomization, Zhi Wang, Renquan Cheng, Debin Gao

Research Collection School Of Computing and Information Systems

Address space randomization is believed to be a strong defense against memory error exploits. Many code and data objects in a potentially vulnerable program and the system could be randomized, including those on the stack and heap, base address of code, order of functions, PLT, GOT, etc. Randomizing these code and data objects is believed to be effective in obfuscating the addresses in memory to obscure locations of code and data objects. However, attacking techniques have advanced since the introduction of address space randomization. In particular, return-oriented programming has made attacks without injected code much more powerful than what they …

Go to article

Protecting And Restraining The Third Party In Rfid-Enabled 3pl Supply Chains, Shaoying Cai, Chunhua Su, Yingjiu Li, Robert H. Deng Dec 2010

Protecting And Restraining The Third Party In Rfid-Enabled 3pl Supply Chains, Shaoying Cai, Chunhua Su, Yingjiu Li, Robert H. Deng

Research Collection School Of Computing and Information Systems

“Symmetric secret”-based RFID systems are widely adopted in supply chains. In such RFID systems, a reader’s ability to identify a RFID tag relies on the possession of the tag’s secret which is usually only known by its owner. If a “symmetric secret”-based RFID system is deployed in third party logistics (3PL) supply chains, all the three parties (the sender of the goods, the receiver of the goods and the 3PL provider) should have a copy of those tags’ secrets to access the tags. In case the three parties in 3PL supply chain are not all honest, sharing the secrets among …

Go to article

Optimized Algorithms For Predictive Range And Knn Queries On Moving Objects, Rui Zhang, H.V. Jagadish, Bing Tian Dai, Kotagiri Ramamohanarao Dec 2010

Optimized Algorithms For Predictive Range And Knn Queries On Moving Objects, Rui Zhang, H.V. Jagadish, Bing Tian Dai, Kotagiri Ramamohanarao

Research Collection School Of Computing and Information Systems

There have been many studies on management of moving objects recently. Most of them try to optimize the performance of predictive window queries. However, not much attention is paid to two other important query types: the predictive range query and the predictive k nearest neighbor query. In this article, we focus on these two types of queries. The novelty of our work mainly lies in the introduction of the Transformed Minkowski Sum, which can be used to determine whether a moving bounding rectangle intersects a moving circular query region. This enables us to use the traditional tree traversal algorithms to …

Go to article

Evaluation Of Protein Backbone Alphabets : Using Predicted Local Structure For Fold Recognition, Kyong Jin Shim Dec 2010

Evaluation Of Protein Backbone Alphabets : Using Predicted Local Structure For Fold Recognition, Kyong Jin Shim

Research Collection School Of Computing and Information Systems

Optimally combining available information is one of the key challenges in knowledge-driven prediction techniques. In this study, we evaluate six Phi and Psi-based backbone alphabets. We show that the addition of predicted backbone conformations to SVM classifiers can improve fold recognition. Our experimental results show that the inclusion of predicted backbone conformations in our feature representation leads to higher overall accuracy compared to when using amino acid residues alone.

Go to article

Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner Dec 2010

Time Cost Evaluation For Executing Rfid Authentication Protocols, Kevin Chiew, Yingjiu Li, Tieyan Li, Robert H. Deng, Manfred Aigner

Research Collection School Of Computing and Information Systems

There are various reader/tag authentication protocols proposed for the security of RFID systems. Such a protocol normally contains several rounds of conversations between a tag and a reader and involves cryptographic operations at both reader and tag sides. Currently there is a lack of benchmarks that provide a fair comparison platform for (a) the time cost of cryptographic operations at the tag side and (b) the time cost of data exchange between a reader and a tag, making it impossible to evaluate the total time cost for executing a protocol. Based on our experiments implemented on IAIK UHF tag emulators …

Go to article

Sequence Alignment Based Analysis Of Player Behavior In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava Dec 2010

Sequence Alignment Based Analysis Of Player Behavior In Massively Multiplayer Online Role-Playing Games (Mmorpgs), Kyong Jin Shim, Jaideep Srivastava

Research Collection School Of Computing and Information Systems

This study proposes a sequence alignment-based behavior analysis framework (SABAF) developed for predicting inactive game players that either leave the game permanently or stop playing the game for a long period of time. Sequence similarity scores and derived statistics form profile databases of inactive players and active players from the past. SABAF uses global and local sequence alignment algorithms and a unique scoring scheme to measure similarity between activity sequences. SABAF is tested on the game player activity data of Ever Quest II, a popular massively multiplayer online role-playing game developed by Sony Online Entertainment. SABAF consists of the following …

Go to article

Exploiting Intensity Inhomogeneity To Extract Textured Objects From Natural Scenes, Jundi Ding, Jialie Shen, Hwee Hwa Pang, Songcan Chen, Jingyu Yang Dec 2010

Exploiting Intensity Inhomogeneity To Extract Textured Objects From Natural Scenes, Jundi Ding, Jialie Shen, Hwee Hwa Pang, Songcan Chen, Jingyu Yang

Research Collection School Of Computing and Information Systems

Extracting textured objects from natural scenes is a challenging task in computer vision. The main difficulties arise from the intrinsic randomness of natural textures and the high-semblance between the objects and the background. In this paper, we approach the extraction problem with a seeded region-growing framework that purely exploits the statistical properties of intensity inhomogeneity. The pixels in the interior of potential textured regions are first found as texture seeds in an unsupervised manner. The labels of the texture seeds are then propagated through their respective inhomogeneous neighborhoods, to eventually cover the different texture regions in the image. Extensive experiments …

Go to article

Opportunistic Routing In Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah Dec 2010

Opportunistic Routing In Wireless Sensor Networks Powered By Ambient Energy Harvesting, Zhi Ang Eu, Hwee-Pink Tan, Winston K. G. Seah

Research Collection School Of Computing and Information Systems

Energy consumption is an important issue in the design of wireless sensor networks (WSNs) which typically rely on portable energy sources like batteries for power. Recent advances in ambient energy harvesting technologies have made it possible for sensor nodes to be powered by ambient energy entirely without the use of batteries. However, since the energy harvesting process is stochastic, exact sleep-and-wakeup schedules cannot be determined in WSNs Powered solely using Ambient Energy Harvesters (WSN–HEAP). Therefore, many existing WSN routing protocols cannot be used in WSN–HEAP. In this paper, we design an opportunistic routing protocol (EHOR) for multi-hop WSN–HEAP. Unlike traditional …

Go to article

Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein Dec 2010

Map Estimation For Graphical Models By Likelihood Maximization, Akshat Kumar, Shlomo Zilberstein

Research Collection School Of Computing and Information Systems

Computing a maximum a posteriori (MAP) assignment in graphical models is a crucial inference problem for many practical applications. Several provably convergent approaches have been successfully developed using linear programming (LP) relaxation of the MAP problem. We present an alternative approach, which transforms the MAP problem into that of inference in a finite mixture of simple Bayes nets. We then derive the Expectation Maximization (EM) algorithm for this mixture that also monotonically increases a lower bound on the MAP assignment until convergence. The update equations for the EM algorithm are remarkably simple, both conceptually and computationally, and can be implemented …

Go to article

A Structure First Image Inpainting Approach Based On Self-Organizing Map (Som), Bo Chen, Zhaoxia Wang, Ming Bai, Quan Wang, Zhen Sun Dec 2010

A Structure First Image Inpainting Approach Based On Self-Organizing Map (Som), Bo Chen, Zhaoxia Wang, Ming Bai, Quan Wang, Zhen Sun

Research Collection School Of Computing and Information Systems

This paper presents a structure first image inpainting method based on self-organizing map (SOM). SOM is employed to find the useful structure information of the damaged image. The useful structure information which includes relevant edges of the image is used to simulate the structure information of the lost or damaged area in the image. The structure information is described by distinct or indistinct curves in an image in this paper. The obtained target curves separate the damaged area of the image into several parts. As soon as each part of the damaged image is restored respectively, the damaged image is …

Go to article

Automobile Exhaust Gas Detection Based On Fuzzy Temperature Compensation System, Zhiyong Wang, Hao Ding, Fufei Hao, Zhaoxia Wang, Zhen Sun, Shujin Li Dec 2010

Automobile Exhaust Gas Detection Based On Fuzzy Temperature Compensation System, Zhiyong Wang, Hao Ding, Fufei Hao, Zhaoxia Wang, Zhen Sun, Shujin Li

Research Collection School Of Computing and Information Systems

A temperature compensation scheme of detecting automobile exhaust gas based on fuzzy logic inference is presented in this paper. The principles of the infrared automobile exhaust gas analyzer and the influence of the environmental temperature on analyzer are discussed. A fuzzy inference system is designed to improve the measurement accuracy of the measurement equipment by reducing the measurement errors caused by environmental temperature. The case studies demonstrate the effectiveness of the proposed method. The fuzzy compensation scheme is promising as demonstrated by the simulation results in this paper.

Go to article

Arivu: Power-Aware Middleware For Multiplayer Mobile Games, Bhojan Anand, Karthik Thirugnanam, Thanh Long Le, Duc-Dung Pham, Akhihebbal L. Ananda, Rajesh Krishna Balan, Mun Choon Chan Nov 2010

Arivu: Power-Aware Middleware For Multiplayer Mobile Games, Bhojan Anand, Karthik Thirugnanam, Thanh Long Le, Duc-Dung Pham, Akhihebbal L. Ananda, Rajesh Krishna Balan, Mun Choon Chan

Research Collection School Of Computing and Information Systems

With the improved processing power, graphic quality and high-speed wireless connection in recent generations of mobile phone, it looks more attractive than ever to introduce networked games on these devices. While device features and application resource requirements are rapidly growing, the battery technologies are not growing at the same pace. Networked Mobile games are a class of application, which consume higher levels of energy, as they are naturally more computationally intensive and use hardware components including audio, display and network to their fullest capacities. Therefore, the main concern is the limitation of the battery power of such portable devices to …

Go to article

An Analytic Characterization Of Model Minimization In Factored Markov Decision Processes, Guo W., Tze-Yun Leong Nov 2010

An Analytic Characterization Of Model Minimization In Factored Markov Decision Processes, Guo W., Tze-Yun Leong

Research Collection School Of Computing and Information Systems

Model minimization in Factored Markov Decision Processes (FMDPs) is concerned with finding the most compact partition of the state space such that all states in the same block are action-equivalent. This is an important problem because it can potentially transform a large FMDP into an equivalent but much smaller one, whose solution can be readily used to solve the original model. Previous model minimization algorithms are iterative in nature, making opaque the relationship between the input model and the output partition. We demonstrate that given a set of well-defined concepts and operations on partitions, we can express the model minimization …

Go to article

Efficient Mining Of Multiple Partial Near-Duplicate Alignments By Temporal Network, Hung-Khoon Tan, Chong-Wah Ngo, Tat-Seng Chua Nov 2010

Efficient Mining Of Multiple Partial Near-Duplicate Alignments By Temporal Network, Hung-Khoon Tan, Chong-Wah Ngo, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

This paper considers the mining and localization of near-duplicate segments at arbitrary positions of partial near-duplicate videos in a corpus. Temporal network is proposed to model the visual-temporal consistency between video sequence by embedding temporal constraints as directed edges in the network. Partial alignment is then achieved through network flow programming. To handle multiple alignments, we consider two properties of network structure: conciseness and divisibility, to ensure that the mining is efficient and effective. Frame-level matching is further integrated in the temporal network for alignment verification. This results in an iterative alignment-verification procedure to fine tune the localization of near-duplicate …

Go to article

Vireo At Trecvid 2010: Semantic Indexing, Known-Item Search, And Content-Based Copy Detection, Chong-Wah Ngo, Shi-Ai Zhu, Hung-Khoon Tan, Wan-Lei Zhao Nov 2010

Vireo At Trecvid 2010: Semantic Indexing, Known-Item Search, And Content-Based Copy Detection, Chong-Wah Ngo, Shi-Ai Zhu, Hung-Khoon Tan, Wan-Lei Zhao

Research Collection School Of Computing and Information Systems

This paper presents our approaches and the comparative analysis of our results for the three TRECVID 2010 tasks that we participated in: semantic indexing, known-item search and content-based copy detection.

Go to article

Would Position Limits Have Made Any Difference To The 'Flash Crash' On May 6, 2010, Wing Bernard Lee, Shih-Fen Cheng, Annie Koh Nov 2010

Would Position Limits Have Made Any Difference To The 'Flash Crash' On May 6, 2010, Wing Bernard Lee, Shih-Fen Cheng, Annie Koh

Research Collection School Of Computing and Information Systems

On May 6, 2010, the US equity markets experienced a brief but highly unusual drop in prices across a number of stocks and indices. The Dow Jones Industrial Average (DJIA) fell by approximately 9% in a matter of minutes, and several stocks were traded down sharply before recovering a short time later. Earlier research by Lee, Cheng and Koh (2010) identified the conditions under which a “flash crash” can be triggered by systematic traders running highly similar trading strategies, especially when they are “crowding out” other liquidity providers in the market. The authors contend that the events of May 6, …

Go to article

Smu-Sis At Tac 2010 - Kbp Track Entity Linking, Swapna Gottipati, Jing Jiang Nov 2010

Smu-Sis At Tac 2010 - Kbp Track Entity Linking, Swapna Gottipati, Jing Jiang

Research Collection School Of Computing and Information Systems

Entity linking task is a process of linking the named entity within the unstructured text to the entity in the Knowledge Base. Entity liking to the relevant knowledge is useful in various information extraction and natural language processing applications that improve the user experiences such as search, summarization and so on. We propose the two way entity linking approach to reformulate query, disambiguate the entity and link to the relevant KB repository. This paper describes the details of our participation in TAC 2010 - Knowledge Base Population track. We provided an innovative approach to disambiguate the entity by query reformulation …

Go to article

Model Checking Hierarchical Probabilistic Systems, Jun Sun, Songzheng Song, Yang Liu Nov 2010

Model Checking Hierarchical Probabilistic Systems, Jun Sun, Songzheng Song, Yang Liu

Research Collection School Of Computing and Information Systems

Probabilistic modeling is important for random distributed algorithms, bio-systems or decision processes. Probabilistic model checking is a systematic way of analyzing finite-state probabilistic models. Existing probabilistic model checkers have been designed for simple systems without hierarchy. In this paper, we extend the PAT toolkit to support probabilistic model checking of hierarchical complex systems. We propose to use PCSP#, a combination of Hoare’s CSP with data and probability, to model such systems. In addition to temporal logic, we allow complex safety properties to be specified by non-probabilistic PCSP# model. Validity of the properties (with probability) is established by refinement checking. Furthermore, …

Go to article

The Impact Of Social Media On Software Engineering Practices And Tools, Margaret-Anne Storey, Christoph Treude, Arie Van Deursen, Li-Te Cheng Nov 2010

The Impact Of Social Media On Software Engineering Practices And Tools, Margaret-Anne Storey, Christoph Treude, Arie Van Deursen, Li-Te Cheng

Research Collection School Of Computing and Information Systems

Today's generation of software developers frequently make use of social media, either as an adjunct or integrated into a wide range of tools ranging from code editors and issue trackers, to IDEs and web-based portals. The role of social media usage in software engineering is not well understood, and yet the use of these mechanisms influences software development practices. In this position paper, we advocate for research that strives to understand the benefits, risks and limitations of using social media in software development at the team, project and community levels. Guided by the implications of current tools and social media …

Go to article

Evolution Of A Bluetooth Test Application Product Line: A Case Study, Narayanasamy Ramasubbu, Rajesh Krishna Balan Nov 2010

Evolution Of A Bluetooth Test Application Product Line: A Case Study, Narayanasamy Ramasubbu, Rajesh Krishna Balan

Research Collection School Of Computing and Information Systems

In this paper, we study the decision making process involved in the five year lifecycle of a Bluetooth software product produced by a large, multi-national test and measurement firm. In this environment, customer change requests either have to be added as a standard feature in the product, or developed as a special customized version of the product. We first discuss the influential factors, such as evolving standards, market share, installed-base, and complexity, which collectively determined how the firm responded to product change requests. We then develop a predictive decision model to test the collective impact of these factors on determining …

Go to article

Semi-Autonomous Virtual Valet Parking, Arne Suppe, Luis Navarro-Serment, Aaron Steinfeld Nov 2010

Semi-Autonomous Virtual Valet Parking, Arne Suppe, Luis Navarro-Serment, Aaron Steinfeld

Research Collection School Of Computing and Information Systems

Despite regulations specifying parking spots that support wheelchair vans, it is not uncommon for end users to encounter problems with clearance for van ramps. Even if a driver elects to park in the far reaches of a parking lot as a precautionary measure, there is no guarantee that the spot next to their van will be empty when they return. Likewise, the prevalence of older drivers who experience significant difficulty with ingress and egress from vehicles is nontrivial and the ability to fully open a car door is important. This work describes a method and user interaction for low cost, …

Go to article

Model Checking A Model Checker: A Code Contract Combined Approach, Jun Sun, Yang Liu, Bin Cheng Nov 2010

Model Checking A Model Checker: A Code Contract Combined Approach, Jun Sun, Yang Liu, Bin Cheng

Research Collection School Of Computing and Information Systems

Model checkers, like any complex software, are subject to bugs. Unlike ordinary software, model checkers are often used to verify safety critical systems. Their correctness is thus vital. Verifying model checkers is extremely challenging because they are always complicated in logic and highly optimized. In this work, we propose a code contract combined approach for checking model checkers and apply it to a home-grown model checker PAT. In this approach, we firstly embed programming contracts (i.e., pre/post-conditions and invariants) into its source code, which can capture correctness of model checking algorithms, underlying data structures, consistency between different model checking parameters, …

Go to article

Detecting Product Review Spammers Using Rating Behaviors, Ee Peng Lim, Viet-An Nguyen, Nitin Jindal, Bing Liu, Hady Wirawan Lauw Oct 2010

Detecting Product Review Spammers Using Rating Behaviors, Ee Peng Lim, Viet-An Nguyen, Nitin Jindal, Bing Liu, Hady Wirawan Lauw

Research Collection School Of Computing and Information Systems

This paper aims to detect users generating spam reviews or review spammers. We identify several characteristic be- haviors of review spammers and model these behaviors so as to detect the spammers. In particular, we seek to model the following behaviors. First, spammers may target specific products or product groups in order to maximize their im- pact. Second, they tend to deviate from the other reviewers in their ratings of products. We propose scoring methods to measure the degree of spam for each reviewer and apply them on an Amazon review dataset. We then select a sub- set of highly suspicious …

Go to article

Mining Collaboration Patterns From A Large Developer Network, Didi Surian, David Lo, Ee Peng Lim Oct 2010

Mining Collaboration Patterns From A Large Developer Network, Didi Surian, David Lo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

In this study, we extract patterns from a large developer collaborations network extracted from Source Forge. Net at high and low level of details. At the high level of details, we extract various network-level statistics from the network. At the low level of details, we extract topological sub-graph patterns that are frequently seen among collaborating developers. Extracting sub graph patterns from large graphs is a hard NP-complete problem. To address this challenge, we employ a novel combination of graph mining and graph matching by leveraging network-level properties of a developer network. With the approach, we successfully analyze a snapshot of …

Go to article

Secureangle: Improving Wireless Security Using Angle-Of-Arrival Information, Jie Xiong, Kyle Jamieson Oct 2010

Secureangle: Improving Wireless Security Using Angle-Of-Arrival Information, Jie Xiong, Kyle Jamieson

Research Collection School Of Computing and Information Systems

Wireless networks play an important role in our everyday lives, at the workplace and at home. However, they are also relatively vulnerable: physically located off site, attackers can circumvent wireless security protocols such as WEP, WPA, and even to some extent WPA2, presenting a security risk to the entire network. To address this problem, we propose SecureAngle, a system designed to operate alongside existing wireless security protocols, adding defense in depth. SecureAngle leverages multi-antenna APs to profile the directions at which a client's signal arrives, using this angle-of-arrival (AoA) information to construct signatures that uniquely identify each client. We identify …

Go to article

Attracting The Community's Many Eyes: An Exploration Of User Involvement In Issue Tracking, Lars Grammel, Holger Schackmann, Adrian Schröter, Christoph Treude, Margaret-Anne Storey Oct 2010

Attracting The Community's Many Eyes: An Exploration Of User Involvement In Issue Tracking, Lars Grammel, Holger Schackmann, Adrian Schröter, Christoph Treude, Margaret-Anne Storey

Research Collection School Of Computing and Information Systems

A community of users who report bugs and request features provides valuable feedback that can be used in product development. We compare the community involvement in issue tracker usage between the open source project Eclipse and the closed source project IBM Jazz to evaluate if publicly accessible issue trackers work as well in closed source projects. We find that IBM Jazz successfully receives user feedback through this channel. We then explore the differences in work item processing in IBM Jazz between team members, project members and externals. We conclude that making public issue trackers available in closed source projects is …

Go to article

Youth Olympic Village Co-Space, Zin-Yan Chua, Yilin Kang, Xing Jiang, Kah-Hoe Pang, Andrew C. Gregory, Chi-Yun Tan, Wai-Lun Wong, Ah-Hwee Tan, Yew-Soon Ong, Chunyan Miao Oct 2010

Youth Olympic Village Co-Space, Zin-Yan Chua, Yilin Kang, Xing Jiang, Kah-Hoe Pang, Andrew C. Gregory, Chi-Yun Tan, Wai-Lun Wong, Ah-Hwee Tan, Yew-Soon Ong, Chunyan Miao

Research Collection School Of Computing and Information Systems

We have designed and implemented a 3D virtual world based on the Co-Space concept encompasses the Youth Olympic Village (YOV) and several sports competition venues. It is a massively multiplayer online (MMO) virtual world built according to the actual, physical locations of the YOV and sports competition venues. On top of that, the Co-Space is being populated with human-like avatars, which are created according to the actual human size and appearance; they perform their activities and interact with the users in realworld context. In addition, autonomous intelligent agents are integrated into the Co-Space to provide context-aware and personalized services to …

Go to article

Wsm'10: Second Acm Workshop On Social Media, Susanne Boll, Steven C. H. Hoi, Roelof Van Zwol, Jiebo Luo Oct 2010

Wsm'10: Second Acm Workshop On Social Media, Susanne Boll, Steven C. H. Hoi, Roelof Van Zwol, Jiebo Luo

Research Collection School Of Computing and Information Systems

The ACM SIGMM International Workshop on Social Media (WSM'10) is the second workshop held in conjunction with the ACM International Multimedia Conference (MM'10) at Firenze, Italy, 2010. This workshop provides a forum for researchers and practitioners from all over the world to share information on their latest investigations on social media analysis, exploration, search, mining, and emerging new social media applications.

Go to article

Wireless Sensing Without Sensors: An Experimental Study Of Motion/Intrusion Detection Using Rf Irregularity, Wei Qi Lee, Winston K. G. Seah, Hwee-Pink Tan, Zexi Yao Oct 2010

Wireless Sensing Without Sensors: An Experimental Study Of Motion/Intrusion Detection Using Rf Irregularity, Wei Qi Lee, Winston K. G. Seah, Hwee-Pink Tan, Zexi Yao

Research Collection School Of Computing and Information Systems

Motion and intrusion detection are often cited as wireless sensor network (WSN) applications with typical configurations comprising clusters of wireless nodes equipped with motion sensors to detect human motion. Currently, WSN performance is subjected to several constraints, namely radio irregularity and finite on-board computation/energy resources. Radio irregularity in radio frequency (RF) propagation rises to a higher level in the presence of human activity due to the absorption effect of the human body. In this paper, we investigate the feasibility of monitoring RF transmission for the purpose of intrusion detection through experimentation. With empirical data obtained from the Crossbow TelosB platform …

Go to article

Online Multiple Kernel Learning: Algorithms And Mistake Bounds, Rong Jin, Steven C. H. Hoi, Tianbao Yang Oct 2010

Online Multiple Kernel Learning: Algorithms And Mistake Bounds, Rong Jin, Steven C. H. Hoi, Tianbao Yang

Research Collection School Of Computing and Information Systems

Online learning and kernel learning are two active research topics in machine learning. Although each of them has been studied extensively, there is a limited effort in addressing the intersecting research. In this paper, we introduce a new research problem, termed Online Multiple Kernel Learning (OMKL), that aims to learn a kernel based prediction function from a pool of predefined kernels in an online learning fashion. OMKL is generally more challenging than typical online learning because both the kernel classifiers and their linear combination weights must be learned simultaneously. In this work, we consider two setups for OMKL, i.e. combining …

Go to article

First Prev Next Last