Sciweavers

641 search results - page 22 / 129
» Collusion set detection using graph clustering
Sort
View
ACSAC
2005
IEEE
14 years 2 months ago
Understanding Complex Network Attack Graphs through Clustered Adjacency Matrices
We apply adjacency matrix clustering to network attack graphs for attack correlation, prediction, and hypothesizing. We self-multiply the clustered adjacency matrices to show atta...
Steven Noel, Sushil Jajodia
MICCAI
2010
Springer
13 years 7 months ago
Morphology-Guided Graph Search for Untangling Objects: C. elegans Analysis
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
Tammy Riklin Raviv, Vebjorn Ljosa, Annie L. Conery...
EDBT
2012
ACM
228views Database» more  EDBT 2012»
11 years 11 months ago
Finding maximal k-edge-connected subgraphs from a large graph
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...
Rui Zhou, Chengfei Liu, Jeffrey Xu Yu, Weifa Liang...
TVCG
2008
95views more  TVCG 2008»
13 years 8 months ago
Improving the Readability of Clustered Social Networks using Node Duplication
Exploring communities is an important task in social network analysis. Such communities are currently identified using clustering methods to group actors. This approach often leads...
Nathalie Henry, Anastasia Bezerianos, Jean-Daniel ...
AIRWEB
2007
Springer
14 years 2 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla