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

Actually, we will also train on whitepapers (because otherwise I would

Browse Source 
have to fix an ugly bug)
This commit is contained in:
Dominik Moritz Roth 2021-10-17 15:52:52 +02:00
parent ce99e5301b
commit 7f51f139f2
1 changed files with 1 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
caliGraph.py
View File

@ -795,7 +795,7 @@ def waveFlow(G, node, n, dist, menge, firstEdge=False):
if node in bestlist or node in keeplist: if node in bestlist or node in keeplist:
waveFlow(G, node, m, dist, menge, firstEdge=firstEdge) waveFlow(G, node, m, dist, menge, firstEdge=firstEdge)
def evaluateFitness(books, debugPrint=False, ignoreWhitepapers=True): def evaluateFitness(books, debugPrint=False):
global weights global weights
G = buildBookGraph(books) G = buildBookGraph(books)
graphAddAuthors(G, books) graphAddAuthors(G, books)
@ -804,9 +804,6 @@ def evaluateFitness(books, debugPrint=False, ignoreWhitepapers=True):
graphAddSeries(G, books) graphAddSeries(G, books)
graphAddTags(G, books) graphAddTags(G, books)
if ignoreWhitepapers:
removeWhitepapers(G)
ratedBooks = [n for n in list(G.nodes) if 'rating' in G.nodes[n] and G.nodes[n]['rating'] != None] ratedBooks = [n for n in list(G.nodes) if 'rating' in G.nodes[n] and G.nodes[n]['rating'] != None]
boundsLoss = 0 boundsLoss = 0
linSepLoss = [] linSepLoss = []