Total views : 137

Computation Analysis for Finding Co–Location Patterns using Map–Reduce Framework

Affiliations

  • Department of Computer Science and Engineering, KL University, Vijayawada – 520002, Andhra Pradesh, India
  • Department of Computer Science and Engineering, SR Engineering College, Warangal – 506371, Telangana, India

Abstract


Objectives: The main objectives of the paper are 1. Generating the Neib_tree based on the number of features and instances. 2. Finding all the co-location patterns using Parallel Approach. 3. Improving the computation time by exploring Map-Reduce Framework. Methods: To generate Neib-tree is by Grid based approach. The method used find co-location patterns is by parallel approach which drastically increases the time complexity. The exploratory results are directed by utilizing manufactured information sets by taking the different data sets one with 25k, 50k and 75k features and an average of 20k instances each, which produces the computational analysis with a distance of 20km. Findings: This paper presents fast calculation of co-location patterns where these is helpful in finding the people suffering from a particular problem in a place and what are the patterns affecting the problem. The proposed work diminishes the calculation time by 1/n terms where n is the quantity of components as it uses a Map-Reduce system. This paper presents exact and fulfillment of the new approach. At long last, exploratory assessments utilizing manufactured information sets demonstrate the calculation is computationally more productive. Applications: The concept presented in this paper is helpful in different areas like medical Field, NASA, and etc., Improvements: The paper improves the time complexity and space complexity by using parallel join-less approach.

Keywords

Co-Location Mining, Map-Reduce, Participation Index, Participation Ratio, Time Complexity

Full Text:

 |  (PDF views: 120)

References


  • Huang Y, Shekar S, Xiong H. Discovering co-location patterns from spatial data sets: a general approach. Institute of Electrical and Electronics Engineers (IEEE) Transaction Knowledge and Data Engineering. 2004 Dec; 16(12):1472–85.Crossref
  • Huang Y, Pei J, Xiong H. Mining co-location patterns with rare events from spatial data sets. GeoInformatica. 2006 Sep; 10(3):239–60.Crossref
  • Wang L, Bao Y, Lu J, Yip J. A new join-less approach for co-location pattern mining. In the Proceedings of the 8th Institute of Electrical and Electronics Engineers (IEEE) International Conference Computer and Information Technology (CIT); 2008 Jul 8–11. p. 197–202.
  • Yoo JS, Shekar S, Smith J, Kumquat JP. A partial join approach for mining co- location patterns. In the Proceedings of the 12th Annual Association for Computing Machinery (ACM) International Workshop Geographic Information Systems (GIS); 2004 Nov 12–13. p. 241–9.Crossref
  • Wang L, Wu P, Chen H. Finding probabilistic prevalent colocations in spatially uncertain data sets. Institute of Electrical and Electronics Engineers (IEEE) Transaction Knowledge and Data Engineering (TKDE); 2013 Apr; 25(4):790–804.Crossref
  • Morimoto Y. Mining frequent neighboring class sets in spatial databases. In the Proceedings of the Seventh Association for Computing Machinery (ACM) SIGKDD International Conference Knowledge Discovery and Data Mining (KDDM), San Francisco, California; 2001 Aug 26–29. p. 353–8.Crossref
  • Manjula KR, Keshari AK, Pahlazani A. An approach to perform uncertainty analysis on a spatial dataset using clustering and distance based outlier detection technique. Indian Journal of Science and Technology. 2015 Dec; 8(35):1–7.Crossref
  • Huang Y, Xiong H, Shekar S. Mining confident co-location rules without a support threshold. In the Proceedings of the Association for Computing Machinery (ACM) Symposium in Applied Computing, Melbourne, Florida, USA; 2003. p.497–501.
  • Yoo JS, Shekar S. A join less approach for mining spatial co-location patterns. Institute of Electrical and Electronics Engineers (IEEE) Transaction Knowledge and Data Engineering (TKDE). 2006 Dec; 18(10):1323–37.Crossref
  • White T. Hadoop: the definitive guide. O’reilly; 2012 May.
  • Park H, Cha G, Chung C. Multi-way spatial joins using r-trees: methodology and performance evaluation.International Symposium on Advances in Spatial Databases; 1999 Jun 25. p. 229–50.
  • Sajana T, Sheela Rani CM, Narayana KV. A survey on clustering techniques for big data mining. Indian Journal of Science and Technology. 2016 Jan; 9(3):1–12.Crossref
  • Rarimala M, Lopez D. K-neighborhood structural similarity approach or spatial clustering. Indian Journal of Science and Technology. 2015 Sep; 8(23):1–11.
  • Agrawal R. Design and development of data classification methodology for uncertain data. Indian Journal of Science and Technology. 2016 Jan; 9(3):1–12.Crossref
  • Anuradha K, Sairam N. Spatio-temporal based approaches for human action recognition in static and dynamic background: a survey. Indian Journal of Science and Technology. 2016 Feb; 9(5):1–12.
  • https://doi.org/10.17485/ijst/2016/v9i5/72065
  • Kumar S, Suseendran G. Incremental quality based reverse ranking for spatial data. Indian Journal of Science and Technology. 2016 Jan; 9(1):1–10.

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.