Name
Abstract | ||
|---|---|---|
The number of services on the web is growing every day and finding useful and efficient ranking methods for services has become
an important issue in modern web applications. In this paper we present a link-based importance model and efficient algorithms
for distributed services collaborating through service calls. We adapt the PageRank algorithm and define a service importance
that reflects its activity and its contribution to the quality of other services.
|
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11914853_20 | BDA |
Keywords | DocType | Volume |
important issue,modern web application,service importance,efficient ranking method,pagerank algorithm,link-based importance model,efficient algorithm,link-based ranking model | Conference | 4275 |
ISSN | ISBN | Citations |
0302-9743 | 3-540-48287-3 | 2 |
PageRank | References | Authors |
0.38 | 19 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Camélia Constantin | 1 | 9 | 4.87 |
| Bernd Amann | 2 | 425 | 59.99 |
| David Gross-Amblard | 3 | 63 | 101.22 |