Sciweavers

1263 search results - page 25 / 253
» An objective approach to cluster validation
Sort
View
ASIAMS
2007
IEEE
15 years 4 months ago
Solving Shortest Capacitated Path Problem Using a Bi-Objective Heuristic Approach
The shortest capacitated path problem is a well known problem in the networking area, having a wide range of applications. In the shortest capacitated path problem, a traffic flow...
Crina Grosan, Ajith Abraham
PAKDD
2009
ACM
123views Data Mining» more  PAKDD 2009»
15 years 2 months ago
Clustering with Lower Bound on Similarity
We propose a new method, called SimClus, for clustering with lower bound on similarity. Instead of accepting k the number of clusters to find, the alternative similarity-based app...
Mohammad Al Hasan, Saeed Salem, Benjarath Pupacdi,...
EDBT
2004
ACM
147views Database» more  EDBT 2004»
15 years 3 months ago
Clustering Multidimensional Extended Objects to Speed Up Execution of Spatial Queries
Abstract. We present a cost-based adaptive clustering method to improve average performance of spatial queries (intersection, containment, enclosure queries) over large collections...
Cristian-Augustin Saita, François Llirbat
KDD
2005
ACM
157views Data Mining» more  KDD 2005»
15 years 10 months ago
A fast kernel-based multilevel algorithm for graph clustering
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
DAGM
2007
Springer
15 years 4 months ago
Clustered Stochastic Optimization for Object Recognition and Pose Estimation
We present an approach for estimating the 3D position and in case of articulated objects also the joint configuration from segmented 2D images. The pose estimation without initial...
Juergen Gall, Bodo Rosenhahn, Hans-Peter Seidel