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...
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...
Analytical Solutions to Minimum-Norm Problems
Analytical Solutions to Minimum-Norm Problems
For G∈Rm×n and g∈Rm, the minimization min∥Gψ−g∥2, with ψ∈Rn, is known as the Tykhonov regularization. We transport the Tykhonov regularization to an infinite-dimensional setting, t...
A COMPARATIVE ANALYSIS OF K-MEANS AND HIERARCHICAL CLUSTERING
A COMPARATIVE ANALYSIS OF K-MEANS AND HIERARCHICAL CLUSTERING
Clustering is the process of arranging comparable data elements into groups. One of the most frequent data mining analytical techniques is clustering analysis; the clustering algor...
Multiview-Learning-Based Generic Palmprint Recognition: A Literature Review
Multiview-Learning-Based Generic Palmprint Recognition: A Literature Review
Palmprint recognition has been widely applied to security authentication due to its rich characteristics, i.e., local direction, wrinkle, and texture. However, different types of p...
Application of an improved k‐means clustering algorithm in power user grouping
Application of an improved k‐means clustering algorithm in power user grouping
AbstractThe illegal act of stealing electricity has brought serious security risks to the operation of power transmission system. The electricity consumption law of power users has...
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
In the process of parallel density clustering, the boundary points of clusters with different densities are blurred and there is data noise, which affects the clustering performanc...

Back to Top