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

Databases and Information Systems Commons™

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

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 2101 - 2130 of 3560

Full-Text Articles in Databases and Information Systems

Did You Expect Your Users To Say This?: Distilling Unexpected Micro-Reviews For Venue Owners, Wen-Haw Chong, Bingtian Dai, Ee-Peng Lim Sep 2015

Did You Expect Your Users To Say This?: Distilling Unexpected Micro-Reviews For Venue Owners, Wen-Haw Chong, Bingtian Dai, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

With social media platforms such as Foursquare, users can now generate concise reviews, i.e. micro-reviews, about entities such as venues (or products). From the venue owner's perspective, analysing these micro-reviews will offer interesting insights, useful for event detection and customer relationship management. However not all micro-reviews are equally important, especially since a venue owner should already be familiar with his venue's primary aspects. Instead we envisage that a venue owner will be interested in micro-reviews that are unexpected to him. These can arise in many ways, such as users focusing on easily overlooked aspects (by the venue owner), making comparisons …

Go to article

Latent Factors Meet Homophily In Diffusion Modelling, Duc Minh Luu, Ee-Peng Lim Sep 2015

Latent Factors Meet Homophily In Diffusion Modelling, Duc Minh Luu, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Diffusion is an important dynamics that helps spreading information within an online social network. While there are already numerous models for single item diffusion, few have studied diffusion of multiple items, especially when items can interact with one another due to their inter-similarity. Moreover, the well-known homophily effect is rarely considered explicitly in the existing diffusion models. This work therefore fills this gap by proposing a novel model called Topic level Interaction Homophily Aware Diffusion (TIHAD) to include both latent factor level interaction among items and homophily factor in diffusion. The model determines item interaction based on latent factors and …

Go to article

Candy Crushing Your Sleep, Kasthuri Jeyarajah, Meeralakshi Radhakrishnan, Steven C. H. Hoi, Archan Misra Sep 2015

Candy Crushing Your Sleep, Kasthuri Jeyarajah, Meeralakshi Radhakrishnan, Steven C. H. Hoi, Archan Misra

Research Collection School Of Computing and Information Systems

Growing interest in quantified self has led to the popularity of lifelogging applications. In particular, health and wellness related applications have seen an upsurge with the advent of wearables such as the Fitbit. In this paper, we focus on the quality of sleep that directly impacts the overall wellness of individuals. In particular, in this work, we present a first of its kind study that (1) unobtrusively quantifies the quality of sleep and (2) seeks to identify attributing aspects of our daily lives such as an individual's usage of apps throughout the day and his/her physical environment that may affect …

Go to article

Multi-Factor Duplicate Question Detection In Stack Overflow, Yun Zhang, David Lo, Xin Xia, Jian Ling Sun Sep 2015

Multi-Factor Duplicate Question Detection In Stack Overflow, Yun Zhang, David Lo, Xin Xia, Jian Ling Sun

Research Collection School Of Computing and Information Systems

Stack Overflow is a popular on-line question and answer site for software developers to share their experience and expertise. Among the numerous questions posted in Stack Overflow, two or more of them may express the same point and thus are duplicates of one another. Duplicate questions make Stack Overflow site maintenance harder, waste resources that could have been used to answer other questions, and cause developers to unnecessarily wait for answers that are already available. To reduce the problem of duplicate questions, Stack Overflow allows questions to be manually marked as duplicates of others. Since there are thousands of questions …

Go to article

A Survey On Artificial Intelligence-Based Modeling Techniques For High Speed Milling Processes, Amin Jahromi Torabi, Meng Joo Er, Xiang Li, Beng Siong Lim, Lianyin Zhai, Richard Jayadi Oentaryo, Gan Oon Peen, Jacek M. Zurada Sep 2015

A Survey On Artificial Intelligence-Based Modeling Techniques For High Speed Milling Processes, Amin Jahromi Torabi, Meng Joo Er, Xiang Li, Beng Siong Lim, Lianyin Zhai, Richard Jayadi Oentaryo, Gan Oon Peen, Jacek M. Zurada

Research Collection School Of Computing and Information Systems

The process of high speed milling is regarded as one of the most sophisticated and complicated manufacturing operations. In the past four decades, many investigations have been conducted on this process, aiming to better understand its nature and improve the surface quality of the products as well as extending tool life. To achieve these goals, it is necessary to form a general descriptive reference model of the milling process using experimental data, thermomechanical analysis, statistical or artificial intelligence (AI) models. Moreover, increasing demands for more efficient milling processes, qualified surface finishing, and modeling techniques have propelled the development of more …

Go to article

Semi-Supervised Hashing With Semantic Confidence For Large Scale Visual Search, Yingwei Pan, Ting Yao, Houqiang Li, Chong-Wah Ngo, Tao Mei Aug 2015

Semi-Supervised Hashing With Semantic Confidence For Large Scale Visual Search, Yingwei Pan, Ting Yao, Houqiang Li, Chong-Wah Ngo, Tao Mei

Research Collection School Of Computing and Information Systems

Similarity search is one of the fundamental problems for large scale multimedia applications. Hashing techniques, as one popular strategy, have been intensively investigated owing to the speed and memory efficiency. Recent research has shown that leveraging supervised information can lead to high quality hashing. However, most existing supervised methods learn hashing function by treating each training example equally while ignoring the different semantic degree related to the label, i.e. semantic confidence, of different examples. In this paper, we propose a novel semi-supervised hashing framework by leveraging semantic confidence. Specifically, a confidence factor is first assigned to each example by neighbor …

Go to article

Tweet Sentiment: From Classification To Quantification, Wei Gao, Fabrizio Sebastiani Aug 2015

Tweet Sentiment: From Classification To Quantification, Wei Gao, Fabrizio Sebastiani

Research Collection School Of Computing and Information Systems

Sentiment classification has become a ubiquitous enabling technology in the Twittersphere, since classifying tweets according to the sentiment they convey towards a given entity (be it a product, a person, a political party, or a policy) has many applications in political science, social science, market research, and many others. In this paper we contend that most previous studies dealing with tweet sentiment classification (TSC) use a suboptimal approach. The reason is that the final goal of most such studies is not estimating the class label (e.g., Positive, Negative, or Neutral) of individual tweets, but estimating the relative frequency (a.k.a. "prevalence") …

Go to article

Gibberish, Assistant, Or Master? Using Tweets Linking To News For Extractive Single-Document Summarization, Zhongyu Wei, Wei Gao Aug 2015

Gibberish, Assistant, Or Master? Using Tweets Linking To News For Extractive Single-Document Summarization, Zhongyu Wei, Wei Gao

Research Collection School Of Computing and Information Systems

Single-document summarization is a challenging task. In this paper, we explore effective ways using the tweets linking to news for generating extractive summary of each document. We reveal the very basic value of tweets that can be utilized by regarding every tweet as a vote for candidate sentences. Base on such finding, we resort to unsupervised summarization models by leveraging the linking tweets to master the ranking of candidate extracts via random walk on a heterogeneous graph. The advantage is that we can use the linking tweets to opportunistically "supervise" the summarization with no need of reference summaries. Furthermore, we …

Go to article

Memes As Building Blocks: A Case Study On Evolutionary Optimization + Transfer Learning For Routing Problems, Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Ivor W. Tsang Aug 2015

Memes As Building Blocks: A Case Study On Evolutionary Optimization + Transfer Learning For Routing Problems, Liang Feng, Yew-Soon Ong, Ah-Hwee Tan, Ivor W. Tsang

Research Collection School Of Computing and Information Systems

A significantly under-explored area of evolutionary optimization in the literature is the study of optimization methodologies that can evolve along with the problems solved. Particularly, present evolutionary optimization approaches generally start their search from scratch or the ground-zero state of knowledge, independent of how similar the given new problem of interest is to those optimized previously. There has thus been the apparent lack of automated knowledge transfers and reuse across problems. Taking this cue, this paper presents a Memetic Computational Paradigm based on Evolutionary Optimization + Transfer Learning for search, one that models how human solves problems, and embarks on …

Go to article

Neural Modeling Of Sequential Inferences And Learning Over Episodic Memory, Budhitama Subagdja, Ah-Hwee Tan Aug 2015

Neural Modeling Of Sequential Inferences And Learning Over Episodic Memory, Budhitama Subagdja, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Episodic memory is a significant part of cognition for reasoning and decision making. Retrieval in episodic memory depends on the order relationships of memory items which provides flexibility in reasoning and inferences regarding sequential relations for spatio-temporal domain. However, it is still unclear how they are encoded and how they differ from representations in other types of memory like semantic or procedural memory. This paper presents a neural model of sequential representation and inferences on episodic memory. It contrasts with the common views on sequential representation in neural networks that instead of maintaining transitions between events to represent sequences, they …

Go to article

Fast Object Retrieval Using Direct Spatial Matching, Zhiyuan Zhong, Jianke Zhu, Steven C. H. Hoi Aug 2015

Fast Object Retrieval Using Direct Spatial Matching, Zhiyuan Zhong, Jianke Zhu, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

The conventional bag-of-visual-words (BoW) model is popular for the large-scale object retrieval system but suffers from the critical drawback of ignoring spatial information. RANSAC-based methods attempt to remedy this drawback, but often require traversing all the feature matches for each hypothesis, leading to the heavy computational cost which limits the number of gallery images to be verified for each online query. We propose an efficient direct spatial matching (DSM) approach to directly estimate the scale variation using region sizes, in which all feature matches voted for estimating geometric transformation. DSM is much faster than RANSAC-based methods and exhaustive enumeration approaches. …

Go to article

Fusing Heterogeneous Data For Alzheimer's Disease Classification, P. S. Pillai, Tze-Yun Leong Aug 2015

Fusing Heterogeneous Data For Alzheimer's Disease Classification, P. S. Pillai, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

In multi-view learning, multimodal representations of a real world object or situation are integrated to learn its overall picture. Feature sets from distinct data sources carry different, yet complementary, information which, if analysed together, usually yield better insights and more accurate results. Neuro-degenerative disorders such as dementia are characterized by changes in multiple biomarkers. This work combines the features from neuroimaging and cerebrospinal fluid studies to distinguish Alzheimer's disease patients from healthy subjects. We apply statistical data fusion techniques on 101 subjects from the Alzheimer's Disease Neuroimaging Initiative (ADNI) database. We examine whether fusion of biomarkers helps to improve diagnostic …

Go to article

On Mining Lifestyles From User Trip Data, Meng-Fen Chiang, Ee-Peng Lim Aug 2015

On Mining Lifestyles From User Trip Data, Meng-Fen Chiang, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

Large cities today are facing major challenges in planning and policy formulation to keep their growth sustainable. In this paper, we aim to gain useful insights about people living in a city by developing novel models to mine user lifestyles represented by the users' activity centers. Two models, namely ACMM and ACHMM, have been developed to learn the activity centers of each user using a large dataset of bus and subway train trips performed by passengers in Singapore. We show that ACHMM and ACMM yield similar accuracies in location prediction task. We also propose methods to automatically predict "home", "work" …

Go to article

Event Detection: Exploiting Socio-Physical Interactions In Physical Spaces, Kasthuri Jayarajah, Archan Misra, Xiao-Wen Ruan, Ee-Peng Lim Aug 2015

Event Detection: Exploiting Socio-Physical Interactions In Physical Spaces, Kasthuri Jayarajah, Archan Misra, Xiao-Wen Ruan, Ee-Peng Lim

Research Collection School Of Computing and Information Systems

This paper investigates how digital traces of people's movements and activities in the physical world (e.g., at college campuses and commutes) may be used to detect local, short-lived events in various urban spaces. Past work that use occupancy-related features can only identify high-intensity events (those that cause large-scale disruption in visit patterns). In this paper, we first show how longitudinal traces of the coordinated and group-based movement episodes obtained from individual-level movement data can be used to create a socio-physical network (with edges representing tie strengths among individuals based on their physical world movement & collocation behavior). We then investigate …

Go to article

Faitcrowd: Fine Grained Truth Discovery For Crowdsourced Data Aggregation, Fenglong Ma, Yaliang Li, Qi Li, Minghui Qiu, Jing Gao, Shi Zhi, Lu Su, Bo Zhao, Jiawei Han Aug 2015

Faitcrowd: Fine Grained Truth Discovery For Crowdsourced Data Aggregation, Fenglong Ma, Yaliang Li, Qi Li, Minghui Qiu, Jing Gao, Shi Zhi, Lu Su, Bo Zhao, Jiawei Han

Research Collection School Of Computing and Information Systems

In crowdsourced data aggregation task, there exist conflicts in the answers provided by large numbers of sources on the same set of questions. The most important challenge for this task is to estimate source reliability and select answers that are provided by high-quality sources. Existing work solves this problem by simultaneously estimating sources' reliability and inferring questions' true answers (i.e., the truths). However, these methods assume that a source has the same reliability degree on all the questions, but ignore the fact that sources' reliability may vary significantly among different topics. To capture various expertise levels on different topics, we …

Go to article

Event Identification And Analysis On Twitter, Qiming Diao Aug 2015

Event Identification And Analysis On Twitter, Qiming Diao

Dissertations and Theses Collection (Open Access)

With the rapid growth of social media, Twitter has become one of the most widely adopted platforms for people to post short and instant messages. Because of such wide adoption of Twitter, events like breaking news and release of popular videos can easily capture people’s attention and spread rapidly on Twitter. Therefore, the popularity and importance of an event can be approximately gauged by the volume of tweets covering the event. Moreover, the relevant tweets also reflect the public’s opinions and reactions to events. It is therefore very important to identify and analyze the events on Twitter. In this dissertation, …

Go to article

Efficacy Of Social Media Utilization By Public Accounting Firms: Findings And Directions For Future Research, B. Eschenbrenner, Fiona Fui-Hoon Nah, V. Telaprolu Aug 2015

Efficacy Of Social Media Utilization By Public Accounting Firms: Findings And Directions For Future Research, B. Eschenbrenner, Fiona Fui-Hoon Nah, V. Telaprolu

Research Collection School Of Computing and Information Systems

Social media presents a new platform for businesses to communicate and interact with others, both internally and externally. Social media may be utilized for activities such as sharing success stories and providing industry updates. Although a plethora of opportunities to achieve business objectives with social media usage exists, the efficacy of its use by public accounting firms is unclear. This article identifies the business objectives that Big 4 and second-tier firms are pursuing with social media. Primary business objectives being fulfilled by social media include Knowledge Sharing, Branding and Marketing, and Socialization and Onboarding. The findings suggest that Big 4 …

Go to article

Facilitating Image Search With A Scalable And Compact Semantic Mapping, Meng Wang, Weisheng Li, Dong Liu, Bingbing Ni, Jialie Shen, Shuicheng Yan Aug 2015

Facilitating Image Search With A Scalable And Compact Semantic Mapping, Meng Wang, Weisheng Li, Dong Liu, Bingbing Ni, Jialie Shen, Shuicheng Yan

Research Collection School Of Computing and Information Systems

This paper introduces a novel approach to facilitating image search based on a compact semantic embedding. A novel method is developed to explicitly map concepts and image contents into a unified latent semantic space for the representation of semantic concept prototypes. Then, a linear embedding matrix is learned that maps images into the semantic space, such that each image is closer to its relevant concept prototype than other prototypes. In our approach, the semantic concepts equated with query keywords and the images mapped into the vicinity of the prototype are retrieved by our scheme. In addition, a computationally efficient method …

Go to article

Topic Modeling With Document Relative Similarities, Jianguang Du, Jing Jiang, Dandan Song, Lejian Liao Jul 2015

Topic Modeling With Document Relative Similarities, Jianguang Du, Jing Jiang, Dandan Song, Lejian Liao

Research Collection School Of Computing and Information Systems

Topic modeling has been widely used in text mining. Previous topic models such as Latent Dirichlet Allocation (LDA) are successful in learning hidden topics but they do not take into account metadata of documents. To tackle this problem, many augmented topic models have been proposed to jointly model text and metadata. But most existing models handle only categorical and numerical types of metadata. We identify another type of metadata that can be more natural to obtain in some scenarios. These are relative similarities among documents. In this paper, we propose a general model that links LDA with constraints derived from …

Go to article

Business Intelligence, Data And Analytics, Singapore Management University Jul 2015

Business Intelligence, Data And Analytics, Singapore Management University

Perspectives@SMU

Data can be used to predict outcomes but quality data is essential

Go to article

Log-Euclidean Metric Learning On Symmetric Positive Definite Manifold With Application To Image Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Li, X. Chen Jul 2015

Log-Euclidean Metric Learning On Symmetric Positive Definite Manifold With Application To Image Set Classification, Zhiwu Huang, R. Wang, S. Shan, X. Li, X. Chen

Research Collection School Of Computing and Information Systems

The manifold of Symmetric Positive Definite (SPD) matrices has been successfully used for data representation in image set classification. By endowing the SPD manifold with Log-Euclidean Metric, existing methods typically work on vector-forms of SPD matrix logarithms. This however not only inevitably distorts the geometrical structure of the space of SPD matrix logarithms but also brings low efficiency especially when the dimensionality of SPD matrix is high. To overcome this limitation, we propose a novel metric learning approach to work directly on logarithms of SPD matrices. Specifically, our method aims to learn a tangent map that can directly transform the …

Go to article

Using Tweets To Help Sentence Compression For News Highlights Generation, Zhongyu Wei, Yang Liu, Chen Li, Wei Gao Jul 2015

Using Tweets To Help Sentence Compression For News Highlights Generation, Zhongyu Wei, Yang Liu, Chen Li, Wei Gao

Research Collection School Of Computing and Information Systems

We explore using relevant tweets of a given news article to help sentence compression for generating compressive news highlights. We extend an unsupervised dependency-tree based sentence compression approach by incorporating tweet information to weight the tree edge in terms of informativeness and syntactic importance. The experimental results on a public corpus that contains both news articles and relevant tweets show that our proposed tweets guided sentence compression method can improve the summarization performance significantly compared to the baseline generic sentence compression method.

Go to article

Personalized Sentiment Classification Based On Latent Individuality Of Microblog Users, Kaisong Song, Shi Feng, Wei Gao, Daling Wang, Ge Yu, Kam-Fai Wong Jul 2015

Personalized Sentiment Classification Based On Latent Individuality Of Microblog Users, Kaisong Song, Shi Feng, Wei Gao, Daling Wang, Ge Yu, Kam-Fai Wong

Research Collection School Of Computing and Information Systems

Sentiment expression in microblog posts often reflects user’s specific individuality due to different language habit, personal character, opinion bias and so on. Existing sentiment classification algorithms largely ignore such latent personal distinctions among different microblog users. Meanwhile, sentiment data of microblogs are sparse for individual users, making it infeasible to learn effective personalized classifier. In this paper, we propose a novel, extensible personalized sentiment classification method based on a variant of latent factor model to capture personal sentiment variations by mapping users and posts into a low-dimensional factor space. We alleviate the sparsity of personal texts by decomposing the posts …

Go to article

A Comparative Study Between Motivated Learning And Reinforcement Learning, James T. Graham, Janusz A. Starzyk, Zhen Ni, Haibo He, T.-H. Teng, Ah-Hwee Tan Jul 2015

A Comparative Study Between Motivated Learning And Reinforcement Learning, James T. Graham, Janusz A. Starzyk, Zhen Ni, Haibo He, T.-H. Teng, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

This paper analyzes advanced reinforcement learning techniques and compares some of them to motivated learning. Motivated learning is briefly discussed indicating its relation to reinforcement learning. A black box scenario for comparative analysis of learning efficiency in autonomous agents is developed and described. This is used to analyze selected algorithms. Reported results demonstrate that in the selected category of problems, motivated learning outperformed all reinforcement learning algorithms we compared with.

Go to article

An Adaptive Computational Model For Personalized Persuasion, Yilin Kang, Ah-Hwee Tan, Chunyan Miao Jul 2015

An Adaptive Computational Model For Personalized Persuasion, Yilin Kang, Ah-Hwee Tan, Chunyan Miao

Research Collection School Of Computing and Information Systems

While a variety of persuasion agents have been created and applied in different domains such as marketing, military training and health industry, there is a lack of a model which can provide a unified framework for different persuasion strategies. Specifically, persuasion is not adaptable to the individuals’ personal states in different situations. Grounded in the Elaboration Likelihood Model (ELM), this paper presents a computational model called Model for Adaptive Persuasion (MAP) for virtual agents. MAP is a semi-connected network model which enables an agent to adapt its persuasion strategies through feedback. We have implemented and evaluated a MAP-based virtual nurse …

Go to article

Structured Learning From Heterogeneous Behavior For Social Identity Linkage, Siyuan Liu, Shuhui Wang, Feida Zhu Jul 2015

Structured Learning From Heterogeneous Behavior For Social Identity Linkage, Siyuan Liu, Shuhui Wang, Feida Zhu

Research Collection School Of Computing and Information Systems

Social identity linkage across different social media platforms is of critical importance to business intelligence by gaining from social data a deeper understanding and more accurate profiling of users. In this paper, we propose a solution framework, HYDRA, which consists of three key steps: (I) we model heterogeneous behavior by long-term topical distribution analysis and multi-resolution temporal behavior matching against high noise and information missing, and the behavior similarity are described by multi-dimensional similarity vector for each user pair; (II) we build structure consistency models to maximize the structure and behavior consistency on users' core social structure across different platforms, …

Go to article

Fast Optimal Aggregate Point Search For A Merged Set On Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang Jul 2015

Fast Optimal Aggregate Point Search For A Merged Set On Road Networks, Weiwei Sun, Chong Chen, Baihua Zheng, Chunan Chen, Liang Zhu, Weimo Liu, Yan Huang

Research Collection School Of Computing and Information Systems

Aggregate nearest neighbor query, which returns an optimal target point that minimizes the aggregate distance for a given query point set, is one of the most important operations in spatial databases and their application domains. This paper addresses the problem of finding the aggregate nearest neighbor for a merged set that consists of the given query point set and multiple points needed to be selected from a candidate set, which we name as merged aggregate nearest neighbor(MANN) query. This paper proposes two algorithms to process MANN query on road networks when aggregate function is max. Then, we extend the algorithms …

Go to article

A Convolution Kernel Approach To Identifying Comparisons In Text, Maksim Tkachenko, Hady W. Lauw Jul 2015

A Convolution Kernel Approach To Identifying Comparisons In Text, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Comparisons in text, such as in online reviews, serve as useful decision aids. In this paper, we focus on the task of identifying whether a comparison exists between a specific pair of entity mentions in a sentence. This formulation is transformative, as previous work only seeks to determine whether a sentence is comparative, which is presumptuous in the event the sentence mentions multiple entities and is comparing only some, not all, of them. Our approach leverages not only lexical features such as salient words, but also structural features expressing the relationships among words and entity mentions. To model these features …

Go to article

Online Learning To Rank For Content-Based Image Retrieval, Ji Wan, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Xingyu Gao, Dayong Wang, Yongdong. Zhang, Jintao Li Jul 2015

Online Learning To Rank For Content-Based Image Retrieval, Ji Wan, Pengcheng Wu, Steven C. H. Hoi, Peilin Zhao, Xingyu Gao, Dayong Wang, Yongdong. Zhang, Jintao Li

Research Collection School Of Computing and Information Systems

A major challenge in Content-Based Image Retrieval (CBIR) is to bridge the semantic gap between low-level image contents and high-level semantic concepts. Although researchers have investigated a variety of retrieval techniques using different types of features and distance functions, no single best retrieval solution can fully tackle this challenge. In a real-world CBIR task, it is often highly desired to combine multiple types of different feature representations and diverse distance measures in order to close the semantic gap. In this paper, we investigate a new framework of learning to rank for CBIR, which aims to seek the optimal combination of …

Go to article

Solar: Scalable Online Learning Algorithms For Ranking, Jialei Wang, Ji Wan, Yongdong Zhang, Steven C. H. Hoi Jul 2015

Solar: Scalable Online Learning Algorithms For Ranking, Jialei Wang, Ji Wan, Yongdong Zhang, Steven C. H. Hoi

Research Collection School Of Computing and Information Systems

Traditional learning to rank methods learn ranking models from training data in a batch and offline learning mode, which suffers from some critical limitations, e.g., poor scalability as the model has to be retrained from scratch whenever new training data arrives. This is clearly nonscalable for many real applications in practice where training data often arrives sequentially and frequently. To overcome the limitations, this paper presents SOLAR- a new framework of Scalable Online Learning Algorithms for Ranking, to tackle the challenge of scalable learning to rank. Specifically, we propose two novel SOLAR algorithms and analyze their IR measure bounds theoretically. …

Go to article

First Prev Next Last