2021
DOI: 10.1007/s13278-021-00721-7
|View full text |Cite
|
Sign up to set email alerts
|

A study of cluster hypergraphs and its properties

Abstract: In this study, cluster hypergraphs are introduced to generalize the concept of hypergraphs, where cluster nodes are allowed. Few related terms and properties on cluster hypergraphs are discussed. Some operations, including the Cartesian product, union, intersection, etc., are studied. Different types of matrix representations and isomorphism are also proposed on cluster hypergraphs. The notion of an effective degree for nodes is introduced to capture the group/ cluster effects. At last, the area of application… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 17 publications
0
2
0
Order By: Relevance
“…The dataset is made into ten clusters [46][47][48][49][50][51] using the k-means clustering algorithm, without any amalgamation of another algorithm as depicted in Fig. 2.…”
Section: Resultsmentioning
confidence: 99%
“…The dataset is made into ten clusters [46][47][48][49][50][51] using the k-means clustering algorithm, without any amalgamation of another algorithm as depicted in Fig. 2.…”
Section: Resultsmentioning
confidence: 99%
“…The approach discussed in [30][31][32][33][34][35] is only considered a set of positive information. But our approach is considered positive information as well as at the same time negative information.…”
Section: Introductionmentioning
confidence: 99%