Distinguishing and Classifying from n-ary Properties
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
Volume (Year): 31 (2014)
Issue (Month): 1 (April)
|Contact details of provider:|| Web page: http://www.springerlink.com/link.asp?id=101794|
|Order Information:||Web: http://link.springer.de/orders.htm|
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.:
- J. Barkley Rosser, 2009. "Introduction," Chapters, in: Handbook of Research on Complexity, chapter 1 Edward Elgar.
- Osborne, Martin J., 2009. "Introduction to Game Theory: International Edition," OUP Catalogue, Oxford University Press, number 9780195322484, March.
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 references are entirely missing, you can add them using this form.