forked from robert-jm/twit-ranker
-
Notifications
You must be signed in to change notification settings - Fork 0
/
ranker.py
185 lines (151 loc) · 4.2 KB
/
ranker.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
import sys
import os
import fnmatch
import operator
import glob
import cPickle as pickle
from collections import defaultdict
def recursive_glob(rootdir='.', pattern='*'):
return [os.path.join(rootdir, filename)
for rootdir, dirnames, filenames in os.walk(rootdir)
for filename in filenames
if fnmatch.fnmatch(filename, pattern)]
def rank_by_aggregate_pmi(folders):
book_pmi = defaultdict(int)
for folder in folders:
scores = [x for x in recursive_glob(folder,'*.score')]
for filename in scores:
l = pickle.load(open(filename,'rb'))
for book in l.keys():
book_pmi[book] += sum(l[book]['pmi'])
sorted_x = sorted(book_pmi.iteritems(),
key=operator.itemgetter(1))
sorted_x.reverse()
return [x[0] for x in sorted_x]
def get_stat(d):
sortedkeys = sorted(d, key=lambda key: int(key.split('k')[1]))
for k in sortedkeys:
if 'avg_sent' not in d[k] or 'rank' not in d[k]:
continue
else:
print '++++++++++++++++'
print k
print 'rank: ', d[k]['rank']
print 'average sentiment: ',d[k]['avg_sent']
print 'cue: ', d[k]['cue']
print 'p_cue: ', d[k]['p_cue']
print 'n_cue: ', d[k]['n_cue']
print 'emo: ', d[k]['emo']
print 'pmi: ', d[k]['pmi']
print '++++++++++++++++'
def neutral_classifier(emo):
total = sum(emo.values())
if emo['neutral']/float(total) >=0.97:
return 1
else:
return -1
def sadness_classifier(emo):
if emo['sadness']>=2:
return 1
else:
return -1
def joy_classifier(emo):
total = sum(emo.values())
if emo['joy']/float(total)>=0/01:
return 1
else:
return -1
def senti_classifier(score):
if score>=2:
return -1
else:
return 1
def num_cue_classifier(cues):
if cues>=50:
return 1
else:
return -1
def neg_classifier(n_cues):
if n_cues >= 30:
return 1
else:
return -1
def pos_classifier(p_cues, n_cues):
cues = p_cues + n_cues
if p_cues/float(cues) > n_cues/float(cues):
return 1
else:
return -1
def pmi_classifier(pmi):
if pmi>=0.5:
return -1
else:
return 1
def fusion_classifer(d):
s=neutral_classifier(d['emo'])+sadness_classifier(d['emo'])+joy_classifier(d['emo'])
s+=senti_classifier(d['avg_sent'])+num_cue_classifier(d['cue'])+neg_classifier(d['n_cue'])
s+=pos_classifier(d['p_cue'], d['n_cue'])
s+=pmi_classifier(d['pmi'])
return s
# For every book, map week -> {rank, all kinds of stats}
if __name__ =='__main__':
arg = sys.argv[1:]
#print rank_by_aggregate_pmi(arg)
ranks = defaultdict(lambda : defaultdict(dict))
booklists = glob.glob('./nyt-lists/*.bkl')
for bl in booklists:
week = os.path.basename(bl).split('.')[0]
with open(bl, 'rU') as f:
for idx, line in enumerate(f):
title = line.split('|')[0].lower().replace(' ','_')
ranks[title][week]['rank'] = idx+1
scores = glob.glob('./scores/*.score')
#for folder in arg:
#scores = [x for x in recursive_glob(folder,'*.score')]
for filename in scores:
basename = os.path.basename(filename)
week = basename.split('.')[0]
l = pickle.load(open(filename,'rb'))
for book in l.keys():
senti_sum = sum(l[book]['pol'])
if len(l[book]['pol'])!=0:
ranks[book][week]['avg_sent'] = senti_sum/len(l[book]['pol'])
else:
ranks[book][week]['avg_sent'] = 0
p, n = 0, 0
cues = l[book]['cue']
for c in cues:
p +=c[0]
n +=c[1]
ranks[book][week]['cue'] = p+n
if len(cues) !=0:
ranks[book][week]['p_cue'] = p/len(cues)
ranks[book][week]['n_cue'] = n/len(cues)
else:
ranks[book][week]['p_cue'] = 0
ranks[book][week]['n_cue'] = 0
e_dict = defaultdict(int)
for d in l[book]['emo']:
for k, v in d.iteritems():
e_dict[k] += v
ranks[book][week]['emo'] = e_dict
pmi_sum = sum(l[book]['pmi'])
if len(l[book]['pmi'])!=0:
ranks[book][week]['pmi'] = pmi_sum/len(l[book]['pmi'])
else:
ranks[book][week]['pmi'] = 0
# Sort the whole list of books be descending number of received tweets.
cues_d = {}
for k,v in ranks.iteritems():
count = 0
for key, items in v.iteritems():
if 'cue' in items:
count += items['cue']
cues_d[k] = count
ranks['112263']['week4']['rank']=35
ranks['112263']['week6']['rank']=24
tops = sorted(cues_d, key=cues_d.get, reverse=True)[:50]
t_d = {}
for t in tops:
t_d[t] = dict(ranks[t])
pickle.dump(t_d, open('tops.pkl','wb'))