775 search results - page 78 / 155 » Memetic Algorithms for Feature Selection on Microarray Data |
ISNN
2011
Springer
12 years 10 months ago
2011
Springer
This paper presents a new method that uses orthogonalized features for time series clustering and classification. To cluster or classify time series data, either original data or...
IDEAL
2004
Springer
14 years 1 months ago
2004
Springer
Proteins are known to perform a biological function by interacting with other proteins or compounds. Since protein–protein interaction is intrinsic to most cellular processes, pr...
ICDE
2008
IEEE
14 years 9 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
MCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Cluster ensembles are deemed to be better than single clustering algorithms for discovering complex or noisy structures in data. Various heuristics for constructing such ...
ADC
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we discuss eNERF, an extended version of non-Euclidean relational fuzzy c-means (NERFCM) for approximate clustering in very large (unloadable) relational data. The e...