讲座:Modeling User Engagement for Ad and Search

讲座:http://bdai.ruc.edu.cn/?p=118

Modeling User Engagement for Ad and Search

ppt 链接:

Dr. Ke(Adam) Zhou

work 1: Modeling User Engagement for Ad and Search,文章链接:http://dl.acm.org/citation.cfm?id=2883053

user engagement

一,how to measure:

1, 分析学:CTR,absence time

2, 自我报告:调查问卷

3,生理学:实验室设备测量

二,maximizing short term vs long-term engagement

三,modeling user engagement (predicting) focus on ad.

online advertising: search ads, display ads, native ads(原生广告):facebook suggested post, twitter promote twitters.

ad ranking:maxmizing the profile but for long time it damage the profile, so  we should take nattive advertising quality into consideration.

pre-click ad quality:点击之前

(1) how to measure?

1,CTR(click through rate):  relevance, quality

2, ads feedback(offensive feedback rate OFR)

correlation: high CTR maybe high OFR

so, to measure the ads quality, it is better to use OFR.

(2) what makes an ad preferred by user?

美观》产品》品牌

(3)engineer ad quality features

Post-click quality metrics

dwell-time

features

work 2:personalized pre-click quality model(个性化),文章链接:http://dl.acm.org/citation.cfm?id=2883053

时间: 2024-10-12 11:44:52

讲座:Modeling User Engagement for Ad and Search的相关文章

[LeetCode] 211. Add and Search Word - Data structure design Java

题目: Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one le

LeetCode OJ:Add and Search Word - Data structure design(增加以及搜索单词)

Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one letter

[leedcode 211] Add and Search Word - Data structure design

Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one letter

(Data structure)Implement Trie And Add and Search Word

Implement Trie (Prefix Tree) Implement a trie with insert, search, and startsWith methods. Note:You may assume that all inputs are consist of lowercase letters a-z solution: class TrieNode { // Initialize your data structure here. boolean isEnd; Trie

[leetcode trie]211. Add and Search Word - Data structure design

Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one letter

LeetCode-Add and Search Word

Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one letter

Leetcode: Add and Search Word - Data structure design

Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent any one letter

LeetCode——Add and Search Word - Data structure design

Description: Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a-z or .. A . means it can represent a

[LeetCode][JavaScript]Add and Search Word - Data structure design

Add and Search Word - Data structure design Design a data structure that supports the following two operations: void addWord(word) bool search(word) search(word) can search a literal word or a regular expression string containing only letters a-z or