539 search results - page 36 / 108 » Finding Groups in Data: Cluster Analysis with Ants |
KDD
2005
ACM
16 years 7 days ago
2005
ACM
While the vast majority of clustering algorithms are partitional, many real world datasets have inherently overlapping clusters. Several approaches to finding overlapping clusters...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
We illustrate with two simple examples how Interactive Evolutionary Computation (IEC) can be applied to Exploratory Data Analysis (EDA). IEC is particularly valuable in an EDA cont...
BMCBI
2008
14 years 12 months ago
2008
Background: The identification and study of proteins from metagenomic datasets can shed light on the roles and interactions of the source organisms in their communities. However, ...
CIDU
2010
14 years 9 months ago
2010
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
100
click to vote
ENGL
2007
14 years 11 months ago
2007
— The paper aims at designing a scheme for automatic identification of a species from its genome sequence. A set of 64 three-tuple keywords is first generated using the four type...