[PDF][PDF] The boundary coefficient: a vertex measure for visualizing and finding structure in weighted graphs

R Vandaele, Y Saeys, T De Bie - 15th International Workshop on …, 2019 - biblio.ugent.be
Graphs have emerged as powerful representations of data, from obvious examples such as
social networks, to proximity graphs of high-dimensional metric data. Many of such real …

Orometry, Intrinsic Dimensionality and Learning: Novel Insights into Network Data

M Stubbemann - 2023 - kobra.uni-kassel.de
Today, networks are an integral part of our world. Let it be real-life friendship networks or
social connections that are based on social media. In this thesis, we contribute to the …

Analysis of Meso-scale Structures in Weighted Graphs

D Sardana - 2017 - rave.ohiolink.edu
Many real world systems across multiple disciplines, like social, biological and information
networks can be described as complex networks, ie, assemblies of nodes and edges having …

Metric tree‐like structures in real‐world networks: an empirical study

M Abu‐Ata, FF Dragan - Networks, 2016 - Wiley Online Library
Based on solid theoretical foundations, we present strong evidence that a number of real‐
world networks, taken from different domains (such as Internet measurements, biological …

A simple statistic for determining the dimensionality of complex networks

T Friedrich, A Göbel, M Katzmann, L Schiller - arXiv preprint arXiv …, 2023 - arxiv.org
Detecting the dimensionality of graphs is a central topic in machine learning. While the
problem has been tackled empirically as well as theoretically, existing methods have several …

Metrics for graph comparison: a practitioner's guide

P Wills, FG Meyer - Plos one, 2020 - journals.plos.org
Comparison of graph structure is a ubiquitous task in data analysis and machine learning,
with diverse applications in fields such as neuroscience, cyber security, social network …

Mining scale-free networks using geodesic clustering

AY Wu, M Garland, J Han - Proceedings of the tenth ACM SIGKDD …, 2004 - dl.acm.org
Many real-world graphs have been shown to be scale-free---vertex degrees follow power
law distributions, vertices tend to cluster, and the average length of all shortest paths is …

Density-friendly graph decomposition

N Tatti - ACM Transactions on Knowledge Discovery from Data …, 2019 - dl.acm.org
Decomposing a graph into a hierarchical structure via k-core analysis is a standard
operation in any modern graph-mining toolkit. k-core decomposition is a simple and efficient …

[图书][B] Dimension Reduction for Network Analysis with an Application to Drug Discovery

H Chen - 2021 - search.proquest.com
Graphs (or networks) naturally represent valuable information for relational data, which are
ubiquitous in real-world applications, such as social networks, recommender systems, and …

Interplay between topology and edge weights in real-world graphs: concepts, patterns, and an algorithm

F Bu, S Kang, K Shin - Data Mining and Knowledge Discovery, 2023 - Springer
What are the relations between the edge weights and the topology in real-world graphs?
Given only the topology of a graph, how can we assign realistic weights to its edges based …