616 search results - page 58 / 124 » Minimum Spanning Tree Based Clustering Algorithms |
171
Voted
KDD
2003
ACM
16 years 4 months ago
2003
ACM
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
146
Voted
TJS
2010
15 years 2 months ago
2010
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
150
Voted
CIE
2007
Springer
15 years 10 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
157
click to vote
CAD
2007
Springer
15 years 3 months ago
2007
Springer
The reconstruction of a surface model from a point cloud is an important task in the reverse engineering of industrial parts. We aim at constructing a curve network on the point c...
123
Voted
ICIP
2009
IEEE
15 years 1 months ago
2009
IEEE
We propose a region-based method to extract semantic foreground regions from color video sequences with static backgrounds. First, we introduce a new distance measure for backgrou...