137 search results - page 12 / 28 » Clustering in Trees: Optimizing Cluster Sizes and Number of ... |
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Unsupervised learning methods often involve summarizing the data using a small number of parameters. In certain domains, only a small subset of the available data is relevant for ...
GECCO
2004
Springer
14 years 24 days ago
2004
Springer
GA-based clustering algorithms often employ either simple GA, steady state GA or their variants and fail to consistently and efficiently identify high quality solutions (best known...
GECCO
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. Feature extraction based on evolutionary search offers new possibilities for improving classification accuracy and reducing measurement complexity in many data mining and...