Spectral Clustering with Jensen-type kernels and their multi-point extensions

2014-03-18 · CVPR 2014 6 · Debarghya Ghoshdastidar, Ambedkar Dukkipati, Ajay P. Adsul, Aparna S. Vijayan

Motivated by multi-distribution divergences, which originate in information theory, we propose a notion of `multi-point' kernels, and study their applications. We study a class of kernels based on Jensen type divergences and show that these can be extended to measure similarity among multiple points. We study tensor flattening methods and develop a multi-point (kernel) spectral clustering (MSC) method. We further emphasize on a special case of the proposed kernels, which is a multi-point extension of the linear (dot-product) kernel and show the existence of cubic time tensor flattening algorithm in this case. Finally, we illustrate the usefulness of our contributions using standard data sets and image segmentation tasks.

📄 PDF Abstract BibTeX arXiv:1403.4378

Code (0)

등록된 구현이 없습니다.

Tasks

ClusteringImage Segmentation Semantic Segmentation Vocal Bursts Type Prediction

HAQJSK: Hierarchical-Aligned Quantum Jensen-Shannon Kernels for Graph Classification

2022-11-05 · Lu Bai, Lixin Cui, Yue Wang, Ming Li 외

In this work, we propose a family of novel quantum kernels, namely the Hierarchical Aligned Quantum Jensen-Shannon Kernels (HAQJSK), for un-attributed graphs. Different from most existing classical graph kernels, the pro…

Graph Classification

Fast Landmark Subspace Clustering

2015-10-28 · Xu Wang, Gilad Lerman

Kernel methods obtain superb performance in terms of accuracy for various machine learning tasks since they can effectively extract nonlinear relations. However, their time complexity can be rather large especially for c…

Clustering

UMAP Is Spectral Clustering on the Fuzzy Nearest-Neighbor Graph

2026-02-12 · Yang Yang arxiv

UMAP (Uniform Manifold Approximation and Projection) is among the most widely used algorithms for non linear dimensionality reduction and data visualisation. Despite its popularity, and despite being presented through th…

Dimensionality Reduction Contrastive Learning

Group Invariant Spectral Embedding

2026-07-09 · Yeari Vigder, Paulina Hoyos, David Thong, Joakim andén 외 arxiv

Spectral embedding methods are widely used for dimensionality reduction and clustering of high-dimensional datasets with intrinsic low-dimensional structures. Although many datasets of practical interest exhibit invarian…

Dimensionality Reduction

DPO Kernels: A Semantically-Aware, Kernel-Enhanced, and Divergence-Rich Paradigm for Direct Preference Optimization

2025-01-05 · Amitava Das, Suranjana Trivedy, Danush Khanna, Rajarshi Roy 외

The rapid rise of large language models (LLMs) has unlocked many applications but also underscores the challenge of aligning them with diverse values and preferences. Direct Preference Optimization (DPO) is central to al…

Instruction Following