An Explainable Recommendation Based on Acyclic Paths in an Edge-Colored Graph.
Kosuke ChinoneAtsuyoshi NakamuraPublished in: AI (2022)
Keyphrases
- disjoint paths
- weighted graph
- undirected graph
- directed graph
- shortest path
- approximation algorithms
- strongly connected
- graph structure
- np hard
- edge detection
- graph model
- edge weights
- structured data
- vertex set
- bipartite graph
- graph theory
- directed acyclic graph
- edge information
- connected graphs
- graph representation
- graph theoretic
- graph construction
- bounded treewidth
- spanning tree
- graph partitioning
- graph databases
- path length
- minimum spanning tree
- multiscale
- np complete
- semi supervised
- special case