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

Numerical Analysis and Scientific Computing Commons™

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

Research Collection School Of Computing and Information Systems

Discipline
Keyword
Publication Year

Articles 451 - 480 of 1024

Full-Text Articles in Numerical Analysis and Scientific Computing

Discovering Burst Patterns Of Burst Topic In Twitter, Guozhong Dong, Wu Yang, Feida Zhu, Wei Wang Feb 2017

Discovering Burst Patterns Of Burst Topic In Twitter, Guozhong Dong, Wu Yang, Feida Zhu, Wei Wang

Research Collection School Of Computing and Information Systems

Twitter has become one of largest social networks for users to broadcast burst topics. There have been many studies on how to detect burst topics. However, mining burst patterns in burst topics has not been solved by the existing works. In this paper, we investigate the problem of mining burst patterns of burst topic in Twitter. A burst topic user graph model is proposed, which can represent the topology structure of burst topic propagation across a large number of Twitter users. Based on the model, hierarchical clustering is applied to cluster burst topics and reveal burst patterns from the macro …

Go to article

Seapot-Rl: Selective Exploration Algorithm For Policy Transfer In Rl, Akshay Narayan, Zhuoru Li, Tze-Yun Leong Feb 2017

Seapot-Rl: Selective Exploration Algorithm For Policy Transfer In Rl, Akshay Narayan, Zhuoru Li, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

We propose a new method for transferring a policy from a source task to a target task in model-based reinforcement learning. Our work is motivated by scenarios where a robotic agent operates in similar but challenging environments, such as hospital wards, differentiated by structural arrangements or obstacles, such as furniture. We address problems that require fast responses adapted from incomplete, prior knowledge of the agent in new scenarios. We present an efficient selective exploration strategy that maximally reuses the source task policy. Reuse efficiency is effected through identifying sub-spaces that are different in the target environment, thus limiting the exploration …

Go to article

Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang Feb 2017

Recurrent Neural Networks With Auxiliary Labels For Cross-Domain Opinion Target Extraction, Ying Ding, Jianfei Yu, Jing Jiang

Research Collection School Of Computing and Information Systems

Opinion target extraction is a fundamental task in opinion mining. In recent years, neural network based supervised learning methods have achieved competitive performance on this task. However, as with any supervised learning method, neural network based methods for this task cannot work well when the training data comes from a different domain than the test data. On the other hand, some rule-based unsupervised methods have shown to be robust when applied to different domains. In this work, we use rule-based unsupervised methods to create auxiliary labels and use neural network models to learn a hidden representation that works well for …

Go to article

Concept-Based Interactive Search System, Yi-Jie Lu, Phuong Anh Nguyen, Hao Zhang, Chong-Wah Ngo Jan 2017

Concept-Based Interactive Search System, Yi-Jie Lu, Phuong Anh Nguyen, Hao Zhang, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Our successful multimedia event detection system at TREC-VID 2015 showed its strength on handling complex concepts in a query. The system was based on a large number of pre-trained concept detectors for textual-to-visual relation. In this paper, we enhance the system by enabling human-in-the-loop. In order to facilitate a user to quickly find an information need, we incorporate concept screening, video reranking by highlighted concepts, relevance feedback and color sketch to refine a coarse retrieval result. The aim is to eventually come up with a system suitable for both Ad-hoc Video Search and Known-Item Search. In addition, as the increasing …

Go to article

The Habits Of Highly Effective Researchers: An Empirical Study, Subhajit Datta, Partha Basuchowdhuri, Surajit Acharya, Subhashis Majumder Jan 2017

The Habits Of Highly Effective Researchers: An Empirical Study, Subhajit Datta, Partha Basuchowdhuri, Surajit Acharya, Subhashis Majumder

Research Collection School Of Computing and Information Systems

Interest in the habits of influential individuals cuts across domains. As researchers, we are intrigued why few attain significant eminence in their fields, whereas many operate in obscurity. An empirical examination of this question has been made possible by the recent availability of large scale publication data. In this paper, we use information from the AMiner Paper Citation and Author Collaboration Networks to discern factors that relate to the impact of influential researchers across five domains in the computing discipline. We propose and apply a novel algorithm to identify influential vertices in co-authorship networks built from total corpora of 1,00,000+papers …

Go to article

Fine-Grained Sentiment Analysis Of Social Media With Emotion Sensing, Zhaoxia Wang, Chee Seng Chong, Landy Lan, Yinping Yang, Beng-Seng Ho, Joo Chuan Tong Jan 2017

Fine-Grained Sentiment Analysis Of Social Media With Emotion Sensing, Zhaoxia Wang, Chee Seng Chong, Landy Lan, Yinping Yang, Beng-Seng Ho, Joo Chuan Tong

Research Collection School Of Computing and Information Systems

Social media is arguably the richest source of human generated text input. Opinions, feedbacks and critiques provided by internet users reflect attitudes and sentiments towards certain topics, products, or services. The sheer volume of such information makes it effectively impossible for any group of persons to read through. Thus, social media sentiment analysis has become an important area of work to make sense of the social media talk. However, most existing sentiment analysis techniques focus only on the aggregate level, classifying sentiments broadly into positive, neutral or negative, and lack the capabilities to perform fine-grained sentiment analysis. This paper describes …

Go to article

Lexicon Knowledge Extraction With Sentiment Polarity Computation, Zhaoxia Wang, Vincent Joo Chuan Tong, Pingcheng Ruan, Fang Li Dec 2016

Lexicon Knowledge Extraction With Sentiment Polarity Computation, Zhaoxia Wang, Vincent Joo Chuan Tong, Pingcheng Ruan, Fang Li

Research Collection School Of Computing and Information Systems

Sentiment analysis is one of the most popular natural language processing techniques. It aims to identify the sentiment polarity (positive, negative, neutral or mixed) within a given text. The proper lexicon knowledge is very important for the lexicon-based sentiment analysis methods since they hinge on using the polarity of the lexical item to determine a text's sentiment polarity. However, it is quite common that some lexical items appear positive in the text of one domain but appear negative in another. In this paper, we propose an innovative knowledge building algorithm to extract sentiment lexicon knowledge through computing their polarity value …

Go to article

Domain Identification For Intention Posts On Online Social Media, Thai Le Luong, Quoc Tuan Truong, Hai-Trieu Dang, Xuan Hieu Phan Dec 2016

Domain Identification For Intention Posts On Online Social Media, Thai Le Luong, Quoc Tuan Truong, Hai-Trieu Dang, Xuan Hieu Phan

Research Collection School Of Computing and Information Systems

Today, more and more Internet users are willing to share their feeling, activities, and even their intention about what they plan to do on online social media. We can easily see posts like "I plan to buy an apartment this year", or "We are looking for a tour for 3 people to Nha Trang" on online forums or social networks. Recognizing those user intents on online social media is really useful for targeted advertising. However fully understanding user intents is a complicated and challenging process which includes three major stages: user intent filtering, intent domain identification, and intent parsing and …

Go to article

Finding Causality And Responsibility For Probabilistic Reverse Skyline Query Non-Answers, Yunjun Gao, Qing Liu, Gang Cheng, Linlin Zhou, Baihua Zheng Nov 2016

Finding Causality And Responsibility For Probabilistic Reverse Skyline Query Non-Answers, Yunjun Gao, Qing Liu, Gang Cheng, Linlin Zhou, Baihua Zheng

Research Collection School Of Computing and Information Systems

Causality and responsibility is an essential tool in the database community for providing intuitive explanations for answers/non-answers to queries. Causality denotes the causes for the answers/non-answers to queries, and responsibility represents the degree of a cause which reflects its influence on the answers/non-answers to queries. In this paper, we study the causality and responsibility problem (CRP) for the non-answers to probabilistic reverse skyline queries (PRSQ). We first formalize CRP on PRSQ, and then, we propose an efficient algorithm termed as CP to compute the causality and responsibility for the non-answers to PRSQ. CP first finds candidate causes, and then, it …

Go to article

Editorial: Trust Management For Multimedia Big Data, Zheng Yan, Jun Liu, Deng, Robert H., Francisco Herrera Nov 2016

Editorial: Trust Management For Multimedia Big Data, Zheng Yan, Jun Liu, Deng, Robert H., Francisco Herrera

Research Collection School Of Computing and Information Systems

No abstract provided.

Go to article

On Profiling Bots In Social Media, Richard J. Oentaryo, Arinto Murdopo, Philips K. Prasetyo, Ee Peng Lim Nov 2016

On Profiling Bots In Social Media, Richard J. Oentaryo, Arinto Murdopo, Philips K. Prasetyo, Ee Peng Lim

Research Collection School Of Computing and Information Systems

The popularity of social media platforms such as Twitter has led to the proliferation of automated bots, creating both opportunities and challenges in information dissemination, user engagements, and quality of services. Past works on profiling bots had been focused largely on malicious bots, with the assumption that these bots should be removed. In this work, however, we find many bots that are benign, and propose a new, broader categorization of bots based on their behaviors. This includes broadcast, consumption, and spam bots. To facilitate comprehensive analyses of bots and how they compare to human accounts, we develop a systematic profiling …

Go to article

Aspect-Based Helpfulness Prediction For Online Product Reviews, Yinfei Yang, Cen Chen, Forrest Sheng Bao Nov 2016

Aspect-Based Helpfulness Prediction For Online Product Reviews, Yinfei Yang, Cen Chen, Forrest Sheng Bao

Research Collection School Of Computing and Information Systems

Product reviews greatly influence purchase decisions in online shopping. A common burden of online shopping is that consumers have to search for the right answers through massive reviews, especially on popular products. Hence, estimating and predicting the helpfulness of reviews become important tasks to directly improve shopping experience. In this paper, we propose a new approach to helpfulness prediction by leveraging aspect analysis of reviews. Our hypothesis is that a helpful review will cover many aspects of a product at different emphasis levels. The first step to tackle this problem is to extract proper aspects. Because related products share common …

Go to article

Plackett-Luce Regression Mixture Model For Heterogeneous Rankings, Maksim Tkachenko, Hady W. Lauw Oct 2016

Plackett-Luce Regression Mixture Model For Heterogeneous Rankings, Maksim Tkachenko, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Learning to rank is an important problem in many scenarios, such as information retrieval, natural language processing, recommender systems, etc. The objective is to learn a function that ranks a number of instances based on their features. In the vast majority of the learning to rank literature, there is an implicit assumption that the population of ranking instances are homogeneous, and thus can be modeled by a single central ranking function. In this work, we are concerned with learning to rank for a heterogeneous population, which may consist of a number of sub-populations, each of which may rank objects dierently. …

Go to article

Tasker: Behavioral Insights Via Campus-Based Experimental Mobile Crowd-Sourcing, Thivya Kandappu, Nikita Jaiman, Randy Tandriansyah Daratan, Archan Misra, Shih-Fen Cheng, Cen Chen, Hoong Chuin Lau, Deepthi Chander, Koustuv Dasgupta Sep 2016

Tasker: Behavioral Insights Via Campus-Based Experimental Mobile Crowd-Sourcing, Thivya Kandappu, Nikita Jaiman, Randy Tandriansyah Daratan, Archan Misra, Shih-Fen Cheng, Cen Chen, Hoong Chuin Lau, Deepthi Chander, Koustuv Dasgupta

Research Collection School Of Computing and Information Systems

While mobile crowd-sourcing has become a game-changer for many urban operations, such as last mile logistics and municipal monitoring, we believe that the design of such crowdsourcing strategies must better accommodate the real-world behavioral preferences and characteristics of users. To provide a real-world testbed to study the impact of novel mobile crowd-sourcing strategies, we have designed, developed and experimented with a real-world mobile crowd-tasking platform on the SMU campus, called TA$Ker. We enhanced the TA$Ker platform to support several new features (e.g., task bundling, differential pricing and cheating analytics) and experimentally investigated these features via a two-month deployment of TA$Ker, …

Go to article

A Reinforcement Learning Framework For Trajectory Prediction Under Uncertainty And Budget Constraint, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau Sep 2016

A Reinforcement Learning Framework For Trajectory Prediction Under Uncertainty And Budget Constraint, Truc Viet Le, Siyuan Liu, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We consider the problem of trajectory prediction, where a trajectory is an ordered sequence of location visits and corresponding timestamps. The problem arises when an agent makes sequential decisions to visit a set of spatial locations of interest. Each location bears a stochastic utility and the agent has a limited budget to spend. Given the agent's observed partial trajectory, our goal is to predict the agent's remaining trajectory. We propose a solution framework to the problem that incorporates both the stochastic utility of each location and the budget constraint. We first cluster the agents into groups of homogeneous behaviors called …

Go to article

Unsupervised Multi-Graph Cross-Modal Hashing For Large-Scale Multimedia Retrieval, Liang Xie, Lei Zhu, Guoqi Chen Aug 2016

Unsupervised Multi-Graph Cross-Modal Hashing For Large-Scale Multimedia Retrieval, Liang Xie, Lei Zhu, Guoqi Chen

Research Collection School Of Computing and Information Systems

With the advance of internet and multimedia technologies, large-scale multi-modal representation techniques such as cross-modal hashing, are increasingly demanded for multimedia retrieval. In cross-modal hashing, three essential problems should be seriously considered. The first is that effective cross-modal relationship should be learned from training data with scarce label information. The second is that appropriate weights should be assigned for different modalities to reflect their importance. The last is the scalability of training process which is usually ignored by previous methods. In this paper, we propose Multi-graph Cross-modal Hashing (MGCMH) by comprehensively considering these three points. MGCMH is unsupervised method which …

Go to article

Probabilistic Robust Route Recovery With Spatio-Temporal Dynamics, Hao Wu, Jiangyun Mao, Weiwei Sun, Baihua Zheng, Hanyuan Zhang, Ziyang Chen, Wei Wang Aug 2016

Probabilistic Robust Route Recovery With Spatio-Temporal Dynamics, Hao Wu, Jiangyun Mao, Weiwei Sun, Baihua Zheng, Hanyuan Zhang, Ziyang Chen, Wei Wang

Research Collection School Of Computing and Information Systems

Vehicle trajectories are one of the most important data in location-based services. The quality of trajectories directly affects the services. However, in the real applications, trajectory data are not always sampled densely. In this paper, we study the problem of recovering the entire route between two distant consecutive locations in a trajectory. Most existing works solve the problem without using those informative historical data or solve it in an empirical way. We claim that a data-driven and probabilistic approach is actually more suitable as long as data sparsity can be well handled. We propose a novel route recovery system in …

Go to article

Singapore In Motion: Insights On Public Transport Service Level Through Farecard And Mobile Data Analytics, Hasan Poonawala, Vinay Kolar, Sebastien Blandin, Laura Wynter, Sambit Sahu Aug 2016

Singapore In Motion: Insights On Public Transport Service Level Through Farecard And Mobile Data Analytics, Hasan Poonawala, Vinay Kolar, Sebastien Blandin, Laura Wynter, Sambit Sahu

Research Collection School Of Computing and Information Systems

Given the changing dynamics of mobility patterns and rapid growth of cities, transport agencies seek to respond more rapidly to needs of the public with the goal of offering an effective and competitive public transport system. A more data-centric approach for transport planning is part of the evolution of this process. In particular, the vast penetration of mobile phones provides an opportunity to monitor and derive insights on transport usage. Real time and historical analyses of such data can give a detailed understanding of mobility patterns of people and also suggest improvements to current transit systems. On its own, however, …

Go to article

Where Is The Goldmine? Finding Promising Business Locations Through Facebook Data Analytics, Jovian Lin, Richard Oentaryo, Ee-Peng Lim, Casey Vu, Adrian Vu, Agus Kwee Jul 2016

Where Is The Goldmine? Finding Promising Business Locations Through Facebook Data Analytics, Jovian Lin, Richard Oentaryo, Ee-Peng Lim, Casey Vu, Adrian Vu, Agus Kwee

Research Collection School Of Computing and Information Systems

If you were to open your own cafe, would you not want to effortlessly identify the most suitable location to set up your shop? Choosing an optimal physical location is a critical decision for numerous businesses, as many factors contribute to the final choice of the location. In this paper, we seek to address the issue by investigating the use of publicly available Facebook Pages data-which include user "check-ins", types of business, and business locations-to evaluate a user-selected physical location with respect to a type of business. Using a dataset of 20,877 food businesses in Singapore, we conduct analysis of …

Go to article

Word Clouds With Latent Variable Analysis For Visual Comparison Of Documents, Tuan M. V. Le, Hady W. Lauw Jul 2016

Word Clouds With Latent Variable Analysis For Visual Comparison Of Documents, Tuan M. V. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Word cloud is a visualization form for text that is recognized for its aesthetic, social, and analytical values. Here, we are concerned with deepening its analytical value for visual comparison of documents. To aid comparative analysis of two or more documents, users need to be able to perceive similarities and differences among documents through their word clouds. However, as we are dealing with text, approaches that treat words independently may impede accurate discernment of similarities among word clouds containing different words of related meanings. We therefore motivate the principle of displaying related words in a coherent manner, and propose to …

Go to article

How Long Will This Live? Discovering The Lifespans Of Software Engineering Ideas, Subhajit Datta, Santonu Sarkar, A. S. M Sajeev Jun 2016

How Long Will This Live? Discovering The Lifespans Of Software Engineering Ideas, Subhajit Datta, Santonu Sarkar, A. S. M Sajeev

Research Collection School Of Computing and Information Systems

We all want to be associated with long lasting ideas; as originators, or at least, expositors. For a tyro researcher or a seasoned veteran, knowing how long an idea will remain interesting in the community is critical in choosing and pursuing research threads. In the physical sciences, the notion of half-life is often evoked to quantify decaying intensity. In this paper, we study a corpus of 19,000+ papers written by 21,000+ authors across 16 software engineering publication venues from 1975 to 2010, to empirically determine the half-life of software engineering research topics. In the absence of any consistent and well-accepted …

Go to article

An Experimental Investigation Of Product Competition And Marketing In Social Networks, Cen Chen, Zhiling Guo, Shih-Fen Cheng, Hoong Chuin Lau Jun 2016

An Experimental Investigation Of Product Competition And Marketing In Social Networks, Cen Chen, Zhiling Guo, Shih-Fen Cheng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

We conduct computational experiment using Facebook data to evaluate competing firms’ initial market seeding and subsequent targeted marketing strategies that influence consumers’ new product adoption decisions. We find that firms generally overspend their advertising budget in the market seeding phase. In the subsequent market advertising phase, a coupon strategy (equivalent to price discount) generally yields higher market share than the strategy of distributing free product samples. The effect is more significant when both price and product quality are low. We offer managerial insights into firms’ effective competition strategies for new product introduction in the presence of consumers’ word of mouth …

Go to article

#Greysanatomy Vs. #Yankees: Demographics And Hashtag Use On Twitter, Jisun An, Ingmar Weber May 2016

#Greysanatomy Vs. #Yankees: Demographics And Hashtag Use On Twitter, Jisun An, Ingmar Weber

Research Collection School Of Computing and Information Systems

Demographics, in particular, gender, age, and race, are a key predictor of human behavior. Despite the significant effect that demographics plays, most scientific studies using online social media do not consider this factor, mainly due to the lack of such information. In this work, we use state-of-the-art face analysis software to infer gender, age, and race from profile images of 350K Twitter users from New York. For the period from November 1, 2014 to October 31, 2015, we study which hashtags are used by different demographic groups. Though we find considerable overlap for the most popular hashtags, there are also …

Go to article

Euclidean Co-Embedding Of Ordinal Data For Multi-Type Visualization, Dung D. Le, Hady W. Lauw May 2016

Euclidean Co-Embedding Of Ordinal Data For Multi-Type Visualization, Dung D. Le, Hady W. Lauw

Research Collection School Of Computing and Information Systems

Embedding deals with reducing the high-dimensional representation of data into a low-dimensional representation. Previous work mostly focuses on preserving similarities among objects. Here, not only do we explicitly recognize multiple types of objects, but we also focus on the ordinal relationships across types. Collaborative Ordinal Embedding or COE is based on generative modelling of ordinal triples. Experiments show that COE outperforms the baselines on objective metrics, revealing its capacity for information preservation for ordinal data.

Go to article

Temporal Kernel Descriptors For Learning With Time-Sensitive Patterns, Doyen Sahoo, Abhishek Sharma, Hoi, Steven C. H., Peilin Zhao May 2016

Temporal Kernel Descriptors For Learning With Time-Sensitive Patterns, Doyen Sahoo, Abhishek Sharma, Hoi, Steven C. H., Peilin Zhao

Research Collection School Of Computing and Information Systems

Detecting temporal patterns is one of the most prevalent challenges while mining data. Often, timestamps or information about when certain instances or events occurred can provide us with critical information to recognize temporal patterns. Unfortunately, most existing techniques are not able to fully extract useful temporal information based on the time (especially at different resolutions of time). They miss out on 3 crucial factors: (i) they do not distinguish between timestamp features (which have cyclical or periodic properties) and ordinary features; (ii) they are not able to detect patterns exhibited at different resolutions of time (e.g. different patterns at the …

Go to article

Semantic Proximity Search On Graphs With Metagraph-Based Learning, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Kevin Chen-Chuan Chang, Xiao-Li Li May 2016

Semantic Proximity Search On Graphs With Metagraph-Based Learning, Yuan Fang, Wenqing Lin, Vincent W. Zheng, Min Wu, Kevin Chen-Chuan Chang, Xiao-Li Li

Research Collection School Of Computing and Information Systems

Given ubiquitous graph data such as the Web and social networks, proximity search on graphs has been an active research topic. The task boils down to measuring the proximity between two nodes on a graph. Although most earlier studies deal with homogeneous or bipartite graphs only, many real-world graphs are heterogeneous with objects of various types, giving rise to different semantic classes of proximity. For instance, on a social network two users can be close for different reasons, such as being classmates or family members, which represent two distinct classes of proximity. Thus, it becomes inadequate to only measure a …

Go to article

Joint Search By Social And Spatial Proximity [Extended Abstract], Kyriakos Mouratidis, Jing Li, Yu Tang, Nikos Mamoulis May 2016

Joint Search By Social And Spatial Proximity [Extended Abstract], Kyriakos Mouratidis, Jing Li, Yu Tang, Nikos Mamoulis

Research Collection School Of Computing and Information Systems

The diffusion of social networks introduces new challengesand opportunities for advanced services, especially so with their ongoingaddition of location-based features. We show how applications like company andfriend recommendation could significantly benefit from incorporating social andspatial proximity, and study a query type that captures these twofold semantics.We develop highly scalable algorithms for its processing, and use real socialnetwork data to empirically verify their efficiency and efficacy.

Go to article

A Core Task Abstraction Approach To Hierarchical Reinforcement Learning [Extended Abstract], Zhuoru Li, Akshay Narayan, Tze-Yun Leong May 2016

A Core Task Abstraction Approach To Hierarchical Reinforcement Learning [Extended Abstract], Zhuoru Li, Akshay Narayan, Tze-Yun Leong

Research Collection School Of Computing and Information Systems

We propose a new, core task abstraction (CTA) approach to learning the relevant transition functions in model-based hierarchical reinforcement learning. CTA exploits contextual independences of the state variables conditional on the task-specific actions; its promising performance is demonstrated through a set of benchmark problems.

Go to article

Mining And Clustering Mobility Evolution Patterns From Social Media For Urban Informatics, Chien-Cheng Chen, Meng-Fen Chiang, Wen-Chih Peng May 2016

Mining And Clustering Mobility Evolution Patterns From Social Media For Urban Informatics, Chien-Cheng Chen, Meng-Fen Chiang, Wen-Chih Peng

Research Collection School Of Computing and Information Systems

In this paper, given a set of check-in data, we aim at discovering representative daily movement behavior of users in a city. For example, daily movement behavior on a weekday may show users moving from one to another spatial region associated with time information. Since check-in data contain both spatial and temporal information, we propose a mobility evolution pattern to capture the daily movement behavior of users in a city. Furthermore, given a set of daily mobility evolution patterns, we formulate their similarity distances and then discover representative mobility evolution patterns via the clustering process. Representative mobility evolution patterns are …

Go to article

Context-Aware Advertisement Recommendation For High-Speed Social News Feeding, Yuchen Li, Dongxiang Zhang, Ziquan Lan, Kian-Lee Tan May 2016

Context-Aware Advertisement Recommendation For High-Speed Social News Feeding, Yuchen Li, Dongxiang Zhang, Ziquan Lan, Kian-Lee Tan

Research Collection School Of Computing and Information Systems

Social media advertising is a multi-billion dollar market and has become the major revenue source for Facebook and Twitter. To deliver ads to potentially interested users, these social network platforms learn a prediction model for each user based on their personal interests. However, as user interests often evolve slowly, the user may end up receiving repetitive ads. In this paper, we propose a context-aware advertising framework that takes into account the relatively static personal interests as well as the dynamic news feed from friends to drive growth in the ad click-through rate. To meet the real-time requirement, we first propose …

Go to article

First Prev Next Last