xiii Preface INTRODUCTION
|
|
- Bertram Lucas
- 6 years ago
- Views:
Transcription
1 xiii Preface INTRODUCTION With rapid progress of mobile device technology, a huge amount of moving objects data can be geathed easily. This data can be collected from cell phones, GPS embedded in cars or telemetry attached on animals. Location of mobile phone user can be collected by locating the cell connected with their mobile phone. In addition, The GPS-equiped vehicle can be tracked. Useful knowledge can be discovered automatically from moving objects data. For example mobile phone logs can be extracted to form a pattern of mobile user movement. This pattern can be used to improve services of network providers. In addition, GPS-equipped vehicle position data can also be extracted to discover frequent routes of vehicle movements. This pattern can be used for traffic management. Moving object data containd spatial and temporal elements. Spatial data is related with geographic aspects, whereas temporal data related with the time properties. Unlike the traditional relational databases, relation among spatial objects is more complex. Ester, Kriegel and Sander (2001) state three basic types of spatial relations, namely: topological, distance, and direction relations (as illustrated in Figure 1). The first type is based on the positions of two objects. The position of these objects could be classified as inside, disjoint or overlaps. For example: x disjoints y, x overlaps y. Distance relation type is based on the distance between two objects. The distance between two objects can be compared with a defined number. As a result the distance between two objects can be classified as equal, lower than or greater than the specified number. Finally, Direction relation of spatial data is based on the directions of the two objects. In order to do that, one of the two objects is defined as the source object. The direction between two objects depends on the source object. For example: z north x means that object z, as a source object, is located north of object x. Figure 1. Spatial relations
2 xiv The characteristics of spatial data is unique compared to the other databases. In relation to data mining field, Buttenfiled et al. (2000) argued three characteristic of spatial data, namely: huge data, collected cyclically & data foundation. Most of spatial data is obtained automatically by the system rather than input manually, which is retrieved cyclically. The problem of cycled data is that the time information may not be mentioned. Thus, the first challenge before the mining process begins is to mine the cycle pattern of the data. The last characteristic is that spatial data mostly contains raw data. Mining pattern from spatio-temporal databases is more challenging than on numerical data. Because of the spatio-temporal data complexity, primitive data mining techniques cannot be applied straightforward as those for numerical data. In this section, we highlight data mining techniques for discovering usefull knowledge from spatio-temporal data including: movement pattern, trajectory pattern, relative motion pattern, location prediction and trajectory clustering. MOVEMENT PATTERN MINING Mobile user movement data is the data, which can be obtained from users or cars, which carry or embed geographic track devices, such as, mobile phone and GPS. Based on this data, patterns can be discovered, including most people are likely to move from A to B, or the group of people who have same trajectory route on daily movement. Basically, there are two types of pattern, namely: location-based and userbased movement pattern. Location-Based Movement Pattern In location-based pattern mining, we are interested on the object or location, rather than the mobile user who visited the location. An example of pattern that we can discover is: Location A will be visited after Location B. It means that most mobile users visit location B and then Location A. Three related works on location-based pattern mining are: 2-step walking pattern, Location Link Pattern and Periodic Pattern. First, Goh & Taniar (2006) proposed a 2-step walking pattern mining method. This pattern is taken from a mobile user database, which contains the x- and y-coordinates indicating the location of the user at a particular time. The knowledge derived from this pattern is that with the 2-given steps, the mobile user walks from one point to another point. The points represent the location of interest. The process of 2-step walking pattern mining works as follows: Initially, the user movement data set and the location of interest become a data source for this process. Next, the coordinate location in the user movement data set is converted to a relevant location of interest, with regard to the user-defined minimum duration value. The result of this conversion is shown in Table 1. Then, using the user defined minimum weight value, the user location database is analyzed to generate user location summary database. Finally, the user location summary database is posted to the Walking-Matrix or Walking-Graph algorithm to generate the pattern. The following walk-through illustrates the working of the 2-step walking pattern mining using the Walking-Matrix algorithm. This example is taken from Goh and Taniar (2006) experiments. Firstly, the user location database in Table 1 is generated from a user movement database. For example, user movement database of u 1 is converted to l 1 and at time 1. It implies that user u 1 stayed in both location l 1 and at time 1. Let the min_dur = 3 and min_weight = 0.5. Next, using the min_weight value, the user location database is analyzed to form a user location summary database (see Table 2). The user move-
3 xv Table 1. User location database T u 1 u 2 u 3 u 4 u 5 u ,, 5,, 6,, 7,, 8,, 9,, ,, 17,, 18,, 19,, 20,, 21,, ment l x l y implies that user moves from l x to l y. However, if x=y the user movement is removed because there is no significant movement of that user. Lastly, the Walking-Matrix algorithm is used for mining 2-step walking pattern from the user location summary database. Walking-Matrix is shown in Table 3. The weight of each 2-step walking pattern is counted. If the weight is greater than min_weight, these patterns are valid, otherwise pruned. Next, location-based pattern mining is Location Link Pattern (Iwan & Safar, 2009). The pattern consists of location sequences, which have a link. For example, as we can see from Figure 2 that all mobile users (u 1, u 2, u 3, u 4, u 5 ) visit childcare before go to school. From that fact, it is possible to summarize that childcare and school have a strong relationship. In other word, there is a link between school and childcare. Iwan & Safar (2009) proposed an algorithm for mining location link pattern from mobile user movement data. This algorithm discovers location link pattern from daily user movement pattern. The well-known Apriori algorithm (Agrawal et al., 1993) is used to generate the patterns. The algorithm for mining location link patterns consists of 2 steps: generating 1-location links and mining location link patterns. The 1-location link pattern mining algorithm uses the daily mobile user movement pattern from all users (instead of a single user) in the mobile user movement database. The location link pattern algorithm is the main process for mining location link patterns. This algorithm requires the location set 1-LLP, the set of daily mobile movement pattern DMP, and the min_user threshold as inputs. Initially, 1-LLP is stored to a valid user movement 1 variable, VUM 1. After that, k-
4 xvi Table 2. The result from analysis of a User location summary database u 1 u 2 u 3 u 4 u 5 u 6 l 1 l3 l3 l 6 l3 l3 l 1 l3 l3 l3 l3 l 6 l 1 l3 l3 l 6 l 1 l 1 l 1 l 1 l3 l3 l3 l3 l 6 l 1 l 6 l 1 l 1 Table 3. A walking-matrix l 1 l 6 l 1 * 5 1 * * * * l * Figure 2. An example of a mobile user movement
5 xvii valid user movement candidate VUC k is generated by self joining each member of VUM k-1. Because daily mobile user movement patterns are classified as sequential data, the joining step is similar to that of the sequential-pattern mining algorithm (Srikant and Agrawal, 1996). Next, if the member of VUC k is one of the DMP subsets, then the number of users is counted. After that, if the number of users is greater than or equal to the min_user threshold, then this candidate is considered to be a valid user movement. This process runs recursively until no more valid user movements can be generated. The output of this algorithm is a set of location link patterns. Another movement pattern based on location is the Periodic Pattern. Mamoulis et al. (2004) proposed a periodic pattern mining method from spatio-temporal data. Spatio-temporal data in this pattern is daily routes over a regular time interval. For example, people are using similar routes from home to office everyday. The routes may not be exactly the same. The route consists of a set of location points. The location points are close to each other if they have the same cluster. The periodic mining {AB*C} means that people move to B from A. After that, they do not move to any other location point. Finally, they move to C. The process of mining the periodic patterns consists of two stages: discovering frequent 1-patterns and discovering a longer pattern. In the first stage, the user movement data is clustered for each timestamp. Traditional clustering technique such as DBSCAN (Ester et al., 1996) can be used. The frequent 1-pattern is generated by checking the number of points in the cluster. The frequent 1-pattern is valid if the number of points of that cluster is greater than the minimum support threshold, min_sup. In the second stage of mining the periodic pattern, the frequent longer patterns are discovered. Mamoulis et al. (2004) proposed two methods for generating frequent longer pattern: bottom-up and top-down approaches. While the bottom-up approach called STPMine1, which is based on the Apriori- TID algorithm (Agrawal and Srikant, 1994), the top-down approach is called SPTMine2 Algorithm. The frequent 1-pattern is the input for both algorithms. In the bottom-up approach, candidate k pattern is generated by joining segment ID of pairs (k 1) pattern. After that, each candidate pattern is checked to determine whether or not its number of segments is greater than min_sup. Finally, in order to make sure that the region of that candidate is still clustered, the pattern is validated. User-Based Movement Pattern Unlike location-based pattern mining, user-based movement patterns are interested in the movement itself. One existing pattern mining algorithm based on user movement is group pattern mining. Group pattern is a relatively new in the data mining research area. Initially, Wang et al. (2003) and Wang et al. (2006) proposed two group pattern mining algorithms: AGP and VG-Growth algorithms. Subsequently, using a spherical location summarization method, Wang et al. (2004) improved the efficiency of the group pattern mining algorithm on a large number of users and lengthy logging duration in order to reduce the processing time required to mine 2-valid groups. Subsequently, Wang et al. (2008) revised the AGP and VG-Growth algorithms in order to mine max-valid groups. The revised algorithms are called: AMG and VGMax algorithms. A group pattern can be extracted from mobile user movement dataset. A user movement dataset is a set of time series of locations for each user. The locations are defined as a set of x- and y-coordinates, while a time series is defined as the time when the user moved to that location. Each record of this dataset contains a triple set of fields: t, x, and y denoting x- and y- coordinates is the location of the user at time t. An example of a user movement data set is shown in Figure 3.
6 xviii Figure 3. User movement dataset A group pattern is defined as a group of users whose distance is less than the maximum distance between them and the duration of time for which they remain together is greater than, or equal to, the minimum duration. Both maximum distance and minimum duration are the user-defined thresholds. The distance between users is calculated using Euclidean distance whose formulation is shown: ( ) = 2 d ( x, y x y x x y y 1 1),(, 2 2 ) ( 1 2 ) + ( ) For example, the distance between u 1 and u 2 at time 1 denoted by d(u 1,u 2 ) = 52. In addition, the validity of the group pattern is determined by its weight value. The Weight of group pattern P is defined as: weight P where: n i ( ) = = 1 N S i P = group pattern S i = Valid segment of i n = number of valid segment N = number of time points in database A group pattern is called a valid group if the weight of the group pattern is greater than the min_weight user-defined threshold. Consider the following user movement dataset in Table 4. The problem to be solved in this example is to find a group of users which remained together for a period of time. Let the maximum distance, max_dis = 3, the minimum duration, min_dur = 3 and the minimum weight, min_wei = 6. As we can see from Table 4, the distance between users u 1 and u 2 from time 1 to time 3 and from time 7 to time 10 is less then max_dis. Therefore, u 1 and u 2 fulfill the distance requirements of group pattern. The other requirement is the duration. The durations of u 1 and u 2 from time 1 to time 3 and time 7 to time 10 are 3 and 4 respectively. Therefore, u 1 and u 2 have a duration that is greater than or equal to min_dur. The last
7 xix requirement is weight. The total number of weights of u 1 and u 2 being closed to each other is 7 which is greater than min_wei. Therefore, u 1 and u 2 are classified as one group because both users satisfied all of the requirements of group pattern. The generation of 2-valid group patterns using the AGP algorithm above is inefficient. The number of 2-valid groups is huge, especially when there are a large number of users. In order to solve this problem, Wang et al. (2004) proposed an efficient method for generating 2-valid group patterns which uses a spherical location summarization approach. In Wang et al. (2004) experiments, the execution time of the AGP algorithm using the SLS method is less than that using the AGP algorithm without the SLS method. A maximal valid group is a set of valid groups without redundancy. Although the AGP algorithm above mines a complete a set of valid groups from user movement dataset, the AGP algorithm produces some redundant valid groups. In order to resolve the redundancy valid group problem, Wang et al. (2008) proposed a maximal valid group mining algorithm for discovering group patterns without redundant valid groups. Another work of user-based pattern mining is User Link Pattern (Iwan & Safar, 2009). As we can see from Table 4 that mobile user u 3, u 4 and u 5 have the same daily movement. They go to school before going to campus and go to childcare before going to school. Based on this fact, it is possible to conclude that u 3, u 4 and u 5 may have a strong relationship. The user link pattern mining algorithm consists of two procedures. The first procedure generates user link candidates. With this procedure, a (n 1)-valid user link is joined to obtain an n-user link candidate. The join process is based on the prefix join method. Two or more users are joinable if they have the same prefix user link set. Otherwise, these users are not joinable. The second procedure in the mining step is the user link candidate validation algorithm. This procedure validates whether or not the size of location movement intersection between them is greater than or equal to min_loc. This procedure consists of two steps: location intersection base generation and intersection step. In the first step, the first user in user link candidate set becomes the location base intersection. Specifically, each subset of the first user location segment where has size greater than equal to min_loc, is used as a location intersection process. In the second step, each member of location intersection base set intersects with the other user location segments in user link candidate. If the size of location movement intersection result is greater than or equal to min_loc, than this user link candidate is valid. Table 4. User movement dataset example Time u 1 u 2 d(u 1,u 2 ) 1 (4, 7) (4, 6) 1 2 (4, 8) (4, 8) 0 3 (4, 7) (4, 6) 1 4 (70, 50) (90,50) 20 5 (70, 51) (90, 53) 20 6 (70,52) (90,52) 20 7 (74, 57) (74, 56) 1 8 (74, 58) (74, 58) 0 9 (74, 57) (74, 56) 1 10 (74, 58) (74, 58) 0
8 xx TRAJECTORY PATTERN MINING Trajectories are sequences that consist of spatial and temporal data about movements. Giannotti et al. (2007) defined trajectory as spatio-temporal sequences (ST-sequence): <(x 0,y 0,t 0 ),...,(x n,y n,t n )>. x i and y i are the position coordinate relative to the orgin whereas t i is the time stamp for the position information. The example of trajectory data <(x 0,y 0,t 0 ), (x 1,y 1,t 1 ), (x 2,y 2,t 2 ), (x 3,y 3,t 3 ), (x 4,y 4,t 4 ), (x 5,y 5,t 5 )> can be illustrated in Figure 4. In order to obtain a usefull knowledge from movement data above, Giannotti et al. (2007) proposed an algorithm for mining spatio-temporal pattern called a Trajectory Pattern (T-Pattern). T-pattern is formed by examining a set of each trajectories data which has visited almost the same point of interest on similiar times. T-Pattern is defined as a couple (s,a), where: s x, y,..., x, y = ( ) ( ) 0 0 n n is a sequence of n+1 locations a = α,..., α 1 n are the transision times such that α 1 = t = t t i i i 1. α α α 1 2 n T = S S... S 0 1 n A T-pattern T will be discovered in a subseqeunce S if it matches the following two conditions: Each (x i, y i ) in T, matches a point (x i, y i ) in S The transition times in T are similar to those in S. Figure 4. Trajectory data illustration
9 xxi In fact, it is hard to find exact the same spatial location (x, y) and transition times occurs often on trajectory data. However, the same area is often representated by close location coordinate and the same behavior is often indicated by the close times of trajectory data. This problem can be tackled by the notion of spatial neigborhood and temporal tolerance (Giannotti et al., 2007). Spatial neigborhood is used for defining the location area whereas temporal tolerance is used for defining transisiton times. The two pints will be defined as one area if one and another point falls within a spatial neigborhood and. The two transition times will be defined as one time if the diferences between the two is less than or equal to T. Furthermore, as generating all T-patterns is too computational intensive, the concept of regions of interest is used (Giannotti et al., 2007). Region of interest is used for defining similar point of interest. The region is built from set of point which have same neighbors. Otherwise, the point is not region if they do not have a neighbors. Furthermore, Giannotti et al. (2007) used density-based algorithm for finding regions of interest. With region of interest approach, Giannotti et al. (2007) proposed algorithm for mining T-pattern with pre-defined region interest and dynamic region of interest (RoI). Pre-defined RoI technique is used if the region interest is given whereas dynamic RoI technique is used if the region of interest is unknown. RELATIVE MOTION PATTERN Motion pattern can be formed based on the relative motion (REMO) concept proposed by Laube et al. (2004). There are three basic REMO concept, namely: constance, concurrence, and trend-setter. First, pattern forms constance when sequence moving point object (MPOs) moves on the same motion attribute for given period of time. Next, concurrence can be formed when the number of MPOs have the same motion attributes on the given period of time. The last concept is trend-setter. This pattern is formed when one MPO encourages of other MPOs moving to the same direction. The basic REMO concept disregards the information space. In fact, information space is important to detect patterns. For example, trend-setter of one MPO in location A influences other MPOs in location B. However, if location A has diferent information space with location B, we cannot say that MPO in location A is trend-setter the MPOs in location B. Therefore, information space is essensial for detecting a pattern. In order to solve the above problem, Laube et al. (2004) extended the basic REMO concept for mining spatially constrained REMO patterns, namely: track, flock, and leadership. First, constance pattern with spatial constraint is defined as track. Next, concurence pattern with spatial pattern forms a flock. Lastly, leadership can be build by combining trend-setter and spatial constraints. The extended of basic REMO concept is illustrated in Figure 5. Furthermore, Laube et al. (2004) proposed spatial REMO pattern convergence. This concept is to detect groups of MPOs aggregating in space and time. Convergence is built when groups of MPOs from any location move to the same circular region of the given radius. The convergence pattern is illustrated in Figure 6. A convergence pattern is discovered from 4 MPOs for p 2, p 3, p 5, and p 6. In order to detect aggreration pattern, Laube proposed a spatial data mining approach. Aggreration pattern including flocking behaviour and convergence in spatial-temporal data. The apporach is based on object motion properties and spatial constraint.
10 xxii Figure 5. An extended basic REMO concept: track, flock, leadership Figure 6. Convergence pattern LOCATION PREDICTION Location prediction for moving object can be classified as based on one moving object and based on all moving objects trajectories. Based on one moving object, location prediction is defined as a prediction of the next location on a defined timestamp. This location prediction is based on the past movement history. Consider Figure 7 taken from Tao et al. (2004) as an example. Assume we want to predict the location at the next time 4 timestamp based on 2 past movements history at time 1 and time 2. The white dots in Figure 7 illustrate the location prediction at the next 4 timestamp at time 1 and time 2 respectively. However in reality most of movements are not linear. As illustrated in Figure 7, object o is moving not linear showed in the black dots. In order to predict location from non-linear movement, Tao et al. (2004) proposed algorithm for predicting location from non-linear movement patterns. Specifically, Tao et al. proposed three contributions to solve the problems on location prediction, namely: system architecture, the recursive motion function and the STP Tree (spatio-temporal prediction tree). The first, Tao et al. (2004) assumed the system architecture is client-server (refer to Figure 8). The client maintains the location path history and calculates its single motion function continuously whereas the server receives information from all clients, stores the path history and delivers location prediction based on user query.
11 xxiii Figure 7. Location prediction Location prediction is based on both pattern and path history. Therefore it can predict location in the future, even the current time is longer than the requested time. It is focused on time when the prediction requested. Similar with Tao et al. (2004), Jeung et al. (2008) concerned on non-linear moving objects which can predict the longest time. One of techniques for predicting location based on all moving object s trajectories is WhereNext (Monreale et al., 2009). WhereNext predicts locations using frequent trajectory pattern of other moving objects. The moving object is likely to follow a pattern where most moving objects formed a pattern. In order to predict locations, WhereNext has four main steps, namely: data selection, trajectory pattern (T-pattern) mining, T-pattern Tree building, and prediction. In the data selection step, a location area and a time period are selected. The purpose of this step is for taking only the moving object that passing the location area in some period of time. After that the selected data is extracted for mining the frequent movement pattern. The process of extracting data is using trajectory patterns algorithm called T-patterns. In the third step, T-pattern Tree is constructed by combining T-patterns in a prefix tree. Finally, the future location of moving object can be predicted by using T-pattern Tree. An example of T-pattern Tree of Table 4 s T-Pattern is shown in Figure 9 which is taken from Moonreale et al. (2009). Figure 8. System architecture on location prediction
12 xxiv Table 4. T-pattern <(), C> <(15,20), B)> supp:20 <(), C> <(10,12), D> supp:35 <(), A> <(4,20), A)> supp: 26 <(), C> <(70,90), C> supp:21 <(), A> <(9,12), C)> <(10,12), D> supp:21 <(), F> <(2,51), D> supp:37 <(), A> <(9,12), B)> <(10,56), E> supp:21 <(), A> <(9,15), B> supp:31 <(), A> <(9,12), C)> <(15,20), B> supp:10 <(), B> <(8,70), E> supp:28 Figure 9. T-pattern tree construction The T-Pattern: <(), loc 1 > <(t min, t max ), loc 2 > sup:n Where: loc 1 = the source location loc 2 = the destination location t min = the minimum time interval from source to destination location t max = the maximum time interval from source to destination location n = the support value of this pattern TRAJECTORY CLUSTERING There are two types of clustering spatio-temporal data, namely: distance-based and shape-based clustering. Distance-based clustering aims to discover a group of objects moving together whereas shape-based clustering aims to discover similar shape trajectories. Unlike existing algorithms where cluster trajectories as a whole, Lee et al. (2007) proposed a partition and group framework for clustering trajectories. Clustering trajectories as a whole may lead to miss essential information. In particular, common behavior may not be discovered because all trajectories can move in different directions. An example of this problem can be seen in Figure 10. As a whole
13 xxv Figure 10. An example of a common trajectory trajectory, all trajectories (TR 1, TR 2, TR 3, and TR 4 ) move to totally different directions. As a result, the cluster is not discovered. However, the cluster will be discovered when we partition the trajectories into sub-trajectories. As can be seen, the dotted rectangle is a common sub-trajectories which form a cluster. In order to tackle the problem above, Lee et al. (2007) proposed a trajectory clustering algorithms, TRACLUS, based on partition-and-group framework. According to this framework, TRACLUS discovers the common sub-trajectories in two steps, namely: partitioning and grouping. In the partitioning step, the characteristic points are identified by using the minimum description length (MDL) technique. The characteristic point classified a point where the behavior of trajectory changes dramatically. After that a trajectory partition is formed at every characteristic point. In the grouping step, the clusters are discovered by applying density-based clustering, DBSCAN. After that, overall movement of the trajectory partitions is described. This common sub-trajectory forms a cluster. CONCLUSION The purpose of this preface was to highlight data mining techniques for spatio-temporal data. We show that the usefull knowledge can be discovered by extracting spatio-temporal data. This knowlege including: movement pattern, trajectory pattern, relative motion pattern, location prediction and trajectory clustering. David Taniar Monash University, Australia Lukman Hakim Iwan RMIT University, Australia REFERENCES Agrawal, R., Imielinski, T., & Swami, A. (1993). Mining association rules between sets of items in large databases. In the Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. pp Washington, D.C., United States. ACM. Agrawal, R., & Srikant, R. (1994). Fast Algorithms for Mining Association Rules in Large Databases. Proceedings of the 20th International Conference on Very Large Data Bases. pp Santiago, Chile. Morgan Kaufmann Publishers Inc.
14 xxvi Buttenfield, B., Gahegan, M., Miller, H., & Yuan, M. (2000). Geospatial Data Mining and Knowledge Discovery. Technical report, University Consorsium for Geographic Information Science Research White Paper. Washington, D.C. Available online at white/2000%20papers/emerging/gkd.pdf. Ester, M., Kriegel, H., & Sander, J. (2001). Algorithms and Applications for Spatial Data Mining. Geographic Data Mining and Knowledge Discovery, Research Monograph in GIS. Taylor and Francis. Ester, M., Kriegel, H.-P., Sander, J. & XU, X. (1996). A density-based algorithm for discovering clusters in large spatial databases with noise, Second International Conference on Knowledge and Data Mining. pp Portland, Oregon. AAAI Press. Giannotti, F., Nanni, M., Pinelli, F., & Pedreschi, D. (2007). Trajectory pattern mining. Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. pp San Jose, California, USA. ACM. Goh, J., & Taniar, D. (2006). On Mining 2 Step Walking Pattern from Mobile Users. Computational Science and Its Applications - ICCSA 2006 (pp ). Glasgow, UK: Springer. Iwan, L.H. and Safar, M. (2009). Pattern mining from movement of mobile users, Journal Ambient Intelligence and Humanized Computing, 1-4(2010), pp Jeung, H., Liu, Q., Shen, H. T., & Zhou, X. (2008). A Hybrid Prediction Model for Moving Objects. In Proceedings of the 24th International Conference on Data Engineering (ICDE 08). pp Cancun, Mexico. IEEE. Laube, P., Kreveld, M., & Imfeld, S. (2004). Finding REMO Detecting Relative Motion Patterns in Geospatial Lifelines. Developments in Spatial Data Handling: Proceddings of the 11th International Symposium on Spatial Data Handling. pp Lee, J., Han, J., & Whang, J. (2007). Trajectory clustering: a partition-and-group framework. In Proceedings of the ACM SIGMOD International Conference on Management of data (SIGMOD 07). pp Beijing, China, ACM. Mamoulis, N., Cao, H., Kollios, G., Hadjieleftheriou, M., Tao, Y., & Cheung, D. W. (2004). Mining, indexing, and querying historical spatiotemporal data. Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp Seattle, WA, USA. ACM. Monreale, A., Pinelli, F., Trasarti, R., & Giannotti, F. (2009). WhereNext: a location predictor on trajectory pattern mining. Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD 09). pp Paris, France, ACM. Srikant, R., & Agrawal, R. (1996). Mining sequential patterns: Generalizations and performance improvements. Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology. pp Avignon, France. Springer. Tao, Y., Faloutsos, C., Papadias, D., & Liu, B. (2004). Prediction and indexing of moving objects with unknown motion patterns. In Proceedings of the 2004 ACM SIGMOD international conference on Management of data (SIGMOD 04). pp Paris, France. ACM.
15 xxvii Wang, Y., Lim, E.-P., & Hwang, S.-Y. (2003). On mining group patterns of mobile users. The 14th International Conference on Database and Expert Systems Applications - DEXA pp Prague, Czech Republic. Springer. Wang, Y., Lim, E.-P., & Hwang, S.-Y. (2004). Efficient group pattern mining using data summarization. The 9th International Conference on Database Systems for Advanced Applications - DASFAA pp Jeju Island, Korea. Springer. Wang, Y., Lim, E.-P., & Hwang, S.-Y. (2006). Efficient mining of group patterns from user movement data. Data & Knowledge Engineering, 57, doi: /j.datak Wang, Y., Lim, E.-P., & Hwang, S.-Y. (2008). Efficient algorithms for mining maximal valid groups. The International Journal on Very Large Data Bases -. The VLDB Journal, 17, doi: / s
Where Next? Data Mining Techniques and Challenges for Trajectory Prediction. Slides credit: Layla Pournajaf
Where Next? Data Mining Techniques and Challenges for Trajectory Prediction Slides credit: Layla Pournajaf o Navigational services. o Traffic management. o Location-based advertising. Source: A. Monreale,
More informationMobility Data Mining. Mobility data Analysis Foundations
Mobility Data Mining Mobility data Analysis Foundations MDA, 2015 Trajectory Clustering T-clustering Trajectories are grouped based on similarity Several possible notions of similarity Start/End points
More informationTRAJECTORY PATTERN MINING
TRAJECTORY PATTERN MINING Fosca Giannotti, Micro Nanni, Dino Pedreschi, Martha Axiak Marco Muscat Introduction 2 Nowadays data on the spatial and temporal location is objects is available. Gps, GSM towers,
More informationHidden Markov Models. Slides adapted from Joyce Ho, David Sontag, Geoffrey Hinton, Eric Xing, and Nicholas Ruozzi
Hidden Markov Models Slides adapted from Joyce Ho, David Sontag, Geoffrey Hinton, Eric Xing, and Nicholas Ruozzi Sequential Data Time-series: Stock market, weather, speech, video Ordered: Text, genes Sequential
More informationTrajectory analysis. Ivan Kukanov
Trajectory analysis Ivan Kukanov Joensuu, 2014 Semantic Trajectory Mining for Location Prediction Josh Jia-Ching Ying Tz-Chiao Weng Vincent S. Tseng Taiwan Wang-Chien Lee Wang-Chien Lee USA Copyright 2011
More informationOLAP for Trajectories
OLAP for Trajectories Oliver Baltzer 1, Frank Dehne 2, Susanne Hambrusch 3, and Andrew Rau-Chaplin 1 1 Dalhousie University, Halifax, Canada obaltzer@cs.dal.ca, arc@cs.dal.ca http://www.cs.dal.ca/~arc
More informationA Joint approach of Mining Trajectory Patterns according to Various Chronological Firmness
2016 IJSRSET Volume 2 Issue 3 Print ISSN : 2395-1990 Online ISSN : 2394-4099 Themed Section: Engineering and Technology A Joint approach of Mining Trajectory Patterns according to Various Chronological
More informationMobility Data Management & Exploration
Mobility Data Management & Exploration Ch. 07. Mobility Data Mining and Knowledge Discovery Nikos Pelekis & Yannis Theodoridis InfoLab University of Piraeus Greece infolab.cs.unipi.gr v.2014.05 Chapter
More informationMining Frequent Trajectory Using FP-tree in GPS Data
Journal of Computational Information Systems 9: 16 (2013) 6555 6562 Available at http://www.jofcis.com Mining Frequent Trajectory Using FP-tree in GPS Data Junhuai LI 1,, Jinqin WANG 1, Hailing LIU 2,
More informationDetect tracking behavior among trajectory data
Detect tracking behavior among trajectory data Jianqiu Xu, Jiangang Zhou Nanjing University of Aeronautics and Astronautics, China, jianqiu@nuaa.edu.cn, jiangangzhou@nuaa.edu.cn Abstract. Due to the continuing
More informationSpatiotemporal Access to Moving Objects. Hao LIU, Xu GENG 17/04/2018
Spatiotemporal Access to Moving Objects Hao LIU, Xu GENG 17/04/2018 Contents Overview & applications Spatiotemporal queries Movingobjects modeling Sampled locations Linear function of time Indexing structure
More informationRoute Pattern Mining From Personal Trajectory Data *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 31, 147-164 (2015) Route Pattern Mining From Personal Trajectory Data * MINGQI LV 1, YINGLONG LI 1, ZHENMING YUAN 2 AND QIHUI WANG 2 1 College of Computer
More informationVoronoi-based Trajectory Search Algorithm for Multi-locations in Road Networks
Journal of Computational Information Systems 11: 10 (2015) 3459 3467 Available at http://www.jofcis.com Voronoi-based Trajectory Search Algorithm for Multi-locations in Road Networks Yu CHEN, Jian XU,
More informationHotspot District Trajectory Prediction *
Hotspot District Trajectory Prediction * Hongjun Li 1,2, Changjie Tang 1, Shaojie Qiao 3, Yue Wang 1, Ning Yang 1, and Chuan Li 1 1 Institute of Database and Knowledge Engineering, School of Computer Science,
More informationPSON: A Parallelized SON Algorithm with MapReduce for Mining Frequent Sets
2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming PSON: A Parallelized SON Algorithm with MapReduce for Mining Frequent Sets Tao Xiao Chunfeng Yuan Yihua Huang Department
More informationCOMPARISON OF DENSITY-BASED CLUSTERING ALGORITHMS
COMPARISON OF DENSITY-BASED CLUSTERING ALGORITHMS Mariam Rehman Lahore College for Women University Lahore, Pakistan mariam.rehman321@gmail.com Syed Atif Mehdi University of Management and Technology Lahore,
More informationUnderstanding Rule Behavior through Apriori Algorithm over Social Network Data
Global Journal of Computer Science and Technology Volume 12 Issue 10 Version 1.0 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals Inc. (USA) Online ISSN: 0975-4172
More informationFosca Giannotti et al,.
Trajectory Pattern Mining Fosca Giannotti et al,. - Presented by Shuo Miao Conference on Knowledge discovery and data mining, 2007 OUTLINE 1. Motivation 2. T-Patterns: definition 3. T-Patterns: the approach(es)
More informationA Framework for Trajectory Data Preprocessing for Data Mining
A Framework for Trajectory Data Preprocessing for Data Mining Luis Otavio Alvares, Gabriel Oliveira, Vania Bogorny Instituto de Informatica Universidade Federal do Rio Grande do Sul Porto Alegre Brazil
More informationPredicting the Next Location Change and Time of Change for Mobile Phone Users
Predicting the Next Location Change and Time of Change for Mobile Phone Users Mert Ozer, Ilkcan Keles, İsmail Hakki Salih Ergut Toroslu, Pinar Karagoz Avealabs, Avea Technology Center Computer Engineering
More informationMining Quantitative Association Rules on Overlapped Intervals
Mining Quantitative Association Rules on Overlapped Intervals Qiang Tong 1,3, Baoping Yan 2, and Yuanchun Zhou 1,3 1 Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China {tongqiang,
More informationA System for Discovering Regions of Interest from Trajectory Data
A System for Discovering Regions of Interest from Trajectory Data Muhammad Reaz Uddin, Chinya Ravishankar, and Vassilis J. Tsotras University of California, Riverside, CA, USA {uddinm,ravi,tsotras}@cs.ucr.edu
More informationRoute pattern mining from personal trajectory data *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING XX, XXX-XXX (201X) Route pattern mining from personal trajectory data * MINGQI LV 1, ZHENMING YUAN 1, QIHUI WANG 1 1 Institute of Information Science and
More informationAn Improved Apriori Algorithm for Association Rules
Research article An Improved Apriori Algorithm for Association Rules Hassan M. Najadat 1, Mohammed Al-Maolegi 2, Bassam Arkok 3 Computer Science, Jordan University of Science and Technology, Irbid, Jordan
More informationAn Efficient Clustering Algorithm for Moving Object Trajectories
3rd International Conference on Computational Techniques and Artificial Intelligence (ICCTAI'214) Feb. 11-12, 214 Singapore An Efficient Clustering Algorithm for Moving Object Trajectories Hnin Su Khaing,
More informationOn-Line Discovery of Flock Patterns in Spatio-Temporal Data
On-Line Discovery of Floc Patterns in Spatio-Temporal Data Marcos R. Vieira University of California Riverside, CA 97, USA mvieira@cs.ucr.edu Peto Baalov ESRI Redlands, CA 97, USA pbaalov@esri.com Vassilis
More informationMining Dense Trajectory Pattern Regions of Various Temporal Tightness Ms. Sumaiya I. Shaikh 1, Prof. K. N. Shedge 2
Mining Dense Trajectory Pattern Regions of Various Temporal Tightness Ms. Sumaiya I. Shaikh 1, Prof. K. N. Shedge 2 1 Ms.Sumaiya I. Shaikh, ComputerEngineering Department,SVIT, Chincholi, Nashik, Maharashtra,
More informationMining Trajectory Patterns Using Hidden Markov Models
Mining Trajectory Patterns Using Hidden Markov Models Hoyoung Jeung, Heng Tao Shen, and Xiaofang Zhou National ICT Australia (NICTA), Brisbane, QLD, Australia School of Information Technology and Electrical
More informationClustering Spatio-Temporal Patterns using Levelwise Search
Clustering Spatio-Temporal Patterns using Levelwise Search Abhishek Sharma, Raj Bhatnagar University of Cincinnati Cincinnati, OH, 45221 sharmaak,rbhatnag@ececs.uc.edu Figure 1: Spatial Grids at Successive
More informationA Novel Algorithm for Associative Classification
A Novel Algorithm for Associative Classification Gourab Kundu 1, Sirajum Munir 1, Md. Faizul Bari 1, Md. Monirul Islam 1, and K. Murase 2 1 Department of Computer Science and Engineering Bangladesh University
More informationDiscovery of Association Rules in Temporal Databases 1
Discovery of Association Rules in Temporal Databases 1 Abdullah Uz Tansel 2 and Necip Fazil Ayan Department of Computer Engineering and Information Science Bilkent University 06533, Ankara, Turkey {atansel,
More informationA NEW METHOD FOR FINDING SIMILAR PATTERNS IN MOVING BODIES
A NEW METHOD FOR FINDING SIMILAR PATTERNS IN MOVING BODIES Prateek Kulkarni Goa College of Engineering, India kvprateek@gmail.com Abstract: An important consideration in similarity-based retrieval of moving
More informationIntroduction to Trajectory Clustering. By YONGLI ZHANG
Introduction to Trajectory Clustering By YONGLI ZHANG Outline 1. Problem Definition 2. Clustering Methods for Trajectory data 3. Model-based Trajectory Clustering 4. Applications 5. Conclusions 1 Problem
More informationDiscovering Frequent Mobility Patterns on Moving Object Data
Discovering Frequent Mobility Patterns on Moving Object Data Ticiana L. Coelho da Silva Federal University of Ceará, Brazil ticianalc@ufc.br José A. F. de Macêdo Federal University of Ceará, Brazil jose.macedo@lia.ufc.br
More informationEfficient distributed computation of human mobility aggregates through User Mobility Profiles
Efficient distributed computation of human mobility aggregates through User Mobility Profiles Mirco Nanni, Roberto Trasarti, Giulio Rossetti, Dino Pedreschi KDD Lab - ISTI CNR Pisa, Italy name.surname@isti.cnr.it
More informationSimilarity-based Analysis for Trajectory Data
Similarity-based Analysis for Trajectory Data Kevin Zheng 25/04/2014 DASFAA 2014 Tutorial 1 Outline Background What is trajectory Where do they come from Why are they useful Characteristics Trajectory
More informationOSM-SVG Converting for Open Road Simulator
OSM-SVG Converting for Open Road Simulator Rajashree S. Sokasane, Kyungbaek Kim Department of Electronics and Computer Engineering Chonnam National University Gwangju, Republic of Korea sokasaners@gmail.com,
More informationMobility Data Management and Exploration: Theory and Practice
Mobility Data Management and Exploration: Theory and Practice Chapter 4 -Mobility data management at the physical level Nikos Pelekis & Yannis Theodoridis InfoLab, University of Piraeus, Greece infolab.cs.unipi.gr
More informationSA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases
SA-IFIM: Incrementally Mining Frequent Itemsets in Update Distorted Databases Jinlong Wang, Congfu Xu, Hongwei Dan, and Yunhe Pan Institute of Artificial Intelligence, Zhejiang University Hangzhou, 310027,
More informationMining Representative Movement Patterns through Compression
Mining Representative Movement Patterns through Compression Phan Nhat Hai, Dino Ienco, Pascal Poncelet, and Maguelonne Teisseire 1 IRSTEA Montpellier, UMR TETIS - 34093 Montpellier, France {nhat-hai.phan,dino.ienco,maguelonne.teisseire}@teledetection.fr
More informationImproved Frequent Pattern Mining Algorithm with Indexing
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661,p-ISSN: 2278-8727, Volume 16, Issue 6, Ver. VII (Nov Dec. 2014), PP 73-78 Improved Frequent Pattern Mining Algorithm with Indexing Prof.
More informationTransforming Quantitative Transactional Databases into Binary Tables for Association Rule Mining Using the Apriori Algorithm
Transforming Quantitative Transactional Databases into Binary Tables for Association Rule Mining Using the Apriori Algorithm Expert Systems: Final (Research Paper) Project Daniel Josiah-Akintonde December
More informationMining Temporal Association Rules in Network Traffic Data
Mining Temporal Association Rules in Network Traffic Data Guojun Mao Abstract Mining association rules is one of the most important and popular task in data mining. Current researches focus on discovering
More informationDiscovery of Multi-level Association Rules from Primitive Level Frequent Patterns Tree
Discovery of Multi-level Association Rules from Primitive Level Frequent Patterns Tree Virendra Kumar Shrivastava 1, Parveen Kumar 2, K. R. Pardasani 3 1 Department of Computer Science & Engineering, Singhania
More informationMining Frequent Itemsets for data streams over Weighted Sliding Windows
Mining Frequent Itemsets for data streams over Weighted Sliding Windows Pauray S.M. Tsai Yao-Ming Chen Department of Computer Science and Information Engineering Minghsin University of Science and Technology
More informationAn Evolutionary Algorithm for Mining Association Rules Using Boolean Approach
An Evolutionary Algorithm for Mining Association Rules Using Boolean Approach ABSTRACT G.Ravi Kumar 1 Dr.G.A. Ramachandra 2 G.Sunitha 3 1. Research Scholar, Department of Computer Science &Technology,
More informationA Novel Method for Activity Place Sensing Based on Behavior Pattern Mining Using Crowdsourcing Trajectory Data
A Novel Method for Activity Place Sensing Based on Behavior Pattern Mining Using Crowdsourcing Trajectory Data Wei Yang 1, Tinghua Ai 1, Wei Lu 1, Tong Zhang 2 1 School of Resource and Environment Sciences,
More informationClustering Algorithm for Network Constraint Trajectories
Clustering Algorithm for Network Constraint Trajectories Ahmed Kharrat 1, Iulian Sandu Popa 1 Karine Zeitouni 1, Sami Faiz 2, 1 PRiSM Laboratory, University of Versailles 45, avenue des Etats-Unis - 78035
More informationPrivacy-Preserving of Check-in Services in MSNS Based on a Bit Matrix
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 15, No 2 Sofia 2015 Print ISSN: 1311-9702; Online ISSN: 1314-4081 DOI: 10.1515/cait-2015-0032 Privacy-Preserving of Check-in
More informationSEQUENTIAL PATTERN MINING FROM WEB LOG DATA
SEQUENTIAL PATTERN MINING FROM WEB LOG DATA Rajashree Shettar 1 1 Associate Professor, Department of Computer Science, R. V College of Engineering, Karnataka, India, rajashreeshettar@rvce.edu.in Abstract
More informationA mining method for tracking changes in temporal association rules from an encoded database
A mining method for tracking changes in temporal association rules from an encoded database Chelliah Balasubramanian *, Karuppaswamy Duraiswamy ** K.S.Rangasamy College of Technology, Tiruchengode, Tamil
More informationAC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery
: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery Hong Cheng Philip S. Yu Jiawei Han University of Illinois at Urbana-Champaign IBM T. J. Watson Research Center {hcheng3, hanj}@cs.uiuc.edu,
More informationPerformance Analysis of Apriori Algorithm with Progressive Approach for Mining Data
Performance Analysis of Apriori Algorithm with Progressive Approach for Mining Data Shilpa Department of Computer Science & Engineering Haryana College of Technology & Management, Kaithal, Haryana, India
More informationImplementation and Experiments of Frequent GPS Trajectory Pattern Mining Algorithms
DEIM Forum 213 A5-3 Implementation and Experiments of Frequent GPS Trajectory Pattern Abstract Mining Algorithms Xiaoliang GENG, Hiroki ARIMURA, and Takeaki UNO Graduate School of Information Science and
More informationConcurrent Processing of Frequent Itemset Queries Using FP-Growth Algorithm
Concurrent Processing of Frequent Itemset Queries Using FP-Growth Algorithm Marek Wojciechowski, Krzysztof Galecki, Krzysztof Gawronek Poznan University of Technology Institute of Computing Science ul.
More informationPartSpan: Parallel Sequence Mining of Trajectory Patterns
Fifth International Conference on Fuzzy Systems and Knowledge Discovery PartSpan: Parallel Sequence Mining of Trajectory Patterns Shaojie Qiao,, Changjie Tang, Shucheng Dai, Mingfang Zhu Jing Peng, Hongjun
More informationMINING CO-LOCATION PATTERNS FROM SPATIAL DATA
MINING CO-LOCATION PATTERNS FROM SPATIAL DATA C. Zhou a,, W. D. Xiao a,b, D. Q. Tang a,b a Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology,
More informationarxiv: v1 [cs.db] 9 Mar 2018
TRAJEDI: Trajectory Dissimilarity Pedram Gharani 1, Kenrick Fernande 2, Vineet Raghu 2, arxiv:1803.03716v1 [cs.db] 9 Mar 2018 Abstract The vast increase in our ability to obtain and store trajectory data
More informationPeriodic Pattern Mining Based on GPS Trajectories
Periodic Pattern Mining Based on GPS Trajectories iaopeng Chen 1,a, Dianxi Shi 2,b, Banghui Zhao 3,c and Fan Liu 4,d 1,2,3,4 National Laboratory for Parallel and Distributed Processing, School of Computer,
More informationChapter 1, Introduction
CSI 4352, Introduction to Data Mining Chapter 1, Introduction Young-Rae Cho Associate Professor Department of Computer Science Baylor University What is Data Mining? Definition Knowledge Discovery from
More informationFeature Extraction in Time Series
Feature Extraction in Time Series Instead of directly working with the entire time series, we can also extract features from them Many feature extraction techniques exist that basically follow two different
More informationComparative Study of Subspace Clustering Algorithms
Comparative Study of Subspace Clustering Algorithms S.Chitra Nayagam, Asst Prof., Dept of Computer Applications, Don Bosco College, Panjim, Goa. Abstract-A cluster is a collection of data objects that
More informationPublishing CitiSense Data: Privacy Concerns and Remedies
Publishing CitiSense Data: Privacy Concerns and Remedies Kapil Gupta Advisor : Prof. Bill Griswold 1 Location Based Services Great utility of location based services data traffic control, mobility management,
More informationData Stream Clustering Using Micro Clusters
Data Stream Clustering Using Micro Clusters Ms. Jyoti.S.Pawar 1, Prof. N. M.Shahane. 2 1 PG student, Department of Computer Engineering K. K. W. I. E. E. R., Nashik Maharashtra, India 2 Assistant Professor
More informationSalah Alghyaline, Jun-Wei Hsieh, and Jim Z. C. Lai
EFFICIENTLY MINING FREQUENT ITEMSETS IN TRANSACTIONAL DATABASES This article has been peer reviewed and accepted for publication in JMST but has not yet been copyediting, typesetting, pagination and proofreading
More informationFaster Clustering with DBSCAN
Faster Clustering with DBSCAN Marzena Kryszkiewicz and Lukasz Skonieczny Institute of Computer Science, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland Abstract. Grouping data
More informationProduct presentations can be more intelligently planned
Association Rules Lecture /DMBI/IKI8303T/MTI/UI Yudho Giri Sucahyo, Ph.D, CISA (yudho@cs.ui.ac.id) Faculty of Computer Science, Objectives Introduction What is Association Mining? Mining Association Rules
More informationGraph Based Approach for Finding Frequent Itemsets to Discover Association Rules
Graph Based Approach for Finding Frequent Itemsets to Discover Association Rules Manju Department of Computer Engg. CDL Govt. Polytechnic Education Society Nathusari Chopta, Sirsa Abstract The discovery
More informationCS570 Introduction to Data Mining
CS570 Introduction to Data Mining Frequent Pattern Mining and Association Analysis Cengiz Gunay Partial slide credits: Li Xiong, Jiawei Han and Micheline Kamber George Kollios 1 Mining Frequent Patterns,
More informationEfficient ERP Distance Measure for Searching of Similar Time Series Trajectories
IJIRST International Journal for Innovative Research in Science & Technology Volume 3 Issue 10 March 2017 ISSN (online): 2349-6010 Efficient ERP Distance Measure for Searching of Similar Time Series Trajectories
More informationClustering Algorithms for Data Stream
Clustering Algorithms for Data Stream Karishma Nadhe 1, Prof. P. M. Chawan 2 1Student, Dept of CS & IT, VJTI Mumbai, Maharashtra, India 2Professor, Dept of CS & IT, VJTI Mumbai, Maharashtra, India Abstract:
More informationMining Recent Frequent Itemsets in Data Streams with Optimistic Pruning
Mining Recent Frequent Itemsets in Data Streams with Optimistic Pruning Kun Li 1,2, Yongyan Wang 1, Manzoor Elahi 1,2, Xin Li 3, and Hongan Wang 1 1 Institute of Software, Chinese Academy of Sciences,
More informationCity, University of London Institutional Repository
City Research Online City, University of London Institutional Repository Citation: Andrienko, N., Andrienko, G., Fuchs, G., Rinzivillo, S. & Betz, H-D. (2015). Real Time Detection and Tracking of Spatial
More informationFinding Local and Periodic Association Rules from Fuzzy Temporal Data
Finding Local and Periodic Association Rules from Fuzzy Temporal Data F. A. Mazarbhuiya, M. Shenify, Md. Husamuddin College of Computer Science and IT Albaha University, Albaha, KSA fokrul_2005@yahoo.com
More informationC-NBC: Neighborhood-Based Clustering with Constraints
C-NBC: Neighborhood-Based Clustering with Constraints Piotr Lasek Chair of Computer Science, University of Rzeszów ul. Prof. St. Pigonia 1, 35-310 Rzeszów, Poland lasek@ur.edu.pl Abstract. Clustering is
More informationGeT_Move: An Efficient and Unifying Spatio-Temporal Pattern Mining Algorithm for Moving Objects
GeT_Move: An Efficient and Unifying Spatio-Temporal Pattern Mining Algorithm for Moving Objects Phan Nhat Hai LIRMM - Univ. Montpellier 2 nhathai.phan@teledetection.fr Pascal Poncelet LIRMM - Univ. Montpellier
More informationA Spatio-temporal Access Method based on Snapshots and Events
A Spatio-temporal Access Method based on Snapshots and Events Gilberto Gutiérrez R Universidad del Bío-Bío / Universidad de Chile Blanco Encalada 2120, Santiago / Chile ggutierr@dccuchilecl Andrea Rodríguez
More informationWeb page recommendation using a stochastic process model
Data Mining VII: Data, Text and Web Mining and their Business Applications 233 Web page recommendation using a stochastic process model B. J. Park 1, W. Choi 1 & S. H. Noh 2 1 Computer Science Department,
More informationTo Enhance Projection Scalability of Item Transactions by Parallel and Partition Projection using Dynamic Data Set
To Enhance Scalability of Item Transactions by Parallel and Partition using Dynamic Data Set Priyanka Soni, Research Scholar (CSE), MTRI, Bhopal, priyanka.soni379@gmail.com Dhirendra Kumar Jha, MTRI, Bhopal,
More informationUpper bound tighter Item caps for fast frequent itemsets mining for uncertain data Implemented using splay trees. Shashikiran V 1, Murali S 2
Volume 117 No. 7 2017, 39-46 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu Upper bound tighter Item caps for fast frequent itemsets mining for uncertain
More informationGenerating Cross level Rules: An automated approach
Generating Cross level Rules: An automated approach Ashok 1, Sonika Dhingra 1 1HOD, Dept of Software Engg.,Bhiwani Institute of Technology, Bhiwani, India 1M.Tech Student, Dept of Software Engg.,Bhiwani
More informationUsing Association Rules for Better Treatment of Missing Values
Using Association Rules for Better Treatment of Missing Values SHARIQ BASHIR, SAAD RAZZAQ, UMER MAQBOOL, SONYA TAHIR, A. RAUF BAIG Department of Computer Science (Machine Intelligence Group) National University
More informationYunfeng Zhang 1, Huan Wang 2, Jie Zhu 1 1 Computer Science & Engineering Department, North China Institute of Aerospace
[Type text] [Type text] [Type text] ISSN : 0974-7435 Volume 10 Issue 20 BioTechnology 2014 An Indian Journal FULL PAPER BTAIJ, 10(20), 2014 [12526-12531] Exploration on the data mining system construction
More informationLife and motion configuration
Life and motion configuration Pierre Hallot, Roland Billen 1 1 Geomatics Unit, University of Liège, 17 allée du 6 Août, B-4000 Liège, Belgium {P.Hallot, rbillen}@ulg.ac.be 1 INTRODUCTION Spatio-temporality
More informationFast Discovery of Sequential Patterns Using Materialized Data Mining Views
Fast Discovery of Sequential Patterns Using Materialized Data Mining Views Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzewicz Poznan University of Technology Institute of Computing Science ul. Piotrowo
More informationAN IMPROVED DENSITY BASED k-means ALGORITHM
AN IMPROVED DENSITY BASED k-means ALGORITHM Kabiru Dalhatu 1 and Alex Tze Hiang Sim 2 1 Department of Computer Science, Faculty of Computing and Mathematical Science, Kano University of Science and Technology
More informationWeb Page Classification using FP Growth Algorithm Akansha Garg,Computer Science Department Swami Vivekanad Subharti University,Meerut, India
Web Page Classification using FP Growth Algorithm Akansha Garg,Computer Science Department Swami Vivekanad Subharti University,Meerut, India Abstract - The primary goal of the web site is to provide the
More informationMaterialized Data Mining Views *
Materialized Data Mining Views * Tadeusz Morzy, Marek Wojciechowski, Maciej Zakrzewicz Poznan University of Technology Institute of Computing Science ul. Piotrowo 3a, 60-965 Poznan, Poland tel. +48 61
More informationDS504/CS586: Big Data Analytics Data Management Prof. Yanhua Li
Welcome to DS504/CS586: Big Data Analytics Data Management Prof. Yanhua Li Time: 6:00pm 8:50pm R Location: KH 116 Fall 2017 First Grading for Reading Assignment Weka v 6 weeks v https://weka.waikato.ac.nz/dataminingwithweka/preview
More informationGraph-based Analysis of City-wide Traffic Dynamics using Time-evolving Graphs of Trajectory Data
Australasian Transport Research Forum 2016 Proceedings 16 18 November 2016, Melbourne, Australia Publication website: http://www.atrf.info Graph-based Analysis of City-wide Traffic Dynamics using Time-evolving
More informationBalanced COD-CLARANS: A Constrained Clustering Algorithm to Optimize Logistics Distribution Network
Advances in Intelligent Systems Research, volume 133 2nd International Conference on Artificial Intelligence and Industrial Engineering (AIIE2016) Balanced COD-CLARANS: A Constrained Clustering Algorithm
More informationBest Keyword Cover Search
Vennapusa Mahesh Kumar Reddy Dept of CSE, Benaiah Institute of Technology and Science. Best Keyword Cover Search Sudhakar Babu Pendhurthi Assistant Professor, Benaiah Institute of Technology and Science.
More informationAn Algorithm for Mining Frequent Itemsets from Library Big Data
JOURNAL OF SOFTWARE, VOL. 9, NO. 9, SEPTEMBER 2014 2361 An Algorithm for Mining Frequent Itemsets from Library Big Data Xingjian Li lixingjianny@163.com Library, Nanyang Institute of Technology, Nanyang,
More informationAnalysis and Extensions of Popular Clustering Algorithms
Analysis and Extensions of Popular Clustering Algorithms Renáta Iváncsy, Attila Babos, Csaba Legány Department of Automation and Applied Informatics and HAS-BUTE Control Research Group Budapest University
More informationFramework of Frequently Trajectory Extraction from AIS Data
Framework of Frequently Trajectory Extraction from AIS Data 1 State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications Beijing,100876, China E-mail:
More informationMINING CTMSPS IN LBS
981 MINING CTMSPS IN LBS Pooja Mauskar*, Manisha Naoghare** *Department of Computer Engineering, SVIT, Chincholi ** Department of Computer Engineering, SVIT, Chincholi ABSTRACT Increasing popularity of
More informationData Clustering Hierarchical Clustering, Density based clustering Grid based clustering
Data Clustering Hierarchical Clustering, Density based clustering Grid based clustering Team 2 Prof. Anita Wasilewska CSE 634 Data Mining All Sources Used for the Presentation Olson CF. Parallel algorithms
More informationInternational Journal Of Engineering And Computer Science ISSN: Volume 5 Issue 11 Nov. 2016, Page No.
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 2319-7242 Volume 5 Issue 11 Nov. 2016, Page No. 19054-19062 Review on K-Mode Clustering Antara Prakash, Simran Kalera, Archisha
More informationOptimization using Ant Colony Algorithm
Optimization using Ant Colony Algorithm Er. Priya Batta 1, Er. Geetika Sharmai 2, Er. Deepshikha 3 1Faculty, Department of Computer Science, Chandigarh University,Gharaun,Mohali,Punjab 2Faculty, Department
More informationDevelopment of Efficient & Optimized Algorithm for Knowledge Discovery in Spatial Database Systems
Development of Efficient & Optimized Algorithm for Knowledge Discovery in Spatial Database Systems Kapil AGGARWAL, India Key words: KDD, SDBS, neighborhood graph, neighborhood path, neighborhood index
More information