Journal Title : International Journal of Modern Trends in Engineering and Science


Author’s Name : Justin K Williams | A Benazir Begamunnamed

Volume 03 Issue 12 2016

ISSN no:  2348-3121

Page no: 78-80

Abstract – The application will have two kinds users, Firstly, the travellers (drivers) who use their own vehicle (car only for now) to commute to work daily and need some fellow passengers to share cost of fuel and other expenses. Some might just want someone to accompany them for the whole journey. These drivers can use our application to create their profiles as driver under “offer a ride” section and mention their route to work, fare they are expecting from passengers, car they have (hatchback, sedan, SUV), number of fellow passengers they need and details of their time when leave from home for work as well as when they leave from office. This will help other category of users to analyse their requirements and choose drivers accordingly. Most importantly, Drivers will be asked to mention their license number mandatorily for safety reasons. Secondly, the travellers (passengers) who also travel to work daily but they either use public transport or use others modes of transportation which takes more time than usual to reach their destination because of which they feel exhausted and frizzled at the end of the day. These passengers can use this application to find drivers who has source and destination same as theirs and allow them to connect to drivers and decide fares, meeting points and other necessary details. Passengers will be asked to create their profile as well so that our application will be able to filter the drivers according to their specified expected fare and of course, source and destination, our application will also provide passengers the user’s review and filter accordingly i.e.higher to lower ratings, that way passengers are susceptible to use our application and we will also be able to perform up to their expectations. 

Keywords— Automobile;  Car Pooling System;


  1. Vincent S. Tseng, Cheng-Wei Wu, and Philip S. Yu, ‘Efficient Algorithms for Mining the Concise and Lossless Representation’, IEEE Transactions on Knowledge and Data Engineering, Vol. 27, No. 3, March 2015.
  2. Ahmed C.F, Tanbeer S.K, Jeong .B.S and Lee T.K, ‘Efficient tree structures for high utility pattern mining in incremental databases’, IEEE Trans. Knowl. Data Eng., vol. 21, no. 12, pp. 1708– 1721, Dec. 2009.
  3. Boulicaut J.F, Bykowski A, and Rigotti C, ‘Free-sets: A condensed representation of Boolean data for the approximation of frequency queries’, Data Mining Knowl. Discovery, vol. 7, no. 1, pp. 5–22, 2003.
  4. Calders T and Goethals B, ‘Mining all non-derivable frequent itemsets’, in Proc. Int. Conf. Eur. Conf. Principles Data Mining Knowl. Discovery, 2002.
  5. Chuang K, Huang J, and Chen M, ‘Mining top-k frequent patterns in the presence of the memory constraint’, VLDB J., vol. 17, pp. 1321–1344, 2008.
  6. Chan R, Yang Q, and Shen Y, ‘Mining high utility itemsets’, in Proc. IEEE Int. Conf. Data Min., 2003, pp. 19–26.
  7. Erwin A, Gopalan R.P, and Achuthan N.R, ‘Efficient mining of high utility itemsets from large datasets’, in Proc. Int. Conf. Pacific- Asia Conf. Knowl. Discovery Data Mining, 2008, pp. 554–561. 738 IEEE Transactions On Knowledge And Data Engineering, Vol. 27, No. 3, March 2015.
  8. Gouda K and Zaki M.J, ‘Efficiently mining maximal frequent itemsets’, in Proc. IEEE Int. Conf. Data Mining, 2001, pp. 163–170.
  9. Hamrouni T, ‘Key roles of closed sets and minimal generators in concise representations of frequent patterns’, Intel. Data Anal., vol. 16, no. 4, pp. 581–631, 2012.
  10. Han J, Pei J, and Yin Y, ‘Mining frequent patterns without candidate generation’, in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2000, pp. 1–12.