EDBT 2026 Demo / reviewers in the wild / expert
Janara M. Christensen
dblp:71/105
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2007
—ORCID · none
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 · 100% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › predictive modeling
classification |
0.1 | 1 | 2007 | Supervised Learning by Training on Aggregate Outputs · ICDM 2007 |
Data mining › predictive modeling
supervised learning |
0.1 | 1 | 2007 | Supervised Learning by Training on Aggregate Outputs · ICDM 2007 |
Privacy and data protection
privacy-preserving data analysis |
0.0 | 1 | 2007 | Supervised Learning by Training on Aggregate Outputs · ICDM 2007 |
Methods — techniques the papers use, named apart from their topics
support vector machine · 0.1neural network · 0.1k-nearest neighbors · 0.1k-nearest neighbor · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2007 | Supervised Learning by Training on Aggregate OutputsabstractSupervised learning is a classic data mining problem where one wishes to be be able to predict an output value associated with a particular input vector. We present a new twist on this classic problem where, instead of having the training set contain an individual output value for each input vector, the output values in the training set are only given in aggregate over a number of input vectors. This new problem arose from a particular need in learning on mass spectrometry data, but could easily apply to situations when data has been aggregated in order to maintain privacy. We provide a formal description of this new problem for both classification and regression. We then examine how k-nearest neighbor, neural networks, and support vector machines can be adapted for this problem. David R. Musicant, Janara M. Christensen, Jamie F. Olson |
ICDM | 2 |