How Many Pairwise Preferences Do We Need to Rank A Graph Consistently?
Aadirupa SahaRakesh ShivannaChiranjib BhattacharyyaPublished in: CoRR (2018)
Keyphrases
- pairwise
- pairwise interactions
- graph matching
- similarity scores
- graph theoretic
- graph structure
- higher order relations
- graph theory
- multi class
- markov random field
- grows quadratically
- min cut
- higher order
- spectral graph partitioning
- graph based algorithm
- decision making
- directed graph
- structured data
- random walk
- multi attribute
- ranked list
- user preferences
- graph model
- graph databases
- graph representation
- semi supervised
- graphical representation
- spectral clustering
- connected graphs
- pairwise comparisons
- weighted graph
- mutual reinforcement
- preference elicitation
- directed acyclic graph
- loss function
- similarity measure