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 “"kernel clustering"”.

  1. Scalable Embeddings for Kernel Clustering on MapReduce

    … industries to make the best use of their data. Clustering is a powerful tool for discovering natural groupings in data. The k-means algorithm is the most commonly-used data clustering method, having gained popularity for its effectiveness on various data sets and ease of implementation on …

    waterloo Repository record for Scalable Embeddings for Kernel Clustering on MapReduce (opens in a new tab)

  2. Optimization for Image Segmentation

    … include for example Markov Random Field (MRF), Kernel Clustering (KC), and nowadays popular Convolutional Neural Networks (CNN). In this work, we focus on optimization for image segmentation. Techniques like MRF, KC, and CNN optimize MRF energies, KC criteria, or CNN losses respectively, and …

    waterloo Repository record for Optimization for Image Segmentation (opens in a new tab)

  3. Kernel-based clustering of big data

    … highly scalable data analysis techniques. Clustering is an exploratory data analysis tool used to discover the underlying groups in the data. The state-of-the-art algorithms for clustering big data sets are linear clustering algorithms, which assume that the data is linearly separable in …

    msu Repository record for Kernel-based clustering of big data (opens in a new tab)

  4. Feature selection for cancer classification using microarray gene expression data

    … the other two methods, SWKC (supervised weighted kernel clustering) (Shim et al., 2009) and SVM-RFE (support vector machine with recursive feature elimination) (Guyon et al., 2002), the proposed method is shown to be more effective and sensitive to differentially expressed genes. In the simulation …

    calgary Repository record for Feature selection for cancer classification using microarray gene expression data (opens in a new tab)

  5. Power-Constrained Supercomputing

    … approach to generate such a model offline using kernel clustering and multivariate linear regression. Our model requires only two iterations to select a configuration, which provides a significant advantage over exhaustive search-based strategies. We apply our model to predict power and …

    arizona-thes Repository record for Power-Constrained Supercomputing (opens in a new tab)

  6. Model Calibration and Performance Optimization Using Multiple-Point Geostatistics and Machine Learning Techniques

    … efficiently search the space of uncertainty by clustering the generated realizations. This method allows us to navigate through realizations and approximate the uncertainty bounds with fewer iterations and, consequently, less computational cost. In addition, a new segmentation method, which does …

    calgary Repository record for Model Calibration and Performance Optimization Using Multiple-Point Geostatistics and Machine Learning Techniques (opens in a new tab)

  7. Bayesian Network Fisher Kernel for Categorical Feature Spaces

    … between two such vectors exists. The Fisher kernel provides a method for computing similarities by considering an underlying statistical model, which circumvents the problem of computing distances between categorical vectors. A promising probabilistic model is the Bayesian network, which is …

    chalmers Repository record for Bayesian Network Fisher Kernel for Categorical Feature Spaces (opens in a new tab)