Open Access. Powered by Scholars. Published by Universities.®
Numerical Analysis and Scientific Computing Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Databases and Information Systems (671)
- Social and Behavioral Sciences (173)
- Artificial Intelligence and Robotics (112)
- Communication (98)
- Social Media (87)
-
- Engineering (67)
- Business (65)
- Software Engineering (59)
- Operations Research, Systems Engineering and Industrial Engineering (54)
- Theory and Algorithms (51)
- Public Affairs, Public Policy and Public Administration (47)
- Transportation (40)
- Asian Studies (20)
- Graphics and Human Computer Interfaces (20)
- International and Area Studies (20)
- E-Commerce (19)
- Information Security (19)
- Medicine and Health Sciences (18)
- Education (17)
- Finance and Financial Management (14)
- Environmental Sciences (11)
- Computer Engineering (9)
- Data Science (9)
- Communication Technology and New Media (8)
- Educational Assessment, Evaluation, and Research (7)
- Health Information Technology (7)
- Higher Education (7)
- Keyword
-
- Social media (31)
- Data mining (28)
- Twitter (24)
- Machine learning (23)
- Query processing (19)
-
- Deep learning (17)
- Online learning (17)
- Classification (16)
- Sentiment analysis (16)
- Natural language processing (14)
- Neural networks (14)
- Feature extraction (13)
- Reinforcement learning (13)
- Algorithms (12)
- MITB student (12)
- Artificial intelligence (11)
- Text mining (11)
- Algorithm (10)
- Visualization (9)
- Analytics (8)
- Data structures (8)
- Spatial databases (8)
- Topic model (8)
- Clustering (7)
- Deep Learning (7)
- Location-based services (7)
- Mobile computing (7)
- Optimization (7)
- Recommender systems (7)
- Singapore (7)
- Publication Year
- Publication
- Publication Type
Articles 631 - 660 of 1060
Full-Text Articles in Numerical Analysis and Scientific Computing
Shortlisting Top-K Assignments, Yimin Lin, Kyriakos Mouratidis
Shortlisting Top-K Assignments, Yimin Lin, Kyriakos Mouratidis
Research Collection School Of Computing and Information Systems
In this paper we identify a novel query type, the top-K assignment query (αTop-K). Consider a set of objects and a set of suppliers, where each object must be assigned to one supplier. Assume that there is a cost associated with every object-supplier pair. If we allocate each object to the server with the smallest cost (for the specific object), the derived overall assignment will have the minimum total cost. In many scenarios, however, runner-up assignments may be required too, like for example when a decision maker needs to make additional considerations, not captured by individual object-supplier costs. In this …
Active Learning With Expert Advice, Peilin Zhao, Steven C. H. Hoi, Jinfeng Zhuang
Active Learning With Expert Advice, Peilin Zhao, Steven C. H. Hoi, Jinfeng Zhuang
Research Collection School Of Computing and Information Systems
Conventional learning with expert advice methods assumes a learner is always receiving the outcome (e.g., class labels) of every incoming training instance at the end of each trial. In real applications, acquiring the outcome from oracle can be costly or time consuming. In this paper, we address a new problem of active learning with expert advice, where the outcome of an instance is disclosed only when it is requested by the online learner. Our goal is to learn an accurate prediction model by asking the oracle the number of questions as small as possible. To address this challenge, we propose …
Reviving Dormant Ties In An Online Social Network Experiment, Ee Peng Lim, Denzil Correa, David Lo, Michael Finegold, Feida Zhu
Reviving Dormant Ties In An Online Social Network Experiment, Ee Peng Lim, Denzil Correa, David Lo, Michael Finegold, Feida Zhu
Research Collection School Of Computing and Information Systems
Social network users connect and interact with one another to fulfil different kinds of social and information needs. When interaction ceases between two users, we say that their tie becomes dormant. While there are different underlying reasons of dormant ties, it is important to find means to revive such ties so as to maintain vibrancy in the relationships. In this work, we thus focus on designing an online experiment to evaluate the effectiveness of personalized social messages to revive dormant ties. The experiment carefully selects users with dormant ties so that no user gets mixed treatments and be affected by …
A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery, Feida Zhu, Zequn Zhang, Qiang Qu
A Direct Mining Approach To Efficient Constrained Graph Pattern Discovery, Feida Zhu, Zequn Zhang, Qiang Qu
Research Collection School Of Computing and Information Systems
Despite the wealth of research on frequent graph pattern mining, how to efficiently mine the complete set of those with constraints still poses a huge challenge to the existing algorithms mainly due to the inherent bottleneck in the mining paradigm. In essence, mining requests with explicitly-specified constraints cannot be handled in a way that is direct and precise. In this paper, we propose a direct mining framework to solve the problem and illustrate our ideas in the context of a particular type of constrained frequent patterns — the “skinny” patterns, which are graph patterns with a long backbone from which …
Real Time Event Detection In Twitter, Xun Wang, Feida Zhu, Jing Jiang, Sujian Li
Real Time Event Detection In Twitter, Xun Wang, Feida Zhu, Jing Jiang, Sujian Li
Research Collection School Of Computing and Information Systems
Event detection has been an important task for a long time. When it comes to Twitter, new problems are presented. Twitter data is a huge temporal data flow with much noise and various kinds of topics. Traditional sophisticated methods with a high computational complexity aren’t designed to handle such data flow efficiently. In this paper, we propose a mixture Gaussian model for bursty word extraction in Twitter and then employ a novel time-dependent HDP model for new topic detection. Our model can grasp new events, the location and the time an event becomes bursty promptly and accurately. Experiments show the …
A Latent Variable Model For Viewpoint Discovery From Threaded Forum Posts, Minghui Qiu, Jing Jiang
A Latent Variable Model For Viewpoint Discovery From Threaded Forum Posts, Minghui Qiu, Jing Jiang
Research Collection School Of Computing and Information Systems
Threaded discussion forums provide an important social media platform. Its rich user generated content has served as an important source of public feedback. To automatically discover the viewpoints or stances on hot issues from forum threads is an important and useful task. In this paper, we propose a novel latent variable model for viewpoint discovery from threaded forum posts. Our model is a principled generative latent variable model which captures three important factors: viewpoint specific topic preference, user identity and user interactions. Evaluation results show that our model clearly outperforms a number of baseline models in terms of both clustering …
Mining User Relations From Online Discussions Using Sentiment Analysis And Probabilistic Matrix Factorization, Minghui Qiu, Liu Yang, Jing Jiang
Mining User Relations From Online Discussions Using Sentiment Analysis And Probabilistic Matrix Factorization, Minghui Qiu, Liu Yang, Jing Jiang
Research Collection School Of Computing and Information Systems
Advances in sentiment analysis have enabled extraction of user relations implied in online textual exchanges such as forum posts. However, recent studies in this direction only consider direct relation extraction from text. As user interactions can be sparse in online discussions, we propose to apply collaborative filtering through probabilistic matrix factorization to generalize and improve the opinion matrices extracted from forum posts. Experiments with two tasks show that the learned latent factor representation can give good performance on a relation polarity prediction task and improve the performance of a subgroup detection task.
Approximate Inference In Collective Graphical Models, Daniel Sheldon, Tao Sun, Akshat Kumar, Thomas G. Dietterich
Approximate Inference In Collective Graphical Models, Daniel Sheldon, Tao Sun, Akshat Kumar, Thomas G. Dietterich
Research Collection School Of Computing and Information Systems
We study the problem of approximate inference in collective graphical models (CGMs), which were recently introduced to model the problem of learning and inference with noisy aggregate observations. We first analyze the complexity of inference in CGMs: unlike inference in conventional graphical models, exact inference in CGMs is NP-hard even for tree-structured models. We then develop a tractable convex approximation to the NP-hard MAP inference problem in CGMs, and show how to use MAP inference for approximate marginal inference within the EM framework. We demonstrate empirically that these approximation techniques can reduce the computational cost of inference by two orders …
Introducing Programmers To Pair Programming: A Controlled Experiment, A. S. M. Sajeev, Subhajit Datta
Introducing Programmers To Pair Programming: A Controlled Experiment, A. S. M. Sajeev, Subhajit Datta
Research Collection School Of Computing and Information Systems
Pair programming is a key characteristic of the Extreme Programming (XP) method. Through a controlled experiment we investigate pair programming behaviour of programmers without prior experience in XP. The factors investigated are: (a) characteristics of pair programming that are less favored (b) perceptions of team effectiveness and how they relate to product quality, and (c) whether it is better to train a pair by giving routine tasks first or by giving complex tasks first. Our results show that: (a) the least liked aspects of pair programming were having to share the screen, keyboard and mouse, and having to switch between …
R-Energy For Evaluating Robustness Of Dynamic Networks, Ming Gao, Ee Peng Lim, David Lo
R-Energy For Evaluating Robustness Of Dynamic Networks, Ming Gao, Ee Peng Lim, David Lo
Research Collection School Of Computing and Information Systems
The robustness of a network is determined by how well its vertices are connected to one another so as to keep the network strong and sustainable. As the network evolves its robustness changes and may reveal events as well as periodic trend patterns that affect the interactions among users in the network. In this paper, we develop R-energy as a new measure of network robustness based on the spectral analysis of normalized Laplacian matrix. R-energy can cope with disconnected networks, and is efficient to compute with a time complexity of O (jV j + jEj) where V and E are …
Traditional Media Seen From Social Media, Jisun An, Daniele Quercia, Meeyoung Cha, Krishna Gummadi, Jon Crowcroft
Traditional Media Seen From Social Media, Jisun An, Daniele Quercia, Meeyoung Cha, Krishna Gummadi, Jon Crowcroft
Research Collection School Of Computing and Information Systems
With the advent of social media services, media outlets have started reaching audiences on social-networking sites. On Twitter, users actively follow a wide set of media sources, form interpersonal networks, and propagate interesting stories to their peers. These media subscription and interaction patterns, which had previously been hidden behind media corporations' databases, offer new opportunities to understand media supply and demand on a large scale. Through a map that connects 77 media outlets based on Twitter subscription patterns, we are able to answer a variety of questions: to what extent New York Times and the Wall Street Journal readers overlap? …
Fans: Face Annotation By Searching Large-Scale Web Facial Images, Steven Hoi, Dayong Wang, I Yeu Cheng, Elmer Lin, Jianke Zhu, Ying He, Chunyan Miao
Fans: Face Annotation By Searching Large-Scale Web Facial Images, Steven Hoi, Dayong Wang, I Yeu Cheng, Elmer Lin, Jianke Zhu, Ying He, Chunyan Miao
Research Collection School Of Computing and Information Systems
Auto face annotation is an important technique for many real-world applications, such as online photo album management, new video summarization, and so on. It aims to automatically detect human faces from a photo image and further name the faces with the corresponding human names. Recently, mining web facial images on the internet has emerged as a promising paradigm towards auto face annotation. In this paper, we present a demonstration system of search-based face annotation: FANS - Face ANnotation by Searching large-scale web facial images. Given a query facial image for annotation, we first retrieve a short list of the most …
Your Love Is Public Now: Questioning The Use Of Personal Information In Authentication, Payas Gupta, Swapna Gottipati, Jing Jiang, Debin Gao
Your Love Is Public Now: Questioning The Use Of Personal Information In Authentication, Payas Gupta, Swapna Gottipati, Jing Jiang, Debin Gao
Research Collection School Of Computing and Information Systems
Most social networking platforms protect user's private information by limiting access to it to a small group of members, typically friends of the user, while allowing (virtually) everyone's access to the user's public data. In this paper, we exploit public data available on Facebook to infer users' undisclosed interests on their profile pages. In particular, we infer their undisclosed interests from the public data fetched using Graph APIs provided by Facebook. We demonstrate that simply liking a Facebook page does not corroborate that the user is interested in the page. Instead, we perform sentiment-oriented mining on various attributes of a …
It Is Not Just What We Say, But How We Say Them: Lda-Based Behavior-Topic Model, Minghui Qiu, Feida Zhu, Jing Jiang
It Is Not Just What We Say, But How We Say Them: Lda-Based Behavior-Topic Model, Minghui Qiu, Feida Zhu, Jing Jiang
Research Collection School Of Computing and Information Systems
Textual information exchanged among users on online social network platforms provides deep understanding into users' interest and behavioral patterns. However, unlike traditional text-dominant settings such as o ine publishing, one distinct feature for online social network is users' rich interactions with the textual content, which, unfortunately, has not yet been well incorporated in the existing topic modeling frameworks. In this paper, we propose an LDA-based behavior-topic model (B-LDA) which jointly models user topic interests and behavioral patterns. We focus the study of the model on online social network settings such as microblogs like Twitter where the textual content is relatively …
Retweeting: An Act Of Viral Users, Susceptible Users, Or Viral Topics?, Tuan-Anh Hoang, Ee Peng Lim
Retweeting: An Act Of Viral Users, Susceptible Users, Or Viral Topics?, Tuan-Anh Hoang, Ee Peng Lim
Research Collection School Of Computing and Information Systems
When a user retweets, there are three behavioral factors that cause the actions. They are the topic virality, user virality and user susceptibility. Topic virality captures the degree to which a topic attracts retweets by users. For each topic, user virality and susceptibility refer to the likelihood that a user attracts retweets and performs retweeting respectively. To model a set of observed retweet data as a result of these three topic specific factors, we first represent the retweets as a three-dimensional tensor of the tweet authors, their followers, and the tweets themselves. We then propose the V 2S model, a …
Disclosing Climate Change Patterns Using An Adaptive Markov Chain Pattern Detection Method, Zhaoxia Wang, Gary Lee, Hoong Maeng Chan, Reuben Li, Xiuju Fu, Rick Goh, Pauline A. W. Poh Kim, Martin L. Hibberd, Hoong Chor Chin
Disclosing Climate Change Patterns Using An Adaptive Markov Chain Pattern Detection Method, Zhaoxia Wang, Gary Lee, Hoong Maeng Chan, Reuben Li, Xiuju Fu, Rick Goh, Pauline A. W. Poh Kim, Martin L. Hibberd, Hoong Chor Chin
Research Collection School Of Computing and Information Systems
This paper proposes an adaptive Markov chain pattern detection (AMCPD) method for disclosing the climate change patterns of Singapore through meteorological data mining. Meteorological variables, including daily mean temperature, mean dew point temperature, mean visibility, mean wind speed, maximum sustained wind speed, maximum temperature and minimum temperature are simultaneously considered for identifying climate change patterns in this study. The results depict various weather patterns from 1962 to 2011 in Singapore, based on the records of the Changi Meteorological Station. Different scenarios with varied cluster thresholds are employed for testing the sensitivity of the proposed method. The robustness of the proposed …
Vistruclizer: A Structural Visualizer For Multi-Dimensional Social Networks, Bingtian Dai, Agus Trisnajaya Kwee, Ee Peng Lim
Vistruclizer: A Structural Visualizer For Multi-Dimensional Social Networks, Bingtian Dai, Agus Trisnajaya Kwee, Ee Peng Lim
Research Collection School Of Computing and Information Systems
With the popularity of Web 2.0 sites, social networks today increasingly involve different kinds of relationships among different types of users in a single network. Such social networks are said to be multi-dimensional. Analyzing multi-dimensional networks is a challenging research task that requires intelligent visualization techniques. In this paper, we therefore propose a visual analytics tool called ViStruclizer to analyze structures embedded in a multi-dimensional social network. ViStruclizer incorporates structure analyzers that summarize social networks into both node clusters each representing a set of users, and edge clusters representing relationships between users in the node clusters. ViStruclizer supports user interactions …
Delayed Insertion And Rule Effect Moderation Of Domain Knowledge For Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan
Delayed Insertion And Rule Effect Moderation Of Domain Knowledge For Reinforcement Learning, Teck-Hou Teng, Ah-Hwee Tan
Research Collection School Of Computing and Information Systems
Though not a fundamental pre-requisite to efficient machine learning, insertion of domain knowledge into adaptive virtual agent is nonetheless known to improve learning efficiency and reduce model complexity. Conventionally, domain knowledge is inserted prior to learning. Despite being effective, such approach may not always be feasible. Firstly, the effect of domain knowledge is assumed and can be inaccurate. Also, domain knowledge may not be available prior to learning. In addition, the insertion of domain knowledge can frame learning and hamper the discovery of more effective knowledge. Therefore, this work advances the use of domain knowledge by proposing to delay the …
Roundtriprank: Graph-Based Proximity With Importance And Specificity, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw
Roundtriprank: Graph-Based Proximity With Importance And Specificity, Yuan Fang, Kevin Chen-Chuan Chang, Hady W. Lauw
Research Collection School Of Computing and Information Systems
Graph-based proximity has many applications with different ranking needs. However, most previous works only stress the sense of importance by finding "popular” results for a query. Often times important results are overly general without being well-tailored to the query, lacking a sense of specificity— which only emerges recently. Even then, the two senses are treated independently, and only combined empirically. In this paper, we generalize the well-studied importance-based random walk into a round trip and develop RoundTripRank, seamlessly integrating specificity and importance in one coherent process. We also recognize the need for a flexible trade-off between the two senses, and …
Dynamic Label Propagation In Social Networks, Juan Du, Feida Zhu, Ee Peng Lim
Dynamic Label Propagation In Social Networks, Juan Du, Feida Zhu, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Label propagation has been studied for many years, starting from a set of nodes with labels and then propagating to those without labels. In social networks, building complete user profiles like interests and affiliations contributes to the systems like link prediction, personalized feeding, etc. Since the labels for each user are mostly not filled, we often employ some people to label these users. And therefore, the cost of human labeling is high if the data set is large. To reduce the expense, we need to select the optimal data set for labeling, which produces the best propagation result. In this …
Finding The Optimal Social Trust Path For The Selection Of Trustworthy Service Providers In Complex Social Networks, Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee Peng Lim
Finding The Optimal Social Trust Path For The Selection Of Trustworthy Service Providers In Complex Social Networks, Guanfeng Liu, Yan Wang, Mehmet A. Orgun, Ee Peng Lim
Research Collection School Of Computing and Information Systems
Online social networks have provided the infrastructure for a number of emerging applications in recent years, e.g., for the recommendation of service providers or the recommendation of files as services. In these applications, trust is one of the most important factors in decision making by a service consumer, requiring the evaluation of the trustworthiness of a service provider along the social trust paths from a service consumer to the service provider. However, there are usually many social trust paths between two participants who are unknown to one another. In addition, some social information, such as social relationships between participants and …
Image Collection Summarization Via Dictionary Learning For Sparse Representation, Chunlei Yang, Jialie Shen, Jinye Peng, Jianping Fan
Image Collection Summarization Via Dictionary Learning For Sparse Representation, Chunlei Yang, Jialie Shen, Jinye Peng, Jianping Fan
Research Collection School Of Computing and Information Systems
In this paper, a novel approach is developed to achieve automatic image collection summarization. The effectiveness of the summary is reflected by its ability to reconstruct the original set or each individual image in the set. We have leveraged the dictionary learning for sparse representation model to construct the summary and to represent the image. Specifically we reformulate the summarization problem into a dictionary learning problem by selecting bases which can be sparsely combined to represent the original image and achieve a minimum global reconstruction error, such as MSE (Mean Square Error). The resulting “Sparse Least Square” problem is NP-hard, …
Structures Of Broken Ties: Exploring Unfollow Behavior On Twitter, Bo Xu, Yun Huang, Haewoon Kwak
Structures Of Broken Ties: Exploring Unfollow Behavior On Twitter, Bo Xu, Yun Huang, Haewoon Kwak
Research Collection School Of Computing and Information Systems
This study investigates unfollow behavior in Twitter, i.e. people removing others from their Twitter following lists. Considering the interdependency and dynamics of unfollow decisions, we use actor-oriented modeling (SIENA) to examine the impacts of reciprocity, status, embeddedness, homophily, and informativeness on tie dissolution. Focusing on ordinary users in tightly-knitted user groups, the results show that relational properties play key roles in the emergence of unfollow behavior: mutual following relations and common followees reduce the likelihood of unfollowing. And unfollow tends to be reciprocal: when a user is unfollowed by someone, he or she will unfollow back. However, there is no …
Online Multi-Modal Distance Learning For Scalable Multimedia Retrieval, Hao Xia, Pengcheng Wu, Steven C. H. Hoi
Online Multi-Modal Distance Learning For Scalable Multimedia Retrieval, Hao Xia, Pengcheng Wu, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
In many real-word scenarios, e.g., multimedia applications, data often originates from multiple heterogeneous sources or are represented by diverse types of representation, which is often referred to as "multi-modal data". The definition of distance between any two objects/items on multi-modal data is a key challenge encountered by many real-world applications, including multimedia retrieval. In this paper, we present a novel online learning framework for learning distance functions on multi-modal data through the combination of multiple kernels. In order to attack large-scale multimedia applications, we propose Online Multi-modal Distance Learning (OMDL) algorithms, which are significantly more efficient and scalable than the …
Utility Of Potential Misdiagnoses In Predicting Foodborne Outbreaks, Lucia Lucia, Artur Dubrawski, Lujie Chen
Utility Of Potential Misdiagnoses In Predicting Foodborne Outbreaks, Lucia Lucia, Artur Dubrawski, Lujie Chen
Research Collection School Of Computing and Information Systems
To investigate utility of using inpatient and emergency room diagnoses to detect outbreaks of Salmonellosis in humans. To quantify the impact of including in the analysis cases diagnosed with conditions that may have physiological appearance similar to Salmonellosis.
Hypergraph Index: An Index For Context-Aware Nearest Neighbor Query On Social Networks, Yazhe Wang, Baihua Zheng
Hypergraph Index: An Index For Context-Aware Nearest Neighbor Query On Social Networks, Yazhe Wang, Baihua Zheng
Research Collection School Of Computing and Information Systems
Social network has been touted as the No. 2 innovation in a recent IEEE Spectrum Special Report on “Top 11 Technologies of the Decade”, and it has cemented its status as a bona fide Internet phenomenon. With more and more people starting using social networks to share ideas, activities, events, and interests with other members within the network, social networks contain a huge amount of content. However, it might not be easy to navigate social networks to find specific information. In this paper, we define a new type of queries, namely context-aware nearest neighbor (CANN) search over social network to …
Towards Next-Generation Multimedia Recommendation Systems, Jialie Shen, Shuicheng Yan, Xian-Sheng Hua
Towards Next-Generation Multimedia Recommendation Systems, Jialie Shen, Shuicheng Yan, Xian-Sheng Hua
Research Collection School Of Computing and Information Systems
Empowered by advances in information technology, such as social media network, digital library and mobile computing, there emerges an ever-increasing amounts of multimedia data. As the key technology to address the problem of information overload, multimedia recommendation system has been received a lot of attentions from both industry and academia. This course aims to 1) provide a series of detailed review of state-of-the-art in multimedia recommendation; 2) analyze key technical challenges in developing and evaluating next generation multimedia recommendation systems from different perspectives and 3) give some predictions about the road lies ahead of us.
Cqarank: Jointly Model Topics And Expertise In Community Question Answering, Liu Yang, Minghui Qiu, Swapna Gottopati, Feida Zhu, Jing Jiang, Huiping Sun, Zhong Chen
Cqarank: Jointly Model Topics And Expertise In Community Question Answering, Liu Yang, Minghui Qiu, Swapna Gottopati, Feida Zhu, Jing Jiang, Huiping Sun, Zhong Chen
Research Collection School Of Computing and Information Systems
Community Question Answering (CQA) websites, where people share expertise on open platforms, have become large repositories of valuable knowledge. To bring the best value out of these knowledge repositories, it is critically important for CQA services to know how to find the right experts, retrieve archived similar questions and recommend best answers to new questions. To tackle this cluster of closely related problems in a principled approach, we proposed Topic Expertise Model (TEM), a novel probabilistic generative model with GMM hybrid, to jointly model topics and expertise by integrating textual content model and link structure analysis. Based on TEM results, …
The Impact Of Smartphone Adoption On Consumers’ Switching Behavior In Broadband And Cable Tv Services, Gwangjae Jung
The Impact Of Smartphone Adoption On Consumers’ Switching Behavior In Broadband And Cable Tv Services, Gwangjae Jung
Research Collection School Of Computing and Information Systems
The emergence of smartphones has brought a technology disruption to the telecom business. Due to the various services offered in association with smartphones, people can surf the web or watch TV. This research is related to telecom services overall, and has the goal of finding the impact of smartphone adoption to consumers’ switching behavior in broadband and cable TV services. This research adopts a quasi-experimental design and investigates the causal effect of smartphone service adoption on broadband and cable TV service choices. The data collection involves five years of consumer service subscriptions in a Singaporean telecommunications company. I tested for …
Multimedia Recommendation: Technology And Techniques, Jialie Shen, Meng Wang, Shuicheng Yan, Peng Cui
Multimedia Recommendation: Technology And Techniques, Jialie Shen, Meng Wang, Shuicheng Yan, Peng Cui
Research Collection School Of Computing and Information Systems
In recent years, we have witnessed a rapid growth in the availability of digital multimedia on various application platforms and domains. Consequently, the problem of information overload has become more and more serious. In order to tackle the challenge, various multimedia recommendation technologies have been developed by different research communities (e.g., multimedia systems, information retrieval, machine learning and computer version). Meanwhile, many commercial web systems (e.g., Flick, YouTube, and Last.fm) have successfully applied recommendation techniques to provide users personalized content and services in a convenient and flexible way. When looking back, the information retrieval (IR) community has a long history …