A Personalized Interest-Forgetting Markov Model for Recommendations - - PowerPoint PPT Presentation

β–Ά
a personalized interest forgetting markov
SMART_READER_LITE
LIVE PREVIEW

A Personalized Interest-Forgetting Markov Model for Recommendations - - PowerPoint PPT Presentation

A Personalized Interest-Forgetting Markov Model for Recommendations Jun Chen , Chaokun Wang, Jianmin Wang Tsinghua University, China chenjun14@mails.tsinghua.edu.cn, {chaokun, jimwang}@tsinghua.edu.cn AAAI-15 28-Jan-15 1 Review on


slide-1
SLIDE 1

Jun Chen, Chaokun Wang, Jianmin Wang

Tsinghua University, China chenjun14@mails.tsinghua.edu.cn, {chaokun, jimwang}@tsinghua.edu.cn

A Personalized Interest-Forgetting Markov Model for Recommendations

28-Jan-15 AAAI-15

1

slide-2
SLIDE 2

A Personalized Interest-Forgetting Markov Model for Recommendations 2

Memory Forgetting Ebbinghaus FC More FCs

Review on Forgetting Curve (FC)

Forgetting speeds Starting experience An intelligent recommender system?

slide-3
SLIDE 3

A Personalized Interest-Forgetting Markov Model for Recommendations 3

Forgetting of User Interests

  • Interest-Forgetting
  • User 𝑣’s interest upon item 𝑦 loses as time

elapses after the consumption.

  • Importance to influence current user interest.
  • Some issues
  • Modeling of interest-forgetting.
  • Personalization
  • Forgetting speeds
  • Starting experience
  • Re-learning/Reconsumption
slide-4
SLIDE 4

A Personalized Interest-Forgetting Markov Model for Recommendations 4

Major Contributions

1. We considered the interest-forgetting in recommendations towards a β€œhuman-minded” recommender system. 2. A personalized framework for interest-forgetting Markov model with multiple implementations on experience and interest retention. 3. An effective solution to item recommendation problem compared with the state-of-the-art.

slide-5
SLIDE 5

A Personalized Interest-Forgetting Markov Model for Recommendations 5

Related Works

  • Markov model & Recommendation
  • First-order Markov chain model[Rendle et al 2010, Cheng et al 2013].
  • High-order Markov model[Raftery 1985]
  • Variable-order Markov models[Begleiter et al 2004, Dimitrakakis 2010].
  • Memory Forgetting & Learning
  • Forgetting models[Ebbinghaus 1885, Nembhard et al 2001, Averell et al 2011].
  • Learning models[Jaber et al 1997, Anzanello et al 2011]
  • Data filtering & updating[Packer et al 2011, Freedman et al 2011]
slide-6
SLIDE 6

A Personalized Interest-Forgetting Markov Model for Recommendations 6

Problem Formulation

  • Variable-Order Markov (VOM) model based Recommendation
  • Given an item trace 𝒴𝑣,𝑒 = {𝑦1

𝑣, 𝑦2 𝑣, … , 𝑦𝑒 𝑣} of user 𝑣, recommend Top-N

unseen items with the largest transition probability: 𝑄 𝑦|𝒴𝑣,𝑒 = 𝑄(X𝑒+1

𝑣

= 𝑦|X𝑒

𝑣 = 𝑦𝑒 𝑣, … , X1 𝑣 = 𝑦1 𝑣)

  • Exponential expansion on the number of states
  • πœ‡-VOM
  • Step-wise weighted first-order Markov model

𝑄 𝑦|𝒴𝑣,𝑒 =

π‘˜=1 𝑒

πœ‡π‘˜

𝑣,𝑒 𝑄 X𝑒+1 𝑣

= 𝑦 X𝑒+1βˆ’π‘˜

𝑣

= 𝑦𝑒+1βˆ’π‘˜

𝑣

=

π‘˜=1 𝑒

πœ‡π‘˜

𝑣,𝑒 𝑄 𝑦 𝑦𝑒+1βˆ’π‘˜ 𝑣

slide-7
SLIDE 7

A Personalized Interest-Forgetting Markov Model for Recommendations 7

Framework

  • πœ‡-VOM

𝑄 𝑦|𝒴𝑣,𝑒 =

π‘˜=1 𝑒

πœ‡π‘˜

𝑣,𝑒 𝑄 𝑦 𝑦𝑒+1βˆ’π‘˜ 𝑣

=

π‘˜=1 𝑒

Ξ₯𝑦𝑒+1βˆ’π‘˜

𝑣

𝑣,𝑒

Φ𝑦𝑒+1βˆ’π‘˜

𝑣

𝑣,𝑒

𝑄 𝑦 𝑦𝑒+1βˆ’π‘˜

𝑣

𝑄 𝑦 𝑦𝑒+1βˆ’π‘˜

𝑣

: one-step transition probability. πœ‡π‘˜

𝑣,𝑒: personalized interest-forgetting component.

πœ‡π‘˜

𝑣,𝑒 = Ξ₯𝑦𝑒+1βˆ’π‘˜

𝑣

𝑣,𝑒

Φ𝑦𝑒+1βˆ’π‘˜

𝑣

𝑣,𝑒

 Starting Experience: Ξ₯𝑦

𝑣,𝑒 ∝ 𝑔 𝑦, 𝑣, 𝑒 , monotonically increasing with frequency.

 Interest Retention: Φ𝑦

𝑣,𝑒 ∝ 1/π‘˜ , monotonically decreasing with elapsed time steps.

slide-8
SLIDE 8

A Personalized Interest-Forgetting Markov Model for Recommendations 8

IFMM Framework

  • Objective
  • Minimize the negative log-likelihood of the probabilities to recommend the

last item in each training trace.

  • Parameters Ξ˜βˆ— could be learned via stochastic gradient descent method.
  • One-step transition probability can be directly computed.
slide-9
SLIDE 9

A Personalized Interest-Forgetting Markov Model for Recommendations 9

Framework Specifications

  • One-Step Transition Probability
  • Conditional probability of observing 𝑦𝑗 after π‘¦π‘˜.
slide-10
SLIDE 10

A Personalized Interest-Forgetting Markov Model for Recommendations 10

Framework Specifications

  • Starting Experience
  • Logistic function
  • Rational function (normalized frequencies)

Starting Experience: Ξ₯𝑦

𝑣,𝑒 ∝ 𝑔 𝑦, 𝑣, 𝑒 ,

monotonically increasing with frequency.

𝑔

𝑣,𝑒(𝑦)

Experience Curves

Ξ₯𝑦

𝑣,𝑒

Starting experience measures the personalized accumulative interest a user has upon a certain item before forgetting.

slide-11
SLIDE 11

A Personalized Interest-Forgetting Markov Model for Recommendations 11

Framework Specifications

  • Interest Retention
  • Log-Linear function[Wright 1936]
  • Exponential function[Knecht 1974]
  • Hypobolic function[Mazur and Hastie 1978]

Interest Retention: Φ𝑦

𝑣,𝑒 ∝ 1/π‘˜ ,

monotonically decreasing with elapsed time.

π‘˜

Interest Retention Curves

Φ𝑦

𝑣,𝑒

Interest retention measures the personalized residual interest of a user upon a certain item after forgetting.

slide-12
SLIDE 12

A Personalized Interest-Forgetting Markov Model for Recommendations 12

Personalized Recommendation

  • IFMM Framework

𝑄 𝑦|𝒴𝑣,𝑒 =

π‘˜=1 𝑒

Ξ₯𝑦𝑒+1βˆ’π‘˜

𝑣

𝑣,𝑒

Φ𝑦𝑒+1βˆ’π‘˜

𝑣

𝑣,𝑒

𝑄 𝑦 𝑦𝑒+1βˆ’π‘˜

𝑣

  • Forgetting speeds
  • Starting experience
  • Re-learning/Reconsumption

Top-N item recommendation with the largest values of 𝑄 𝑦|𝒴𝑣,𝑒 .

slide-13
SLIDE 13

A Personalized Interest-Forgetting Markov Model for Recommendations 13

Experiments

  • Data Set
  • Last.fm music listening data set.
  • 992 users, 964,464 songs, 16,986,614 listening records.
  • Partition each user’s listening history with a time shreshold, e.g. 1 hour.
  • Remove listening records whose duration is less than 30 secs.
  • 80% traces for training, 20% traces for test.
  • Comparative Methods
  • Markov model based
  • Factorizing Personalized Markov Chain (FPMC) [Rendle 2010, Cheng 2013]
  • Topic Sensitive PageRank (TSPR) [Haveliwala 2002]
  • Graph-based preference fusion (STG) [Xiang 2010]
  • Sequential pattern based (SEQ) [Hariri et al 2012]
slide-14
SLIDE 14

A Personalized Interest-Forgetting Markov Model for Recommendations 14

Experiments

  • Accuracy of the proposed methods
  • Starting Experience
  • NM: rational function
  • NO: logistic function
  • Interest Retention
  • LL: log-linear
  • EX: exponential
  • HY: hypobolic

NO+HY performs the best, and is selected as the representative.

slide-15
SLIDE 15

A Personalized Interest-Forgetting Markov Model for Recommendations 15

Experiments

  • Accuracy Comparisons
  • NO+HY
  • SEQ
  • s5w4: sup 5, winsize 4
  • s7w3: sup 7, winsize 3
  • s6w2: sup 6, winsize 2
  • FPMC
  • STG
  • TSPR

NO+HY improves 10%-20% in recommendation accuracy compared with the best of the reference methods.

slide-16
SLIDE 16

A Personalized Interest-Forgetting Markov Model for Recommendations 16

Experiments

  • Personalized parameters distribution
  • NO+HY

πœšπ‘£ 𝛽𝑣 𝐷𝑣

slide-17
SLIDE 17

A Personalized Interest-Forgetting Markov Model for Recommendations 17

Conclusions

  • Forgetting is an intrinsic feature of human beings, and should be taken into account

in recommender systems.

  • We proposed πœ‡-VOM to simplify the computation of variable-order Markov model.
  • We brought forward a personalized framework which integrates interest-forgetting

and Markov model.

  • Multiple forgetting curve models and experience models have been evaluated

under our framework to find an optimal solution.

  • IFMM provides various strategies for personalization.
  • The experimental results proved the effectiveness of our method in

recommendation tasks.

slide-18
SLIDE 18

Jun Chen, Chaokun Wang, Jianmin Wang

Tsinghua University, China chenjun14@mails.tsinghua.edu.cn, {chaokun, jimwang}@tsinghua.edu.cn

Thank You ~

Any Question?

28-Jan-15 AAAI-15

18

A Personalized Interest-Forgetting Markov Model for Recommendations

slide-19
SLIDE 19

A Personalized Interest-Forgetting Markov Model for Recommendations 19

Experiments

  • Timeout Threshold
  • Influence general length of traces.
  • Larger value, longer traces.

Very slight impact upon the recommendation accuracy