This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
Searching for optimal ways in a network is an important task in multiple application areas such as social networks, co-citation graphs or road networks. In the majority of applicat...
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
Maciej Kurant, Minas Gjoka, Yan Wang, Zack W. Almq...
We propose a logical/mathematical framework for statistical parameter learning of parameterized logic programs, i.e. denite clause programs containing probabilistic facts with a ...
Many applications, including provenance and some analyses of social networks, require path-based queries over graphstructured data. When these graphs contain sensitive information...
Barbara T. Blaustein, Adriane Chapman, Len Seligma...