Novel Framework for Spectral Clustering using Topological Node Features(TNF)

Spectral clustering has gained importance in recent years due to its ability to cluster complex data as it requires only pairwise similarity among data points with its ease of implementation. The central point in spectral clustering is the process of capturing pair-wise similarity. In the literature, many research techniques have been proposed for effective construction of affinity matrix with suitable pair- wise similarity. In this paper a general framework for capturing pairwise affinity using local features such as density, proximity and structural similarity is been proposed. Topological Node Features are exploited to define the notion of density and local structure. These local features are incorporated into the construction of the affinity matrix. Experimental results, on widely used datasets such as synthetic shape datasets, UCI real datasets and MNIST handwritten datasets show that the proposed framework outperforms standard spectral clustering methods.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/17/2019

Conformal Prediction based Spectral Clustering

Spectral Clustering(SC) is a prominent data clustering technique of rece...
research
01/04/2014

Context-Aware Hypergraph Construction for Robust Spectral Clustering

Spectral clustering is a powerful tool for unsupervised data analysis. I...
research
02/04/2019

Enhanced Hierarchical Music Structure Annotations via Feature Level Similarity Fusion

We describe a novel pipeline to automatically discover hierarchies of re...
research
11/13/2015

Adaptive Affinity Matrix for Unsupervised Metric Learning

Spectral clustering is one of the most popular clustering approaches wit...
research
10/19/2012

Learning Generative Models of Similarity Matrices

We describe a probabilistic (generative) view of affinity matrices along...
research
05/21/2019

Spatially Constrained Spectral Clustering Algorithms for Region Delineation

Regionalization is the task of dividing up a landscape into homogeneous ...
research
06/10/2014

Graph Approximation and Clustering on a Budget

We consider the problem of learning from a similarity matrix (such as sp...

Please sign up or login with your details

Forgot password? Click here to reset