An approach for multi-objective categorization based on the game theory and Markov process

被引:21
作者
Liu, Wei-Yi [1 ]
Yue, Kun [1 ]
Wu, Tian-Ying [1 ]
Wei, Mu-Jin [1 ]
机构
[1] Yunnan Univ, Sch Informat Sci & Engn, Dept Comp Sci & Engn, Kunming 650091, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-objective categorization; Shapley value; Coalitional games; Priority groups; Markov process;
D O I
10.1016/j.asoc.2011.02.023
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Realistic objects are not only described by their own attributes, but also described by their mutual relationships in a specific domain. By mainly considering the mutual associations among the given objects, in this paper we propose a method for multi-objective categorization based on the game theory and Markov process. We adopt Shapley value in coalitional games to measure the player's satisfaction degree in a group. We then give the concept of priority groups and an algorithm to combine small-size priority groups to large-size ones, and thus the efficiency of calculating the players' satisfaction degree can be improved. We further define a improving-replay Markov process to model the process of forming a reasonable payoff configuration. Accordingly, we give a simulation algorithm to obtain the desired payoff configuration to categorize players into groups by their satisfaction degrees. Finally, we give experimental results and performance studies to verify the efficiency and effectiveness of our methods. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:4087 / 4096
页数:10
相关论文
共 29 条
[1]
Dynamic coalition formation and the core [J].
Arnold, T ;
Schwalbe, U .
JOURNAL OF ECONOMIC BEHAVIOR & ORGANIZATION, 2002, 49 (03) :363-380
[2]
Aumann J., 1960, B AM MATH SOC, V66, P173, DOI [10.1090/S0002-9904-1960-10418-1, DOI 10.1090/S0002-9904-1960-10418-1]
[3]
Aumann R. J., 1964, BARGAINING SET COOPE, P443
[4]
Conitzer V, 2004, PROCEEDING OF THE NINETEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE SIXTEENTH CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE, P219
[5]
Deng X., 1944, MATH OPER RES, V19, P257
[6]
*ED BOARD MATH HDB, 1977, MATH HDB
[7]
A linear approximation method for the Shapley value [J].
Fatima, Shaheen S. ;
Wooldridge, Michael ;
Jennings, Nicholas R. .
ARTIFICIAL INTELLIGENCE, 2008, 172 (14) :1673-1699
[8]
Collaborative clustering with background knowledge [J].
Forestier, G. ;
Gancarski, P. ;
Wemmert, C. .
DATA & KNOWLEDGE ENGINEERING, 2010, 69 (02) :211-228
[9]
Han J, 2000, Data mining: Concepts and Techniques
[10]
Data clustering: 50 years beyond K-means [J].
Jain, Anil K. .
PATTERN RECOGNITION LETTERS, 2010, 31 (08) :651-666