See this document in CiteSeerX!

A Framework for Inductive Learning Based on Subsumption Lattices (1998)  (Make Corrections)  (1 citation)
Zdravko Markov, Nikolay Pelov
Lecture Notes in Computer Science



  Home/Search   Context   Related

 
View or download:
ccsu.edu/~markov/aimsa98.ps


From:  ctstateu.edu/~markov/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In the present paper we propose an approach to inductive machine learning based on a consistent integration of the generalizationbased (such as inductive learning from examples) and metric-based (such as agglomerative clustering) approaches. The approach stems from the natural idea (formally studied within the lattice theory) to estimate the similarity between two objects in a hierarchical structure by the distances to their closest common parent. The hierarchies used are the subsumption ... (Update)

Similar documents based on text:   More   All
0.9:   An Algebraic Approach to Inductive Learning - Markov (2000)   (Correct)
0.6:   lambda-Subsumption and Its Application to Learning from.. - Markov   (Correct)
0.6:   Generalization under Implication by lambda-Subsumption - Markov   (Correct)

BibTeX entry:   (Update)

Z. Markov and N. Pelov, A framework for inductive learning based on subsumption lattices, Proceedings of AIMSA'98, ed. F. Guinchiglia, Lecture Notes in Artificial Intelligence 1480, Springer (1998) 341--352. http://citeseer.ist.psu.edu/markov98framework.html   More

@article{ markov98framework,
    author = "Zdravko Markov and Nikolay Pelov",
    title = "A Framework for Inductive Learning Based on Subsumption Lattices",
    journal = "Lecture Notes in Computer Science",
    volume = "1480",
    pages = "341--??",
    year = "1998",
    url = "citeseer.ist.psu.edu/markov98framework.html" }
Citations (may not include all citations):
503   Instance-based learning algorithms (context) - Aha, Kibler et al. - 1991
328   Algorithmic program debugging (context) - Shapiro - 1983
274   Generalization as search (context) - Mitchell - 1982
267   A note on inductive generalization (context) - Plotkin - 1970
153   AutoClass: a Bayesian classification system (context) - Cheeseman, Kelly et al. - 1988
139   Learning from observation: conceptual clustering (context) - Michalski, Stepp - 1983
105   The MONK's problems - a performance comparison of different .. - Thrun - 1991
103   Model of incremental concept formation (context) - Gennari, Langley et al. - 1990
63   Transformational systems and the algebraic structure of atom.. (context) - Reynolds - 1970
58   Learning by being told and learning from examples: An experi.. (context) - Michalski, Chilausky - 1980
17   Metrics on terms and clauses (context) - Hutchinson - 1997
11   Complexity-based induction - Conklin, Witten - 1994
5   Empirically conservative search space reduction (context) - Champesme, Br'ezellec et al. - 1995
5   An Analysis of Refinement Operators in Inductive Logic Progr.. (context) - van der Laag - 1995
5   Metrics on partially ordered sets -- a survey (context) - Monjardet - 1981

[Article contains additional citations not shown here]

Documents on the same site (http://www.cs.ccsu.ctstateu.edu/~markov/):   More
An Algebraic Approach to Inductive Learning - Markov (2000)   (Correct)
Coverage-based semi-distance between Horn clauses - Markov, Marinchev (2000)   (Correct)
An Algebraic Approach To Inductive Learning - Markov (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC