Sciweavers

159 search results - page 6 / 32
» Consistent Minimization of Clustering Objective Functions
Sort
View
CEC
2005
IEEE
15 years 5 months ago
Adaptive cluster covering and evolutionary approach: comparison, differences and similarities
In case the objective function to be minimized is not known analytically and no assumption can be made about the single extremum, global optimization (GO) methods must be used. Pap...
Dimitri P. Solomatine
NIPS
2008
15 years 1 months ago
Measures of Clustering Quality: A Working Set of Axioms for Clustering
Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) tha...
Shai Ben-David, Margareta Ackerman
PKDD
2010
Springer
177views Data Mining» more  PKDD 2010»
14 years 10 months ago
ITCH: Information-Theoretic Cluster Hierarchies
Hierarchical clustering methods are widely used in various scientific domains such as molecular biology, medicine, economy, etc. Despite the maturity of the research field of hie...
Christian Böhm, Frank Fiedler, Annahita Oswal...
DMKD
1997
ACM
308views Data Mining» more  DMKD 1997»
15 years 3 months ago
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining
Partitioning a large set of objects into homogeneous clusters is a fundamental operation in data mining. The k-means algorithm is best suited for implementing this operation becau...
Zhexue Huang
EOR
2010
99views more  EOR 2010»
14 years 11 months ago
Min sum clustering with penalties
Traditionally, clustering problems are investigated under the assumption that all objects must be clustered. A shortcoming of this formulation is that a few distant objects, calle...
Refael Hassin, Einat Or