Demo Data from EDBT 2026 / reviewers in the wild / expert
Rachel Ostroff
dblp:132/9251
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Databases, data management, data science and information retrieval · 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 33% Recommender systems · 33% Machine learning and data management · 33% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Bioinformatics and computational biology · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › feature engineering
feature interaction discovery |
0.2 | 1 | 2014 | Factorized sparse learning models with interpretable high order feature interactions · KDD 2014 |
Recommender systems › click-through rate prediction › feature interaction learning
high-order feature interaction |
0.2 | 1 | 2014 | Factorized sparse learning models with interpretable high order feature interactions · KDD 2014 |
Machine learning and data management
sparse learning |
0.2 | 1 | 2014 | Factorized sparse learning models with interpretable high order feature interactions · KDD 2014 |
Bioinformatics and computational biology
biomarker discovery |
0.1 | 1 | 2014 | Factorized sparse learning models with interpretable high order feature interactions · KDD 2014 |
Methods — techniques the papers use, named apart from their topics
sparse learning · 0.4logistic regression · 0.4factorization · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Factorized sparse learning models with interpretable high order feature interactionsabstractIdentifying interpretable discriminative high-order feature interactions given limited training data in high dimensions is challenging in both machine learning and data mining. In this paper, we propose a factorization based sparse learning framework termed FHIM for identifying high-order feature interactions in linear and logistic regression models, and study several optimization methods for solving them. Unlike previous sparse learning methods, our model FHIM recovers both the main effects and the interaction terms accurately without imposing tree-structured hierarchical constraints. Furthermore, we show that FHIM has oracle properties when extended to generalized linear regression models with pairwise interactions. Experiments on simulated data show that FHIM outperforms the state-of-the-art sparse lear-ning techniques. Further experiments on our experimentally generated data from patient blood samples using a novel SOMAmer (Slow Off-rate Modified Aptamer) technology show that, FHIM performs blood-based cancer diagnosis and bio-marker discovery for Renal Cell Carcinoma much better than other competing methods, and it identifies interpretable block-wise high-order gene interactions predictive of cancer stages of samples. A literature survey shows that the interactions identified by FHIM play important roles in cancer development. Sanjay Purushotham, Martin Renqiang Min, C.-C. Jay Kuo, Rachel Ostroff |
KDD | 4 |