1 / 26

Brett Boge CS 765 University of Nevada, Reno

A Hybrid Recommender System Using Link Analysis and Genetic Tuning in the Bipartite Network of BoardGameGeek.com. Brett Boge CS 765 University of Nevada, Reno. Data (Overview). Data (Scope). Starting with the top 5,000 games

pete
Download Presentation

Brett Boge CS 765 University of Nevada, Reno

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. A Hybrid Recommender System Using Link Analysis and Genetic Tuning in the Bipartite Network of BoardGameGeek.com Brett Boge CS 765 University of Nevada, Reno

  2. Data (Overview)

  3. Data (Scope) • Starting with the top 5,000 games • List of users == those which have rated at least one of the top 5,000 games • Users with no ratings cannot be connected to anycomponent of the graph, and can only be evaluatedin the most general sense

  4. Data (Retrieval) • Data will be obtained through the BGG XML API2 • Game|Small World, id 40692 • http://boardgamegeek.com/xmlapi2/thing?id=40692&ratingcomments=1 • User|Licinian • http://boardgamegeek.com/xmlapi2/user?name=Licinian • http://boardgamegeek.com/xmlapi2/ • collection?name=Licinian • &own/played/trade/want/wishlist/etc

  5. Data (Sets)

  6. General Approach

  7. General Approach Approaches R. Burke, "Hybrid recommender systems: Survey and experiments,"

  8. General Approach Approaches

  9. Link Analysis Step Approaches From Z. Huang, et al., "A Link analysis approach to recommendation under sparse data," 2004.

  10. ConsumerRepresentativeness • Matrix Link Analysis Step Approaches • ProductRepresentativeness • Matrix From Z. Huang, et al., "A Link analysis approach to recommendation under sparse data," 2004.

  11. ConsumerRepresentativeness • Matrix Link Analysis Step Approaches • ProductRepresentativeness • Matrix From Z. Huang, et al., "A Link analysis approach to recommendation under sparse data," 2004.

  12. ConsumerRepresentativeness • Matrix Link Analysis Step Approaches • ProductRepresentativeness • Matrix From Z. Huang, et al., "A Link analysis approach to recommendation under sparse data," 2004.

  13. Content-based Cascade Approaches • ProductRepresentativeness • Matrix PRi

  14. Content-based Cascade Approaches

  15. Content-based Cascade Approaches These will need to be normalized on the same scale (0.00 - 1.00)

  16. Content-based Cascade Approaches

  17. Content-based Cascade Approaches • Create PRfinal by refining PR: • W is a vector of weights which determine how much a givenproperty should effect the original score

  18. Genetic Tuning Approaches • W needs to be defined optimally for this given domain • A genetic algorithm will be used to tune W • Chromosome = sequential binary representation of W • Fitness based on Rank Score (from Huang et al.) • 8 bits per weight, ranging from 0 - .25 to start • Rates of crossover/mutation TBD

More Related