705 search results - page 21 / 141 » Proximity Cluster Trees |
ISNN
2004
Springer
14 years 29 days ago
2004
Springer
This paper proposes a novel hierarchical clustering method that can classify given data without specified knowledge of the number of classes. In this method, at each node of a hie...
ICMCS
2006
IEEE
14 years 1 months ago
2006
IEEE
EM algorithm is an important unsupervised clustering algorithm, but the algorithm has several limitations. In this paper, we propose a fast EM algorithm (FEMA) to address the limi...
EUROCAST
2009
Springer
14 years 2 months ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising in particular in network design. There exist various exact and metaheuri...
ICDCS
2012
IEEE
11 years 10 months ago
2012
IEEE
—Mining trajectory data has been gaining significant interest in recent years. However, existing approaches to trajectory clustering are mainly based on density and Euclidean di...
CPM
2005
Springer
14 years 1 months ago
2005
Springer
Permutations on strings representing gene clusters on genomes have been studied earlier in [18, 14, 3, 12, 17] and the idea of a maximal permutation pattern was introduced in [12]....