Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Samantha Lam

dblp:77/9924 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Databases, data management, data science and information retrieval · 2Human-computer interaction and ubiquitous computing · 2Graphics, computer vision, multimedia, augmented reality and games · 1Applied, interdisciplinary, general and emerging computing · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 67% Web and social media mining · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › structured data mining › graph mining › network structure analysis
blockmodeling
0.112011
Increasing the Scalability of the Fitting of Generalised Block Models for Social Networks · IJCAI 2011
Data mining › structured data mining
graph mining
0.112011
Increasing the Scalability of the Fitting of Generalised Block Models for Social Networks · IJCAI 2011
Web and social media mining
social network analysis
0.112011
Increasing the Scalability of the Fitting of Generalised Block Models for Social Networks · IJCAI 2011

Methods — techniques the papers use, named apart from their topics

simulated annealing · 0.1genetic algorithm · 0.1
YearPublicationVenuePosition
2012 Towards Maximising Cross-Community Information Diffusion
abstract
In recent years, companies have started to utilise online social communities as a means of communicating with and targeting their employees and customers, and such online communities include discussion fora. The conversational dynamics of users in fora can influence their neighbours in the underlying social network. We make use of such influence to target specific communities with information, i.e. post in them, because a post is generally shared with the community and not just with individual users. In short, we study information diffusion across communities and show that we can achieve high community (and user) spread using an efficient targeting strategy. In order to achieve this, we use a set of novel measures for cross-community influence and show that it outperforms other targeting strategies on two different data-sets: the largest Irish online discussion system, Boards.ie, and technical support fora, SAP SCN.
Václav Belák, Samantha Lam, Conor Hayes
ASONAM2
2012 Cross-Community Influence in Discussion Fora
Václav Belák, Samantha Lam, Conor Hayes
ICWSM2
2011 Increasing the Scalability of the Fitting of Generalised Block Models for Social Networks
abstract
In recent years, the summarisation and decomposition of social networks has become increasingly popular, from community finding to role equivalence. However, these approaches concentrate on one type of model only. Generalised blockmodelling decomposes a network into independent, interpretable, labeled blocks, where the block labels summarise the relationship between two sets of users. Existing algorithms for fitting generalised blockmodels do not scale beyond networks of 100 vertices. In this paper, we introduce two new algorithms, one based on genetic algorithms and the other on simulated annealing, that is at least two orders of magnitude faster than existing algorithms and obtaining similar accuracy. Using synthetic and real datasets, we demonstrate their efficiency and accuracy and show how generalised blockmodelling and our new approaches enable tractable network summarisation and modelling of medium sized networks. 1
Jeffrey Chan, Samantha Lam, Conor Hayes
IJCAI2