Scalable Data Chunk Similarity for Mobile Node Data Using Group Pattern Object

JAYANTHI.R; JOHN AUGUSTINE.P

Scalable Data Chunk Similarity for Mobile Node Data Using Group Pattern Object

Authors: JAYANTHI.R, JOHN AUGUSTINE.P

Unique Paper ID: 148153
Volume: 5
Issue: 12
PageNo: 589-596

Keywords: Compressive Sensing Data Gathering Random Walk Wireless Sensor Network

Abstract:
Spatial co-location pattern mining is an interesting and important task in spatial data mining which discovers the subsets of spatial features frequently observed together in nearby geographic space. However, the traditional framework of mining prevalent co-location patterns produces numerous redundant co-location patterns, which makes it hard for users to understand or apply. To address this issue, in this paper we study the problem of reducing redundancy in a collection of prevalent co-location patterns by utilizing the spatial distribution information of co-location instances In this project considered the redundancy reduction problem of the spatial prevalent co-locations by applying distribution information from co-location instances. It is worth mentioning that the proposed method not only solves the redundancy reduction problem but also provides high efficiency. There are several interesting directions that we are considering for future work: (1) Compression of the spatial prevalent co-locations (to get fewer co-locations but more usability, i.e., a set of representative co-locations); (2) Ordering of the spatial prevalent co-locations; and (3) Reducing the redundancy of prevalent co-locations found in incrementally updated data. In proposed study analysis a natural phenomena show that many creatures form large social groups and move in regular patterns. However, previous works focus on finding the movement patterns of each single object or all objects. This thesis proposes an efficient distributed mining algorithm to jointly identify a group of moving objects and discover their movement patterns in wireless sensor networks. Afterward, a compression algorithm, called (2 phase and 2D) 2P2D is proposed, which utilizes the discovered group movement patterns shared by the transmitting node and the receiving node to compress data and thereby reduces the amount of delivered data.

Download article

email to a friend

Cite This Article

ISSN: 2349-6002
Volume: 5
Issue: 12
PageNo: 589-596

Scalable Data Chunk Similarity for Mobile Node Data Using Group Pattern Object

Available:https://ijirt.org/Article?manuscript=148153

28 Mar, 2020

TRAFFIC SIGN CLASSIFICATION AND DETECTION USING DEEP LEARNING

28 Mar, 2020

MICROSLEEP DETECTION TECHNIQUE

28 Mar, 2020

ATM PERSONAL IDENTIFICATION PIN THEFT AVOIDANCE SYSTEM

28 Mar, 2020

CERTAIN INVESTIGATION ON ADVANCED HIGH SECURE MULTI PARKING SYSTEM

14 May, 2019

ARDUINO BASED SMART IRRIGATION SYSTEM IN ENVIRONMENT MONITORING

14 May, 2019

Effective Heart Disease Prediction Model for Feature Extraction Model using Data Mining Classification Algorithm

11 May, 2019

Differential Privacy Preserving of Training Model In Wireless Big Data with Edge Computing

11 May, 2019

Search Rank Fraud and Malware Detection in Google Play Application

06 Apr, 2018

PERSONAL HEALTH RECORD SYSTEM BASED ON DISTRIBUTED COMPUTING

Impact Factor
8.01 (Year 2024)

UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.

Join Now