News for hackers. Stuff that matters.

A comment on Project Alexandria – A graph based book exploration and recommendation engine.

Re:Project Alexandria – A graph based book exploration and r... by stared on Tuesday January 19, 2016 @04:44AM (#10929603)
It would be great if the graph was larger. Or rather - any non-trivial graph, with diameter > 2 and interconnections (rather just star of 6 nodes).
[ Parent | on HN ]
Re:Project Alexandria – A graph based book exploration and r... by gilleain on Tuesday January 19, 2016 @04:53AM (#10929637)
If you click on a leaf node, it walks the graph, expanding as it goes. Managed to find a triangle at one point. I wonder what the edges really are - some similarity measure, but what exactly?
[ Parent | on HN ]
Re:Project Alexandria – A graph based book exploration and r... by odabaxok on Tuesday January 19, 2016 @05:02AM (#10929672)
If you hover over an edge you will see what similarity measure it uses.
[ Parent | on HN ]