# MALNISI-Infused Graph Construction and Weighted Contrastive Loss based GAT for Unsupervised Representation Learning in HSI

DevFeed: [MALNISI-Infused Graph Construction and Weighted Contrastive Loss based GAT for Unsupervised Representation Learning in HSI](<https://devfeed.tech/articles/malnisi-infused-graph-construction-and-weighted-contrastive-loss-based-gat-for-unsupervised-representation-learning-in-hsi-132320.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17199>)

Author: Soumi Sarkar, Subhadip Boral, Sarbani Palit, Ashish Ghosh

Published: 2026-11-13T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [metric learning](<https://devfeed.tech/topics/metric-learning.md>), [Embeddings](<https://devfeed.tech/topics/embeddings.md>), [Neural Network](<https://devfeed.tech/topics/neural-network.md>), [clustering](<https://devfeed.tech/topics/clustering.md>), [Graphs](<https://devfeed.tech/topics/graphs.md>)

Tags: [absolute](<https://devfeed.tech/tags/absolute.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [accelerate](<https://devfeed.tech/tags/accelerate.md>), [adjacency-matrix](<https://devfeed.tech/tags/adjacency-matrix.md>), [analysis](<https://devfeed.tech/tags/analysis.md>), [architecture](<https://devfeed.tech/tags/architecture.md>), [article](<https://devfeed.tech/tags/article.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [attention](<https://devfeed.tech/tags/attention.md>), [based](<https://devfeed.tech/tags/based.md>), [benchmark](<https://devfeed.tech/tags/benchmark.md>), [capability](<https://devfeed.tech/tags/capability.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [complex](<https://devfeed.tech/tags/complex.md>), [construction](<https://devfeed.tech/tags/construction.md>), [contributions](<https://devfeed.tech/tags/contributions.md>), [convergence](<https://devfeed.tech/tags/convergence.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [data](<https://devfeed.tech/tags/data.md>), [graph](<https://devfeed.tech/tags/graph.md>), [learning](<https://devfeed.tech/tags/learning.md>)

## AI overview

The method builds a weighted graph of hyperspectral image pixels using MALNISI, a neighborhood-based similarity index, then learns compact representations with an upgraded Graph Attention Network. MALNISI weights inform multi-head attention and the contrastive loss, which pulls strongly connected pixels together in latent space and pushes weakly connected ones apart. Residual connections, skip projections, and feature normalization are intended to reduce over-smoothing and preserve spectral detail. The learned embeddings are clustered with spectral clustering. The abstract reports experiments on six benchmark datasets and superior performance to fourteen state-of-the-art approaches, but gives no metrics or dataset-specific results.

## Source excerpt

arXiv:2611.17199v1 Announce Type: cross Abstract: Hyperspectral images (HSI) possess discriminating spectral characteristics with respect to land utilization due to high-dimensional information. Recently, unsupervised representation learning using graph neural networks has unveiled these utilization-specific complex spectral relations. This article has three main contributions. First, it proposes an index, the Mean Absolute Local Neighborhood Inverse Spectral Index (MALNISI), which measures the similarity between two pixels based on their neighborhood information. The index is used to construct a weighted adjacency matrix, giving the HSI a graph structure. Second, it proposes an upgraded Graph Attention Network that learns compact latent representations of hyperspectral data from the constructed graph. In this network, an enhanced multi-head attention mechanism incorporates the MALNISI weights as an auxiliary feature to emphasize learned attention between neighboring pixels. To alleviate over-smoothing and preserve fine-grained spectral details, the architecture integrates residual connections, skip projections, and feature normalization, which together enhance representation capability, stabilize learning, and accelerate convergence. Third, it proposes a weighted contrastive loss function that incorporates neighborhood-aware MALNISI between connected pixels, encouraging strongly connected pixels in the high-dimensional space to remain close in the latent space, and weakly connected pixels to stay apart. The resulting discriminative low-dimensional embeddings are then clustered using spectral clustering. Experimental analysis on six benchmark HSI datasets demonstrates the efficiency and necessity of the three aforementioned contributions, and the comparative study highlights superior performance over fourteen state-of-the-art approaches.