Welcome to DiSC 2003
SIGMOD 2002
PODS 2002
 SIGMOD RECORD 2002
 ADBIS 2002
CIKM 2002
CoopIS 2002
 EDBT 2002
 ER 2002
Data Engineering Bul
DEXA_EC-WEB 2002
DMKD 2002
 DPDJ 2002
HYPERTEXT 2002
ICDE 2002
ICDM 2002
JCDL 2002
KDD 2002
 KDD_EXPLORATIONS 20
KRDB 2002
MDM 2002
MIS 2002
RIDE 2002
SBBD 2002
 SIGIR 2002
 SIGIR FORUM 2002
SSDBM 2002
TODS 2002
TIME 2002
VLDB 2002
VLDBJ 2002
About DiSC 2003
Editorial Board
Acknowledgements
DiSC 2003 Production
ADVIS
DiSC'03 Feedback
DiSC'03 Sitemap
Search DiSC'03
<<<Author Index>>>
Copyright Notice

Charles Elkan

Papers on DiSC'03


Alternatives to the k-means algorithm that find better clusterings

Transforming classifier scores into accurate multiclass probability estimates

Publications


Note: Links lead to the DBLP on the Web.

Charles Elkan

35 Greg Hamerly , Charles Elkan: Alternatives to the k-means algorithm that find better clusterings. CIKM 2002 : 600-607

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

33 Charles Elkan: Shared challenges in data mining and computational biology (abstract of invited talk). BIOKDD 2001 : 44

32 Greg Hamerly , Charles Elkan: Bayesian approaches to failure prediction for disk drives. ICML 2001 : 202-209

31 Bianca Zadrozny , Charles Elkan: Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. ICML 2001 : 609-616

30 Charles Elkan: The Foundations of Cost-Sensitive Learning. IJCAI 2001 : 973-978

29 Bianca Zadrozny , Charles Elkan: Learning and making decisions when costs and probabilities are both unknown. KDD 2001 : 204-213

28 Charles Elkan: Magical thinking in data mining: lessons from CoIL challenge 2000. KDD 2001 : 426-431

27 Charles Elkan: Results of the KDD'99 Classifier Learning. SIGKDD Explorations 1 (2): 63-64 (2000)

26 Charles Elkan: KDD'99 Knowledge Discovery Contest. SIGKDD Explorations 1 (2): 78 (2000)

25 Fredrik Farnstrom , James Lewis , Charles Elkan: Scalability for Clustering Algorithms Revisited. SIGKDD Explorations 2 (1): 51-57 (2000)

24 Timothy L. Bailey , Michael E. Baker , Charles Elkan, William Noble Grundy : MEME, MAST, and Meta-MEME: New Tools for Motif Discovery in Protein Sequences. Pattern Discovery in Biomolecular Data 1999 : 30-54

23 Alvaro E. Monge , Charles Elkan: An Efficient Domain-Independent Algorithm for Detecting Approximately Duplicate Database Records. DMKD 1997 : 0-

22 William Noble Grundy , Timothy L. Bailey , Charles Elkan, Michael E. Baker : Meta-MEME: motif-based hidden Markov models of protein families. Computer Applications in the Biosciences 13 (4): 397-406 (1997)

21 Karan Bhatia , Charles Elkan: LPMEME: A Statistical Method for Inductive Logic Programming. Canadian Conference on AI 1996 : 227-239

20 Charles Elkan: Reasoning about Unknown, Counterfactual, and Nondeterministic Actions in First-Order Logic. Canadian Conference on AI 1996 : 54-68

19 Alvaro E. Monge , Charles Elkan: The Field Matching Problem: Algorithms and Applications. KDD 1996 : 267-270

18 Alberto Maria Segre , Geoffrey J. Gordon , Charles Elkan: Exploratory Analysis of Speedup Learning Data Using Epectation Maximization. Artificial Intelligence 85 (1-2): 301-319 (1996)

17 William Noble Grundy , Timothy L. Bailey , Charles Elkan: ParaMEME: a parallel implementation and a web interface for a DNA and protein motif discovery tool. Computer Applications in the Biosciences 12 (4): 303-310 (1996)

16 Timothy L. Bailey , Charles Elkan: The Value of Prior Knowledge in Discovering Motifs with MEME. ISMB 1995 : 21-29

15 Timothy L. Bailey , Charles Elkan: Unsupervised Learning of Multiple Motifs in Biopolymers Using Expectation Maximization. Machine Learning 21 (1-2): 51-80 (1995)

14 Timothy L. Bailey , Charles Elkan: Fitting a Mixture Model By Expectation Maximization To Discover Motifs In Biopolymer. ISMB 1994 : 28-36

13 Alberto Maria Segre , Charles Elkan: A High-Performance Explanation-Based Learning Algorithm. Artificial Intelligence 69 (1-2): 1-50 (1994)

12 Charles Elkan: The Paradoxical Success of Fuzzy Logic. AAAI 1993 : 698-703

11 Timothy L. Bailey , Charles Elkan: Estimating the Accuracy of Learned Concepts. IJCAI 1993 : 895-901

10 Charles Elkan, Russell Greiner : D. B. Lenat and R. V. Guha, Building Large Knowledge-Based Systems: Representation and Inference in the Cyc Project. Artificial Intelligence 61 (1): 41-52 (1993)

9 Russell Greiner , Charles Elkan: Measuring and Improving the Effectiveness of Representations. IJCAI 1991 : 518-524

8 Alberto Maria Segre , Charles Elkan, Alexander Russell : A Critical Look at Experimental Evaluations of EBL. Machine Learning 6 : 183-195 (1991)

7 Charles Elkan: Incremental, Approximate Planning. AAAI 1990 : 145-150

6 Charles Elkan: Independence of Logic Database Queries and Updates. PODS 1990 : 154-160

5 Charles Elkan: A Rational Reconstruction of Nonmonotonic Truth Maintenance Systems. Artificial Intelligence 43 (2): 219-234 (1990)

4 Charles Elkan: Conspiracy Numbers and Caching for Searching And/Or Trees and Theorem-Proving. IJCAI 1989 : 341-348

3 Charles Elkan: Logical Characterizations of Nonmonotonic TMSs. MFCS 1989 : 218-224

2 Charles Elkan: A Decision Procedure for Conjunctive Query Disjointness. PODS 1989 : 134-139

1 Charles Elkan, David A. McAllester : Automated Inductive Reasoning about Logic Programs. ICLP/SLP 1988 : 876-892




DiSC'03 © 2003 Association for Computing Machinery