Demo Data from EDBT 2026 / reviewers in the wild / expert
Pavel Sidorov
dblp:98/10767
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2019
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 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.
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Bioinformatics and computational biology › molecular informatics › molecular modeling › molecular docking
machine learning scoring function |
0.4 | 1 | 2019 | Classical scoring functions for docking are unable to exploit large volumes of structural and interaction data · Bioinform. 2019 |
Bioinformatics and computational biology › molecular informatics › molecular modeling
molecular docking |
0.4 | 1 | 2019 | Classical scoring functions for docking are unable to exploit large volumes of structural and interaction data · Bioinform. 2019 |
Bioinformatics and computational biology › molecular informatics › molecular modeling
scoring function |
0.4 | 1 | 2019 | Classical scoring functions for docking are unable to exploit large volumes of structural and interaction data · Bioinform. 2019 |
Methods — techniques the papers use, named apart from their topics
similarity metrics · 0.4random forest · 0.4extreme gradient boosting · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2019 | Classical scoring functions for docking are unable to exploit large volumes of structural and interaction dataabstractMOTIVATION: Studies have shown that the accuracy of random forest (RF)-based scoring functions (SFs), such as RF-Score-v3, increases with more training samples, whereas that of classical SFs, such as X-Score, does not. Nevertheless, the impact of the similarity between training and test samples on this matter has not been studied in a systematic manner. It is therefore unclear how these SFs would perform when only trained on protein-ligand complexes that are highly dissimilar or highly similar to the test set. It is also unclear whether SFs based on machine learning algorithms other than RF can also improve accuracy with increasing training set size and to what extent they learn from dissimilar or similar training complexes. RESULTS: We present a systematic study to investigate how the accuracy of classical and machine-learning SFs varies with protein-ligand complex similarities between training and test sets. We considered three types of similarity metrics, based on the comparison of either protein structures, protein sequences or ligand structures. Regardless of the similarity metric, we found that incorporating a larger proportion of similar complexes to the training set did not make classical SFs more accurate. In contrast, RF-Score-v3 was able to outperform X-Score even when trained on just 32% of the most dissimilar complexes, showing that its superior performance owes considerably to learning from dissimilar training complexes to those in the test set. In addition, we generated the first SF employing Extreme Gradient Boosting (XGBoost), XGB-Score, and observed that it also improves with training set size while outperforming the rest of SFs. Given the continuous growth of training datasets, the development of machine-learning SFs has become very appealing. AVAILABILITY AND IMPLEMENTATION: https://github.com/HongjianLi/MLSF. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Jiangjun Peng, Pavel Sidorov, Yee Leung, Kwong-Sak Leung, Man Hon Wong 0001, Pedro J. Ballester |
Bioinform. | 3 |
| 2011 | Project or Process? How to Measure the Real Type of Employees' Activity?abstractBy analyzing the logs of corporate e-mail networks we found a number of patterns, showing how the size of ego-networks of individual employees changes on a day by day basis. We proposed a simple model that adequately describes the observed time dependence of an employee's "social circle". Comparison of experimental data with the theoretical model showed that employees are divided into two groups - with fast and slow changes in their social circles, respectively. We believe that the presence of these groups reflects both project-type and process-type of employees' activities. Comparison of data obtained before and during the global economic crisis has shown that the crisis led to an actual reduction in project-type activities. Dmitry Romanov, Pavel Sidorov |
DASC | 2 |