Skip navigation
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPerlich, Claudia-
dc.contributor.authorProvost, Foster-
dc.identifier.citationIn Proceedings of the Ninth SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2003).en
dc.description.abstractModel induction from relational data requires aggregation of values of attributes of related entities. This paper makes three contributions to the study of relational learning.(1) It presents a hierarchy of relational concepts of increasing complexity, using relational schema characteristics such as cardinality, and derives classes of aggregation operators that are needed to learn these concepts. (2) Expanding one level of the hierarchy, it introduces new aggregation operators that model the distribution of the values to be aggregated and (for classification problems) the differences in these distributions by class. (3) It demonstrates empirically on a noisy business domain that more-complex aggregation methods can increase generalization performance. Constructing features using target-dependent aggregations can transform relational prediction tasks so that well-understood feature-vector-based modeling algorithms can be applied successfully.en
dc.description.sponsorshipNYU, Stern School of Business, IOMS Department, Center for Digital Economy Researchen
dc.format.extent181473 bytes-
dc.subjectRelational learningen
dc.subjectFeature Constructionen
dc.subjectConstructive inductionen
dc.titleAggregation-Based Feature Invention and Relational Concept Classesen
Appears in Collections:CeDER Published Papers

Files in This Item:
File Description SizeFormat 
CPP-03-03.pdf177.22 kBAdobe PDFView/Open

Items in FDA are protected by copyright, with all rights reserved, unless otherwise indicated.