766 search results - page 27 / 154 » Clustering high dimensional data using subspace and projecte... |
IDEAL
2004
Springer
14 years 2 months ago
2004
Springer
Microarray datasets are often too large to visualise due to the high dimensionality. The self-organising map has been found useful to analyse massive complex datasets. It can be us...
ICDE
2005
IEEE
14 years 2 months ago
2005
IEEE
We present a novel algorithm called CLICKS, that finds clusters in categorical datasets based on a search for kpartite maximal cliques. Unlike previous methods, CLICKS mines subs...
CIBB
2008
2008
Unsupervised Stability-Based Ensembles to Discover Reliable Structures in Complex Bio-molecular Data
13 years 10 months ago
The assessment of the reliability of clusters discovered in bio-molecular data is a central issue in several bioinformatics problems. Several methods based on the concept of stabil...
IIS
2004
13 years 10 months ago
2004
Search results clustering problem is defined as an automatic, on-line grouping of similar documents in a search hits list, returned from a search engine. In this paper we present t...
SADM
2010
13 years 3 months ago
2010
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...