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 41 for “"affinity propagation"”.

  1. Affinity Propagation: Clustering Data by Passing Messages

    … solution. This thesis describes a method called "affinity propagation" that simultaneously considers all data points as potential exemplars, exchanging real-valued messages between data points until a high-quality set of exemplars and corresponding clusters gradually emerges. Affinity propagation …

    toronto-retro Repository record for Affinity Propagation: Clustering Data by Passing Messages (opens in a new tab)

  2. Building A Classification Model Using Affinity Propagation

    … compressed data. This thesis will explore using Affinity Propagation, categorical data, exploring entropy within cluster sets, and testing the compressed data using Cosine Similarity as a classifier.

    gsu Repository record for Building A Classification Model Using Affinity Propagation (opens in a new tab)

  3. Beyond Affinity Propagation: Message Passing Algorithms for Clustering

    Affinity propagation is an exemplar-based clustering method that takes as input similarities between data points. It outputs a set of data points that best represent the data (exemplars), and assignments of each non-exemplar point to its most appropriate exemplar, thereby partitioning the data set …

    toronto-retro Repository record for Beyond Affinity Propagation: Message Passing Algorithms for Clustering (opens in a new tab)

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

    … self-organizing map, the K-means algorithm, and affinity propagation. These three algorithms are applied to large datasets from three different domains--organizational management, bioinformatics, and financial markets--each of which presents its own challenges in terms of data management and …

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

  5. Optimalizace metod automatizované tvorby pravidel pro modifikaci hesel

    … paměťové nároky při shlukování pomocí metod Affinity Propagation (AP) a Hierarchical Agglomerative Clustering (HAC). Jsou zkoumány přistupy pro řešení těchto problému studiem existujích optimalizací pro tyto shlukovací algoritmy. Následně jsou vybrané algoritmy speciálně implenetovány pro …

    brno-tech Repository record for Optimalizace metod automatizované tvorby pravidel pro modifikaci hesel (opens in a new tab)

  6. Machine learning and data science application for financial price prediction and portfolio optimization

    … construction, especially when coupled with affinity propagation (AP) clustering and appropriate data-driven risk measures based on volatility estimates - with sign correlation (VES) and volatility correlation (VEV). Traditional models optimize portfolio weights using objective functions, …

    manitoba Repository record for Machine learning and data science application for financial price prediction and portfolio optimization (opens in a new tab)

  7. Federated Clustering of Electric Vehicle’s Usage Patterns for Personalized State-of-Health Estimation

    … framework, combining K-means initialization and Affinity Propagation (AP) clustering. Evaluated on NASA laboratory cells and telemetry from nine electric vehicles used in heterogeneous driving conditions, the approach achieves faster convergence and lower prediction errors compared to single …

    chalmers Repository record for Federated Clustering of Electric Vehicle’s Usage Patterns for Personalized State-of-Health Estimation (opens in a new tab)

  8. Computational methods for the identification of statistically significant genes: applications to gene expression data of various human diseases

    … successfully multiple hypothesis testing and affinity propagation clustering algorithm along with the Krzanowski & Lai cluster quality index, to select a small yet informative subset of genes. We subject our method across a variety of validation tests on simulated microarray data as well as on …

    greece Repository record for Computational methods for the identification of statistically significant genes: applications to gene expression data of various human diseases (opens in a new tab)

  9. Urban area traffic flow forecasting in intelligent transportation systems

    … the road points affected by traffic using affinity propagation clustering, a distributed message passing algorithm. Finally, I predict the effect of traffic on this cluster using long-short term memory neural network model. I evaluate and show the feasibility of my proposed clustering and …

    manitoba Repository record for Urban area traffic flow forecasting in intelligent transportation systems (opens in a new tab)

  10. Complex-Wavelet Structural Similarity Based Image Classification

    … machine method (SVM) and CW-SSIM based SVM using affinity propagation. Among the proposed approaches, the best compromise between accuracy and complexity is obtained by the CW-SSIM support vector machine algorithm, which combines an unsupervised clustering method to divide the training images into …

    waterloo Repository record for Complex-Wavelet Structural Similarity Based Image Classification (opens in a new tab)

  11. Multi-Layer Web Services Discovery using Word Embedding and Clustering Techniques

    … layer, three clustering algorithms, including affinity propagation, K-means, and hierarchical agglomerative clustering, are investigated to cluster Web services based on the observed documents’ similarities. We demonstrate how each component of the five layers is employed in the process of Web …

    ottawa-retro Repository record for Multi-Layer Web Services Discovery using Word Embedding and Clustering Techniques (opens in a new tab)

  12. Malware Recognition by Properties of Executables

    This thesis explores what patterns, if any, exist to differentiate non-malware from malware, given only a sequence of raw bytes composing either a received file or a fixed-length initial segment of a received file. If any such patterns are found, their effectiveness as filtering criteria is …

    uno Repository record for Malware Recognition by Properties of Executables (opens in a new tab)

  13. A Comparison of Clustering Algorithms for the Study of Antibody Loop Structures

    … a database of CDR loop structures using the affinity propagation clustering algorithm of Frey and Dueck. With the growth of the number of structures deposited in the Protein Data Bank, the number of antibody CDRs has approximately tripled. In addition, although the affinity clustering in 2011 …

    temple Repository record for A Comparison of Clustering Algorithms for the Study of Antibody Loop Structures (opens in a new tab)

  14. Comparative Study of Clustering Techniques on Eye-Tracking in Dynamic 3D Virtual Environments

    … methods. These include DBSCAN, OPTICS, BIRCH, Affinity Propagation, and Mean Shift. These methods range greatly in complexity and provide emphasis on different aspects of the data to ensure we find the most appropriate method(s). To test the appropriateness of each method, we will create four …

    utahstate Repository record for Comparative Study of Clustering Techniques on Eye-Tracking in Dynamic 3D Virtual Environments (opens in a new tab)

  15. Energy-Efficient Semi-Supervised Optimization for PAPR Reduction in OTSM for High-Mobility 6G Wireless Communications

    … tone reservation (SS-QPSO-TR) integrating affinity propagation (AP) clustering and KNN, achieving ∼4.5 dB PAPR reduction with 16.7× lower CC than A-TR-BD. The third contribution, semi-supervised vectored delay-sequency selective mapping (SS-VDS-SLM), combines AHC, W-KNN, and M-CLT …

    calgary Repository record for Energy-Efficient Semi-Supervised Optimization for PAPR Reduction in OTSM for High-Mobility 6G Wireless Communications (opens in a new tab)

  16. Συγκριτική αξιολόγηση αλγορίθμων ομαδοποίησης εφαρμοσμένοι σε βιολογικά δίκτυα

    … οι υπό μελέτη αλγόριθμοι ομαδοποίησης: Affinity Propagation, ClusterONE, MCL, MCODE, NCMine, SPICi. Ακολούθως τα αποτελέσματα που θα παραχθούν θα υποστούν στατιστικό έλεγχο, ώστε να βρεθεί η αξιοπιστία των δεδομένων που προέκυψαν, μέσω της σύγκρισης τόσο μεταξύ των αποτελεσμάτων των …

    athens Repository record for Συγκριτική αξιολόγηση αλγορίθμων ομαδοποίησης εφαρμοσμένοι σε βιολογικά δίκτυα (opens in a new tab)

  17. Definition of customer requirements, function requirements, and product structures based on big data and data mining methods

    … Filtered data are clustered into groups by an affinity propagation (AP) clustering method to define CRs. Importance rates (IRs) of CRs are then decided by integration of the importance-performance analysis and Kano model to balance conflict comments from different customers using a similarity …

    manitoba Repository record for Definition of customer requirements, function requirements, and product structures based on big data and data mining methods (opens in a new tab)

  18. Algorithmic issues in visual object recognition

    … recognition. We present an implementation of the Affinity Propagation clustering algorithm based on this representation, which is about 6 times faster than another GPU implementation based on a conventional sparse matrix representation.

    maryland Repository record for Algorithmic issues in visual object recognition (opens in a new tab)

  19. Automatic Keyword Tagging With Machine Learning Approach

    … embedding (GloVe and fastText) with clustering (Affinity Propagation, Mean Shift and K-means). We use semantic relevance to cluster the terms in a document, and extract the noun phrase nearest to the center of the cluster as the keyword. This method ensures that the extracted keywords satisfy the …

    concordia Download PDF for Automatic Keyword Tagging With Machine Learning Approach (opens in a new tab)

  20. On a class of distributed algorithms over networks and graphs

    … of communication networks. Our main framework is Affinity Propagation (AP), originally developed for clustering problems. We reinterpret this framework to unify the development of distributed algorithms for discrete resource allocation problems. Also, we consider a network-coded communication …

    texas Repository record for On a class of distributed algorithms over networks and graphs (opens in a new tab)

Page 1 of 3