The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Clifford Brunk: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Michael J. Pazzani, Clifford Brunk, Glenn Silverstein
    A Knowledge-intensive Approach to Learning Relational Concepts. [Citation Graph (1, 0)][DBLP]
    ML, 1991, pp:432-436 [Conf]
  2. Michael J. Pazzani, Clifford Brunk
    Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning. [Citation Graph (0, 0)][DBLP]
    AAAI, 1993, pp:328-334 [Conf]
  3. Jeffrey P. Bradford, Clayton Kunz, Ron Kohavi, Clifford Brunk, Carla E. Brodley
    Pruning Decision Trees with Misclassification Costs. [Citation Graph (0, 0)][DBLP]
    ECML, 1998, pp:131-136 [Conf]
  4. Clifford Brunk, Michael J. Pazzani
    An Investigation of Noise-Tolerant Relational Concept Learning Algorithms. [Citation Graph (0, 0)][DBLP]
    ML, 1991, pp:389-393 [Conf]
  5. Clifford Brunk, Michael J. Pazzani
    A Lexical Based Semantic Bias for Theory Revision. [Citation Graph (0, 0)][DBLP]
    ICML, 1995, pp:81-89 [Conf]
  6. Michael J. Pazzani, Christopher J. Merz, Patrick M. Murphy, Kamal Ali, Timothy Hume, Clifford Brunk
    Reducing Misclassification Costs. [Citation Graph (0, 0)][DBLP]
    ICML, 1994, pp:217-225 [Conf]
  7. Kamal Ali, Clifford Brunk, Michael J. Pazzani
    On Learning Multiple Descriptions of a Concept. [Citation Graph (0, 0)][DBLP]
    ICTAI, 1994, pp:476-483 [Conf]
  8. Clifford Brunk, James Kelly, Ron Kohavi
    MineSet: An Integrated System for Data Mining. [Citation Graph (0, 0)][DBLP]
    KDD, 1997, pp:135-138 [Conf]
  9. Giovanni Semeraro, Floriana Esposito, Donato Malerba, Clifford Brunk, Michael J. Pazzani
    Avoiding Non-Termination when Learning Logical Programs: A Case Study with FOIL and FOCL. [Citation Graph (0, 0)][DBLP]
    LOPSTR, 1994, pp:183-198 [Conf]
  10. Daniel Billsus, Clifford Brunk, Craig Evans, Brian Gladish, Michael J. Pazzani
    Adaptive interfaces for ubiquitous web access. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 2002, v:45, n:5, pp:34-38 [Journal]

Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002