How Many Pairwise Preferences Do We Need to Rank a Graph Consistently?
Aadirupa SahaRakesh ShivannaChiranjib BhattacharyyaPublished in: AAAI (2019)
Keyphrases
- pairwise
- graph matching
- pairwise interactions
- higher order relations
- graph theory
- user preferences
- graph structure
- markov random field
- similarity measure
- similarity scores
- graph model
- directed graph
- grows quadratically
- mutual reinforcement
- pairwise comparisons
- multi class
- weighted graph
- connected components
- bipartite graph
- structured data
- decision making
- higher order
- random walk
- pairwise similarities
- min cut
- graph representation
- spanning tree
- soft constraints
- similarity matrix
- adjacency matrix
- preference elicitation
- graph theoretic
- graph partitioning
- semi supervised
- spectral clustering
- ranked list