Konu "Graph Theory" için Araştırma Çıktıları | TR-Dizin | WoS | Scopus | PubMed listeleme
Toplam kayıt 3, listelenen: 1-3
-
CutESC: Cutting edge spatial clustering technique based on proximity graphs
(Elsevier, 2019)In this paper, we propose a cut-edge algorithm for spatial clustering (CutESC) based on proximity graphs. The CutESC algorithm removes edges when a cut-edge value for the edge's endpoints is below a threshold. The cut-edge ... -
Data on cut-edge for spatial clustering based on proximity graphs
(Elsevier, 2020)Cluster analysis plays a significant role regarding automating such a knowledge discovery process in spatial data mining. A good clustering algorithm supports two essential conditions, namely high intra-cluster similarity ... -
Patients with Alzheimer's disease dementia show partially preserved parietal 'hubs' modeled from resting-state alpha electroencephalographic rhythms
(Frontiers Media S.A., 2023)IntroductionGraph theory models a network by its nodes (the fundamental unit by which graphs are formed) and connections. 'Degree' hubs reflect node centrality (the connection rate), while 'connector' hubs are those linked ...