2006
DOI: 10.1016/j.fss.2006.01.001
|View full text |Cite
|
Sign up to set email alerts
|

A hierarchical clustering algorithm based on fuzzy graph connectedness

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0
1

Year Published

2008
2008
2020
2020

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 56 publications
(22 citation statements)
references
References 11 publications
0
21
0
1
Order By: Relevance
“…Therefore, the overlap is a significant feature of many realworld networks. To solve this problem, fuzzy clustering algorithms applied to graphs [56] and overlapping approaches [57] have been proposed.…”
Section: Community Detection Algorithmsmentioning
confidence: 99%
“…Therefore, the overlap is a significant feature of many realworld networks. To solve this problem, fuzzy clustering algorithms applied to graphs [56] and overlapping approaches [57] have been proposed.…”
Section: Community Detection Algorithmsmentioning
confidence: 99%
“…A HFS is a special type of a CFS that has a specific structure [2,4,13,24,25,30,36,39,64,70,75,79,90,94,139,143,151,169]. Each subsystem in a HFS has two inputs and one output.…”
Section: Systems With Multiple Rule Basesmentioning
confidence: 99%
“…Unlike the techniques mentioned before, the HC algorithm produce a hierarchy of clusters instead of just one clustering set. HC data is described as hard since output of clustering process generates a hard partition between disjoint subsets using the dataset [16,25,26,[33][34][35][36].…”
Section: The Substructure Of Prediction Tool Developedmentioning
confidence: 99%