Assume that the directed graph G ha

Assume that the directed graph G has N vertices and the maximal timestamp is T. First, all frequent mobility 1-patterns are extracted from the database D as the following procedure. To discover frequent 1-patterns, for each cell ID ci for 1  i  N, we scan the transactional database D to find all points (ci, tj) for 1  j  T. Each point (ci, tj) is a 1-pattern. Then their support values are calculated by using the equation (1). All 1-patterns which have support values
higher than a predefined minimum support threshold (suppmin) are selected and called frequent mobility 1-patterns as definition 7.

Results (English) 2:

假设有向图G有n个顶点和最大时间戳是T。第一，所有的频繁流动1-patterns从数据库提取下列程序。发现频繁1-patterns，每个小区ID CI 1 我 N，我们扫描事务数据库D，找到所有的点（CI，TJ）1  J  T.每个点（CI，TJ）是一个模式。然后他们的支持值的计算公式（1）。所有1-patterns具有支持值
高于一个预定义的最小支持度阈值（suppmin）被称为频繁流动1-patterns定义7。