Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Authors

Abstract:

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members in each cluster. In this paper, we use hierarchical SVD to cluster graphs with itchr('39')s adjacency matrix. In this algorithm, users can select a range for the number of members in each cluster. The results show in hierarchical SVD algorithm, clustering measurement parameters are more desirable and clusters are as dense as possible. The complexity of this algorithm is less than the complexity of SVD clustering method.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Dynamic Document Clustering Using Singular Value Decomposition

Incremental document clustering is important in many applications, but particularly so in healthcare contexts where text data is found in abundance, ranging from published research in journals to day-to-day healthcare data such as discharge summaries and nursing notes. In such dynamic environments new documents are constantly added to the set of documents that have been used in the initial clus...

full text

پیشنهاد روش جدیدی برای محاسبه polynomial singular value decomposition ) psvd )

در این پایان نامه به معرفی روشهای مختلف محاسبه psvd می پردازیم. بخشی از این روشها به بررسی روشهای مختلف محاسبه psvd در مقالات مطالعه شده می پردازد که می توان به محاسبهpsvd با استفاده از الگوریتمهای pqrd و pevd و sbr2 و محاسبه psvd براساس تکنیک kogbetliantz و روش پارامتریک برای محاسبه psvd اشاره نمود. بخش بعدی نیز به بررسی روشهای مستقیم پیشنهادی محاسبه psvd برای ماتریسهای 2×2و2× n و n×2 و 3× n و...

15 صفحه اول

A Hierarchical Singular Value Decomposition Algorithm for Low Rank Matrices

Singular value decomposition (SVD) is a widely used technique for dimensionality reduction and computation of basis vectors. In many applications, especially in fluid mechanics, the matrices are dense, but low-rank matrices. In these cases, a truncated SVD corresponding to the most significant singular values is sufficient. In this paper, we propose a tree based merge-and-truncate algorithm to ...

full text

Singular Value Decomposition based Steganography Technique for JPEG2000 Compressed Images

In this paper, a steganography technique for JPEG2000 compressed images using singular value decomposition in wavelet transform domain is proposed. In this technique, DWT is applied on the cover image to get wavelet coefficients and SVD is applied on these wavelet coefficients to get the singular values. Then secret data is embedded into these singular values using scaling factor. Different com...

full text

Singular Value Decomposition (SVD) and Generalized Singular Value Decomposition (GSVD)

The singular value decomposition (SVD) is a generalization of the eigen-decomposition which can be used to analyze rectangular matrices (the eigen-decomposition is definedonly for squaredmatrices). By analogy with the eigen-decomposition, which decomposes a matrix into two simple matrices, the main idea of the SVD is to decompose a rectangular matrix into three simple matrices: Two orthogonal m...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 16  issue 1

pages  105- 121

publication date 2021-04

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023