We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as we...
Jacob Abernethy, Olivier Chapelle, Carlos Castillo
Personalization of web search results as a technique for improving user satisfaction has received notable attention in the research community over the past decade. Much of this wo...
Self-managing solutions have recently attracted a lot of interest from the database community. The need for self-* properties is more evident in distributed applications comprising...
We introduce a stricter Web community definition to overcome boundary ambiguity of a Web community defined by Flake, Lawrence and Giles [2], and consider the problem of finding co...