Data mining of social networks represented as graphs

DOI10.1016/j.cosrev.2012.12.001zbMath1298.68046OpenAlexW2009746817MaRDI QIDQ465703

David F. Nettleton

Publication date: 24 October 2014

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2012.12.001

zbMATH Keywords

data modellingdata miningstatistical analysisonline social networksgraph mining

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Distributed systems (68M14) Internet topics (68M11)

Related Items

Fuzzy Forcing Set on Fuzzy Graphs ⋮ Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Connectedness of Graph and Matroid by Covering-Based Rough Sets ⋮ A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model ⋮ A rapid learning automata-based approach for generalized minimum spanning tree problem ⋮ A survey of neighborhood construction algorithms for clustering and classifying data points

Uses Software

• NetworkX
• SNAP
• igraph
• gSpan
• Colibri
• Gephi
• Neo4J
• JUNG
• BigML

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On graph problems in a semi-streaming model
• Estimating PageRank on graph streams
• Conditional Marginalization for Exponential Random Graph Models
• The Geometric Protean Model for On-Line Social Networks
• Empirical Analysis of an Evolving Social Network
• Authoritative sources in a hyperlinked environment
• Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
• The small-world phenomenon
• Snowball Sampling
• Mining Graph Data
• Fredman–Komlós bounds and information theory
• The Structure and Function of Complex Networks
• Community structure in social and biological networks
• Fast Approximation of Centrality
• Fast unfolding of communities in large networks
• Analysis of Graphs by Connectivity Considerations
• Trading off space for passes in graph streaming problems