Sciweavers

1241 search results - page 12 / 249
» On detecting space-time clusters
Sort
View
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
ESAS
2007
Springer
14 years 1 months ago
Detecting Node Compromise in Hybrid Wireless Sensor Networks Using Attestation Techniques
Abstract. Node compromise is a serious threat in wireless sensor networks. Particular in networks which are organized in clusters, nodes acting as cluster heads for many cluster no...
Christoph Krauß, Frederic Stumpf, Claudia M....
ICTAI
2008
IEEE
14 years 1 months ago
Knee Point Detection on Bayesian Information Criterion
The main challenge of cluster analysis is that the number of clusters or the number of model parameters is seldom known, and it must therefore be determined before clustering. Bay...
Qinpei Zhao, Mantao Xu, Pasi Fränti
DAGSTUHL
2007
13 years 8 months ago
Subspace outlier mining in large multimedia databases
Abstract. Increasingly large multimedia databases in life sciences, ecommerce, or monitoring applications cannot be browsed manually, but require automatic knowledge discovery in d...
Ira Assent, Ralph Krieger, Emmanuel Müller, T...
DASFAA
2007
IEEE
199views Database» more  DASFAA 2007»
14 years 1 months ago
Detection and Visualization of Subspace Cluster Hierarchies
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
Elke Achtert, Christian Böhm, Hans-Peter Krie...