1839 search results - page 230 / 368 » Feature Selection in Clustering Problems |
EUROGP
1998
Springer
14 years 2 months ago
1998
Springer
The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Kn...
CIKM
2008
Springer
14 years 5 days ago
2008
Springer
If Kolmogorov complexity [25] measures information in one object and Information Distance [4, 23, 24, 42] measures information shared by two objects, how do we measure information...
IIS
2003
13 years 11 months ago
2003
Current research on the VINLEN inductive database system is briefly reviewed and illustrated by selected results. The goal of research on VINLEN is to develop a methodology for de...
DKE
2007
13 years 10 months ago
2007
A major challenge in frequent-pattern mining is the sheer size of its mining results. To compress the frequent patterns, we propose to cluster frequent patterns with a tightness m...
ICDM
2006
IEEE
14 years 4 months ago
2006
IEEE
Much work on skewed, stochastic, high dimensional, and biased datasets usually implicitly solve each problem separately. Recently however, we have been approached by Texas Commiss...