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 20 of 1834 for “"K-Means"”.

  1. Extending K-means

    … a mechanic for extending the use cases of the K-means algorithm.</p> <p>Paper 1. Clustering is a difficult problem that is further challenged in higher dimensions where some of the information can be redundant. Such redundancy can be in the form of dimensions that have group information that is …

    iastate Repository record for Extending K-means (opens in a new tab)

  2. Faster k-means clustering.

    The popular k-means algorithm is used to discover clusters in vector data automatically. We present three accelerated algorithms that compute exactly the same clusters much faster than the standard method. First, we redesign Hamerly's algorithm to use k heaps to avoid checking distance bounds for …

    baylor Repository record for Faster k-means clustering. (opens in a new tab)

  3. Efficient Multi-GPU K-means Clustering

    … algorithms for accomplishing clusterization is k-means, also known as Lloyd’s algorithm. Lloyd’s algorithm for computing clusters has a simple heuristic implementation, but due to the extreme size of the typical input target data, it can be a very time-consuming algorithm and is, therefore, a …

    texas-state Repository record for Efficient Multi-GPU K-means Clustering (opens in a new tab)

  4. K-Means Clustering Using Gravity Distance

    … is an important topic in data modeling. K-means Clustering is a well-known partitional clustering algorithm, where a dataset is separated into groups sharing similar properties. Clustering an unbalanced dataset is a challenging problem in data modeling, where some group has a much larger …

    wku-diss Repository record for K-Means Clustering Using Gravity Distance (opens in a new tab)

  5. Local Optima in K-Means Clustering

    … study of the properties of local optimality in K-means clustering is pursued. In doing so, it is shown that several of the commercial software packages prove to be inadequate in their treatment of the K-means algorithm, resulting in the proposal of an alternative method based on several thousand …

    uiuc Repository record for Local Optima in K-Means Clustering (opens in a new tab)

  6. Query K-means clustering for crowdsourcing

    This thesis focuses on solving the $K$-means clustering problem approximately with side information provided by crowdsourcing. Both binary same-cluster oracle and general crowdsourcing framework are considered. It can be shown that, under some mild assumptions on the smallest cluster size, one can …

    uiuc Repository record for Query K-means clustering for crowdsourcing (opens in a new tab)

  7. On K-Means Clustering Using Mahalanobis Distance

    … clusters in a set of observations is known as K-Means. The main limitation of this algorithm is that it uses the Euclidean distance metric to assign points to clusters. Hence, this algorithm operates well only if the covariance structures of the clusters are nearly spherical and homogeneous in …

    ndsu Repository record for On K-Means Clustering Using Mahalanobis Distance (opens in a new tab)

  8. Some contributions to k-means clustering problems

    <p>k-means clustering is the most common clustering technique for homogeneous data sets. In this thesis we introduced some contributions for problems related to k-means. The first topic, we developed a modification of the k-means algorithm to efficiently partition massive data sets in a …

    iastate Repository record for Some contributions to k-means clustering problems (opens in a new tab)

  9. Accelerating k-means : novel strategies for algorithm improvement.

    … goal is to group similar points together. The k-means algorithm is one of the most widely used clustering algorithms due to its efficiency and simplicity. In each iteration, it finds a better solution and converges when the algorithm reaches a local minimum. However, for large datasets, the …

    baylor Repository record for Accelerating k-means : novel strategies for algorithm improvement. (opens in a new tab) Embargoed until 2027-08-15

  10. A fast seeding technique for k-means algorithm.

    The k-means algorithm is one of the most popular clustering techniques because of its speed and simplicity. This algorithm is very simple and easy to understand and implement. The first step of this algorithm is choosing k initial cluster centers. The way that this set of initial cluster centers …

    baylor Repository record for A fast seeding technique for k-means algorithm. (opens in a new tab)

  11. Robustification of the sparse K-means clustering algorithm

    … variable selection: we robustified sparse K-means (Witten and Tibshirani [28]), based on the idea of trimmed K-means introduced by Gordaliza [7] and Gordaliza [8]. Since high dimensional datasets often contain quite a few missing observations, we made our proposed method capable of handling …

    ubc Repository record for Robustification of the sparse K-means clustering algorithm (opens in a new tab) Download PDF for Robustification of the sparse K-means clustering algorithm (opens in a new tab)

  12. Modified K-means clustering algorithms for feature selection

    … this study in relation to the effectiveness of kmeans-based clustering methods. This research project aims to reduce the number of different features by clustering the D features into k (k < D) clusters, determining the cluster center to represent its members by finding the closest feature to the …

    manitoba Repository record for Modified K-means clustering algorithms for feature selection (opens in a new tab)

  13. Transfer k-means: a new supervised clustering approach

    … Ως αποτέλεσμα, αναπτύξαμε τη μέθοδο transfer-$K$means, μια παραλλαγή της δημοφιλής ευριστικής μεθόδου $K$means, που βασίζεται στην μεταφορά μάθησης. Η προτεινόμενη μέθοδος εμπλουτίζει την μη-επιτηρούμενη φύση του $K$means χρησιμοποιώντας επιτήρηση από ένα διαφορετικό αλλά σχετικό χώρο ως τεχνική …

    athens Repository record for Transfer k-means: a new supervised clustering approach (opens in a new tab)

  14. Statistical and algorithmic foundation of K-means clustering

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2027-12-01

    uiuc Repository record for Statistical and algorithmic foundation of K-means clustering (opens in a new tab)

  15. K-means initialisation algorithms: an extensive comparative study

    The K-means data clustering algorithm, whilst widely popular, is not without its drawbacks. In this work, we are particularly interested in the sensitivity of K-means to its initialisation, in the form of a set of initial centroids. Since the cluster recovery performance of K-means can potentially …

    essex Download PDF for K-means initialisation algorithms: an extensive comparative study (opens in a new tab)

  16. Geometric methods of accelerating triangle-inequality-based k-means.

    … the most frequent ways how to cluster data is k-means. The standard way of solving the problem is iterative Lloyd's algorithm. This algorithm performs many redundant calculations. Elkan's and Hamerly's algorithms, the heap algorithm and many others eliminate this redundancy by maintaining a set …

    baylor Repository record for Geometric methods of accelerating triangle-inequality-based k-means. (opens in a new tab)

  17. Parameterized Implementation of K-means Clustering on Reconfigurable Systems

    … growing datasets. However, algorithms such as k-means clustering include significant potential parallelism that could be exploited to enhance processing speed on conventional platforms. A better and effective solution to speed-up the algorithm performance is the use of a hardware assist since …

    ut-knoxville Repository record for Parameterized Implementation of K-means Clustering on Reconfigurable Systems (opens in a new tab)

  18. How to Use K-means for Big Data Clustering?

    K-means plays a vital role in data mining, being the simplest and most widely used algorithm under the Euclidean Minimum Sum-of-Squares Clustering (MSSC) model. However, its performance drastically drops when applied to vast amounts of data. Therefore, it is crucial to improve K-means by scaling it …

    washington Repository record for How to Use K-means for Big Data Clustering? (opens in a new tab)

Page 1 of 92