no code implementations • 11 Jun 2018 • Wang Xinyi, Aguinaga Salvador, Weninger Tim, Chiang David
Recent work in graph models has found that probabilistic hyperedge replacement grammars (HRGs) can be extracted from graphs and used to generate new random graphs with graph properties and substructures close to the original.
no code implementations • 28 Nov 2016 • Shi Baoxu, Yang Lin, Weninger Tim
Similarity search is a fundamental problem in social and knowledge networks like GitHub, DBLP, Wikipedia, etc.
no code implementations • 18 Aug 2015 • Weninger Tim, Palacios Rodrigo, Crescenzi Valter, Gottron Thomas, Merialdo Paolo
In this paper, we present a meta-analysis of several Web content extraction algorithms, and make recommendations for the future of content extraction on the Web.