Andreas L. Prodromidis

Algorithms & Complexity · 1997–2000

A researcher in the Science corpus: 2 papers; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

• Algorithms & Complexity — 5 citations into it

Whom Andreas L. Prodromidis trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. William W. Cohen
2. Rakesh Agrawal
3. David Hilton Wolpert

Papers from Andreas L. Prodromidis's perspective

Ordered by how strongly the researchers Andreas L. Prodromidis trusts endorse each paper. Same corpus, a different order for every researcher.

1. Improved Boosting Algorithms Using Confidence-rated Predictions
2. Fast Algorithms for Mining Association Rules
3. Fast Effective Rule Induction
4. Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm
5. Classification and Regression Trees
6. Mining association rules between sets of items in large databases
7. Original Contribution: Stacked generalization
8. Adam: A Method for Stochastic Optimization (International Conference on Learning Representations)
9. Adaptive Subgradient Methods for Online Learning and Stochastic Optimization
10. Gradient-based learning applied to document recognition

Their papers

• Cost-based modeling for fraud and intrusion detection: results from the JAM project (2000) — 703 citations
• Credit Card Fraud Detection Using Meta-Learning: Issues and Initial Results 1 (1997)