CogSci 2018 bespoke paper recommendations
Brought to you by the LUCID graduate training program
NOTE this is a system prototype. We are interested to know (1) whether the system works smoothely without substantial delay and (2) whether the recommendations seem appropriate. Please email your feedback to email@example.com with the subject line: Paper Recommender
Graphing relations among CogSci 2018 talks
To help organize sessions this year, we computed latent topics for the discipline from publications submitted by reviewers and editors, then represented each accepted talk as its posterior probability over topics. To visualize the conceptual relations among talks, the resulting similarities were used to generate a 5-nearest-neighbor graph, which you can view by clicking one of the links below. Hover over nodes to see both the paper title and nearest neighbors on thew graph. Click a node to highlight it and its nearest neighbors. Drag nodes to move them. Colors indicate graph communities identified by the spinglass algorithm. The static graph shows an arrangement generated by the Fruchterman-Reingold algorithm. The dynamic graph runs the settling process for a force-directed layout from an initial random assignment. Pull the nodes around to see what happens to the layout!