paper-with-me

Papers

Sequence-Aware Factorization Machines for Temporal Predictive Analytics

2019-11-07 · Tong Chen, Hongzhi Yin, Quoc Viet Hung Nguyen, Wen-Chih Peng, Xue Li, Xiaofang Zhou

In various web applications like targeted advertising and recommender systems, the available categorical features (e.g., product type) are often of great importance but sparse. As a widely adopted solution, models based on Factorization Machines (FMs) are capable of modelling high-order interactions among features for effective sparse predictive analytics. As the volume of web-scale data grows exponentially over time, sparse predictive analytics inevitably involves dynamic and sequential features. However, existing FM-based models assume no temporal orders in the data, and are unable to capture the sequential dependencies or patterns within the dynamic features, impeding the performance and adaptivity of these methods. Hence, in this paper, we propose a novel Sequence-Aware Factorization Machine (SeqFM) for temporal predictive analytics, which models feature interactions by fully investigating the effect of sequential dependencies. As static features (e.g., user gender) and dynamic features (e.g., user interacted items) express different semantics, we innovatively devise a multi-view self-attention scheme that separately models the effect of static features, dynamic features and the mutual interactions between static and dynamic features in three different views. In SeqFM, we further map the learned representations of feature interactions to the desired output with a shared residual network. To showcase the versatility and generalizability of SeqFM, we test SeqFM in three popular application scenarios for FM-based models, namely ranking, classification and regression tasks. Extensive experimental results on six large-scale datasets demonstrate the superior effectiveness and efficiency of SeqFM.

📄 PDF Abstract BibTeX arXiv:1911.02752

Code (0)

등록된 구현이 없습니다.

Tasks

Recommendation Systems

Methods 이 논문이 사용한 방법론

Test 설명 없음

Similar Papers 제목 키워드 기반

A Dual Input-aware Factorization Machine for CTR Prediction

2020-07-01 · IJCAI 2020 7 · Lu, Wantong and Yu, Yantao and Chang, Yongzhe and Wang 외

Factorization Machines (FMs) refer to a class of general predictors working with real valued feature vectors, which are well-known for their ability to estimate model parameters under significant sparsity and have found …

Click-Through Rate Prediction

Contextual and Position-Aware Factorization Machines for Sentiment Classification

2018-01-18 · Shuai Wang, Mianwei Zhou, Geli Fei, Yi Chang 외

While existing machine learning models have achieved great success for sentiment classification, they typically do not explicitly capture sentiment-oriented word interaction, which can lead to poor results for fine-grain…

ClassificationGeneral ClassificationPositionRecommendation Systems+4

Knowledge Tracing Machines: Factorization Machines for Knowledge Tracing

2018-11-08 · Jill-Jênn Vie, Hisashi Kashima

Knowledge tracing is a sequence prediction problem where the goal is to predict the outcomes of students over questions as they are interacting with a learning platform. By tracking the evolution of the knowledge of some…

Knowledge Tracing

Field-aware factorization machines for CTR prediction

2016-09-07 · RecSys 2016 9 · Yuchin Juan, Yong Zhuang, Wei-Sheng Chin, Chih-Jen Lin

Click-through rate (CTR) prediction plays an important role in computational advertising. Models based on degree-2 polynomial mappings and factorization machines (FMs) are widely used for this task. Recently, a varian…

Click-Through Rate PredictionPredictionRecommendation Systems

CORE: Context-Aware Open Relation Extraction with Factorization Machines

2015-09-01 · EMNLP 2015 9 · Fabio Petroni, Luciano Del Corro, Rainer Gemulla
Open Information ExtractionRelationRelation Extraction