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

Bingyang Huang

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

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

Databases, data management, data science and information retrieval · 2 · 2 since 2021

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 · 77% Web and social media mining · 23%

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

TopicWeightPapersLastEvidence papers
Data mining › structured data mining › graph mining
graph generation
0.512021
FastSGG: Efficient Social Graph Generation Using a Degree Distribution Generation Model · ICDE 2021
Web and social media mining
social network analysis
0.112021
FastSGG: Efficient Social Graph Generation Using a Degree Distribution Generation Model · ICDE 2021

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

degree distribution generation · 0.5
YearPublicationVenuePosition
2021 UniTest: A Universal Testing Framework for Database Management Systems
Gengyuan Shi, Chaokun Wang, Bingyang Huang, Hao Feng 0007
DASFAA (1)3
2021 FastSGG: Efficient Social Graph Generation Using a Degree Distribution Generation Model
abstract
With the popularity of social networks, large-scale social graphs are necessary to evaluate the algorithms for various social network analysis tasks, especially in the era of big data. An efficient and configurable social graph generator has become more important than ever before because it is difficult to obtain billion-scale real-world social graphs for various scenarios.In this paper, we present an efficient and widely-applicable social graph generator called FastSGG. FastSGG generates social graphs according to a user-defined configuration depicting the features of the target social graph, which is a flexible way to generate graphs in a variety of applications. The generation method consists of two main steps: the determination of out-degree for a source vertex and the determination of a target vertex to construct an edge. In order to accelerate the graph generation process, a degree distribution generation (D2G) model is proposed. The D2G model is a universal model for generating graphs following different degree distributions as long as the probability density functions or probability mass functions are given. The extensive experimental results demonstrate that FastSGG can generate high-quality social graphs with small world properties, power-law degree distributions, and community structures. Moreover, FastSGG generates graphs at least four times faster than the state-of-the-art graph generators. In addition, the peak memory usage of FastSGG is less than one seventh of that of the state-of-the-art method.
Chaokun Wang, Bingyang Huang, Shaoxu Song, Zai Li
ICDE3