Davies–Bouldin index

Known as: Davies-Bouldin index 
The Davies–Bouldin index (DBI) (introduced by David L. Davies and Donald W. Bouldin in 1979) is a metric for evaluating clustering algorithms. This… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Spatial clustering is most powerfully technology to spatial data mining. One of impartant part on spatial clustering is cluster… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • table II
Is this relevant?
2016
2016
We study the clustering problem when using Davies-Bouldin index as the optimization criterion. The problem is to partition a… (More)
  • figure 1
  • figure 5
  • figure 7
  • figure 8
  • figure 11
Is this relevant?
2014
2014
A new method for finding fuzzy information granules from multivariate data through a gravitational inspired clustering algorithm… (More)
Is this relevant?
2013
2013
This paper presents a new version of Davies-Bouldin index for clustering validation through the use of a new distance based on… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
In this work, we present a novel framework for automatic feature selection in brain-computer interfaces (BCIs). The proposal… (More)
  • table I
  • table II
  • table V
  • table III
  • table IV
Is this relevant?
2012
2012
This paper explores the predicted hydrologic responses associated with the compounded error of cascading global circulation model… (More)
  • figure 1
  • figure 7
  • figure 8
Is this relevant?
2006
2006
One of the most difficult problems in the design of an anomaly b sed intrusion detection system (IDS) that uses clustering is th… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
2004
2004
The aim of the study was to select the best electroencephalogram features and channel locations for detection of wrist movement… (More)
  • table 1
  • table 11
  • figure 1
  • table 111
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In this article, we evaluate the performance of three clustering algorithms, hard K-Means, single linkage, and a simulated… (More)
  • figure 3
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
Review
1998
Review
1998
We review two clustering algorithms (hard c-means and single linkage) and three indexes of crisp cluster validity (Hubert's… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 5
  • figure 4
Is this relevant?