Debbie Rank Typed Graph Walks Presentation Gregory Todd Williams 2

Question is for the Presentation: Debbie Rank Typed Graph Walks Presentation
Question is asked by: Gregory Todd Williams
The Question is: The model presented in the paper assumes every node x has a type τ(x). This model is clearly different from the RDF model in which a node many have zero or more types. Can the ranking approach in the paper be modified to support more flexible graph models such as RDF, or is the assumption of unique node typing fundamental?

Question asked	The model presented in the paper assumes e … The model presented in the paper assumes every node x has a type τ(x). This model is clearly different from the RDF model in which a node many have zero or more types. Can the ranking approach in the paper be modified to support more flexible graph models such as RDF, or is the assumption of unique node typing fundamental? umption of unique node typing fundamental?
Question asked by	Gregory Todd Williams +
Question for the Presentation	Debbie Rank Typed Graph Walks Presentation +