50,426 research outputs found
DPPIN: A Biological Dataset of Dynamic Protein-Protein Interaction Networks
Nowadays, many network representation learning algorithms and downstream
network mining tasks have already paid attention to dynamic networks or
temporal networks, which are more suitable for real-world complex scenarios by
modeling evolving patterns and temporal dependencies between node interactions.
Moreover, representing and mining temporal networks have a wide range of
applications, such as fraud detection, social network analysis, and drug
discovery. To contribute to the network representation learning and network
mining research community, in this paper, we generate a new biological dataset
of dynamic protein-protein interaction networks (i.e., DPPIN), which consists
of twelve dynamic protein-level interaction networks of yeast cells at
different scales. We first introduce the generation process of DPPIN. To
demonstrate the value of our published dataset DPPIN, we then list the
potential applications that would be benefited. Furthermore, we design dynamic
local clustering, dynamic spectral clustering, dynamic subgraph matching,
dynamic node classification, and dynamic graph classification experiments,
where DPPIN indicates future research opportunities for some tasks by
presenting challenges on state-of-the-art baseline algorithms. Finally, we
identify future directions for improving this dataset utility and welcome
inputs from the community. All resources of this work are deployed and publicly
available at https://github.com/DongqiFu/DPPIN
Models of Social Groups in Blogosphere Based on Information about Comment Addressees and Sentiments
This work concerns the analysis of number, sizes and other characteristics of
groups identified in the blogosphere using a set of models identifying social
relations. These models differ regarding identification of social relations,
influenced by methods of classifying the addressee of the comments (they are
either the post author or the author of a comment on which this comment is
directly addressing) and by a sentiment calculated for comments considering the
statistics of words present and connotation. The state of a selected blog
portal was analyzed in sequential, partly overlapping time intervals. Groups in
each interval were identified using a version of the CPM algorithm, on the
basis of them, stable groups, existing for at least a minimal assumed duration
of time, were identified.Comment: Gliwa B., Ko\'zlak J., Zygmunt A., Models of Social Groups in
Blogosphere Based on Information about Comment Addressees and Sentiments, in
the K. Aberer et al. (Eds.): SocInfo 2012, LNCS 7710, pp. 475-488, Best Paper
Awar
Detecting change points in the large-scale structure of evolving networks
Interactions among people or objects are often dynamic in nature and can be
represented as a sequence of networks, each providing a snapshot of the
interactions over a brief period of time. An important task in analyzing such
evolving networks is change-point detection, in which we both identify the
times at which the large-scale pattern of interactions changes fundamentally
and quantify how large and what kind of change occurred. Here, we formalize for
the first time the network change-point detection problem within an online
probabilistic learning framework and introduce a method that can reliably solve
it. This method combines a generalized hierarchical random graph model with a
Bayesian hypothesis test to quantitatively determine if, when, and precisely
how a change point has occurred. We analyze the detectability of our method
using synthetic data with known change points of different types and
magnitudes, and show that this method is more accurate than several previously
used alternatives. Applied to two high-resolution evolving social networks,
this method identifies a sequence of change points that align with known
external "shocks" to these networks
- …