See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/324704121

Customized Trip planning using Modified Clustering Algorithm with

Personalized Points of Interests & Association Rule Generation

Article · April 2016

CITATIONS READS

0 208

1 author:

Roopa Venkatakrishnan
Sri Krishna College of Technology
12 PUBLICATIONS   2 CITATIONS   

SEE PROFILE

All content following this page was uploaded by Roopa Venkatakrishnan on 27 April 2018.

The user has requested enhancement of the downloaded file.

 International Review on Computers and Software (I.RE.CO.S.), Vol. 11, N. 3
ISSN 1828-6003 March 2016

Customized Trip Planning Using Modified Clustering Algorithm

with Personalized Points of Interests and Association Rule Generation

D. Sudha, Y. Narasimha Rao, G. Dayanandam, V. Roopa

Abstract – Data mining technologies are widely used to mine the interesting patterns and data
from the huge collections of data. This work is intended to develop and implement an efficient,
economic and customized software for trip plan for final customers. The main functions of this
software are listed in the following. In this itinerary planning system, the users specify source,
destination, days of travel and budget, then the system will generate a set of Points Of Interests
(POIs) for a given destination, so the users can select their customized points of interests and can
plan travels with k-days itinerary. All POIs are considered and ranked based on the users
preference. Nearby POIs are put in the same day itinerary for the effective utilization of the plan.
Inconsistent and incomplete data are removed and the list of POIs will be generated using the
Clustering technique so that users can select their interested POIs. Shortest path will be displayed
once they select their customized POIs. Frequent visits and suggestions for a particular
destination are listed to the customers using Association rule mining technique. Clustering takes
major advantage to compute the data and it has fast processing time. Each cluster holds the
number of countries with the relevant information and the list of points of interests for a specified
cost. With the help of shortest path, users can understand and view what is the travel distance
between the POIs. Users can delete the POIs if they have relatively long distance to visit and
travel. Using the association rule mining technique users can know the frequent visits of a
particular destination, and it helps the system to predict the travelling patterns of the people. In
this work, a customized itinerary planning service is provided, and the users can plan for multiday
itineraries, designed effectively by managing the cost and time to the users. Copyright © 2016
Praise Worthy Prize S.r.l. - All rights reserved.

Keywords: Customized Travel, Clustering, Shortest Path, Association Rule, Multiday Itinerary

Nomenclature The proposed algorithm works efficiently and the cost,

time, space are effectively managed. With this proposed
T Total Amount formulation users can make their customized journey and
∑ Summation enjoy their travel plan. In this work, Data mining
TA Travel Amount techniques, such as association rule mining and
PA POI Amount clustering techniques, are used to discover the users
TR Total Trip Hour traveling patterns and their interests and to implement the
POI Points Of Interest travel plan, satisfying the expectations of users.
PH POI Hour Moreover this implementation will provide the
effective costs to the customers. The used algorithm
partitions the POIs into groups (or clusters). Clusters are
I. Introduction
formed from the specified destination, budget and days
This paper will present an algorithm based on of travel. All the data sources of single day itineraries are
association rule and clustering method to be used for integrated to form multiday itineraries. Inconsistent and
planning a travel with the possibility for the users to incomplete data are removed during preprocessing.
choose the itinerary to follow. Single day itineraries are collected from several
Most travel agencies always suggest the user with destinations and grouped using the cluster technique.
predefined packages. Users cannot suggest their specified The main advantage of clustering is the fast
budget. Thus the existing systems cannot satisfy the computation and identification of outliers outside the
expectation of the customers and the cost and time boundary. In this itinerary planning system, the users can
management are not always efficient for the customers. specify the source, destination, budget and days of travel,
To overcome these disadvantages, the proposed then the system will generate a set of Points of Interests
system is constructed to satisfy the expectations of the (POIs) for each selected destination, indicating also the
users and to make their customized travel plan. shortest path for each POIs.

Copyright © 2016 Praise Worthy Prize S.r.l. - All rights reserved DOI: 10.15866/irecos.v11i3.8389

200
 D. Sudha, Y. Narasimha Rao, G. Dayanandam, V. Roopa
Once the POIs are generated, users can select their
customized POIs for a specified destination and they can
plan travel with k-days itinerary. It is possible also to
view the distance among each chosen POIs. Nearby POIs
will be put in the same day for the time management.
With the help of this route generation, users can cancel
the POI which is relatively long to visit and choose other
POI for their effective utilization of the plan.
Frequent patterns and suggestions are listed using
association rule mining. Association rule helps to find the
users traveling patterns and interests. Users can choose
the most popular POIs visited before by other travellers.
This will provide the ease of use to the customers who
wish to use predefined packages to make their travel plan
instead to make personalized travel plans.
II. Overview
II.1. Problem Statement
In the itinerary planning system, all POIs are
considered and ranked based on the users preference.
Frequent pattern and suggestions are listed to the
customers using associative rules. Single day itineraries
are collected and grouped using the cluster technique.
All the data sources of single day itineraries are
integrated to form multiday itineraries.
Moreover, suggestions and frequent visits will be
listed for the customers. Through this implementation
they can choose their POIs to visit so to satisfy their
expectations selecting the customized points of interests
(POIs) for the specified destination and planning a travel
for N number of days. The database designed for this
work can be used by single users or by tourism operators.
It is structured in tables containing rows and relevant
attributes. Tables are designed for Registration, list of
POI generation, customized POI, adding or removing
POI, route generation, etc.
Attributes are related to other attributes, thus it is easy
to find the relationship among different attributes and the
system can retrieve the data in a faster manner and
present to the users. Both space and time are managed
efficiently. Basically, most of the travel agents allow the
user with a predefined travel plan and with few
destinations. There are so many popular POIs available
for a destination, but the travel systems present only few
popular POIs. With this modified implementation the
system can uncover several POIs and suggest them to the
users. Thus, with this new implementation the
satisfaction of the customers can be achieved.
Moreover the system works in a faster manner by the
modified algorithms.
II.2. System Architecture
In this work, instead of using a predefined budget
indicated by the travel agents, the customers can choose
the interested places to visit considering the allowed
budget.
Copyright © 2016 Praise Worthy Prize S.r.l. - All rights reserved
201
Here the modified clustering algorithm is
implemented to mine the selected POIs and the
association rule is generated to find the frequent
travelling patterns of the users, submitting them some
suggestions. Fig. 1 shows the architecture of a
customized itinerary planning system and it describes the
overall functionalities, features and characteristics of the
system. Here, there are three main roles played in the
system.
They are the admin, customer and database. Users can
interact through the web and submit their queries and
plan for the journey. Likewise the admin also interacts
with the system through the web.
The architecture is designed in such a way to uncover
the relationship among the popular POIs and to allow the
users to plan for k-day itinerary plan and to provide a
personalized trip plan.
Fig. 1. Architecture of a Customized Itinerary Planning System
There are two main users in the system. One is the
customer who uses the services provided by the itinerary
planning system, and another is the admin who maintains
the overall system. To enjoy the services provided by the
system, the users have to enroll their information and
details into the system. Once the users complete their
registration they can make the travel plan.
The registration is required only for the first access,
then the users can make N numbers of travel they wish.
After the registration the users can indicate the necessary
information about the travel plan to the system.
The system will generate a set of POIs for a particular
destination and specified budget of the users. Once the
users select their customized POIs, the route will be
generated with the estimated distance among the selected
POIs. If the distance is too long, they can cancel the POI
and select some other POIs. The system will indicate the
balance amount and balance hour and then the final
amount will be calculated for the selected POIs and
presented to the users.
International Review on Computers and Software, Vol. 11, N. 3
 D. Sudha, Y. Narasimha Rao, G. Dayanandam, V. Roopa
After confirming the places, the users can go to the
payment processing and the report will be generated by
the system.
At the other end of the system, the admin plays a
major role. The admin is responsible to manage and
maintain the overall system. Admin can add the new
emerging POIs to the system and he can also delete the
places. Admin can indicate all the trip details to the
database. Admin can save all the details and list out the
amount to the customers for the POIs specified by the
user. Frequent visits and some suggestions will be listed
for the users using the association rule.
The database holds the tourism and travel related data.
In travel related data it contains POIs of each destination
and their related costs. And in travel related data, detailed
information about the countries and mode of travel
available for the countries are stored. All the information
will be enlisted to the users for their use and to make the
customized journey. A report is generated once all the
process of a travel plan gets over. The report is highly
useful since it holds all the information about the travel.
Both the users and service provider can use the report as
a future reference and the details can be collected
efficiently.
III. Related Work
Existing systems are mainly focused on providing the
predefined itineraries to the users. Some systems allow
the users to make their customized trip, but the cost is not
yet effectively managed by the system.
This section briefly discusses about the existing
systems and their functionalities. A two stage model [1]
was proposed by incorporating the preprocessing step to
compute the single day itineraries and online stage to
integrate the single day itineraries to avail for multiday
itineraries. The result of the system is to provide the k-
day itinerary plan for the backpack travelers.
Two models called as TAST and TRAST model [2]
were developed to recommend the users to travel with
several features based on locations, travel seasons, and
relationships among the areas. The limitation of the
model was that the system recommended the users with
an itinerary plan before they make a decision on their
own. Link flows are used for the destination selection
model in [3] based on the travel behavior of the users and
considering the traffic to re-route the best path for the
travelers in the journey. Any travel model can be used
and integrated with travel behavior. But it did not
consider about more trip counts by the travelers and only
a few points of places are listed.
A popular Bayesian learning framework [4] was
introduced for the travel recommendation to the
customers by mining the person's attributes and their
interested areas by considering their age, gender, etc., but
there was a difficult to mine all the attributes of the
people and there was the risk of missing the information.
High dimensional framework with better visualization
techniques was adopted to view the local and global
Copyright © 2016 Praise Worthy Prize S.r.l. - All rights reserved
202
points covered in each area [5]. But time was still not
effectively managed to visit and orient the places.
Systems focused on multimodal trip planning provide
navigation, services offered on each trip, a list of access
devices, information display [6].
Multimodal travel system estimates the travel time,
walking time and waiting time [7] and it presents the
information to the travelers. Pre-planning, dynamic
information and online path retrieval [8] are available to
the users with reliable pre-trip plan. But the system
focused on providing the reliable paths, not considering
the traveler preferences such as faster, and slower while
processing the request. There was an absence to compute
online demand submitted by the user. Personal travel
companion was developed with the help of existing
information and available for multimodal travelers [9].
But because of poor internet connection the users
requests discontinued. Some systems use GPS
trajectories by assuming the underlying geometric
structure [10] for the route plan in the journey based on
the individual request.
Geometry structure are computed with datasets
including bicycle, pedestrian and taxi. If there are many
routes available for a particular location the algorithm
slows down and the system does not know which path to
take and cannot determine the shortest path in elapsed
time. CBVAR algorithm for frequent item sets generation
uses single scan towards the database [11], [12].
By considering the several challenges and limitations,
the motivation of this work is to provide an economic
and customized travel plan to the user. And an another
main intention of this proposed work is to ensure that the
algorithm works and performs well under any constraints
mining the POIs from the dataset within specified
elapsed time.
IV. Functional Requirements
By considering the functional requirements of
customized travel to the users there are three main
requirements associated, namely 1) k-day travel, 2) trip
management, 3) trip personalization.
K-day travel implies that the users can plan travel
without considering the number of days.
Trip management is related to the budget and
destination of the journey. Trip personalization describes
the mode of travel (e.g., Flight, ship, train, bus, etc.,) that
is allowable for several destinations and users can select
the travel mode.
IV.1. K-Day Itinerary Plan
Most of the existing systems specify the travel plan
with limited days of journey. Customization for the days
of travel is restricted to the users. Hence the customer is
allowed to choose the predefined itinerary plan specified
by the travel agents. To overcome this limitation, this
proposed work is designed to allow the users to plan the
journey with K days.
International Review on Computers and Software, Vol. 11, N. 3
 D. Sudha, Y. Narasimha Rao, G. Dayanandam, V. Roopa
Another key advantage of this K-day itinerary plan is
that most business people and backpack travelers can
plan the customized travel. With the functionality of this
requirement the customer satisfaction can be achieved in
a higher rate.
IV.2. Customized Trip Management
One of the other key requirements of the customized
travel is the trip management. The main intention trip
management is to allow the users to specify their budget
for the travel and to choose the destination.
Since most of the agents specifies the popular
itineraries with a fixed budget, the users should choose
any of the predefined travel plans maintained by the
agencies. The customer satisfaction cannot be achieved
because of this limitation.
To overcome this negative aspect, this requirement
permits the user to mention the budget and destination.
Some users are interested to specify low cost travel
with limited POIs. This proposed system allows the users
to enter the cost of the journey meeting the requirements
and expectations of the travelers.
IV.3. Trip Plan Personalization
Most travel agencies do not allow the user to choose
the mode of travel. Some travel agencies allow the
customers to specify the travel mode, but the system does
not present all the available travel modes for each
country to the users.
By considering this requirement, this proposed work
allows the travelers to mention the travel mode. The main
advantage of this personalization of the travel plan is that
the cost and time will vary for each travel mode.
The customer can choose their interested mode so to
enjoy the journey.
V. Design of a Customized Travel Plan
This section describes about the overall features,
characteristics and functionalities of the proposed system
to make a personalized travel plan.
V.1. Modified Clustering Algorithm
In this work, the cluster is defined in terms of a
collection of several POIs. A cluster is formed with a
temporary name. Once the users submit the necessary
information for a travel plan, the system forms a cluster.
Each cluster is responsible to hold a set of POIs for a
particular destination with the specified budget. The main
advantage of doing this internal process is to identify the
boundaries easily with a fast processing of data.
There may be a chance of receiving more requests
from the same user. The system should be capable of
handling the queries and fast response. To handle these
situations, the modified clustering algorithm is designed
so to identify the outliers easily.
Copyright © 2016 Praise Worthy Prize S.r.l. - All rights reserved
203
Algorithm 1 Modified Clustering Algorithm
Input:
D: a data set with k- number of objects.
N: number of clusters.
C: cost.
Output:
A set of Points Of Interests (POIs) generated for
a specified cost to a given destination.
Method:
1: Choose a specific destination with a given cost C
to assign in the cluster.
2: Calculate the itinerary cost and others.
2.1: Calculate travel cost and POIs cost.
2.2: Generate balance amount respectively.
2.3: Travel hour and POIs hour are calculated
2.4: Total trip hour is represented.
3: Generate a set of POIs for the cost C.
4: A group of POIs is generated for a specified
destination
5: Assign relevant POIs to each cluster.
The above algorithm is designed in such a way to
indicate all the details about the itinerary plan to the
users. The system will indicate the minimum travel hours
and cost for the journey. Once the details are furnished,
travel amount is deducted and the balance amount will be
indicated. Likewise, travel hour are calculated and
presented with remaining journey hour:
T=TA+∑PA (1)
Eq. (1) shows the trip calculation, where T is the total
amount, TA is the travel amount, PA is POI amount:
TR=TH+∑PH (2)
Eq. (2) shows the calculation of total itinerary hour
with the specified number of days mentioned by the
users. TR indicates the total trip hours, where TH is the
travel hour and PH is the POI hour required to visit the
places in the journey. With the help of these equations
the users can view all the details about the cost and travel
required for the itineraries. Customized POIs are
assigned in each cluster to the chosen destination and the
budget specified by the customer. Hence the processing
in retrieval of data can be increased with this new
formulation and the outliers can be detected efficiently.
V.2. Route Suggestion
The main usage of route suggestion is to show the
distance among the selected POIs. The first POI is
assumed as the source, when the users select the next
POI the system will indicate the distance between the
source and the POI. The users can view the distance
among each POIs. Each place is interlinked with other
POIs. Hence the distance among the places can be
calculated easily by the system.
Users can view the detailed information of all POIs
and select the places which are closer to each other. Each
destination is given with the unique number and the same
International Review on Computers and Software, Vol. 11, N. 3
 D. Sudha, Y. Narasimha Rao, G. Dayanandam, V. Roopa

is done for each place coming under destination. When VI.1. Generation of POIs
the users select the POI, the system will retrieve the data
In this step, POIs are generated once the users select
from the database and it will calculate the distance
the destination and cost of travel. Table I represents the
among the POIs. Each time the temporary table is
modified clustering algorithm to generate a list of POIs.
generated by the system in the database.
This temporary table holds all the information about TABLE I
the customized POIs and the path distance is calculated EFFECT OF TOTAL POIS
and represented for the users. If the distance is too long Number of total POIs Clustering (Processing time in ms)
to visit the POIs, the users can cancel and add some other 10 0.3
place where the distance is lesser to make an efficient 15 0.5
20 0.5
travel plan. The selected POIs are represented by the 25 0.8
amount, total coverage area and number of days. Users
can add the POIs and simultaneously view the balance Fig. 2 shows the clustering graph for POIs. It is found
amount and balance hour to proceed further. Once the that the time taken to generate the list of POIs for a
users finish adding the places, they can proceed. particular destination is less and it takes a few
milliseconds.
V.3. Frequent Visits using Association Rule
Association rule is used to uncover the relationship
among the places and the interesting patterns of the
customers. Some users interested to go with the
predefined itinerary plan suggested by the system. By
association rule, the popular places for each destination
is represented for the users for their ease of journey:

Country(X,”Barcelona”)^Budget(X,”10000)
(3)
=>Visit(X,Poi)

Eq. (3) shows the association rule specified in the

country and budget, where X represents the users. Once
the users submit the destination and budget of the
itinerary plan, the system suggests the tour packages with
the help of the association rule. The places suggested by Fig. 2. POI Generation
the system are the frequent travelers by the customers.
Based on the cost submitted by the users, the most
VI.2. Customized POIs
popular POIs are generated and presented to the
travelers. The packages submitted by the system are most Once the system has generated total POIs for a
frequently picked by other travelers. Registered users can destination, the users can choose their interested POIs.
view the frequent places and can plan the journey. Table II shows the tabular representation for processing
Administrator gathers all the information about the the selected data. It contains the number of selected POIs
frequent places made by the customers saving all the with processing time. Fig. 3 shows the comparison
details in the database. Upon the submission of requests between the existing and the modified clustering
by the travelers, the system retrieves the data using the algorithm for the customized POIs.
association rule and displays the places under the
indicated budget. The main usage of association rule is to
VI.3. Mean Time for Clusters
give suggestions to the users.
Thus the system acts intelligently upon the submission This section explains the computation of clusters to
of queries. Relationships among the POIs are uncovered form the list of POIs, describing the comparison between
using the rule and frequent POIs are suggested by the the existing and the proposed system. Table III illustrates
system. POIs and their related attributes are gathered and the comparison between the existing algorithms with the
the administrator saves the details. These are the three modified clustering algorithm with respect to the mean
main modules to design a customized travel plan and the time to form the number of clusters.
motivation is to reduce the response time and increase
the processing of data by the system. TABLE II
EFFECT OF SELECTED POIS
Number of Existing Proposed
selected POIs (Processing time in ms) (Processing time in ms)
VI. Experiment Evaluations 5 150 100
10 250 200
This section describes the experimental setup and the 15 350 300
performance evaluation of the system. 20 450 400

Copyright © 2016 Praise Worthy Prize S.r.l. - All rights reserved International Review on Computers and Software, Vol. 11, N. 3

204
 D. Sudha, Y. Narasimha Rao, G. Dayanandam, V. Roopa

Fig. 3. Selected POIs

Fig. 5. Path Computation
TABLE III
EFFECT OF TOTAL NUMBER OF CLUSTERS
Number of Existing Proposed VII. Conclusion
clusters (Processing time in ms) (Processing time in ms)
1 60 25 In this paper, a customized itinerary planning system
2 200 100 is provided to the customers. Users can plan for k-day
3 350 250 travel plans choosing their interested POIs. It will allow
4 430 350
the users to select their preference of places to visit.
With this new formulation, all the users can make an
Fig. 4 shows the comparison between the existing and
economic travel plan and this will satisfy the
the proposed clustering algorithm respect to their
expectations of the backpack travelers. With the help of a
processing time. It is observed that the modified
modified clustering algorithm, a customized journey can
clustering algorithm performs better than the existing
be provided with the specified cost and number of days
systems.
of travel. The modified clustering algorithm works faster
and retrieves the data in a few milliseconds.
During the preprocessing stage all the incomplete and
inconsistent data will be eliminated with the specified
constraints. Since it is one time registration to the users,
they can plan any number of travels in the future and
they can view their travel history with all the necessary
details provided by the system.
Once the customized POIs are chosen by the users,
some routes will be suggested to them for each selected
place. If the distance is relatively long from one POI to
POI, the users can cancel it and add some other POIs
relatively shorter to visit. Thus, with the route generation,
users can make effective travel plan visiting a number of
places with the specified budget.
Fig. 4. Existing vs Proposed Association rule suggests the frequent visits to the
travelers. Those who are new to the travel can efficiently
view the frequent visits and choose the popular POIs.
VI.4. Suggestion of Route With the largest collection of data sets, the system will
After the users have finalized their customized POIs, suggest the most visited POIs to the customers.
the system will suggest the path, represented by the The system will mine the frequent places for each
distance of one POI to an another one. Table IV shows destination from the database and present it to the users.
the tabular representation for processing the distance of By this implementation customers can choose their
POIs. customized travel plan with the specified cost.
Fig. 5 shows the processing time required by the
system to suggest the distance for the selected POIs.
References
TABLE IV [1] Gang Chen, Sai Wu, Jingbo Zhou, and Anthony K.H. Tung,
ROUTE GENERATION Automatic Itinerary Planning for Traveling Services, IEEE
Customized POIs Processing time in ms Transactions on Knowledge and Data Engineering, vol. 26, 2014,
1 0.05 pp. 514-527.
2 0.1 [2] Qi Liu, Enhong Chen, Hui Xiong,Yong Ge, Zhongmou Li, and
3 0.15 Xiang Wu, A Cocktail Approach for Travel Package
4 0.2 Recommendation, IEEE Transactions on Knowledge and Data
Engineering, vol. 26, 2014, pp. 278-292.

Copyright © 2016 Praise Worthy Prize S.r.l. - All rights reserved International Review on Computers and Software, Vol. 11, N. 3

205
 D. Sudha, Y. Narasimha Rao, G. Dayanandam, V. Roopa

[3] Peijun Ye and Ding Wen, A Study of Destination Selection Model Prof. G. Dayanandam B. Tech-CSE, M.Tech-
based on Link Flows, IEEE Transactions on Intelligent IT, (Ph.D)-CSE, ANU, currently working as
Transportation Systems, vol. 14, 2013, pp. 428-437. Professor, IT Dept, QIS College of Engineering
[4] Yan-Ying Chen, An-Jung Cheng, and Winston H. Hsu, Travel and Technology, Ongole, A.P. Having work
Recommendation by Mining People Attributes and Travel Group experience of 13 years, he has published 4
Types From Community-Contributed Photos, IEEE Transactions papers in international journal, 1 paper in
on Multimedia, vol. 15, 2013, pp.1283-1295. National journal and 2 papers in national level
[5] Julia EunJu Nam and Klaus Mueller, TripAdvisor N-D: A conferences. His areas of interest are
Tourism-Inspired High-Dimensional Space Exploration Cryptography, network security and information security.
Framework with Overview and Detail, IEEE Transactions on
Visualization and Computer Graphics, vol. 19, 2013, pp.291-305. Ms. V. Roopa, working as Assistant Professor,
[6] Konstantinos G. Zografos, Konstantinos N. Androutsopoulos, and Department of Information Technology, Sri
Vassilis Spitadakis, Design and Assessment of an Online Krishna College of Technology, Coimbatore,
Passenger Information System for Integrated Multimodal Trip India. She completed her Master’s degree from
Planning, IEEE Transactions on Intelligent Transportation KCG College of Technology. She has both
Systems, vol. 10, 2009, pp. 311-323. Industry and Academic Experience. She
[7] Konstantinos G. Zografos and Konstantinos N. Androutsopoulos, published one paper in International conference,
Algorithms for Itinerary Planning in Multimodal Transportation one paper in International Journal. Her research
Networks, IEEE Transactions on Intelligent Transportation interest include Cloud Computing and IOT.
Systems, vol. 9, 2008, pp. 175-184.
[8] Yanyan Chen, Michael G. H. Bell, and Klaus Bogenberger,
Reliable Pretrip Multipath Planning and Dynamic Adaptation for
a Centralized Road Navigation System, IEEE Transactions on
Intelligent Transportation Systems, vol. 8, 2007, pp. 14-20.
[9] Karl Rehrl, Stefan Bruntsch, and Hans-Joachim Mentz, Assisting
Multimodal Travelers: Design and Prototypical Implementation of
a Personal Travel Companion, IEEE Transactions on Intelligent
Transportation Systems, vol. 8, 2007, pp. 31-42.
[10] Stefan Edelkamp, Shahid Jabbar, and Thomas Willhalm,
Geometric Travel Planning, IEEE Transactions on Intelligent
Transportation Systems, vol. 6, 2005, pp. 5-16.
[11] Krishnamurthy M, A. Kannan, R. Baskaran , M. Kavitha , Cluster
based Bit Vector Mining Algorithm for Finding Frequent Itemsets
in Temporal Databases, In Journal of Elsevier on Procedia
Computer Science , vol. 3, 2011, pp. 513-523.
[12] Krishnamurthy M, Rajalakshmi E, Baskaran R Kannan A,.
Improved Cluster Based Mining Algorithm for Frequent Itemsets
Generation using Bit Vectors, TQ-Research Journal, 2013.

Authors’ information
Ms. D. Sudha, working as Assistant Professor,
Department of Computer Science and
Engineering, QIS College of Engineering and
Technology, Ongole, A.P. She completed her
Master’s degree from KCG College of
Technology. She has both Industry and
Academic Experience. She is a student member
in IET since 2013. She published one paper in
International conference. Her research interests include Data Mining,
and Network Security.

Dr. Y. Narasimha Rao, working as Professor &

HOD, in the department of Information
technology, QIS College of Engineering and
Technology, Ongole, A.P, India. He has more
than 11 years academic experience. He has
completed his PhD from Andhra University,
Masters degree from Acharya Nagarjuna
University. He has published more than 10
research papers in reputed international journals and conferences. His
research interests are Parallel Processing, Advanced computer
architecture, Cryptography algorithms and Network security

Copyright © 2016 Praise Worthy Prize S.r.l. - All rights reserved International Review on Computers and Software, Vol. 11, N. 3

206

View publication stats