360 search results - page 9 / 72 » Spatial Clustering Algorithm Based on Hierarchical-Partition... |
EUROCAST
2009
Springer
14 years 3 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...
IWANN
2009
Springer
14 years 2 months ago
2009
Springer
Cluster analysis is a technique used in a variety of fields. There are currently various algorithms used for grouping elements that are based on different methods including partiti...
ICDM
2003
IEEE
14 years 1 months ago
2003
IEEE
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
COCOA
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...