Sciweavers

378 search results - page 24 / 76
» An objective evaluation criterion for clustering
Sort
View
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
13 years 9 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...
SADM
2008
165views more  SADM 2008»
13 years 7 months ago
Global Correlation Clustering Based on the Hough Transform
: In this article, we propose an efficient and effective method for finding arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set o...
Elke Achtert, Christian Böhm, Jörn David...
GIS
2007
ACM
14 years 1 months ago
Predicting future locations using clusters' centroids
As technology advances we encounter more available data on moving objects, thus increasing our ability to mine spatiotemporal data. We can use this data for learning moving object...
Sigal Elnekave, Mark Last, Oded Maimon
FLAIRS
2007
13 years 10 months ago
Contextual Concept Discovery Algorithm
In this paper, we focus on the ontological concept extraction and evaluation process from HTML documents. In order to improve this process, we propose an unsupervised hierarchical...
Lobna Karoui, Marie-Aude Aufaure, Nacéra Be...
CEC
2007
IEEE
14 years 2 months ago
Solving multimodal problems via multiobjective techniques with Application to phase equilibrium detection
Abstract— For solving multimodal problems by means of evolutionary algorithms, one often resorts to multistarts or niching methods. The latter approach the question: ‘What is e...
Mike Preuss, Günter Rudolph, Feelly Tumakaka