Advanced Search
MyIDEAS: Login to save this article or follow this journal

Distinguishing and Classifying from n-ary Properties

Contents:

Author Info

  • Pascal Préa

    ()

  • Monique Rolbert

    ()

Registered author(s):

    Abstract

    We present a hierarchical classification based on n-ary relations of the entities. Starting from the finest partition that can be obtained from the attributes, we distinguish between entities having the same attributes by using relations between entities. The classification that we get is thus a refinement of this finest partition. It can be computed in O(n + m 2 ) space and O(n · p · m 5/2 ) time, where n is the number of entities, p the number of classes of the resulting hierarchy (p is the size of the output; p > 2n) and m the maximum number of relations an entity can have (usually, m ≪ n). So we can treat sets with millions of entities. Copyright Classification Society of North America 2014

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://hdl.handle.net/10.1007/s00357-014-9151-1
    Download Restriction: Access to full text is restricted to subscribers.

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Springer in its journal Journal of Classification.

    Volume (Year): 31 (2014)
    Issue (Month): 1 (April)
    Pages: 28-48

    as in new window
    Handle: RePEc:spr:jclass:v:31:y:2014:i:1:p:28-48

    Contact details of provider:
    Web page: http://www.springerlink.com/link.asp?id=101794

    Order Information:
    Web: http://link.springer.de/orders.htm

    Related research

    Keywords: Classification; Data analysis; Hierarchy; Ultrametric; Computational linguistics; Generation of referring expressions;

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Osborne, Martin J., 2009. "Introduction to Game Theory: International Edition," OUP Catalogue, Oxford University Press, number 9780195322484, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:spr:jclass:v:31:y:2014:i:1:p:28-48. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.