Sciweavers

990 search results - page 72 / 198
» An efficient data structure for network anomaly detection
Sort
View
ICML
2007
IEEE
15 years 10 months ago
Graph clustering with network structure indices
Graph clustering has become ubiquitous in the study of relational data sets. We examine two simple algorithms: a new graphical adaptation of the k-medoids algorithm and the Girvan...
Matthew J. Rattigan, Marc Maier, David Jensen
IMC
2006
ACM
15 years 3 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
INFOCOM
2003
IEEE
15 years 3 months ago
An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks
— A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data ...
Seema Bandyopadhyay, Edward J. Coyle
AAIM
2007
Springer
118views Algorithms» more  AAIM 2007»
15 years 1 months ago
Significance-Driven Graph Clustering
Abstract. Modularity, the recently defined quality measure for clusterings, has attained instant popularity in the fields of social and natural sciences. We revisit the rationale b...
Marco Gaertler, Robert Görke, Dorothea Wagner
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 2 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou