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

Jan-Hendrik Zab

dblp:183/0577 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · none

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

Databases, data management, data science and information retrieval · 2Artificial intelligence and machine learning · 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.

Artificial intelligence
1 paper
Efficient and distributed learning · 67% Representation and self-supervised learning · 33%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 77% Data mining · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › distributed training
asynchronous training
0.412019
Asynchronous Training of Word Embeddings for Large Text Corpora · WSDM 2019
Machine learning › Efficient and distributed learning
distributed training
0.412019
Asynchronous Training of Word Embeddings for Large Text Corpora · WSDM 2019
Machine learning › Representation and self-supervised learning › word representation
word embedding
0.412019
Asynchronous Training of Word Embeddings for Large Text Corpora · WSDM 2019
Web and social media mining
social network extraction
0.212016
Cobwebs from the Past and Present: Extracting Large Social Networks using Internet Archive Data · SIGIR 2016
Data mining › network analysis
temporal network analysis
0.112016
Cobwebs from the Past and Present: Extracting Large Social Networks using Internet Archive Data · SIGIR 2016

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

parameter partitioning · 0.4model merging · 0.4web page extraction · 0.2social relation extraction · 0.2
YearPublicationVenuePosition
2019 Asynchronous Training of Word Embeddings for Large Text Corpora
abstract
Word embeddings are a powerful approach for analyzing language and have been widely popular in numerous tasks in information retrieval and text mining. Training embeddings over huge corpora is computationally expensive because the input is typically sequentially processed and parameters are synchronously updated. Distributed architectures for asynchronous training that have been proposed either focus on scaling vocabulary sizes and dimensionality or suffer from expensive synchronization latencies. In this paper, we propose a scalable approach to train word embeddings by partitioning the input space instead in order to scale to massive text corpora while not sacrificing the performance of the embeddings. Our training procedure does not involve any parameter synchronization except a final sub-model merge phase that typically executes in a few minutes. Our distributed training scales seamlessly to large corpus sizes and we get comparable and sometimes even up to 45% performance improvement in a variety of NLP benchmarks using models trained by our distributed procedure which requires $1/10$ of the time taken by the baseline approach. Finally we also show that we are robust to missing words in sub-models and are able to effectively reconstruct word representations.
Avishek Anand, Megha Khosla, Jan-Hendrik Zab, Zijian Zhang 0006
WSDM4
2016 Cobwebs from the Past and Present: Extracting Large Social Networks using Internet Archive Data
abstract
Social graph construction from various sources has been of interest to researchers due to its application potential and the broad range of technical challenges involved. The World Wide Web provides a huge amount of continuously updated data and information on a wide range of topics created by a variety of content providers, and makes the study of extracted people networks and their temporal evolution valuable for social as well as computer scientists. In this paper we present SocGraph - an extraction and exploration system for social relations from the content of around 2 billion web pages collected by the Internet Archive over the 17 years time period between 1996 and 2013. We describe methods for constructing large social graphs from extracted relations and introduce an interface to study their temporal evolution.
Miroslav Shaltev, Jan-Hendrik Zab, Philipp Kemkes, Stefan Siersdorfer, Sergej Zerr
SIGIR2