Demo Data from EDBT 2026 / reviewers in the wild / expert
Bahareh Azarnoush
dblp:224/1157
· DBLP profile ↗
3ranked-venue papers
0as first author
1since 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 · 1 since 2021Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 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 |
Machine translation · 50% Language models and text generation · 50% | |
| Databases, data mining, and information retrieval
2 papers |
Data mining · 100% |
Topics — the 7 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Machine translation › monolingual data augmentation
back-translation |
0.4 | 1 | 2020 | Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020 |
Natural language and speech › Machine translation
low-resource machine translation |
0.4 | 1 | 2020 | Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020 |
Natural language and speech › Language models and text generation › text generation
paraphrase generation |
0.4 | 1 | 2020 | Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020 |
Natural language and speech › Language models and text generation › text generation › text simplification
sentence simplification |
0.4 | 1 | 2020 | Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020 |
Data mining
clustering |
0.3 | 1 | 2018 | CRAFTER: A Tree-Ensemble Clustering Algorithm for Static Datasets with Mixed Attributes and High Dimensionality · IEEE Trans. Knowl. Data Eng. 2018 |
Natural language and speech › Language models and text generation › text evaluation
human evaluation |
0.1 | 1 | 2020 | Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020 |
Natural language and speech › Machine translation
machine translation evaluation |
0.1 | 1 | 2020 | Simplify-Then-Translate: Automatic Preprocessing for Black-Box Translation · AAAI 2020 |
Methods — techniques the papers use, named apart from their topics
regression tree · 0.5gradient boosting · 0.5sequence-to-sequence paraphrase model · 0.4back-translation · 0.4tree ensemble · 0.3class probability estimation · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2021 | MTBR: Multi-Target Boosting for RegressionabstractGradient boosting method has been successfully used for single target prediction problems. In real world applications, however, problems involving the prediction of multiple target attributes are often of interest. In this paper, a multi-target boosting method for regression problems, named as MTBR, is proposed. Although MTBR builds one model for each target attribute separately, all the target attributes are utilized when building each model. In each boosting iteration, the base learner, the regression tree in particular, is learned by selecting the best models from all the target attributes. We also introduce a novel knowledge transfer approach. That is, the tree structure learned from one target attribute, representing a way to partition the feature space, is used to predict another target attribute. Experiments with six data sets compare MTBR to other ensemble regression methods, and prove the effectiveness of MTBR in leveraging the knowledge of multiple target attributes and improving the model accuracy. Sangdi Lin, Bahareh Azarnoush, George C. Runger |
IEEE Trans. Knowl. Data Eng. | 2 |
| 2020 | Simplify-Then-Translate: Automatic Preprocessing for Black-Box TranslationabstractBlack-box machine translation systems have proven incredibly useful for a variety of applications yet by design are hard to adapt, tune to a specific domain, or build on top of. In this work, we introduce a method to improve such systems via automatic pre-processing (APP) using sentence simplification. We first propose a method to automatically generate a large in-domain paraphrase corpus through back-translation with a black-box MT system, which is used to train a paraphrase model that “simplifies” the original sentence to be more conducive for translation. The model is used to preprocess source sentences of multiple low-resource language pairs. We show that this preprocessing leads to better translation performance as compared to non-preprocessed source sentences. We further perform side-by-side human evaluation to verify that translations of the simplified sentences are better than the original ones. Finally, we provide some guidance on recommended language pairs for generating the simplification model corpora by investigating the relationship between ease of translation of a language pair (as measured by BLEU) and quality of the resulting simplification model from back-translations of this language pair (as measured by SARI), and tie this into the downstream task of low-resource translation. Sneha Mehta, Bahareh Azarnoush, Boris Chen, Avneesh Saluja, Vinith Misra, Ballav Bihani, Ritwik Kumar |
AAAI | 2 |
| 2018 | CRAFTER: A Tree-Ensemble Clustering Algorithm for Static Datasets with Mixed Attributes and High DimensionalityabstractClustering is an important aspect of data mining, while clustering high-dimensional mixed-attribute data in a scalable fashion still remains a challenging problem. In this paper, we propose a tree-ensemble clustering algorithm for static datasets, CRAFTER, to tackle this problem. CRAFTER is able to handle categorical and numeric attributes simultaneously, and scales well with the dimensionality and the size of datasets. CRAFTER leverages the advantages of a tree-ensemble to handle mixed attributes and high dimensionality. The concept of the class probability estimates is utilized to identify the representative data points for clustering. Through a series of experiments on both synthetic and real datasets, we have demonstrated that CRAFTER is superior than Random Forest Clustering (RFC), an existing tree-based clustering method, in terms of both the clustering quality and the computational cost. Sangdi Lin, Bahareh Azarnoush, George C. Runger |
IEEE Trans. Knowl. Data Eng. | 2 |