Sciweavers

158 search results - page 5 / 32
» Community Learning by Graph Approximation
Sort
View
CIKM
2009
Springer
14 years 2 months ago
Networks, communities and kronecker products
Emergence of the web and online computing applications gave rise to rich large scale social activity data. One of the principal challenges then is to build models and understandin...
Jure Leskovec
SIGPRO
2011
209views Hardware» more  SIGPRO 2011»
13 years 2 months ago
Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
In this paper, we survey and compare different algorithms that, given an overcomplete dictionary of elementary functions, solve the problem of simultaneous sparse signal approxim...
A. Rakotomamonjy
WWW
2003
ACM
14 years 8 months ago
On the bursty evolution of blogspace
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
Ravi Kumar, Jasmine Novak, Prabhakar Raghavan, And...
ML
2011
ACM
179views Machine Learning» more  ML 2011»
13 years 2 months ago
Neural networks for relational learning: an experimental comparison
In the last decade, connectionist models have been proposed that can process structured information directly. These methods, which are based on the use of graphs for the representa...
Werner Uwents, Gabriele Monfardini, Hendrik Blocke...
IAAI
2003
13 years 9 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...