Moving Pattern Detection in Spatio Temporal Data Mining

1. Moving Pattern Detection in Spatio Temporal Data Mining By SekHarnalluri VengalAraopachva Surya koganti

2. PROBLEM DEFINITION Increase in use of wireless communication devices leads to the development of location based services . The objective is to trace the moving objects with low response time and minimum utilization of resources to deliver efficient location services.

3. Paper 1 A CLUSTERING BASED APPROACH FOR DISCOVERING INTERESTING PLACES IN A SINGLE TRAJECTORY

4. Motivation • With the development of many location sensors, a lot of trajectories of users and moving objects can be identified • This creates an appropriate basis for developing efficient new methods for mining moving objects • Semantic clustering of trajectories left behind moving objects is an important aspect in spatio temporal data mining

5. Introduction • Spatio temporal data is growing substantially, with the increasing use of wireless communication devices • An algorithm CB-SMoT (Cluster Based Stops and Moves of Trajectories) has been provided to extract stops and moves from trajectory sample points. • Based on traditional algorithm DBSCAN • EPS parameter in the algorithm CB-SMoT can dramatically affect the quality of clustering • A new method of calculating the EPS value is proposed

6. Cont.. • Moving patterns are extracted from stops and moves • To model stops and moves, the user has to specify the places of interest, since stops and moves are specified in advance from an application point of view • The main drawback of this assumption is that important places that may lead to the discovery of interesting patterns can be missed if they are not known by the user. • The proposed algorithm can extract some unknown stops

7. Cont’d.. • The distances between two neighbor points in the trajectory are not distributed by Gaussian curve as shown in figure 1 and figure 2 • So more appropriate method is proposed to calculate the parameter Eps

8. Definitions • Trajectory Sample A trajectory sample is a list of space-time points: • Stops represent the important places of a trajectory where the moving object has stayed for a minimal amount of time

9. Definitions • Move: A move of a trajectory T with respect to an application A is: • a maximal contiguous sub-trajectory of T in between two temporally consecutive stops of T ; OR • a maximal contiguous sub-trajectory of T in between the starting point of T and the first stop of T ; OR • a maximal contiguous sub-trajectory of T in between • the last stop of T and the last point of T ; OR • the trajectory itself, if T has no stops

10. CB-SMoT Algorithm • Well known density based clustering algorithm • The CB-SMoT is interested specially in discovering clusters in a single trajectory and also considers time • Two major steps in CB-SMoT • In first step, the slower parts of a trajectory called potential stops are identified using the variation of the DBSCAN algorithm • In the second step, the algorithm identifies where these potential stops found in the first step are located

11. Cont’d.. • The Eps parameter indicates the absolute distance used to calculate the neighborhood of a point • A trajectory T can be viewed as a list of distances di between two consecutive points pi and pi+1. These distances have an arithmetic mean μ and a standard deviation. With these two parameters it is possible to plot the appropriate Gaussian curve. • The Quantile function is defined as:

12. New method to calculate EPS • According to the distances histogram, it is easy to distinguish the fast speed part and the slow speed part. • Then we calculate the arithmetic mean μ and the standard deviation. To denote (μ1, ı1) with respect to the distances di between two consecutive points pi and pi +1 in the whole trajectory and (μ2,ı2) with respect to the distances di between two consecutive points pi and pi+1 in the slow part.

13. Cont’d • According to the trajectory plotted, we can get (μ1, ı1) = (1.537, 0.845) and (μ2, ı2) = (0.441, 0.095). • Authors thought that the distance di is subjected to Gaussian Curve so, these situations can be standardized and can utilize the normal distribution table to reference the E values WRT different mean and SD.

14. Conclusion • Spatio temporal Data Mining is still infancy • What kinds of patterns can be extracted from trajectories? • Which methods and algorithms should be applied to extract them? • Trajectory clustering is only a little attempt. Future Work • Future work is needed for finding the better method to calculate the parameters Eps and MinTime for the purpose of improvement the quality of clustering

15. Paper 2 Efficient STMPM(Spatio-Temporal Moving Pattern Mining) Using Moving Sequence Tree

16. Introduction • The problem with various pattern mining methods already available are: • Increasing Execution time • Increasing Size of memory for search • A new algorithm is proposed to overcome these problems and to efficiently extract the periodical or sequential frequent moving patterns.

17. Definition Spatio temporal Frequent moving pattern mining Given moving object database MD, user specified minimum support factor min_sup, and the constraint of time interval between spatial scopes max_gap, spatio-temporal frequent moving pattern mining searches all frequent moving sequences that satisfies the minimum support factor.

18. TERMS Min_sup: Lowest value of support factor that has to be satisfied to determine the sequence S is frequent or not Max_gap: The maximum time gap tj-tj-1, moving time from a specific area to another closely located area

19. STMPM PROCEDURE there are two main processes in the stmpm procedure Preprocessing: Spatio-temporal attributes of moving object are transformed into appropriate form for pattern mining. Pattern Mining: Moving sequence tree is created to search frequent patterns that satisfy minimum support factor.

20. Contd… A moving sequence is a sequential list. It needs to satisfy the constraint of time interval among locations that form a sequence. Contains operation generalizes location attributes of the object to spatial scope. During Operation generalizes temporal attributes to temporal scope. Generalized data is summarized into one sequence item if spatial and temporal attributes are identical.

21. PATTERN MINING A moving sequence tree is a hash tree-based sequence tree formed by the sequence of each object. Extracts frequent pattern that satisfies min_sup.

22. Set of generalized moving sequences

23. MINING PROCESS Step 1 : Search for set of frequent 1-sequences and transformation of transaction data with min_suphigher than 2.

24. Cont’d.. Step2 : Construction of moving sequence trees One moving sequence creates 2n-1 partial sequences when there are n sequence items, excluding a null set.

26. CHARECTERISTICS Limited DataSet: Extracts the set of historical data of a moving object. SeqExtractor : Creates sequential list of each object. Contains : It is a spatial operation to generalize location attribute of a moving object. During: It is a time interval operation to generalize temporal attribute of a moving object in the set of moving sequences. FreqPatternExtractor : Creates a moving sequence Trees and extracts frequent moving patterns.

27. Experimental Results Performancecriterion is efficiency in execution time for pattern mining, It is measured by using the minimum support factor. Geometry data used is administrative district and road network data of Seoul. Historical data is created by measuring the driving history of taxis.

28. Contd.. Characteristics of experimental data Execution times for each pattern mining are measured by fixing the time range to 10 hours.

29. PAPER-3 An Energy Saving Strategy for Object Tracking in Sensor Networks by Mining Seamless Temporal Moving Patterns

30. RELATED WORK Hardware designoptimization problem of the communication cost by inactivating the RF radios of idle sensor nodes Software design approach developed some tree structures for efficient object tracking by considering the physical network structure.

31. APPROACH Energy saving for tracking objects in sensor networks is done by STMP-Mine. Prediction strategies employ the discovered seamless temporal movement patterns to reduce the prediction errors for energy saving. Avoids energy expensive components. The prediction-based strategies utilizing STMPsare PSTMP PES+PSTMP

32. Assumptions Network model : a sensor node is activated only if there is object in its coverage/sensing region. Trajectory of each object is represented in the form of S = <(l1, t1) (l2, t2) ... (ln, tn)>, where li represents the sensor node location at time ti. STMP in the form as P = <(l1,i1, l2,i2, ..., ir-1, lr)> iksemantically means the representative time interval between two traversed locations. Seamless temporal movement rule (STMR) incorporated into the location prediction mechanisms. Rt= < (l1, i1, l2, i2, ..., lm-1, im-1) > → < (l m) >

33. STMP – Mine Algorithm Time interval aggregation tables are obtained by manipulate the temporal information of the movement logs. Clustering technique is employed to achieve aggregation.

34. Contd… For a discovered STMP, Pt= < (l1, i1, l2, i2, ..., lm) >,the definitions of confidence conf(Pt) and strength(Pt) are given as:

35. Simulation Model Popular metrics named Total Energy Consumed (TEC) is evaluated for the proposed prediction strategies under different time constraints. 80% of the simulated data are used for training to obtain STMRs, and the rest 20% are taken as testing set for object tracking The network is modelledas a mesh network with size |W| = 20*20 with 10000 objects

36. Contd… The behavior of moving objects in the OTSNs is event driven. Two parameters le and Peto model the average length and the event probability. The length of each event is modelled by Poisson Distribution The event probability indicates the probability for an object to adhere to a certain event, and it is modelled by Normal distribution. The sensing coverage range is 15m and the average object velocity is set as 15 m/s

37. COMPARISION OF PREDICTION STRATEGIES

38. PSTMP • PSTMP-N-gram and PSTMP-N+-gram in terms of TEC and missing rate with TOP-N varied from 1 to 7. • It is observed that the average number of STMRs stored in each sensor node with length greater or equal to 2 is about 5.34 in average, which is much less than that with length equal to 1 (about 10.56).

39. CONCLUSION Paper1 proposes Trajectory clustering method to calculate the Epsvalue which significantly improve the quality of clustering. Paper2 suggested a STMPM algorithm using moving sequence tree that minimizes the time necessary for mining and the amount of memory required, so that pattern mining can be carried out smoothly. Paper3propose a seamless data mining algorithm named STMP-Mine without defining segmenting time unit to efficiently discovering the seamless temporal movement patterns (STMPs) of objects in sensor networks

40. PROS STMPM algorithm minimizes the time necessary for mining and the amount of memory required. No need of segmenting time unit in OTSN’s. Velocity of object is not needed. Low missing rate of the object is possible. Abundant moving patterns can be found without omission of short time interval

41. CONS The kinds of patterns extracted from Trajectories are unanswered in clustering based approach. A mining method that searches for the regular movement of a moving object is not discussed. Only the temporal moving patterns is considered for object tracking in OTSN’s

42. COMAPRISION AND ANALAYSIS

43. FUTURE WORK Future work is needed for finding the better method to calculate the parameters Epsand MinTime. Pattern mining techniques that not only have location history of a moving object but also the information about the behaviors like velocity, direction etcneeds to be accomplished The time the object spent in staying at certain location is to be traced out.

44. REFERENCES S. Elnekave, M. Last, O. Maimon "Incremental Clustering of Mobile Objects",STDM07, IEEE , 2007 J. Allen, "Maintaining Knowledge about Temporal Intervals", Comm. of the ACM, Vol.26, No.11, 1993. S. Y. Han, "Spatio-temporal Moving Sequence Pattern Mining", EwhaWomans Univ., Korea, MS Thesis, 2006. T. Palpanas, A. Mendelzon, Web Prefetching Using Partial Match Prediction, in: Proc. of the 4th Web Caching Workshop, 1999. R. Agrawal, R. Srikant, Mining Sequential Patterns, in: Proc. of the 11th Int’l Conf. on Data Engineering, 1995, pp. 3-14.

45. Queries…?

46. Thank you