dodox/CaliGraph
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Better recommender scores

Browse Source
This commit is contained in:
Dominik Moritz Roth 2022-03-07 13:51:26 +01:00
parent b75ede5d89
commit 44c0c189d7
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
caliGraph.py
View File

@ -398,7 +398,7 @@ def scoreOpinions(G, globMu, globStd):
node['mean'], node['std'] = norm.fit(feedbacks) node['mean'], node['std'] = norm.fit(feedbacks)
node['se'] = globStd / math.sqrt(len(feedbacks)) node['se'] = globStd / math.sqrt(len(feedbacks))
ratio = len(feedbacks) / len(adjacens) ratio = len(feedbacks) / len(adjacens)
node['score'] = node['mean'] node['score'] = node['mean'] + globStd/3 - node['se']
node['feedbacks'] = feedbacks node['feedbacks'] = feedbacks
else: else:
node['score'] = None node['score'] = None
@ -1186,7 +1186,7 @@ def findNewBooks(G, books, mu, num=-1, minRecSco=5):
ses.append(min(ses)) ses.append(min(ses))
scores.append(mu) scores.append(mu)
node['fake_se'] = sum(ses)/(len(ses)**1.2) + 0.5 + 0.5 * (len(scores)==2) # This is not how SE works. DILLIGAF? node['fake_se'] = sum(ses)/(len(ses)**1.2) + 0.5 + 0.5 * (len(scores)==2) # This is not how SE works. DILLIGAF?
node['score'] = sum(scores)/len(scores)*1.2 - node['fake_se']*2 + 0.5 - 0.1/math.sqrt(len(scores)) node['score'] = sum(scores)/len(scores)*1.2 - node['fake_se']*1.6 + 0.5 - 0.1/math.sqrt(len(scores))
if len(scores)==2: if len(scores)==2:
node['score']*=0.80 node['score']*=0.80
node['value'] = 20 + 5 * float(node['score']) node['value'] = 20 + 5 * float(node['score'])