2137 search results - page 178 / 428 » Experiments on Graph Clustering Algorithms |
AE
2007
Springer
14 years 3 months ago
2007
Springer
The evaluation or fitness function is a key component of any heuristic search algorithm. This paper introduces a new evaluation function for the well-known graph K-coloring proble...
EUROSYS
2010
ACM
14 years 6 months ago
2010
ACM
As organizations start to use data-intensive cluster computing systems like Hadoop and Dryad for more applications, there is a growing need to share clusters between users. Howeve...
PAKDD
2007
ACM
14 years 3 months ago
2007
ACM
While null space based linear discriminant analysis (NLDA) obtains a good discriminant performance, the ability easily suffers from an implicit assumption of Gaussian model with sa...
ICISC
2004
13 years 11 months ago
2004
Abstract. Anomaly detection, detection of deviations from what is considered normal, is an important complement to misuse detection based on attack signatures. Anomaly detection in...
KDD
2009
ACM
14 years 10 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...