94 search results - page 15 / 19 » Graph regularization methods for Web spam detection |
JDCTA
2010
13 years 2 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
ML
2000
ACM
13 years 7 months ago
2000
ACM
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
ADMA
2008
Springer
14 years 1 months ago
2008
Springer
Customer retention is crucial for any company relying on a regular client base. One way to approach this problem is to analyse actual user behaviour and take proper actions based o...
MICS
2008
13 years 6 months ago
2008
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
CSL
2004
Springer
13 years 7 months ago
2004
Springer
This article describes an algorithm called HyperLex that is capable of automatically determining word uses in a textbase without recourse to a dictionary. The algorithm makes use ...