Sciweavers

366 search results - page 9 / 74
» Detecting the Number of Clusters in n-Way Probabilistic Clus...
Sort
View
ISICA
2009
Springer
14 years 2 months ago
Detecting Network Anomalies Using CUSUM and EM Clustering
Abstract. Intrusion detection has been extensively studied in the last two decades. However, most existing intrusion detection techniques detect limited number of attack types and ...
Wei Lu, Hengjian Tong
ICDE
2009
IEEE
171views Database» more  ICDE 2009»
14 years 9 months ago
A Framework for Clustering Massive-Domain Data Streams
In this paper, we will examine the problem of clustering massive domain data streams. Massive-domain data streams are those in which the number of possible domain values for each a...
Charu C. Aggarwal
IPPS
2006
IEEE
14 years 1 months ago
Dynamic resource allocation of computer clusters with probabilistic workloads
Real-time resource scheduling is an important factor for improving the performance of cluster computing. In many distributed and parallel processing systems, particularly real-tim...
Marwan S. Sleiman, Lester Lipsky, Robert Sheahan
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 7 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
TKDE
2012
250views Formal Methods» more  TKDE 2012»
11 years 9 months ago
Dense Subgraph Extraction with Application to Community Detection
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
Jie Chen 0007, Yousef Saad