.png){kind=icon}
.png){kind=icon}
Return
Fuzzy Ranking-Based Preference Completion via Graph Pattern Matching and Rematching
.png){kind=icon}
PRE
AI
DOI：10.1109/TETCI.2024.3359096.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As an emerging topic on preference learning, aiming at deducting the linear order of alternatives from the partial ranking, preference completion is to complete the preference of the target agent to form a linear order from the preferences of other agents under certain complex requirements. In order to improve the effectiveness and efficiency of preference completion in Big Data environments, firstly the preference graph is introduced to represent the collective preference of the agents over the alternatives with a certain consensus algorithm following the preference of the target agent. This preference graph can preserve rich information between agents. In addition, with the introduction of fuzzy ranking, it can illustrate the fuzziness of the target agent that can include several ranking options of the target agent over alternatives. Then, the satisfied preference can be matched from the preference graph with the fuzzy ranking requested by the target agent via isomorphism-based graph pattern matching. With the matched preference, the preference of the target agent can be completed. If the completed preference is not satisfied, the target agent can modify the fuzzy ranking, process the graph pattern rematching and complete the preference again. The experimental results show that with several real datasets the effectiveness and efficiency of the fuzzy ranking-based preference completion via graph pattern matching can be validated.
Keywords:
Pattern matching
Ranking (statistics)
Big Data
Consensus algorithm
Computational intelligence
Collaboration
Topology
Fuzzy ranking
preference graph
preference completion
graph pattern matching
partial ranking
Journal
I
IF:
6.5
Papers:
1.4K
Citations:
4.5K