Demo Data from EDBT 2026 / reviewers in the wild / expert
Andrew Arnt
dblp:58/4618
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 2004
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 3 first-authorArtificial intelligence and machine learning · 2 · 2 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.
| Databases, data mining, and information retrieval
1 paper |
Data mining · 100% | |
| Theoretical computer science
1 paper |
Mathematical optimization · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › predictive modeling
classification |
0.0 | 1 | 2004 | Attribute Measurement Policies for Time and Cost Sensitive Classification · ICDM 2004 |
Data mining › predictive modeling › classification › cost-sensitive learning
cost-sensitive classification |
0.0 | 1 | 2004 | Attribute Measurement Policies for Time and Cost Sensitive Classification · ICDM 2004 |
Mathematical optimization › sequential decision making
markov decision processes |
0.0 | 1 | 2004 | Attribute Measurement Policies for Time and Cost Sensitive Classification · ICDM 2004 |
Mathematical optimization
sequential decision making |
0.0 | 1 | 2004 | Attribute Measurement Policies for Time and Cost Sensitive Classification · ICDM 2004 |
Methods — techniques the papers use, named apart from their topics
markov decision process · 0.1AO* heuristic search · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2004 | Attribute Measurement Policies for Time and Cost Sensitive ClassificationabstractAttribute measurement is an important component of classification algorithms, which could limit their applicability in realtime settings. The time taken to assign a value to an unknown attribute may reduce the overall utility of the final result. We identify three different costs that must be considered, including a time sensitive utility function. We model this attribute measurement problem as a Markov decision process (MDP), and build a policy to control this process using AO* heuristic search. The results offer a cost-effective approach to attribute measurement and classification for a variety of realtime applications. Andrew Arnt, Shlomo Zilberstein |
ICDM | 1 |
| 2004 | Dynamic Composition of Information Retrieval Techniques
Andrew Arnt, Shlomo Zilberstein, James Allan 0001, Abdel-Illah Mouaddib |
J. Intell. Inf. Syst. | 1 |
| 2003 | Learning to Perform Moderation in Online ForumsabstractOnline discussion forums are a valuable resource for people looking to find information, discuss ideas, and get advice on the Internet. Unfortunately, many forums have too much activity and information available, resulting in information overload. Moderation systems are implemented in some forums as a way to handle this problem, but due to sparsity issues, they are often not sufficient. We describe a novel method for learning from past moderations to develop a classifier that can perform automated moderation and thus address the sparsity problem. Additionally, we discuss the possibility of training a moderating classifier on a moderated forum and then applying it to an otherwise unmoderated forum. Andrew Arnt, Shlomo Zilberstein |
Web Intelligence | 1 |