Data mining with calendar attributes

DOI10.1007/3-540-45244-3_10MaRDI QIDQ2777827zbMATH OpenFDO

Authors Howard J. Hamilton, Dee Jay Randall

Publication date 12 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2007/20070117

Mathematics Subject Classification ID

Database theory (68P15) Computing methodologies and applications (68U99)

Review text

This paper addresses the problem of data mining from temporal data based on calendar (date and time) attributes. The proposed methods uses a probabilistic domain generalization graph, i.e., a graph defining a partial order that represents a set of generalization relations for an attribute, with an associated probability distribution for the values in the domain represented by each of its nodes. We specify the components of a domain generalization graph suited to calendar attributes and define granularity, subset, lookup, and algorithmic methods for specifying generalizations between calendar domains. We provide a means of specifying distributions. We show how the calendar DGG can be applied to a data mining problem to produce a list of summaries ranked according to an interest measure given assumed probability distributions. For the entire collection see [Zbl 0976.68582].

Recommendations

• Efficient spatio-temporal data mining with GenSpace graphs
• A survey of temporal data mining
• Study of temporal type and time granularity in the temporal data mining
• scientific article; zbMATH DE number 2087265
• On continuous temporal data mining

Cited in

(1)

• Efficient spatio-temporal data mining with GenSpace graphs

This page was built for publication: Data mining with calendar attributes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2777827)