Hyperspectral data can potentially provide greatly improved capability for discrimination between many land cover types, but new methods are required to process these data and extract the required information. Data sets are extremely large, and the data are not well distributed across these high dimensional spaces. The increased number and resolution of spectral bands, many of which are highly ...

PURPOSE To elucidate the molecular mechanisms contributing to the unique clinicopathologic characteristics of mucinous ovarian carcinoma, global gene expression profiling of mucinous ovarian tumors was carried out. EXPERIMENTAL DESIGN Gene expression profiling was completed for 25 microdissected mucinous tumors [6 cystadenomas, 10 low malignant potential (LMP) tumors, and 9 adenocarcinomas] u...

We present a novel method for hierarchical topic detection where topics are obtained by clustering documents in multiple ways. Specifically, we model document collections using a class of graphical models called hierarchical latent tree models (HLTMs). The variables at the bottom level of an HLTM are observed binary variables that represent the presence/absence of words in a document. The varia...

• Often in discriminant analysis several models are estimated but based on some validation criterion, a single model is selected. In the purpose of taking profit from several potential models, classification rules combining models are considered in this article. More precisely two ways of combining models are considered: a serial combining method and a hierarchical combining method. Serial comb...

MOTIVATION We describe a new approach to the analysis of gene expression data coming from DNA array experiments, using an unsupervised neural network. DNA array technologies allow monitoring thousands of genes rapidly and efficiently. One of the interests of these studies is the search for correlated gene expression patterns, and this is usually achieved by clustering them. The Self-Organising ...

The purpose of this paper is to settle two conjectures by Flajolet, Gourdon and Martinez ( 1996). We confirm that in a random binary tree on n nodes, the expected number of different subtrees grows indeed as 0 (n/ log n). Secondly, if K is the largest integer such that all possible shapes of subtrees of cardinality less than or equal to K occur in a random binary search tree, then we show that ...

The main aim of this paper is to develop a suitable regression analysis model for describing the relationship between the index efficiency and the parameters of the Rival Penalized Competitive Learning Binary Tree (RPCLb-tree). RPCL-b-tree is a hierarchical indexing structure built with a hierarchical RPCL clustering implementation, which transforms the feature space into a sequence of nested c...