Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Learning Theory

ALT 2000: Algorithmic Learning Theory pp 166–178Cite as

Conceptual Classifications Guided by a Concept Hierarchy

  • Conference paper
  • First Online:

  • 433 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1968))

Abstract

Given a concept hierarchy and a set of instances of multiple concepts, we consider the revision problem that the primary concepts subsuming the instances are judged inadequate by a user. The basic strategy to resolve this conict is to utilize the information the hierarchy involves in order to classify the instance set and to form a set of several intermediate concepts. We refer to the strategy of this kind as hierarchy-guided classification. For this purpose, we make a condition, Similarity Independence Condition, that checks similarities between the hierarchy and the instances so that the similarities are invariant even when we generalize those instances to some concept at the middle. Based on the condition, we present an algorithm for classifying instances and for modifying the concept hierarchy.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Frazier & L. Pitt: CLASSIC Learning, Machine Learning, Vol. 25, No. 2-3, pp 151–193, 1996.

    Article  MATH  Google Scholar 

  2. W.W. Cohen & H. Hirsh: The Learnability of Description Logics with Equality Constraints, Machine Learning, Vol. 17, No. 2-3, pp 169–199, 1996.

    Article  Google Scholar 

  3. H. Arimura, T. Shinohara & S. Otsuki: Polynomial Time Algorithm for Finding Finite Unions of Two Tree Pattern Languages, LNAI 659, pp 118–131 Springer, 1993.

    Google Scholar 

  4. Y. Itoh: Knowledge Revision of Conceptual Hierarchy base on a Classification Master Thesis, Hokkaido University, 1999 (in Japanese).

    Google Scholar 

  5. T. Yamaguchi: A Legal Ontology Refinement Environment using a General Ontology, Proc. Workshop on Application of Logic Programming to Legal Reasoning, pp 176–185, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Electronics and Information Engineering, Hokkaido University, N-13 W-8, 060-8628, Kita-ku, Sapporo, JAPAN

    Yuhsuke Itoh & Makoto Haraguchi

Authors
  1. Yuhsuke Itoh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Makoto Haraguchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Kyushu University, Hakozaki 6-10-1, 812-8581, Fukuoka, Japan

    Hiroki Arimura

  2. School of Computing, National University of Singapore, 3 Science Drive 2, 117543, Singapore, Singapore

    Sanjay Jain

  3. School of Computer Science and Engineering, The University of New South Wales, 2052, Sydney, Australia

    Arun Sharma

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Itoh, Y., Haraguchi, M. (2000). Conceptual Classifications Guided by a Concept Hierarchy. In: Arimura, H., Jain, S., Sharma, A. (eds) Algorithmic Learning Theory. ALT 2000. Lecture Notes in Computer Science(), vol 1968. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-40992-0_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-40992-0_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41237-3

  • Online ISBN: 978-3-540-40992-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation