id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_khbyjrfnerfmdiy6tnotx4dfl4	L ZHANG	Discovering during-temporal patterns (DTPs) in large temporal databases☆	2008	41	.pdf	application/pdf	9495	1534	88	An approach will be proposed to discover the so-called during-temporal patterns (DTPs) in larger Let A={a1,a2,...,am} be a set of states, and DT a temporal database as shown in Table 1. occurs during the period of another state aj , which is a during-temporal pattern (DTP) with length database), each of which is the set of time intervals of a single state. Definition 2 Let A and T be finite sets of states and time intervals respectively with respect to a the support degree of a DTP pattern (Definition 3). The support degree of pattern α in Definition 3 is the ratio of the number of time intervals included examining whether DTPs are frequent, we may need to consider sub-patterns. Proof: Let β be a frequent pattern, and α is a sub-DTP of β. candidate patterns with length k is generated from the set of frequent DTPk−1	./cache/work_khbyjrfnerfmdiy6tnotx4dfl4.pdf	./txt/work_khbyjrfnerfmdiy6tnotx4dfl4.txt