DiffQue/main2_msr.py at master · deepak0004/DiffQue · GitHub

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
from trueskill import *
from random import randint
from Question import Question
from common2 import *

print "Total questions", len(questions)

for question_id in questions.keys():
	if questions[question_id].best_answer_user_id is not None or len(questions[question_id].non_best_answer_user_ids) != 0:
		continue
	else:
		del questions[question_id]
	# if question_id not in data_ids:
	# 	del questions[question_id]
	# 	continue
	# if questions[question_id].best_answer_user_id is None and len(questions[question_id].non_best_answer_user_ids) == 0:
	# 	del questions[question_id]

print "Useful questions", len(questions)

ratings = dict()
graph = []
error_counter = 0

def competeAndUpdate(id1, id2):
	global error_counter
	rating1 = None
	rating2 = None
	assert(id1 != "-1" and id2 != "-1")
	try:
		rating1 = ratings[id1]
		rating2 = ratings[id2]
	except:
		print "ids not present in ratings dictionary"
		print id1, id2
		return
	ratings[id1], ratings[id2] = rate_1vs1(rating1, rating2)
	# if id1 is not None and id2 is not None:
	# 	graph.append((id2, id1))
	# else:
	# 	error_counter += 1

question_flag = "q"

def getQuestionKey(qid):
	return question_flag + qid

def isQuestionKey(qid):
	return qid.startswith(question_flag)

def removeQuestionFlag(qid):
	if isQuestionKey(qid):
		ending_index = qid.find(question_flag) + len(question_flag)
		return qid[ending_index:]
	else:
		assert(False)

counter = 0
for question_id in questions.keys():
	counter += 1
	if counter % 1000 == 0:
		print counter
	post = questions[question_id]
	for user_id in post.non_best_answer_user_ids:
		ratings[user_id] = Rating()
	ratings[getQuestionKey(question_id)] = Rating()
	ratings[post.best_answer_user_id] = Rating()
	ratings[post.asker_id] = Rating()

counter = 0
for question_id in questions.keys():
	counter += 1
	if counter % 1000 == 0:
		print counter
	post = questions[question_id]
	for user_id in post.non_best_answer_user_ids:
		competeAndUpdate(post.best_answer_user_id, user_id)
	competeAndUpdate(post.best_answer_user_id, post.asker_id)
	competeAndUpdate(post.best_answer_user_id, getQuestionKey(question_id))
	competeAndUpdate(getQuestionKey(question_id), post.asker_id)

# from hits_nx import hits_nx
# import networkx as nx

# G=nx.Graph()

# for edge in graph:
#     G.add_edge(*edge)

# h,a=hits_nx(G)

# difficulty = dict()
# for i in questions.keys():
#     if(h.has_key(getQuestionKey(i))):
#         difficulty[int(i)] = h[getQuestionKey(i)]
#     else:
#         difficulty[int(i)]=0

# computeAccuracy(difficulty)


ratings_new = dict()

for rating in ratings.keys():
	if rating is not None and isQuestionKey(rating):
		ratings_new[int(removeQuestionFlag(rating))] = ratings[rating].mu

computeAccuracy(ratings_new)