Demo Data from EDBT 2026 / reviewers in the wild / expert
Yiou Xiao
dblp:146/4008
· DBLP profile ↗
4ranked-venue papers
3as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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 |
Graph learning · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Web and social media mining · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Graph learning › graph representation learning
edge representation learning |
0.4 | 1 | 2020 | Relation Learning on Social Networks with Multi-Modal Graph Edge Variational Autoencoders · WSDM 2020 |
Machine learning › Graph learning
graph representation learning |
0.4 | 1 | 2020 | Relation Learning on Social Networks with Multi-Modal Graph Edge Variational Autoencoders · WSDM 2020 |
Web and social media mining
social network analysis |
0.4 | 1 | 2020 | Relation Learning on Social Networks with Multi-Modal Graph Edge Variational Autoencoders · WSDM 2020 |
Methods — techniques the papers use, named apart from their topics
variational autoencoder · 0.9multimodal learning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | Relation Learning on Social Networks with Multi-Modal Graph Edge Variational AutoencodersabstractWhile node semantics have been extensively explored in social networks, little research attention has been paid to pro le edge semantics, i.e., social relations. Ideal edge semantics should not only show that two users are connected, but also why they know each other and what they share in common. However, relations in social networks are often hard to pro le, due to noisy multi-modal signals and limited user-generated ground-truth labels. Carl Yang 0001, Jieyu Zhang 0001, Myunghwan Kim 0002, Matt Walker, Yiou Xiao, Jiawei Han 0001 |
WSDM | 7 |
| 2015 | Efficient Classification of Binary Data Stream with Concept Drifting Using Conjunction Rule Based Boolean Classifier
Yiou Xiao, Kishan G. Mehrotra, Chilukuri K. Mohan |
IEA/AIE | 1 |
| 2014 | A fast sorting algorithm for aptamer identification using deep sequencingabstractIn recent years, with the advent of fast sequencing technology, the genomic database is growing rapidly. Researchers in the bioinformatics field are expecting faster and more accurate tools to effectively analyze the gigantic data sets. In the context of aptamer search, the goal is to search for the over-represented DNA sequences from the randomly generated aptamer libraries. Hash functions are widely used in substring comparison, sequence alignment and clustering tools. We have developed a light-weight tool that takes advantage of the hash functions to reduce the size of genomic data and conducts η-neighbor searches on the centroid sequence. This greatly improves the efficiency of the search compared with existing tools. Furthermore, the prior calculation of hash values of η-neighbors decreases the searching overhead. In a dataset of 2.23 million sequences, the proposed algorithm accurately count the frequency of the Human α-Thrombin aptamer sequences in less than 40 seconds, whereas the current script-based method takes 2 hours and 18 minutes. Yiou Xiao, Kishan G. Mehrotra, Damian G. Allis, Phillip N. Borer |
ASONAM | 1 |
| 2013 | Utilizing cis-elements to refine gene regulatory networksabstractGene regulatory networks (GRNs) describe epistatic relationship of genes and how the expression of some genes influence the expression of other genes. This information is critical for understanding molecular mechanisms regulating various biological processes and molecular basis of several diseases. Current research work mostly attempts to infer such regulatory relationships (and GRN architecture topology) from gene expression data. This paper improves on this methodology by utilizing additional information available that describes which cis-elements are present in which genes, and at what locations. Using the underlying principle that target genes of a transcription factor should share the same binding site in their promoter regions, we propose a scoring method that facilitates the refinement of a candidate GRN. Improvements are demonstrated with three data sets, on which GRNs are first obtained from existing dataset (AtRegNet) or using an existing approach (ARACNe), and then modified using cis-element information. Yiou Xiao, Kishan G. Mehrotra, Chilukuri K. Mohan, Ramesh Raina |
BIBM | 1 |