[updated with Tagommenders paper – thanks Shilad.] The organizers of the World Wide Web conference recently announced the list of accepted papers for this year’s event. In the Social Networks and Web 2.0 track (chaired by Elisa Bertino and Lada...
Handcock, M.S., Raftery, A.E. and Tantrum, J. (2005).
Model-Based Clustering for Social Networks.
Working Paper no. 46, Center for Statistics and the Social Sciences,
University of Washington.
Our mission is to leverage the methods of machine learning and game theory for addressing relevant applications both in recreational games and in abstract decision games played in the real world.
Engineer friends often ask me: Graph Deep Learning sounds great, but are there any big commercial success stories? Is it being deployed in practical applications? Besides the obvious ones–recommendation systems at Pinterest, Alibaba and Twitter–a slightly nuanced success story is the Transformer architecture, which has taken the NLP industry by storm. Through this post, I want to establish links between Graph Neural Networks (GNNs) and Transformers. I’ll talk about the intuitions behind model architectures in the NLP and GNN communities, make connections using equations and figures, and discuss how we could work together to drive progress.
Visualization of graph data is incredibly challenging, particularly when it comes to extremely large, scale-free graphs and social networks. A few simple searches on the Web and you will find some mesmerizing and very cool images. Perhaps the most cited...
Web spam pages use various techniques to achieve
higher-than-deserved rankings in a search engine’s
results. While human experts can identify
spam, it is too expensive to manually evaluate a
large number of pages. Instead, we propose techniques
to semi-automatically separate reputable,
good pages from spam. We first select a small set
of seed pages to be evaluated by an expert. Once
we manually identify the reputable seed pages, we
use the link structure of the web to discover other
pages that are likely to be good. In this paper
we discuss possible ways to implement the seed
selection and the discovery of good pages. We
present results of experiments run on the World
Wide Web indexed by AltaVista and evaluate the
performance of our techniques. Our results show
that we can effectively filter out spam from a significant
fraction of the web, based on a good seed
set of less than 200 sites.
Bebo is the next generation social networking site where members can stay in touch with their College friends, connect with friends, share photos, discover new interests and just hang out.
Gephi is an open-source software for visualizing and analyzing large networks graphs. Gephi uses a 3D render engine to display graphs in real-time and speed up the exploration. Use Gephi to explore, analyse, spatialise, filter, cluterize, manipulate and export all types of graphs.