A novel ranking algorithm for service matching based on agent association graphs

Hao Lan Zhang; Clement H.C. Leung; Gitesh K. Raikundalia; Jing He

doi:10.1109/ICDMW.2010.113

A novel ranking algorithm for service matching based on agent association graphs

Hao Lan Zhang, Clement H.C. Leung, Gitesh K. Raikundalia, Jing He

Department of Computer Science

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

2 Citations (Scopus)

Abstract

An efficient service matching process is crucial for solving complex problems based on heterogeneous agents. Agent cooperation can be achieved through matching requesting agents with service-providing agents, and, through such cooperation, multi-agents can solve a variety of complex problems. Improving the efficiency of the agent-matching process has become an important issue in multi-agent research. The adoption of an appropriate agent-matching mechanism will enhance agent cooperation and communication efficiency within an agent network. In this paper, we develop a new agent-matching algorithm, the Agent-Rank algorithm, which ranks service-providing agents according to their contributions to a nominated requesting agent based on Agent Association Graphs. The Agent-Rank algorithm overcomes the problems of agent-matching in a large agent network through combining the general ranking scores with the request-based ranking scores. In our experimental evaluation, we have found that the Agent-Rank algorithm can significantly improve efficiency in the agent-matching and re-matching processes.

Original language	English
Title of host publication	Proceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010
Pages	1273-1280
Number of pages	8
DOIs	https://doi.org/10.1109/ICDMW.2010.113
Publication status	Published - 2010
Event	10th IEEE International Conference on Data Mining Workshops, ICDMW 2010 - Sydney, NSW, Australia Duration: 14 Dec 2010 → 17 Dec 2010

Publication series

Name	Proceedings - IEEE International Conference on Data Mining, ICDM
ISSN (Print)	1550-4786

Conference

Conference	10th IEEE International Conference on Data Mining Workshops, ICDMW 2010
Country/Territory	Australia
City	Sydney, NSW
Period	14/12/10 → 17/12/10

Scopus Subject Areas

General Engineering

User-Defined Keywords

Agent graph
Agent matching
And multi-agent systems
Ranking algorithm

Access to Document

10.1109/ICDMW.2010.113

Cite this

Zhang, H. L., Leung, C. H. C., Raikundalia, G. K., & He, J. (2010). A novel ranking algorithm for service matching based on agent association graphs. In Proceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010 (pp. 1273-1280). Article 5693440 (Proceedings - IEEE International Conference on Data Mining, ICDM). https://doi.org/10.1109/ICDMW.2010.113

@inproceedings{d024a6a5e2fb4798a4d4ffd3f84de2d4,

title = "A novel ranking algorithm for service matching based on agent association graphs",

abstract = "An efficient service matching process is crucial for solving complex problems based on heterogeneous agents. Agent cooperation can be achieved through matching requesting agents with service-providing agents, and, through such cooperation, multi-agents can solve a variety of complex problems. Improving the efficiency of the agent-matching process has become an important issue in multi-agent research. The adoption of an appropriate agent-matching mechanism will enhance agent cooperation and communication efficiency within an agent network. In this paper, we develop a new agent-matching algorithm, the Agent-Rank algorithm, which ranks service-providing agents according to their contributions to a nominated requesting agent based on Agent Association Graphs. The Agent-Rank algorithm overcomes the problems of agent-matching in a large agent network through combining the general ranking scores with the request-based ranking scores. In our experimental evaluation, we have found that the Agent-Rank algorithm can significantly improve efficiency in the agent-matching and re-matching processes.",

keywords = "Agent graph, Agent matching, And multi-agent systems, Ranking algorithm",

author = "Zhang, {Hao Lan} and Leung, {Clement H.C.} and Raikundalia, {Gitesh K.} and Jing He",

year = "2010",

doi = "10.1109/ICDMW.2010.113",

language = "English",

isbn = "9780769542577",

series = "Proceedings - IEEE International Conference on Data Mining, ICDM",

pages = "1273--1280",

booktitle = "Proceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010",

}

Zhang, HL, Leung, CHC, Raikundalia, GK & He, J 2010, A novel ranking algorithm for service matching based on agent association graphs. in Proceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010., 5693440, Proceedings - IEEE International Conference on Data Mining, ICDM, pp. 1273-1280, 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010, Sydney, NSW, Australia, 14/12/10. https://doi.org/10.1109/ICDMW.2010.113

A novel ranking algorithm for service matching based on agent association graphs. / Zhang, Hao Lan; Leung, Clement H.C.; Raikundalia, Gitesh K. et al.
Proceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010. 2010. p. 1273-1280 5693440 (Proceedings - IEEE International Conference on Data Mining, ICDM).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - A novel ranking algorithm for service matching based on agent association graphs

AU - Zhang, Hao Lan

AU - Leung, Clement H.C.

AU - Raikundalia, Gitesh K.

AU - He, Jing

PY - 2010

Y1 - 2010

N2 - An efficient service matching process is crucial for solving complex problems based on heterogeneous agents. Agent cooperation can be achieved through matching requesting agents with service-providing agents, and, through such cooperation, multi-agents can solve a variety of complex problems. Improving the efficiency of the agent-matching process has become an important issue in multi-agent research. The adoption of an appropriate agent-matching mechanism will enhance agent cooperation and communication efficiency within an agent network. In this paper, we develop a new agent-matching algorithm, the Agent-Rank algorithm, which ranks service-providing agents according to their contributions to a nominated requesting agent based on Agent Association Graphs. The Agent-Rank algorithm overcomes the problems of agent-matching in a large agent network through combining the general ranking scores with the request-based ranking scores. In our experimental evaluation, we have found that the Agent-Rank algorithm can significantly improve efficiency in the agent-matching and re-matching processes.

AB - An efficient service matching process is crucial for solving complex problems based on heterogeneous agents. Agent cooperation can be achieved through matching requesting agents with service-providing agents, and, through such cooperation, multi-agents can solve a variety of complex problems. Improving the efficiency of the agent-matching process has become an important issue in multi-agent research. The adoption of an appropriate agent-matching mechanism will enhance agent cooperation and communication efficiency within an agent network. In this paper, we develop a new agent-matching algorithm, the Agent-Rank algorithm, which ranks service-providing agents according to their contributions to a nominated requesting agent based on Agent Association Graphs. The Agent-Rank algorithm overcomes the problems of agent-matching in a large agent network through combining the general ranking scores with the request-based ranking scores. In our experimental evaluation, we have found that the Agent-Rank algorithm can significantly improve efficiency in the agent-matching and re-matching processes.

KW - Agent graph

KW - Agent matching

KW - And multi-agent systems

KW - Ranking algorithm

UR - http://www.scopus.com/inward/record.url?scp=79951762981&partnerID=8YFLogxK

U2 - 10.1109/ICDMW.2010.113

DO - 10.1109/ICDMW.2010.113

M3 - Conference proceeding

AN - SCOPUS:79951762981

SN - 9780769542577

T3 - Proceedings - IEEE International Conference on Data Mining, ICDM

SP - 1273

EP - 1280

BT - Proceedings - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010

T2 - 10th IEEE International Conference on Data Mining Workshops, ICDMW 2010

Y2 - 14 December 2010 through 17 December 2010

ER -

A novel ranking algorithm for service matching based on agent association graphs

Abstract

Publication series

Conference

Scopus Subject Areas

User-Defined Keywords

Access to Document

Other files and links

Fingerprint

Cite this