Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alfonso Lobos Ruiz

dblp:217/4513 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Learning paradigms · 44% Probabilistic and Bayesian machine learning · 44% Graph learning · 13%
Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › latent factor model
factorization machines
0.412019
Predicting Different Types of Conversions with Multi-Task Learning in Online Advertising · KDD 2019
Machine learning › Learning paradigms
multi-task learning
0.412019
Predicting Different Types of Conversions with Multi-Task Learning in Online Advertising · KDD 2019
Recommender systems
click-through rate prediction
0.312018
Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising · WWW 2018
Recommender systems › click-through rate prediction
feature interaction
0.312018
Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising · WWW 2018
Machine learning › Graph learning
advertising applications
0.112019
Predicting Different Types of Conversions with Multi-Task Learning in Online Advertising · KDD 2019

Methods — techniques the papers use, named apart from their topics

multi-task learning · 0.4field-weighted factorization machine · 0.4factorization machines · 0.3
YearPublicationVenuePosition
2019 Predicting Different Types of Conversions with Multi-Task Learning in Online Advertising
abstract
Conversion prediction plays an important role in online advertis- ing since Cost-Per-Action (CPA) has become one of the primary campaign performance objectives in the industry. Unlike click pre- diction, conversions have different types in nature, and each type may be associated with different decisive factors. In this paper, we formulate conversion prediction as a multi-task learning problem, so that the prediction models for different types of conversions can be learned together. These models share feature representa- tions, but have their specific parameters, providing the benefit of information-sharing across all tasks. We then propose Multi-Task Field-weighted Factorization Machine (MT-FwFM) to solve these tasks jointly. Our experiment results show that, compared with two state-of-the-art models, MT-FwFM improve the AUC by 0.74% and 0.84% on two types of conversions, and the weighted AUC across all conversion types is also improved by 0.50%.
Junwei Pan, Yizhi Mao, Alfonso Lobos Ruiz, Aaron Flores 0001
KDD3
2018 Field-weighted Factorization Machines for Click-Through Rate Prediction in Display Advertising
abstract
Click-through rate (CTR) prediction is a critical task in online display advertising. The data involved in CTR prediction are typically multi-field categorical data, i.e., every feature is categorical and belongs to one and only one field. One of the interesting characteristics of such data is that features from one field often interact differently with features from different other fields. Recently, Field-aware Factorization Machines (FFMs) have been among the best performing models for CTR prediction by explicitly modeling such difference. However, the number of parameters in FFMs is in the order of feature number times field number, which is unacceptable in the real-world production systems. In this paper, we propose Field-weighted Factorization Machines (FwFMs) to model the different feature interactions between different fields in a much more memory-efficient way. Our experimental evaluations show that FwFMs can achieve competitive prediction performance with only as few as 4% parameters of FFMs. When using the same number of parameters, FwFMs can bring 0.92% and 0.47% AUC lift over FFMs on two real CTR prediction data sets.
Junwei Pan, Jian Xu 0015, Alfonso Lobos Ruiz, Wenliang Zhao, Shengjun Pan
WWW3