2137 search results - page 164 / 428 » Experiments on Graph Clustering Algorithms |
ICPR
2002
IEEE
15 years 7 months ago
2002
IEEE
Kernel functions can be viewed as a non-linear transformation that increases the separability of the input data by mapping them to a new high dimensional space. The incorporation ...
125
Voted
ICANN
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. Competitive learning approaches with penalization or cooperation mechanism have been applied to unsupervised data clustering due to their attractive ability of automatic ...
140
click to vote
ISBI
2011
IEEE
14 years 6 months ago
2011
IEEE
High angular resolution diffusion imaging (HARDI) allows in vivo analysis of the white matter structure and connectivity. Based on orientation distribution functions (ODFs) that r...
124
Voted
KDD
2010
ACM
15 years 6 months ago
2010
ACM
Mining cluster evolution from multiple correlated time-varying text corpora is important in exploratory text analytics. In this paper, we propose an approach called evolutionary h...
118
click to vote
PLDI
2004
ACM
15 years 7 months ago
2004
ACM
Although dynamic program slicing was first introduced to aid in user level debugging, applications aimed at improving software quality, reliability, security, and performance hav...