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 38 for “"Correlation clustering"”.

  1. Correlation Clustering

    … patterns and relationships in large databases. Clustering is one of the major data mining techniques and aims at grouping the data objects into meaningful classes (clusters) such that the similarity of objects within clusters is maximized, and the similarity of objects from different clusters is …

    lmu-germany Repository record for Correlation Clustering (opens in a new tab)

  2. Advances in correlation clustering

    The task of clustering is to partition a given dataset in such a way that objects within a cluster are similar to each other while being dissimilar to objects from other clusters. One challenge to this task arises when dealing with datasets where the objects are characterized by an increased number …

    lmu-germany Repository record for Advances in correlation clustering (opens in a new tab)

  3. Comparative Study on Optimization Methods for Correlation Clustering

    Correlation clustering is an optimization problem that aims to create partition of data based on pairwise similarity coefficients that represents the level of similarities between data observations. The thesis focused on the maximization of agreements version of the problem in which to find …

    chalmers Repository record for Comparative Study on Optimization Methods for Correlation Clustering (opens in a new tab)

  4. Scalable algorithms for correlation clustering on large graphs

    Correlation clustering (CC) is a widely-used clustering paradigm, where objects are represented as graph nodes and clustering is performed based on relationships between objects (positive or negative edges between pairs of nodes). The CC objective is to obtain a graph clustering that minimizes the …

    bu Repository record for Scalable algorithms for correlation clustering on large graphs (opens in a new tab)

  5. Random models and heuristic algorithms for correlation clustering problems on signed social networks

    … We also present a heuristic algorithm for the Correlation Clustering (CC) which is a class of community detection problem in the signed network. The CC problem can be defined as follow: for a given signed network, finding an optimal partition in the vertices such that the edges inside a group …

    ubc Repository record for Random models and heuristic algorithms for correlation clustering problems on signed social networks (opens in a new tab) Download PDF for Random models and heuristic algorithms for correlation clustering problems on signed social networks (opens in a new tab)

  6. Functional Characterization of the NSF1 (YPL230W) Gene using Correlation Clustering and Genetic Analysis in Saccharomyces Cerevisiae

    … thesis proposes a method called Interdependent Correlation Cluster (ICC) to analyze the relations between genes represented by microarray data that are conditioned on a specific target gene. Based on Correlation Clustering, the proposed method analyzes a large set of correlation values related …

    guelph Repository record for Functional Characterization of the NSF1 (YPL230W) Gene using Correlation Clustering and Genetic Analysis in Saccharomyces Cerevisiae (opens in a new tab)

  7. Canonical Correlation and Clustering for High Dimensional Data

    … applied quantitative method to explore the correlation structure between two domains of a multi-view dataset is the Canonical Correlation Analysis (CCA), which seeks the canonical loading vectors such that the transformed canonical covariates are maximally correlated. In the high dimensional …

    mcmaster Repository record for Canonical Correlation and Clustering for High Dimensional Data (opens in a new tab)

  8. Aproksimavimo algoritmai grupavimo pagal koreliacijas problemai /

    Approximation algorithms for correlation clustering.

    vilnius Repository record for Aproksimavimo algoritmai grupavimo pagal koreliacijas problemai / (opens in a new tab)

  9. Clustering and Inconsistent Information: A Kernelization Approach

    Clustering is the unsupervised classification of patterns into groups, which is easy provided the data of patterns are consistent. However, real data are almost always tempered with inconsistencies, which make it a hard problem, and actually, the most widely studied formulations, correlation …

    tamu Repository record for Clustering and Inconsistent Information: A Kernelization Approach (opens in a new tab)

  10. People Tracking and Re-Identification from Multiple Cameras

    … that emphasize correct person identification. A correlation clustering formulation for associating person observations is then introduced which maximizes agreements on the evidence graph. We assemble a tracker called DeepCC that combines an existing person detector, hierarchical and online …

    duke Repository record for People Tracking and Re-Identification from Multiple Cameras (opens in a new tab)

  11. Theoretical foundations for efficient clustering

    Clustering aims to group together data instances which are similar while simultaneously separating the dissimilar instances. The task of clustering is challenging due to many factors. The most well-studied is the high computational cost. The clustering task can be viewed as an optimization problem …

    waterloo Repository record for Theoretical foundations for efficient clustering (opens in a new tab)

  12. Hierarchical Subspace Clustering

    It is well-known that traditional clustering methods considering all dimensions of the feature space usually fail in terms of efficiency and effectivity when applied to high-dimensional data. This poor behavior is based on the fact that clusters may not be found in the high-dimensional feature …

    lmu-germany Repository record for Hierarchical Subspace Clustering (opens in a new tab)

  13. Recovery Guarantees for Graph Clustering Problems

    Graph clustering is widely-studied unsupervised learning problem in which the task is to group similar entities together based on observed pairwise entity interactions. This problem has applications in diverse domains such as social network analysis and computational biology. There are multiple …

    waterloo Repository record for Recovery Guarantees for Graph Clustering Problems (opens in a new tab)

  14. CREATING ROBUST AND FAIR GRAPH STRUCTURES FOR CONNECTIVITY AND CLUSTERING

    … robustness to failures and fairness in clustering. First, we study fault-tolerant reachability preservers, giving the first non-trivial constructions for preserving pairwise reachability under two edge or vertex failures, including a subgraph of size O(n^{4/3}|P|^{1/3}). Second, we …

    nus Repository record for CREATING ROBUST AND FAIR GRAPH STRUCTURES FOR CONNECTIVITY AND CLUSTERING (opens in a new tab) Download file for CREATING ROBUST AND FAIR GRAPH STRUCTURES FOR CONNECTIVITY AND CLUSTERING (opens in a new tab)

  15. Social Aspects of Algorithms: Fairness, Diversity, and Resilience to Strategic Behavior

    … of fairness in an optimization problem called correlation clustering. In correlation clustering, given an edge-weighted graph, each edge in addition to a weight has a positive or negative label. The goal is to obtain a clustering of the vertices into an arbitrary number of clusters that …

    maryland Repository record for Social Aspects of Algorithms: Fairness, Diversity, and Resilience to Strategic Behavior (opens in a new tab)

  16. Clustering, weighted sequences, and shortest paths

    In this thesis we focus on clustering problems where the input is the ideal relationship between all pairs of objects in the final clustering. More particularly, we concern ourselves with the following problems.Ll-fitting tree metrics and ultrametrics: We are given the ideal distance between all …

    greece Repository record for Clustering, weighted sequences, and shortest paths (opens in a new tab)

  17. Computational Complexity Of Bi-clustering

    … 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)

  18. Quadratic maximization under combinatorial constraints and related applications

    … algorithm for the NP-hard problem of Bipartite Correlation Clustering (BCC). Real datasets will typically produce covariance matrices that have full rank, rendering our algorithms not applicable. Our approach is to first obtain a low-rank approximation of the input data and subsequently solve …

    texas Repository record for Quadratic maximization under combinatorial constraints and related applications (opens in a new tab)

  19. Supervised Clustering With Structural Svms

    Supervised clustering is the problem of training clustering methods to produce desirable clusterings. Given sets of items and complete clusterings over these sets, a supervised clustering algorithm learns how to cluster future sets of items in a similar fashion, typically by changing the underlying …

    cornell Repository record for Supervised Clustering With Structural Svms (opens in a new tab)

  20. Valued Constraint Satisfaction in Structures with an Oligomorphic Automorphism Group

    … important optimization problems, such as min correlation clustering with partial information or the minimum feedback arc set problem cannot be modelled as VCSPs over a finite template. In this thesis, we study infinite-domain VCSPs, more concretely, VCSPs with templates with an oligomorphic …

    qucosa-diss

Page 1 of 2