IPASJ International Journal of Information Technology (IIJIT)

Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm

A Publisher for Research Motivation ........ Email:editoriijit@ipasj.org
Volume 6, Issue 9, September 2018 ISSN 2321-5976

MINING USER MOVEMENT BEHAVIOUR

PATTERNS IN A MOBILE SERVICE
ENVIRONMENT
1
Dr. K.S.Rathnamala, 2Ms. N.Chithra
1
Associate Professor, S.R.College,Trichy, India.
2
M.Sc., S.R.College,Trichy, India.

ABSTRACT
Mobile service systems offer mobile users useful information ubiquitously via mobile devices. Based on changeable user
movement behavior patterns (UMBPs), mobile service systems have the capability of effectively mining a special request from
abundant data. In this paper, UMBPs are studied in terms of the problem of mining matching mobile access patterns based on
joining the following four kinds of characteristics, U, L, T, and S, where U is the mobile user, L is the movement location, T is
the dwell time in the timestamp and S is the service request. By introducing standard graph-matching algorithms along with
the primitives of a database management system, which comprises grouping, sorting and joining, these joint operations are
defined. Moreover, by mining the associated structure via maximum weight bipartite graph matching, a prediction
mechanism, based on the model of UMBPs, is utilized to find strong relationships among U, L, T and S.
Usage of Weblogs is very limited and it is based on their location in the existing system; but, it is tracked on service usage in
the proposed system. Match Joins using Max Flows are used in the new system which helps to compress the input relations by
using group-by operation leads conditions, using synthetically generated , is introduced. Finally, performance studies are
conducted to show that, in terms of execution efficiency and scalability, the proposed procedures produced excellent
performance results.
Keywords: U, L, T,S UMBPS, mobile services, mobility prediction, mobile access patterns, Mobile Access Pattern
Matching.
1. Introduction
The process of mining mobile user movement behavior patterns is performed by initially analyzing the mobile user
input data. This data is analyzed and the essential data is filtered out from the noisy data. This data is processed and is
converted to location based data by combining it together with the timestamp details. The next phase deals with
generating the service request details. This process is performed by adding the corresponding service details. By
performing cross join operation on these data (mobile user, location, service and timestamp) we obtain the raw data
about the entire user details. This raw data functions as the base for constructing the mobile user graph. Weight value
analysis is performed on this graph to obtain mobile user graph with minimal connections. Each user graph represents
one user’s complete information. This graph is decoded and forms the base data for performing pattern matching. Rule
generation is performed with this data starting with a single item set, moving towards n item sets. The process is
stopped once the resultant candidate set returns a null value. A graph is constructed for each of these item sets and
association rule mining is performed on the graph. This provides the mobile user behavior pattern corresponding to
each mobile user.

2. Modules
i) User data analysis. Each mobile user represents a physical person who carries a mobile device that has the
capability of receiving services from the mobile environment, and is capable of being identified and tracked. The

Volume 6, Issue 9, September 2018 Page 6

 IPASJ International Journal of Information Technology (IIJIT)
Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm
A Publisher for Research Motivation ........ Email:editoriijit@ipasj.org
Volume 6, Issue 9, September 2018 ISSN 2321-5976

mobile user movement locations are sampled over a long-term historical data, the movements of the mobile user are
tracked as an n-length sequence of spatial locations. The UMD is formed by the mobile user and the time instance of
the mobile user visiting a specific location. Each cell in the database gives a spatial coordinate and an arrival time that
represents the arrival of a mobile user at an interesting location. This is the raw data that is used for conversion to other
formats and for the analysis of the provided data.

ii) LMD Conversion with Timestamp. The goal of converting the UMD to the LMD is to identify the locations where
the mobile users have associated themselves with the particular location in which they are interested. That is, mobile
users stay at an interesting location longer than the maximum duration. To transform the UMD to the LMD, a
predefined timestamp table needs to be given in advance. Here, 24 h in a day are divided into 48 time slots, and each
time slot is set to 30 min. Two special locations used to identify the regularities of the visiting locations are the generic
location and the interesting location. The generic location is a collective term for one or more interesting locations, and
the interesting location is a subset of the generic location. The interesting location can be defined as the user ui staying
at a location li longer than the maximum duration

iii) Service building. The set of services requested by mobile users is taken as the base data. Each element represents
an individual service ID. In addition, an optimum time is set for each service requested. If the mobile users use the
acquired service longer than the optimum time, the service is regarded as an interesting or useful information service.

iv) Weight value analysis. The weight value w is used to identify the importance of an extracted pattern. The w is
highly dependent on three impact factors, the weight values of match Joins U ⋈ L, L ⋈ T and T ⋈ S, where the symbol
indicates the match join operator, which is defined as follows:

 LC1 LC2 LCn 

,
 Maxf Maxf ,...,
Maxf 
weight value of U ⋈ L =

 Ts1 Ts2 Tsm 
weight value of L ⋈ T =  , ,..., 
d d
 Max Max d Max 

 Tr1 Tr2 Trl 

weight value of T ⋈ S =  , ,..., 
Ot
 1 Ot 2 Ot l 
LCi the count of arriving at Location li for each user.
Maxf the maximum LCi for each user.
Tsi the duration a mobile user dwells at location li.
dMax the maximum Tsi.
Tri the duration of requested service at each location li.
Oti the given optimum time of using the i th service.
Thus, the w-join can be defined as the relational join of
U ⋈w L ⋈w T ⋈w S.

v) Mobile Access Pattern Matching. Mining matching UMBPs can be comprehended by operating on relational flows
to generate the max flow of match joins by means of MJMF. The transformation from a matching problem to the max
flow problem can be divided into three phases: grouping nodes, building the reduced graph, and exercising the max

Volume 6, Issue 9, September 2018 Page 7

 IPASJ International Journal of Information Technology (IIJIT)
Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm
A Publisher for Research Motivation ........ Email:editoriijit@ipasj.org
Volume 6, Issue 9, September 2018 ISSN 2321-5976

flow algorithm. The first step in the grouping node is to find tuples whose relations have different weight values on the
join columns. Second, the weight values of match joins U ⋈ L, L ⋈ T and T ⋈ S are calculated. With the weight
values and the designated min_sup value, the RI can be carried out to construct the reduced max flow graph.

The steps of the algorithm used for performing match join are as follows:

Step 1: Perform an external sort of four input relations on all attributes involved with w.
Step 2: Iterate through the relations and generate the next group G of the tuples of U, L, T, and S.
Step 3: Within G, combine the four subsets of U, L, T, and S tuples.
Compared to the operation of combine-join, the iterators operating in the table can be advanced as soon as matches are
found.
To construct a MJSC graph from raw data, four layers are assigned in advance, which correspond to Ui, Li, Tm, and Sn,
respectively.

vi) Associated tree mining. The approach of mining frequent associated tree patterns can be illustrated in the
following five steps:

Step 1: The max flow database DM is scanned to generate a set of frequent 1-tree candidate patterns. If the candidate
pattern cannot meet the min_sup value, it will be pruned.
Step 2: The match join operation is employed to generate frequent 2-tree candidate patterns.
Step 3: The support of each candidate is counted and the infrequent patterns are pruned.
Step 4: The 3-tree candidate patterns are generated to enumerate all the relational patterns, which include the parent
child and siblings, by the match join operation.
Step 5: Candidate patterns of (k + 1)-trees are repeatedly generated until a set of frequent (k + 1)-trees is empty or no
candidate is generated.
Each tuple represents the max user-location time-service flow that is used to build frequent k-trees. In addition, a strong
associated tree of each frequent k-tree can be identified based on the node count from the associated trees. With the aid
of a strong associated tree, the mining of the match join of associated trees can be applied to predict the mobile user’s
behavior pattern level 0:

Volume 6, Issue 9, September 2018 Page 8

 IPASJ International Journal of Information Technology (IIJIT)
Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm
A Publisher for Research Motivation ........ Email:editoriijit@ipasj.org
Volume 6, Issue 9, September 2018 ISSN 2321-5976

Level 1: graph construction

Level 1: pattern matching

4. Conclusion
Consequently, the optimum patterns of each mobile user’s movement locations with requested services in different time
intervals are obtained. Thus, for the purpose of prediction, the mined results are useful in predicting the movement
behaviour patterns of users. This paper aimed at mining mobile UMBPs such that movement locations associated with
suitable services could be predicted and recommended

Volume 6, Issue 9, September 2018 Page 9

 IPASJ International Journal of Information Technology (IIJIT)
Web Site: http://www.ipasj.org/IIJIT/IIJIT.htm
A Publisher for Research Motivation ........ Email:editoriijit@ipasj.org
Volume 6, Issue 9, September 2018 ISSN 2321-5976

for users.

REFERENCES:
[1]S.Chaudhuri, l.gravano and a.marian,”Optimizing top-k selection queries over multimedia repositories “
[2]U.bellurand R.kulkarni,”Improved matchmaking algorithm for semantic web services based on bipartite graph
matching”
[3] Hyvarinen, A., Karhunen, J., and Oja, E. (20010. Independent Component Analysis. Wiley Inter-science.
[4] Lampinen, J. and Kostiainen, T. (20020. Generative Probability Density Model in the Self-Organizing Map. In
Seiffert and Jain (2002), chapter 4, pages 75-92.
[5] Ultsch, A. Maps for the Visualization of High-Dimensional Data Spaces. In WSOM2003 (2003).

AUTHORS:
1. Associate professor for the past 10 years. She has published 7 papers in international journals and 6 papers in
national journals. Her areas of interests are Big Data Analytics and Wireless communication.
2. A Post Graduate in Computer Science and her area of interests are Web Mining and Mobile Computing.

Volume 6, Issue 9, September 2018 Page 10