Jarana Manotumruksa

Bio: Jarana Manotumruksa is an academic researcher from University of Glasgow. The author has contributed to research in topics: Collaborative filtering & Recommender system. The author has an hindex of 8, co-authored 23 publications receiving 278 citations. Previous affiliations of Jarana Manotumruksa include University College London.

A Contextual Attention Recurrent Architecture for Context-Aware Venue Recommendation

Abstract: Venue recommendation systems aim to effectively rank a list of interesting venues users should visit based on their historical feedback (e.g. checkins). Such systems are increasingly deployed by Location-based Social Networks (LBSNs) such as Foursquare and Yelp to enhance their usefulness to users. Recently, various RNN architectures have been proposed to incorporate contextual information associated with the users' sequence of checkins (e.g. time of the day, location of venues) to effectively capture the users' dynamic preferences. However, these architectures assume that different types of contexts have an identical impact on the users' preferences, which may not hold in practice. For example, an ordinary context such as the time of the day reflects the user's current contextual preferences, whereas a transition context - such as a time interval from their last visited venue - indicates a transition effect from past behaviour to future behaviour. To address these challenges, we propose a novel Contextual Attention Recurrent Architecture (CARA) that leverages both sequences of feedback and contextual information associated with the sequences to capture the users' dynamic preferences. Our proposed recurrent architecture consists of two types of gating mechanisms, namely 1) a contextual attention gate that controls the influence of the ordinary context on the users' contextual preferences and 2) a time- and geo-based gate that controls the influence of the hidden state from the previous checkin based on the transition context. Thorough experiments on three large checkin and rating datasets from commercial LBSNs demonstrate the effectiveness of our proposed CARA architecture by significantly outperforming many state-of-the-art RNN architectures and factorisation approaches.

A Deep Recurrent Collaborative Filtering Framework for Venue Recommendation

Abstract: Venue recommendation is an important application for Location-Based Social Networks (LBSNs), such as Yelp, and has been extensively studied in recent years. Matrix Factorisation (MF) is a popular Collaborative Filtering (CF) technique that can suggest relevant venues to users based on an assumption that similar users are likely to visit similar venues. In recent years, deep neural networks have been successfully applied to tasks such as speech recognition, computer vision and natural language processing. Building upon this momentum, various approaches for recommendation have been proposed in the literature to enhance the effectiveness of MF-based approaches by exploiting neural network models such as: word embeddings to incorporate auxiliary information (e.g. textual content of comments); and Recurrent Neural Networks (RNN) to capture sequential properties of observed user-venue interactions. However, such approaches rely on the traditional inner product of the latent factors of users and venues to capture the concept of collaborative filtering, which may not be sufficient to capture the complex structure of user-venue interactions. In this paper, we propose a Deep Recurrent Collaborative Filtering framework (DRCF) with a pairwise ranking function that aims to capture user-venue interactions in a CF manner from sequences of observed feedback by leveraging Multi-Layer Perception and Recurrent Neural Network architectures. Our proposed framework consists of two components: namely Generalised Recurrent Matrix Factorisation (GRMF) and Multi-Level Recurrent Perceptron (MLRP) models. In particular, GRMF and MLRP learn to model complex structures of user-venue interactions using element-wise and dot products as well as the concatenation of latent factors. In addition, we propose a novel sequence-based negative sampling approach that accounts for the sequential properties of observed feedback and geographical location of venues to enhance the quality of venue suggestions, as well as alleviate the cold-start users problem. Experiments on three large checkin and rating datasets show the effectiveness of our proposed framework by outperforming various state-of-the-art approaches.

Slot Self-Attentive Dialogue State Tracking

Abstract: An indispensable component in task-oriented dialogue systems is the dialogue state tracker, which keeps track of users’ intentions in the course of conversation. The typical approach towards this goal is to fill in multiple pre-defined slots that are essential to complete the task. Although various dialogue state tracking methods have been proposed in recent years, most of them predict the value of each slot separately and fail to consider the correlations among slots. In this paper, we propose a slot self-attention mechanism that can learn the slot correlations automatically. Specifically, a slot-token attention is first utilized to obtain slot-specific features from the dialogue context. Then a stacked slot self-attention is applied on these features to learn the correlations among slots. We conduct comprehensive experiments on two multi-domain task-oriented dialogue datasets, including MultiWOZ 2.0 and MultiWOZ 2.1. The experimental results demonstrate that our approach achieves state-of-the-art performance on both datasets, verifying the necessity and effectiveness of taking slot correlations into consideration.

Modelling User Preferences using Word Embeddings for Context-Aware Venue Recommendation

Abstract: Venue recommendation aims to assist users by making personalised suggestions of venues to visit, building upon data available from location-based social networks (LBSNs) such as Foursquare. A particular challenge for this task is context-aware venue recommendation (CAVR), which additionally takes the surrounding context of the user (e.g. the user’s location and the time of day) into account in order to provide more relevant venue suggestions. To address the challenges of CAVR, we describe two approaches that exploit word embedding techniques to infer the vector-space representations of venues, users’ existing preferences, and users’ contextual preferences. Our evaluation upon the test collection of the TREC 2015 Contextual Suggestion track demonstrates that we can significantly enhance the effectiveness of a state-of-the-art venue recommendation approach, as well as produce context-aware recommendations that are at least as effective as the top TREC 2015 systems.

A Personalised Ranking Framework with Multiple Sampling Criteria for Venue Recommendation

Abstract: Recommending a ranked list of interesting venues to users based on their preferences has become a key functionality in Location-Based Social Networks (LBSNs) such as Yelp and Gowalla. Bayesian Personalised Ranking (BPR) is a popular pairwise recommendation technique that is used to generate the ranked list of venues of interest to a user, by leveraging the user's implicit feedback such as their check-ins as instances of positive feedback, while randomly sampling other venues as negative instances. To alleviate the sparsity that affects the usefulness of recommendations by BPR for users with few check-ins, various approaches have been proposed in the literature to incorporate additional sources of information such as the social links between users, the textual content of comments, as well as the geographical location of the venues. However, such approaches can only readily leverage one source of additional information for negative sampling. Instead, we propose a novel Personalised Ranking Framework with Multiple sampling Criteria (PRFMC) that leverages both geographical influence and social correlation to enhance the effectiveness of BPR. In particular, we apply a multi-centre Gaussian model and a power-law distribution method, to capture geographical influence and social correlation when sampling negative venues, respectively. Finally, we conduct comprehensive experiments using three large-scale datasets from the Yelp, Gowalla and Brightkite LBSNs. The experimental results demonstrate the effectiveness of fusing both geographical influence and social correlation in our proposed PRFMC framework and its superiority in comparison to BPR-based and other similar ranking approaches. Indeed, our PRFMC approach attains a 37% improvement in MRR over a recently proposed approach that identifies negative venues only from social links.

Neural Graph Collaborative Filtering

Abstract: Learning vector representations (aka. embeddings) of users and items lies at the core of modern recommender systems. Ranging from early matrix factorization to recently emerged deep learning based methods, existing efforts typically obtain a user's (or an item's) embedding by mapping from pre-existing features that describe the user (or the item), such as ID and attributes. We argue that an inherent drawback of such methods is that, the collaborative signal, which is latent in user-item interactions, is not encoded in the embedding process. As such, the resultant embeddings may not be sufficient to capture the collaborative filtering effect. In this work, we propose to integrate the user-item interactions - more specifically the bipartite graph structure - into the embedding process. We develop a new recommendation framework Neural Graph Collaborative Filtering (NGCF), which exploits the user-item graph structure by propagating embeddings on it. This leads to the expressive modeling of high-order connectivity in user-item graph, effectively injecting the collaborative signal into the embedding process in an explicit manner. We conduct extensive experiments on three public benchmarks, demonstrating significant improvements over several state-of-the-art models like HOP-Rec [39] and Collaborative Memory Network [5]. Further analysis verifies the importance of embedding propagation for learning better user and item representations, justifying the rationality and effectiveness of NGCF. Codes are available at https://github.com/xiangwang1223/neural_graph_collaborative_filtering.

Forecasting methods and applications.

Abstract: Wed, 05 Dec 2018 22:36:00 GMT forecasting methods and applications 3rd pdf PDF | On Jan 1, 1984, S ~G Makridakis and others published Forecasting: Methods and Applications Tue, 04 Dec 2018 23:06:00 GMT (PDF) Forecasting: Methods and Applications ResearchGate Forecasting: methods and applications. This book was published in 1998, and for nearly 20 years I maintained an associated website at this address. Fri, 30 Nov 2018 14:35:00 GMT Forecasting: methods and applications | Rob J Hyndman Prod 2100-2110 Forecasting Methods 2 1. Framework of planning decisions Let us first remember where the inventory control decisions may take place. Fri, 07 Dec 2018 14:13:00 GMT Forecasting Methods UCLouvain 2002 Forecasting: Methods and Applications Makridakis, ... this 3rd edition very wisely includes some more advanced forecasting methods such as dynamic regression, ... Sat, 01 Dec 2018 22:41:00 GMT 2002 Forecasting: Methods and Applications HEPHAESTUS Methods and Applications Third Edition Spyros Makridakis European Institute of Business ... major forecasting methods 516 The use of different forecasting Tue, 04 Dec 2018 22:37:00 GMT Methods and Applications Max Planck Society MATH6011: Forecasting “All models are wrong, ... S.C. and Hyndman, R.J. 1998, Forecasting: Methods and Applications 3rd Ed., New York: Wiley as text book. Wed, 21 Nov 2018 17:31:00 GMT MATH6011: Forecasting University of Southampton Save As PDF Ebook forecasting methods and applications ... FOUR LAMAS OF DOLPO AUTOBIOGRAPHIES OF FOUR TIBETAN LAMAS INTRODUCTION AND TRANSLATIONS VOL I 3RD [PDF] Tue, 04 Dec 2018 19:10:00 GMT forecasting methods and applications makridakis pdf ... forecasting methods and applications 3rd ed Download forecasting methods and applications 3rd ed or read online books in PDF, EPUB, Tuebl, and Mobi Format. Thu, 06 Dec 2018 07:26:00 GMT forecasting methods and applications 3rd ed | Download ... INDUSTRIAL STATISTICS AND OPERATIONAL MANAGEMENT 6 : ... Some applications of forecasting ... Qualitative techniques in forecasting Time series methods Mon, 19 Nov 2018 11:49:00 GMT INDUSTRIAL STATISTICS AND OPERATIONAL MANAGEMENT 6 ... 3 Hierarchical forecasting 9 3 Advanced methods 9. Forecasting: principles and practice 7 Assumptions • This is not an introduction to R. I assume you are broadly ... Thu, 06 Dec 2018 22:49:00 GMT Forecasting: Principles & Practice, Rob J Hyndman, 2014 forecasting methods and applications 3rd ed Download forecasting methods and applications 3rd ed or read online here in PDF or EPUB. Please click button to get ... Mon, 03 Dec 2018 08:27:00 GMT Forecasting Methods And Applications 3rd Ed | Download ... Forecasting methods can be classified as qualitative or quantitative. ... practical applications. 15-4 Chapter 15 Time Series Analysis and Forecasting Fri, 07 Dec 2018 12:33:00 GMT PDF Time Series Analysis and Forecasting Cengage FORECASTING METHODS AND APPLICATIONS 3RD EDITION PDF READ Forecasting Methods And Applications 3rd Edition pdf. Download Forecasting Methods And Applications 3rd ... Sun, 11 Nov 2018 17:14:00 GMT Free Forecasting Methods And Applications 3rd Edition PDF Forecasting Methods and Applications. 3rd ed. New York: John Wiley & Sons, 1998. Sat, 08 Dec 2018 09:40:00 GMT Forecasting Methods and Applications Book Harvard ... Preface In preparing the manuscript for the third edition of Forecasting: methods and applications, one of our primary goals has been to make the book as complete and ... Wed, 05 Dec 2018

Are we really making much progress? A worrying analysis of recent neural recommendation approaches

Abstract: Deep learning techniques have become the method of choice for researchers working on algorithmic aspects of recommender systems. With the strongly increased interest in machine learning in general, it has, as a result, become difficult to keep track of what represents the state-of-the-art at the moment, e.g., for top-n recommendation tasks. At the same time, several recent publications point out problems in today's research practice in applied machine learning, e.g., in terms of the reproducibility of the results or the choice of the baselines when proposing new models. In this work, we report the results of a systematic analysis of algorithmic proposals for top-n recommendation tasks. Specifically, we considered 18 algorithms that were presented at top-level research conferences in the last years. Only 7 of them could be reproduced with reasonable effort. For these methods, it however turned out that 6 of them can often be outperformed with comparably simple heuristic methods, e.g., based on nearest-neighbor or graph-based techniques. The remaining one clearly outperformed the baselines but did not consistently outperform a well-tuned non-neural linear ranking method. Overall, our work sheds light on a number of potential problems in today's machine learning scholarship and calls for improved scientific practices in this area.

Are We Really Making Much Progress? A Worrying Analysis of Recent Neural Recommendation Approaches

Abstract: Deep learning techniques have become the method of choice for researchers working on algorithmic aspects of recommender systems. With the strongly increased interest in machine learning in general, it has, as a result, become difficult to keep track of what represents the state-of-the-art at the moment, e.g., for top-n recommendation tasks. At the same time, several recent publications point out problems in today's research practice in applied machine learning, e.g., in terms of the reproducibility of the results or the choice of the baselines when proposing new models. In this work, we report the results of a systematic analysis of algorithmic proposals for top-n recommendation tasks. Specifically, we considered 18 algorithms that were presented at top-level research conferences in the last years. Only 7 of them could be reproduced with reasonable effort. For these methods, it however turned out that 6 of them can often be outperformed with comparably simple heuristic methods, e.g., based on nearest-neighbor or graph-based techniques. The remaining one clearly outperformed the baselines but did not consistently outperform a well-tuned non-neural linear ranking method. Overall, our work sheds light on a number of potential problems in today's machine learning scholarship and calls for improved scientific practices in this area. Source code of our experiments and full results are available at: this https URL.

Where to Go Next: Modeling Long- and Short-Term User Preferences for Point-of-Interest Recommendation

Abstract: Point-of-Interest (POI) recommendation has been a trending research topic as it generates personalized suggestions on facilities for users from a large number of candidate venues. Since users' check-in records can be viewed as a long sequence, methods based on recurrent neural networks (RNNs) have recently shown promising applicability for this task. However, existing RNN-based methods either neglect users' long-term preferences or overlook the geographical relations among recently visited POIs when modeling users' short-term preferences, thus making the recommendation results unreliable. To address the above limitations, we propose a novel method named Long- and Short-Term Preference Modeling (LSTPM) for next-POI recommendation. In particular, the proposed model consists of a nonlocal network for long-term preference modeling and a geo-dilated RNN for short-term preference learning. Extensive experiments on two real-world datasets demonstrate that our model yields significant improvements over the state-of-the-art methods.