模式识别与人工智能
Tuesday, Apr. 22, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2013, Vol. 26 Issue (9): 891-898    DOI:
Orignal Article Current Issue| Next Issue| Archive| Adv Search |
Aggregation of Satisfactory Rankings for CP-Nets Based on Voting System
SUN Xue-Jiao,LIU Jing-Lei
School of Computer Science,Yantai University,Yantai 264005

Download: PDF (372 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The satisfactory ranking for conditional preference networks (CP-Nets) is a ranking of all outcomes acquired from preferences of decision maker,and its preference relation is incomplete and transitive. The feasibility on aggregation of satisfactory rankings for CP-Nets with traditional voting system is analyzed. The detailed realizations and performance analysis on aggregation of satisfactory rankings with the majority rule and positional voting are individually introduced. So it realizes the promotion and application of voting system from completeness to non-completeness.
Key wordsCondition Preference Networks(CP-Nets)      Satisfactory Ranking      Voting System     
Aggregation
     
Received: 25 October 2012     
ZTFLH: TP301  
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
SUN Xue-Jiao
LIU Jing-Lei
Cite this article:   
SUN Xue-Jiao,LIU Jing-Lei. Aggregation of Satisfactory Rankings for CP-Nets Based on Voting System[J]. , 2013, 26(9): 891-898.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2013/V26/I9/891
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn