Temporal Generalization with Domain Generalization Graphs
نویسندگان
چکیده
This paper addresses the problem of using domain generalization graphs to generalize temporal data extracted from relational databases. A domain generalization graph associated with an attribute deenes a partial order which represents a set of generalization relations for the attribute. We propose formal speciications for domain generalization graphs associated with calendar (date and time) attributes. These graphs are reusable (i.e., can be used to generalize any calendar attributes), adaptable (i.e., can be extended or restricted as appropriate for particular applications), and transportable (i.e., can be used with any database containing a calendar attribute).
منابع مشابه
A generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملA generalization of Villarreal's result for unmixed tripartite graphs
In this paper we give a characterization of unmixed tripartite graphs under certain conditions which is a generalization of a result of Villarreal on bipartite graphs. For bipartite graphs two different characterizations were given by Ravindra and Villarreal. We show that these two characterizations imply each other.
متن کاملGeneralization for Calendar Attributes using Domain Generalization Graphs
This paper addresses the problem of generalizing temporal data based on calendar (date and time) attributes. The proposed method is based on a domain generalization graph, i.e., a lattice deening a partial order that represents a set of generalization relations for the attribute. We specify the components of a domain generalization graph suited to calendar attributes. We deene granularity, subs...
متن کاملGraph product of generalized Cayley graphs over polygroups
In this paper, we introduce a suitable generalization of Cayley graphs that is defined over polygroups (GCP-graph) and give some examples and properties. Then, we mention a generalization of NEPS that contains some known graph operations and apply to GCP-graphs. Finally, we prove that the product of GCP-graphs is again a GCP-graph.
متن کاملAttribute-oriented Induction Using Domain Generalization Graphs
Howard J. Hamilton, Robert J. Hilderman, and Nick Cercone Department of Computer Science University of Regina Regina, Saskatchewan, Canada, S4S 0A2 fhamilton,hilder,[email protected] Abstract Attribute-oriented induction summarizes the information in a relational database by repeatedly replacing speci c attribute values with more general concepts according to user-de ned concept hierarchies. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJPRAI
دوره 13 شماره
صفحات -
تاریخ انتشار 1999