1,921 research outputs found
Stochastic Block Transition Models for Dynamic Networks
There has been great interest in recent years on statistical models for
dynamic networks. In this paper, I propose a stochastic block transition model
(SBTM) for dynamic networks that is inspired by the well-known stochastic block
model (SBM) for static networks and previous dynamic extensions of the SBM.
Unlike most existing dynamic network models, it does not make a hidden Markov
assumption on the edge-level dynamics, allowing the presence or absence of
edges to directly influence future edge probabilities while retaining the
interpretability of the SBM. I derive an approximate inference procedure for
the SBTM and demonstrate that it is significantly better at reproducing
durations of edges in real social network data.Comment: To appear in proceedings of AISTATS 201
Personalized Degrees: Effects on Link Formation in Dynamic Networks from an Egocentric Perspective
Understanding mechanisms driving link formation in dynamic social networks is
a long-standing problem that has implications to understanding social structure
as well as link prediction and recommendation. Social networks exhibit a high
degree of transitivity, which explains the successes of common neighbor-based
methods for link prediction. In this paper, we examine mechanisms behind link
formation from the perspective of an ego node. We introduce the notion of
personalized degree for each neighbor node of the ego, which is the number of
other neighbors a particular neighbor is connected to. From empirical analyses
on four on-line social network datasets, we find that neighbors with higher
personalized degree are more likely to lead to new link formations when they
serve as common neighbors with other nodes, both in undirected and directed
settings. This is complementary to the finding of Adamic and Adar that neighbor
nodes with higher (global) degree are less likely to lead to new link
formations. Furthermore, on directed networks, we find that personalized
out-degree has a stronger effect on link formation than personalized in-degree,
whereas global in-degree has a stronger effect than global out-degree. We
validate our empirical findings through several link recommendation experiments
and observe that incorporating both personalized and global degree into link
recommendation greatly improves accuracy.Comment: To appear at the 10th International Workshop on Modeling Social Media
co-located with the Web Conference 201
Experimental investigation on performance of fabrics for indirect evaporative cooling applications
Β© 2016 Indirect evaporative cooling, by using water evaporation to absorb heat to lower the air temperature without adding moisture, is an extremely low energy and environmentally friendly cooling principle. The properties of the wet channel surface in an indirect evaporating cooler, i.e. its moisture wicking ability, diffusivity and evaporation ability, can greatly affect cooling efficiency and performance. Irregular fibres help to divert moisture and enlarge the wetted area, thus promoting evaporation. A range of fabrics (textiles) weaved from various fibres were experimentally tested and compared to Kraft paper, which has been conventionally used as a wet surface medium in evaporative coolers. It was found that most of the textile fabrics have superior properties in moisture wicking ability, diffusivity and evaporation ability. Compared with Kraft paper, the wicking ability of some fabrics was found to be 171%β182% higher, the diffusion ability 298%β396% higher and evaporation ability 77%β93% higher. A general assessment concerning both the moisture transfer and mechanical properties found that two of the fabrics were most suitable for indirective evaporative cooling applications
Leveraging Friendship Networks for Dynamic Link Prediction in Social Interaction Networks
On-line social networks (OSNs) often contain many different types of
relationships between users. When studying the structure of OSNs such as
Facebook, two of the most commonly studied networks are friendship and
interaction networks. The link prediction problem in friendship networks has
been heavily studied. There has also been prior work on link prediction in
interaction networks, independent of friendship networks. In this paper, we
study the predictive power of combining friendship and interaction networks. We
hypothesize that, by leveraging friendship networks, we can improve the
accuracy of link prediction in interaction networks. We augment several
interaction link prediction algorithms to incorporate friendships and predicted
friendships. From experiments on Facebook data, we find that incorporating
friendships into interaction link prediction algorithms results in higher
accuracy, but incorporating predicted friendships does not when compared to
incorporating current friendships.Comment: To appear in ICWSM 2018. This version corrects some minor errors in
Table 1. MATLAB code available at
https://github.com/IdeasLabUT/Friendship-Interaction-Predictio
The Block Point Process Model for Continuous-Time Event-Based Dynamic Networks
We consider the problem of analyzing timestamped relational events between a
set of entities, such as messages between users of an on-line social network.
Such data are often analyzed using static or discrete-time network models,
which discard a significant amount of information by aggregating events over
time to form network snapshots. In this paper, we introduce a block point
process model (BPPM) for continuous-time event-based dynamic networks. The BPPM
is inspired by the well-known stochastic block model (SBM) for static networks.
We show that networks generated by the BPPM follow an SBM in the limit of a
growing number of nodes. We use this property to develop principled and
efficient local search and variational inference procedures initialized by
regularized spectral clustering. We fit BPPMs with exponential Hawkes processes
to analyze several real network data sets, including a Facebook wall post
network with over 3,500 nodes and 130,000 events.Comment: To appear at The Web Conference 201
Multi-criteria Anomaly Detection using Pareto Depth Analysis
We consider the problem of identifying patterns in a data set that exhibit
anomalous behavior, often referred to as anomaly detection. In most anomaly
detection algorithms, the dissimilarity between data samples is calculated by a
single criterion, such as Euclidean distance. However, in many cases there may
not exist a single dissimilarity measure that captures all possible anomalous
patterns. In such a case, multiple criteria can be defined, and one can test
for anomalies by scalarizing the multiple criteria using a linear combination
of them. If the importance of the different criteria are not known in advance,
the algorithm may need to be executed multiple times with different choices of
weights in the linear combination. In this paper, we introduce a novel
non-parametric multi-criteria anomaly detection method using Pareto depth
analysis (PDA). PDA uses the concept of Pareto optimality to detect anomalies
under multiple criteria without having to run an algorithm multiple times with
different choices of weights. The proposed PDA approach scales linearly in the
number of criteria and is provably better than linear combinations of the
criteria.Comment: Removed an unnecessary line from Algorithm
- β¦