Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Weighted Multiview K-Means Clustering with L2 Regularization

View through CrossRef
In the era of big data, cloud, internet of things, virtual communities, and interconnected networks, the prominence of multiview data is undeniable. This type of data encapsulates diverse feature components across varying perspectives, each offering unique insights into the same underlying samples. Despite being sourced from diverse settings and domains, these data serve the common purpose of describing the same samples, establishing a significant interrelation among them. Thus, there arises a necessity for the development of multiview clustering methodologies capable of leveraging the wealth of information available across multiple views. This study introduces two novel weighted multiview k-means algorithms, W-MV-KM and weighted multiview k-means using L2 regularization, W-MV-KM-L2, designed specifically for clustering multiview data. These algorithms incorporate feature weights and view weights within the k-means (KM) framework. Our approach emphasizes a weighted multiview learning strategy, which assigns varying degrees of importance to individual views. We evaluate the clustering performance of our algorithms on seven diverse benchmark datasets spanning dermatology, textual, image, and digit domains. Through extensive experimentation and comparisons with existing methods, we showcase the superior effectiveness and utility of our newly introduced W-MV-KM-L2 algorithm.
Title: Weighted Multiview K-Means Clustering with L2 Regularization
Description:
In the era of big data, cloud, internet of things, virtual communities, and interconnected networks, the prominence of multiview data is undeniable.
This type of data encapsulates diverse feature components across varying perspectives, each offering unique insights into the same underlying samples.
Despite being sourced from diverse settings and domains, these data serve the common purpose of describing the same samples, establishing a significant interrelation among them.
Thus, there arises a necessity for the development of multiview clustering methodologies capable of leveraging the wealth of information available across multiple views.
This study introduces two novel weighted multiview k-means algorithms, W-MV-KM and weighted multiview k-means using L2 regularization, W-MV-KM-L2, designed specifically for clustering multiview data.
These algorithms incorporate feature weights and view weights within the k-means (KM) framework.
Our approach emphasizes a weighted multiview learning strategy, which assigns varying degrees of importance to individual views.
We evaluate the clustering performance of our algorithms on seven diverse benchmark datasets spanning dermatology, textual, image, and digit domains.
Through extensive experimentation and comparisons with existing methods, we showcase the superior effectiveness and utility of our newly introduced W-MV-KM-L2 algorithm.

Related Results

A Mixed Regularization Method for Ill-Posed Problems
A Mixed Regularization Method for Ill-Posed Problems
In this paper we propose a mixed regularization method for ill-posed problems. This method combines iterative regularization methods and continuous regularization methods effective...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background: Clustering is one of the most important data mining methods. The k-means (c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
ADAPTIVE KNOWLEDGE REGULARIZATION FOR CONTINUAL LEARNING IN TRANSFORMER ARCHITECTURES
ADAPTIVE KNOWLEDGE REGULARIZATION FOR CONTINUAL LEARNING IN TRANSFORMER ARCHITECTURES
The subject matter of the article is development of latent representation regularization mechanism in transformer-based architecture under conditions of continuous learning with do...
Cluster evaluation on weighted networks
Cluster evaluation on weighted networks
(English) This thesis presents a systematic approach to validate the results of clustering methods on weighted networks, particularly for the cases where the existence of a communi...
How suitable are clustering methods for functional annotation of proteins?
How suitable are clustering methods for functional annotation of proteins?
Abstract The advent of affordable high-throughput genome sequencing has drastically expanded protein sequence databases, necessitating the development of computatio...
An Ensemble Clustering Method Based on Several Different Clustering Methods
An Ensemble Clustering Method Based on Several Different Clustering Methods
Abstract As an unsupervised learning method, clustering is done to find natural groupings of patterns, points, or objects. In clustering algorithms, an important problem is...
Big Data Clustering Method Based on an Improved PSO-Means Algorithm
Big Data Clustering Method Based on an Improved PSO-Means Algorithm
There are problems in big data clustering processing, such as poor clustering effect of different types of data and long clustering time. Therefore, a big data clustering processin...
Image clustering using exponential discriminant analysis
Image clustering using exponential discriminant analysis
Local learning based image clustering models are usually employed to deal with images sampled from the non‐linear manifold. Recently, linear discriminant analysis (LDA) based vario...

Back to Top