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 153 for “"k-means algorithm"”.

  1. 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)

  2. Study of document clustering using the k-means algorithm

    … with categorizing documents using the k-means clustering algorithm which groups objects into K number of groups based on document representations and similarities; The proposed hypothesis of this thesis is to prove that unsupervised clustering of a set of documents produces similar …

    unlv Repository record for Study of document clustering using the k-means algorithm (opens in a new tab) Download PDF for Study of document clustering using the k-means algorithm (opens in a new tab)

  3. Accommodating Positive and Negative Constraints in the K-Means Algorithm

    K-Means is one of the most widely used clustering algorithms, but its standard form is an unsupervised method that assumes no prior information about relationships among observations. In practice, partial knowledge may exist in the form of constraints: some observations should be grouped together …

    umn Repository record for Accommodating Positive and Negative Constraints in the K-Means Algorithm (opens in a new tab)

  4. A Map Reduce Approach of K-Means++ Algorithm with Initial Equidistant Centers

    … try to design efficient parallel clustering algorithms. In this paper, we propose a parallel k-means++ clustering algorithm based on MapReduce, which is simple like traditional K-means, yet more powerful because the initial centroid selection process is not random. It follows a formula to …

    ndsu Repository record for A Map Reduce Approach of K-Means++ Algorithm with Initial Equidistant Centers (opens in a new tab)

  5. Wavelet based image texture segementation using a modified K-means algorithm / by Brian W. Ng.

    In this thesis, wavelet transforms are chosen as the primary analytical tool for texture analysis. Specifically, Dual-Tree Complex Wavelet Transform is applied to the texture segmentation problem. Several possibilities for feature extraction and clustering steps are examined, new schemes being …

    adelaide Repository record for Wavelet based image texture segementation using a modified K-means algorithm / by Brian W. Ng. (opens in a new tab)

  6. A self-organizing map artificial neural network to improve k-means algorithm classification in different cancer types

    … At first, the performance and accuracy of K-Means algorithm in classification and clustering a complex input data (similarity and dependence) is investigated. Then, the mentioned performance is compared with the performance of SOM ANN in clustering mentioned input data. The performance of …

    regina Repository record for A self-organizing map artificial neural network to improve k-means algorithm classification in different cancer types (opens in a new tab) Download PDF for A self-organizing map artificial neural network to improve k-means algorithm classification in different cancer types (opens in a new tab)

  7. Optimal Clustering: Genetic Constrained K-Means and Linear Programming Algorithms

    … this dissertation, we propose two constrained k-means algorithms: Linear Programming Algorithm (LPA) and Genetic Constrained K-means Algorithm (GCKA). Linear Programming Algorithm modifies the k-means algorithm into a linear programming problem with constraints requiring that each cluster have m …

    vcu Repository record for Optimal Clustering: Genetic Constrained K-Means and Linear Programming Algorithms (opens in a new tab)

  8. Optimizing k-means clustering using mini-batches and distance bounds.

    … of the data without the training label. K-means clustering is a widely used iterative clustering technique that groups data into k clusters by repeatedly minimizing a criterion function. The standard k-means algorithm, Lloyd's algorithm, is simple and easy to implement the algorithm. But it …

    baylor Repository record for Optimizing k-means clustering using mini-batches and distance bounds. (opens in a new tab)

  9. Scalable Embeddings for Kernel Clustering on MapReduce

    … 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 different computing architectures. It assumes, however, that data are available in an …

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

  10. 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

  11. TIC: Term Intersection Clustering of Text Documents

    … intersection of document term sets. In that algorithm, documents were associated with terms and the resulting sets of terms were intersected. If the intersection of the sets produced a set equal to or larger than a predefined minimum support level, that new set was considered a relevant …

    gvsu Repository record for TIC: Term Intersection Clustering of Text Documents (opens in a new tab)

  12. Integrating Classification With K-Means to Detect E-Commerce Transaction Anomaly

    … set. This thesis proposes a meta-cluster with K-means algorithm to solve the problem of highly imbalanced data. This meta-cluster with K-means algorithm will be applied as a preprocessing method. The main aim is to generate a collection of clusters from the E-commerce transaction anomaly data …

    york Repository record for Integrating Classification With K-Means to Detect E-Commerce Transaction Anomaly (opens in a new tab)

  13. Profiling and optimizing K-means algorithms in a beowulf cluster environment

    The K-means algorithm is a well known statistical agglomeration algorithm used to sort a database of unlabeled items into K groups. As part of the fitness function of an Evolutionary Algorithm (EA), the optimization of the K-means algorithm has become a point of great interest. Although many …

    ets-quebec Download PDF for Profiling and optimizing K-means algorithms in a beowulf cluster environment (opens in a new tab)

  14. Geological characterisation guided by fuzzy k-means clustering of physical properties measured from core samples from the Victoria property, Sudbury Ontario

    … and geological data quantitatively. The fuzzy-k means algorithm is an unsupervised pattern recognition technique, which groups data into clusters based on properties measured. This study will use the fuzzy-k means algorithm to characterise core samples from 2 drillholes from the Victoria property …

    laurentian Repository record for Geological characterisation guided by fuzzy k-means clustering of physical properties measured from core samples from the Victoria property, Sudbury Ontario (opens in a new tab)

  15. Using Pre- and Post-Process Labeling Techniques for Cluster Analysis

    … technological and investigative advances, the means to analyze and manage this data becomes more critical. Unsupervised machine learning algorithms can be used to group large datasets into categories, thereby facilitating new insight into similarities in data that would, on the surface, appear …

    unr Repository record for Using Pre- and Post-Process Labeling Techniques for Cluster Analysis (opens in a new tab)

  16. An unsupervised approach to COVID-19 fake tweet detection

    … the potential of unsupervised machine learning algorithms in differentiating between genuine and fake COVID-19 news shared on Twitter. The methodology includes a literature review, experimental analysis, and the utilization of a Twitter dataset. Methods: The study used both Mini-Batch K-means …

    cape-town Repository record for An unsupervised approach to COVID-19 fake tweet detection (opens in a new tab)

  17. 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)

  18. THEORETICAL ADVANCES IN CLUSTERING WITH APPLICATIONS TO MATRIX FACTORIZATION

    … part considers the informativeness of the k-means algorithm, which is perhaps the most popular clustering algorithm, for learning mixture models. In the second part, we propose a geometric assumption on nonnegative data matrices such that under this assumption, we are able to provide upper …

    nus Repository record for THEORETICAL ADVANCES IN CLUSTERING WITH APPLICATIONS TO MATRIX FACTORIZATION (opens in a new tab) Download file for THEORETICAL ADVANCES IN CLUSTERING WITH APPLICATIONS TO MATRIX FACTORIZATION (opens in a new tab)

  19. Improved statistical methods for k-means clustering of noisy and directional data

    … papers. The first provides an</p> <p>efficient k-means type algorithm for clustering observations in the presence of scattered observations. Scattered observations are defined as unlike any other, so traditional approaches that force them into groups can lead to erroneous conclusions. The second …

    iastate Repository record for Improved statistical methods for k-means clustering of noisy and directional data (opens in a new tab)

  20. Inductive Monitoring Systems: A CubeSat Ground-Based Prototype

    … use. This program consisted of two main algorithms, one for learning and one for monitoring. The learning algorithm creates the nominal knowledge bases and was developed using three data mining algorithms: the gap statistic method to find the optimal number of clusters, the K-means++ …

    calpoly Repository record for Inductive Monitoring Systems: A CubeSat Ground-Based Prototype (opens in a new tab)

Page 1 of 8