Sciweavers

54 search results - page 1 / 11
» The Network Completion Problem: Inferring Missing Nodes and ...
Sort
View
SDM
2011
SIAM
284views Data Mining» more  SDM 2011»
12 years 7 months ago
The Network Completion Problem: Inferring Missing Nodes and Edges in Networks
While the social and information networks have become ubiquitous, the challenge of collecting complete network data still persists. Many times the collected network data is incomp...
Myunghwan Kim 0002, Jure Leskovec
BIOCOMP
2006
13 years 5 months ago
Theoretical Bounds for the Number of Inferable Edges in Sparse Random Networks
Abstract-- The inference of a network structure from experimental data providing dynamical information about the underlying system of investigation is an important and still outsta...
Frank Emmert-Streib, Matthias Dehmer
KDD
2012
ACM
201views Data Mining» more  KDD 2012»
11 years 6 months ago
Low rank modeling of signed networks
Trust networks, where people leave trust and distrust feedback, are becoming increasingly common. These networks may be regarded as signed graphs, where a positive edge weight cap...
Cho-Jui Hsieh, Kai-Yang Chiang, Inderjit S. Dhillo...
NIPS
2003
13 years 5 months ago
Generalised Propagation for Fast Fourier Transforms with Partial or Missing Data
Discrete Fourier transforms and other related Fourier methods have been practically implementable due to the fast Fourier transform (FFT). However there are many situations where ...
Amos J. Storkey
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 4 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec