Interest based Social recommender

7/24/2019 Interest based Social recommender

1/34

Interest-basedpersonalised real time

content recommendationin online socialcommunities

Nini P Suresh137511


2/34

Problem

Identify unique and diverse

interests of users on real time

basis Existing Recommendation

system flaw: yield biased

decisions favoring popular

content

2


3/34

Problem

3

U={ u1,u2,....,um} I={ i1,i2,....,in}

u1

u2

u3

u4

i1

i2

i3


4/34

Problem

4

i1, i2,i3 should be grouped into

cluster based on the interest of

users optimally.Calculate rating for u1,u2,u3,u

!ind "hether recommendation

repair is re#uired


5/34

$%&I'( )($ I*+%*%(-)-I( ! I(-%/%&-

0)&%$ /%) -I*% +%/&()I%$ &CI)

/%C**%($)-I( &&-%*

5


6/34

6

Through Jaccard Similarity, fnd

distance beteen to items!istance"i,#$%1&JaccardSimilarity"i,#$

%ji

ji

UU

UU

1


7/34

7

'ssign each item to cluster initially

(ased on distance, using ) meansclustering algorithm , fnd ) clustersPer*orm +nterest rou- .lustering on

these ) clusters


8/34

/

Objective Function

wu,c : Fraction of items of cluster c viewedby the user u

Support(u, c) : robability of user belon!in! to

cluster c

= ),(1 , cuSupportwPE cuCcu"he probability of clusterin! error


9/34

0

Objective Function

#ariance is !iven by

= 2)||

(1||

1

UPE

UVar u

$ur ob%ective is to minimi&e variance and

form the bi!!est cluster


10/34

1

'nput

1(user id,itemid,"ime spent,)value

2('tem id, post time

3( user id, new online time,previous time


11/34

11

+nterest rou- contains seto* items, set o* users andcentre .g.entre o* an +nterest grou-is the item ith smallestaerage distance'll users in the set ill li)eero or more item in the seto* item o* +nterest grou-


12/34

12

4 *istin!uishin! operation

+utation

rossover+er!e*ivide


13/34

13

*U-)-I(

+utation

i1 i2

!-i3

i4i.

i/

i0

i

i

i1

i11

i12

i13

i14

i1.i1/

i10

i1

i1

i2

i21

i22

i23

i24

i2.


14/34


15/34

15

C/&&%/

i1

i2

i3

i4

i.

c-i/

i0

ii1

-i

i11

i12

i13

i14

i1.

i1/

i10

i1

i1i2

i21

i22

i23

i24

i2.


16/34

16

C/&&%/

i0

i2

i3

i4

i.

c-i/

i1

ii1

c-i

i11

i12

i13

i14

i1.

i1/

i10

i1

i1i2

i21

i22

i23

i24

i2.


17/34

17

*%/'%

i0

i2

i3

i4

i.

c-i/

i1

ii1

c-i

i11

i12

i13

i14

i1.

i1/

i10

i1

i1i2

i21

i22

i23

i24

i2.


18/34

1/

*%/'%

i0

i2

c-i3

i4

i.

i/

i1

ii1

i

i11

i12

i13

i14

i1.

i1/

i10

i1

i1i2

i21

i22

i23

i24

i2.


19/34

10

i0

i2

c- i3

i4

i.

i/i1

ii1

i

i11

i12

i13

i14

i1.

i1/

i10

i1

i1i2

i21

i22

i23

i24

i2.

$II$%


20/34

2

$II$%

i0

i2

c- i3

i4

i.

i/i1

ii1

i

i11

i12

i13

i14

i1.

i1/

i10

i1

i1i2

i21

i22

i23

-i24

i2.


21/34

21

)lgorithm 4: 'nterestroupluster()

/e#uire: several clusters as the output of 5 means clusterin!

1 'nitialise all clusters into a set 2 smallest6ob%-

3 do

4 fori-1 to si&e71 where si&e is si&e of

. for%-i81 to si&e

/ 'nitialise 9 to null

0 add to 9

remove ith !roup and %th !roup from 9 'nitialise union to null

1 add ith and %th !roup to union

11 add union to 9

12 if $b%ective(9) $b%ective()

13 ;-9

14 smallest6ob%-$b%ective(9)

1. end if

1/ end for

10 end for

1 if smallest6ob% < $b%ective(9)

1 -;

2 end if

21 "hilesmallest6ob% = $b%ective()


22/34

22

)lgorithm 4: 'nterestroupluster()22 round-

23 for round $>S"?>"24 9- @andomly do either crossover() or mer!e() or *ivide()

2. if $b%ective(9) $b%ective()

2/ -9

20 end if

2 if doesnot chan!e for 1 rounds

2 -+utation()

3 end if

31 round88

32 end for

33 @eturn as the bi!!est cluster with minimum variance


23/34

23

Real Time

recommendationsIssues

1alse negaties2eal time neighborselection

3!ierent leels o* +nterest


24/34

24

)lgorithm 5: >ei!hbor Select(,item)

Require: set of interest group C, post time of item, users latest time t1 and previous time t2

1. Map item with post time

2. Map user with t2-t13. forall users u

. for all items i

!. if "(u,i)# $

%. CMu,i

&1

'. else

. ift2-t1 of user u 1$$$$$

*. +1&11$. end if

11. else

12. +1&$

13. end else

1. ifpost time t1

1!. +2&1

1%. end if

1'. else

1. +2&$

1*. end else

1%. Cmu,i

&+1+2

1'. end else

1. end for

1*. end for


25/34

25

)lgorithm 5: >ei!hbor Select(,item)

2$. forall user u21. foreah interest group g in C

22. forall items i in g23. if Cm

u,i&1

2. mg,u

&1

2!. end if

2%. end for

2'. end for

2. end for2*. i&interest group of item

3$. for all user u

31. /0item,u

&CMu,item

Mu,i

32. Map olumn id of CM with list of row indees with non-ero entr4 in updated CM

33. ifli# null where l

iis list orresponding to inde of i

3. for eah u in li

do

3!. if/0item,u

# 1

3%. /0item,u

&Mi,u

3'. end if

3. end for

3*. end if

$. 5eturn /0item


26/34

26

8eighbor Selection"item$1.reate a hashma- *or userconte9t matri9 ith item inde9 as)ey and list o* users li)ed asalue

2:btain the inde9 c o* interestgrou- ith the item3Ta)e list ith c as )ey

4+* list is not em-ty, *or all userschec) 8(;i


27/34

27

>ser Time'da-tion

+=

2

)(1

$

),(6 utiuweighttime if t 7 ! if t 8 !

if u posts9omments

on i

=

|)(|2

)(

$

)(

utt

uttt

avg

avguwhere

if [ ])(2),(!.$ ututt avgavg

otherwise


28/34

2/

||

||),(:r

g

gu

I

IIguecision

=

||

||),(5e

u

gu

I

IIgucall

=

),(5e),(:r

),(5e),(:r)1(),(

gucallguecision

gucallguecisionguweightage

+

+=

),(),(6),(6 guweightiuweighttimeiuweightFinal =


29/34

20

'lgorithm 3? eal Timeecommender+n-ut?ne item@1un neighbour selectionalgorithm *or the ne item and

get the neighbours2u-date ne item rating ithin24hr


30/34

3

3u-date neighbour list4i* neighbour list is not em-ty fnd the

distance o* the item ith centre o* all interestgrou-s5select interest grou- ith the smalldistance6*or each o* users in neighbour list,inaleight is added7emoe users *rom neighbour list i* userdoesnt li)e item/calculate local rating *or the item

0.alculate global rating *or each user1or a s-ecifc user fnd trust orthy usersand determine trust alues

useruserytrustworth

userytrustworth

IIIuserytrustworthuserTrusts

=

6

6)6,(


31/34

31

11 .alculate eightage

12 .alculate user a--roal and disa--roal

13 +* >serAdisa--roalB userAa--roal ,then

recommendation re-air is reCuired

nRatingMaimum

userytrustworthuserTrustweightage

n

j

j

6

)6,(1==

weightageratingli!eavgapprovalUser 666 =weightagerating"isli!eavgal"issapprovUser 666 =


32/34

esult

32

/o. of items/o. of lusters with o;


33/34

esult

33

2 4 / 1 12 14 1/ 1

.

1

1.

2

2.

3luster distribution

>o of clusters with ob%ective in terms of probab ility

>o of clusters with ob%ective in terms of variance

>o of items

>o of clusters


34/34

Than) Dou

34

Documents

Interest based Social recommender