Sciweavers

2137 search results - page 110 / 428
» Experiments on Graph Clustering Algorithms
Sort
View
ICASSP
2011
IEEE
13 years 8 months ago
Non-flat clustering whith alpha-divergences
The scope of the well-known k-means algorithm has been broadly extended with some recent results: first, the k- means++ initialization method gives some approximation guarantees...
Olivier Schwander, Frank Nielsen
WAW
2007
Springer
89views Algorithms» more  WAW 2007»
14 years 4 months ago
Bias Reduction in Traceroute Sampling - Towards a More Accurate Map of the Internet
Traceroute sampling is an important technique in exploring the internet router graph and the autonomous system graph. Although it is one of the primary techniques used in calculati...
Abraham D. Flaxman, Juan Vera
ISAAC
2010
Springer
226views Algorithms» more  ISAAC 2010»
13 years 8 months ago
On Tractable Cases of Target Set Selection
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
André Nichterlein, Rolf Niedermeier, Johann...
ISPA
2005
Springer
14 years 4 months ago
COMPACT: A Comparative Package for Clustering Assessment
Abstract. There exist numerous algorithms that cluster data-points from largescale genomic experiments such as sequencing, gene-expression and proteomics. Such algorithms may emplo...
Roy Varshavsky, Michal Linial, David Horn
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
14 years 11 months ago
Dynamic hybrid clustering of bioinformatics by incorporating text mining and citation analysis
To unravel the concept structure and dynamics of the bioinformatics field, we analyze a set of 7401 publications from the Web of Science and MEDLINE databases, publication years 1...
Bart De Moor, Frizo A. L. Janssens, Wolfgang Gl&au...