Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Data mining of social networks represented as graphs
DF Nettleton - Computer Science Review, 2013 - Elsevier
In this survey we review the literature and concepts of the data mining of social networks,
with special emphasis on their representation as a graph structure. The survey is divided …
with special emphasis on their representation as a graph structure. The survey is divided …
Machine learning in network centrality measures: Tutorial and outlook
Complex networks are ubiquitous to several computer science domains. Centrality
measures are an important analysis mechanism to uncover vital elements of complex …
measures are an important analysis mechanism to uncover vital elements of complex …
[KNIHA][B] Statistical analysis of network data with R
ED Kolaczyk, G Csárdi - 2014 - Springer
Networks and network analysis are arguably one of the largest growth areas of the early
twenty-first century in the quantitative sciences. Despite roots in social network analysis …
twenty-first century in the quantitative sciences. Despite roots in social network analysis …
[KNIHA][B] Network analysis: methodological foundations
U Brandes - 2005 - books.google.com
'Network'is a heavily overloaded term, so that 'network analysis' means different things to
different people. Specific forms of network analysis are used in the study of diverse …
different people. Specific forms of network analysis are used in the study of diverse …
Path problems in temporal graphs
Shortest path is a fundamental graph problem with numerous applications. However, the
concept of classic shortest path is insufficient or even flawed in a temporal graph, as the …
concept of classic shortest path is insufficient or even flawed in a temporal graph, as the …
Centrality measures in complex networks: A survey
In complex networks, each node has some unique characteristics that define the importance
of the node based on the given application-specific context. These characteristics can be …
of the node based on the given application-specific context. These characteristics can be …
Fast approximation of betweenness centrality through sampling
Betweenness centrality is a fundamental measure in social network analysis, expressing the
importance or influence of individual vertices in a network in terms of the fraction of shortest …
importance or influence of individual vertices in a network in terms of the fraction of shortest …
Ranking of closeness centrality for large-scale social networks
Closeness centrality is an important concept in social network analysis. In a graph
representing a social network, closeness centrality measures how close a vertex is to all …
representing a social network, closeness centrality measures how close a vertex is to all …
NetworKit: A tool suite for large-scale complex network analysis
We introduce NetworKit, an open-source software package for analyzing the structure of
large complex networks. Appropriate algorithmic solutions are required to handle …
large complex networks. Appropriate algorithmic solutions are required to handle …
Centrality measures based on current flow
U Brandes, D Fleischer - Annual symposium on theoretical aspects of …, 2005 - Springer
We consider variations of two well-known centrality measures, betweenness and closeness,
with a different model of information spread. Rather than along shortest paths only, it is …
with a different model of information spread. Rather than along shortest paths only, it is …