Charles P. Elkan

Charles P. Elkan is a person.

• See: Monge-Elkan Distance Function.

---

---

References

• DBLP Author Page: http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/e/Elkan:Charles.html

2011

• (Menon & Elkan, 2011) ⇒ Aditya Krishna Menon, and Charles Elkan. (2011). “Link Prediction via Matrix Factorization.” In: Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases.

2008

• (Elkan & Noto, 2008) ⇒ Charles P. Elkan, and Keith Noto. (2008). “Learning classifiers from only positive and unlabeled data.” In: KDD-2008.
• (Elkan, 2008) ⇒ Charles P. Elkan. (2008). “Log-linear models and conditional random fields." Notes for a tutorial at CIKM-2008 (CIKM 2008).

2007

• Andrew T. Smith, Charles P. Elkan: Making generative classifiers robust to selection bias. KDD 2007:657-666

2004

• Andrew T. Smith, Charles P. Elkan: A Bayesian network framework for reject inference. KDD 2004:286-295

2002

• Bianca Zadrozny, Charles P. Elkan: Transforming classifier scores into accurate multiclass probability estimates. KDD 2002:694-699

2001

• Bianca Zadrozny, Charles P. Elkan: Learning and making decisions when costs and probabilities are both unknown. KDD 2001:204-213
• Charles Elkan: Magical thinking in data mining: lessons from CoIL challenge 2000. KDD 2001:426-431
• (Elkan, 2001) ⇒ Charles P. Elkan. (2001). “The foundations of cost-sensitive learning.” In: International joint conference on artificial intelligence (IJCAI 2001).

1996

• (Monge & Elkan, 1996) ⇒ Alvaro E. Monge, and Charles P. Elkan. (1996). “The Field Matching Problem: Algorithms and Applications.” In: Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD 1996).

1994

• (Bailey & Elkan, 1994) ⇒ Timothy L Bailey, and Charles P. Elkan. (1994). “Fitting a Mixture Model by Expectation Maximization to Discover Motifs in Bipolymers." In: Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology (ISMB 1994).

---