Heterogeneous Transfer Learning in Ensemble Clustering

• URL: http://arxiv.org/abs/2001.07155v1
• Date: Mon, 20 Jan 2020 16:03:38 GMT
• Title: Heterogeneous Transfer Learning in Ensemble Clustering
• Authors: Vladimir Berikov
• Abstract summary: We consider a clustering problem in which "similar" labeled data are available. The method is based on constructing meta-features which describe structural characteristics of data. An experimental study of the method using Monte Carlo modeling has confirmed its efficiency.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work proposes an ensemble clustering method using transfer learning approach. We consider a clustering problem, in which in addition to data under consideration, "similar" labeled data are available. The datasets can be described with different features. The method is based on constructing meta-features which describe structural characteristics of data, and their transfer from source to target domain. An experimental study of the method using Monte Carlo modeling has confirmed its efficiency. In comparison with other similar methods, the proposed one is able to work under arbitrary feature descriptions of source and target domains; it has smaller complexity.

Related papers

• A Deterministic Information Bottleneck Method for Clustering Mixed-Type Data [0.0]
  We present an information-theoretic method for clustering mixed-type data, that is, data consisting of both continuous and categorical variables. The method is a variant of the Deterministic Information Bottleneck algorithm which optimally compresses the data while retaining relevant information about the underlying structure.
  arXiv  Detail & Related papers  (2024-07-03T09:06:19Z)
• Model Based Co-clustering of Mixed Numerical and Binary Data [0.0]
  Co-clustering is a data mining technique used to extract the underlying block structure between the rows and columns of a data matrix. In this article, we extend the latent block models based co-clustering to the case of mixed data.
  arXiv  Detail & Related papers  (2022-12-22T14:16:08Z)
• Unified Multi-View Orthonormal Non-Negative Graph Based Clustering Framework [74.25493157757943]
  We formulate a novel clustering model, which exploits the non-negative feature property and incorporates the multi-view information into a unified joint learning framework. We also explore, for the first time, the multi-model non-negative graph-based approach to clustering data based on deep features.
  arXiv  Detail & Related papers  (2022-11-03T08:18:27Z)
• Review of Clustering Methods for Functional Data [1.827510863075184]
  The review aims to bridge the gap between the functional data analysis community and the clustering community. We propose a systematic taxonomy that explores the connections and differences among the existing functional data clustering methods.
  arXiv  Detail & Related papers  (2022-10-03T12:15:23Z)
• Leveraging Ensembles and Self-Supervised Learning for Fully-Unsupervised Person Re-Identification and Text Authorship Attribution [77.85461690214551]
  Learning from fully-unlabeled data is challenging in Multimedia Forensics problems, such as Person Re-Identification and Text Authorship Attribution. Recent self-supervised learning methods have shown to be effective when dealing with fully-unlabeled data in cases where the underlying classes have significant semantic differences. We propose a strategy to tackle Person Re-Identification and Text Authorship Attribution by enabling learning from unlabeled data even when samples from different classes are not prominently diverse.
  arXiv  Detail & Related papers  (2022-02-07T13:08:11Z)
• Graph Contrastive Clustering [131.67881457114316]
  We propose a novel graph contrastive learning framework, which is then applied to the clustering task and we come up with the Graph Constrastive Clustering(GCC) method. Specifically, on the one hand, the graph Laplacian based contrastive loss is proposed to learn more discriminative and clustering-friendly features. On the other hand, a novel graph-based contrastive learning strategy is proposed to learn more compact clustering assignments.
  arXiv  Detail & Related papers  (2021-04-03T15:32:49Z)
• Towards Improved and Interpretable Deep Metric Learning via Attentive Grouping [103.71992720794421]
  Grouping has been commonly used in deep metric learning for computing diverse features. We propose an improved and interpretable grouping method to be integrated flexibly with any metric learning framework.
  arXiv  Detail & Related papers  (2020-11-17T19:08:24Z)
• Dataset Dynamics via Gradient Flows in Probability Space [15.153110906331733]
  We propose a novel framework for dataset transformation, which we cast as optimization over data-generating joint probability distributions. We show that this framework can be used to impose constraints on classification datasets, adapt them for transfer learning, or to re-purpose fixed or black-box models to classify -- with high accuracy -- previously unseen datasets.
  arXiv  Detail & Related papers  (2020-10-24T03:29:22Z)
• Spherical Feature Transform for Deep Metric Learning [58.35971328774927]
  This work proposes a novel spherical feature transform approach. It relaxes the assumption of identical covariance between classes to an assumption of similar covariances of different classes on a hypersphere. We provide a simple and effective training method, and in depth analysis on the relation between the two different transforms.
  arXiv  Detail & Related papers  (2020-08-04T11:32:23Z)
• Elastic Coupled Co-clustering for Single-Cell Genomic Data [0.0]
  Single-cell technologies have enabled us to profile genomic features at unprecedented resolution. Data integration can potentially lead to a better performance of clustering algorithms. In this work, we formulate the problem in an unsupervised transfer learning framework.
  arXiv  Detail & Related papers  (2020-03-29T08:21:53Z)
• Conjoined Dirichlet Process [63.89763375457853]
  We develop a novel, non-parametric probabilistic biclustering method based on Dirichlet processes to identify biclusters with strong co-occurrence in both rows and columns. We apply our method to two different applications, text mining and gene expression analysis, and demonstrate that our method improves bicluster extraction in many settings compared to existing approaches.
  arXiv  Detail & Related papers  (2020-02-08T19:41:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.