Sciweavers

409 search results - page 19 / 82
» The Web as a Graph: Measurements, Models, and Methods
Sort
View
KDD
2004
ACM
124views Data Mining» more  KDD 2004»
15 years 10 months ago
Eigenspace-based anomaly detection in computer systems
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
Hisashi Kashima, Tsuyoshi Idé
ATAL
2009
Springer
15 years 4 months ago
Graph-based methods for the analysis of large-scale multiagent systems
Multiagent systems are often characterized by complex, and sometimes unpredictable interactions amongst their autonomous components. While these systems can provide robust and sca...
Wilbur Peng, William Krueger, Alexander Grushin, P...
TSC
2008
140views more  TSC 2008»
14 years 9 months ago
Dynamic Web Service Selection for Reliable Web Service Composition
This paper studies the dynamic Web service selection problem in a failure-prone environment, which aims to determine a subset of Web services to be invoked at runtime so as to succ...
San-Yih Hwang, Ee-Peng Lim, Chien-Hsiang Lee, Chen...
WWW
2008
ACM
15 years 10 months ago
Web page rank prediction with markov models
In this paper we propose a method for predicting the ranking position of a Web page. Assuming a set of successive past top-k rankings, we study the evolution of Web pages in terms...
Michalis Vazirgiannis, Dimitris Drosos, Pierre Sen...
ICPR
2004
IEEE
15 years 11 months ago
A Probabilistic Approach to Learning Costs for Graph Edit Distance
Graph edit distance provides an error-tolerant way to measure distances between attributed graphs. The effectiveness of edit distance based graph classification algorithms relies ...
Horst Bunke, Michel Neuhaus