Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Bi-Clustering"”.

  1. Computational Complexity Of Bi-clustering

    … a new natural objective (or cost) function for bi-clustering - Monochromatic bi-clustering. Our objective function is suitable for detecting meaningful homogenous clusters based on categorical valued input matrices. Such problems have arisen recently in systems biology where researchers have …

    waterloo Repository record for Computational Complexity Of Bi-clustering (opens in a new tab)

  2. Computational Complexity of Bi-clustering.

    Bi-clustering, i.e. simultaneously clustering the rows and columns of matrices based on their entries, covers a large variety of techniques in data mining. The goal of all bi-clustering techniques is finding the partitions of the rows and the columns in which sub-rows and sub-columns show a similar …

    waterloo Repository record for Computational Complexity of Bi-clustering. (opens in a new tab)

  3. Bi-clustering de Dados Genéticos Binários Baseado em Modelos de Classificação Logística

    … de proteínas de redes de todos os tipos de dados biológicos. Nesta tese é proposto um método de bi-clustering, Lbic, baseado num modelo de classificação logística, para analisar dados biológicos binários. O Lbic é comparado com outros dois métodos de bi-clustering apresentados na literatura, …

    brazil-ufpe Repository record for Bi-clustering de Dados Genéticos Binários Baseado em Modelos de Classificação Logística (opens in a new tab)

  4. PROBLEMI DI CLUSTERING CON VINCOLI: ALGORITMI E COMPLESSITÀ

    … and studies the problem of 1-dimensional bounded clustering: for any fixed p ≥ 1, given reals x1, x2..., xn, and integers k1, k2.., km, determine the partition (A1, A2... Am) of {1, 2, ..., n} with |A1| = k1, |A2| = k2 , ... , |Am| = km which minimizes Σk Σi Ak |xi - μk |p where μk is the …

    milano Repository record for PROBLEMI DI CLUSTERING CON VINCOLI: ALGORITMI E COMPLESSITÀ (opens in a new tab)

  5. Application of Bayesian Modeling in High-throughput Genomic Data and Clinical Trial Design

    … for various aspects of cellular activities and biological functions. So far, NGS techniques have been applied in quantitatively measurement of diverse platforms, such as RNA expression, DNA copy number variation (CNV) and DNA methylation. Although NGS is powerful and largely expedite biomedical …

    rice Repository record for Application of Bayesian Modeling in High-throughput Genomic Data and Clinical Trial Design (opens in a new tab)

  6. Computational Discovery of Phenotype Related Biochemical Processes for Engineering

    Application of bioengineering technologies for enhanced biological hydrogen production is a promising approach that may play a vital role in sustainable energy. Due to the ability of several naturally occurring microorganisms to generate hydrogen through varying metabolic processes, biological …

    usf Repository record for Computational Discovery of Phenotype Related Biochemical Processes for Engineering (opens in a new tab)

  7. Computational and Statistical Methodology for Highly Structured Data

    … valued data. While complex valued data is ubiquitous in spectral analysis and neuroimaging, typical machine learning techniques discard the rich structure of complex numbers, losing valuable phase information in the process. A major contribution of this project is the development of convex …

    rice Repository record for Computational and Statistical Methodology for Highly Structured Data (opens in a new tab)