Evaluating Recommendation Algorithms by Graph Analysis: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:1402:14, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,862 bytes +1,862‎ Created page with "Title: Evaluating Recommendation Algorithms by Graph Analysis Main Research Question: How can we evaluate recommendation algorithms by analyzing the implicit graph underlying the recommender dataset? Methodology: 1. We present a novel framework for evaluating recommendation algorithms based on the 'jumps' they make to connect people to artifacts. This approach emphasizes reachability within the implicit graph structure and serves as a complement to evaluation in terms..."
Retrieved from "https://simplesci.org/wiki/Evaluating_Recommendation_Algorithms_by_Graph_Analysis"