Loading…
A NOVEL RANK BASED CO-LOCATION PATTERN MINING APPROACH USING MAP-REDUCE
With the increase in spatial data analysis, the co-location patterns and its dependencies are used to discover the complex patterns on spatial databases. Most of the traditional spatial data mining techniques have been implemented based on the assumption that the data is meaningful and clean. It is...
Saved in:
Published in: | Journal of Theoretical and Applied Information Technology 2016-05, Vol.87 (3), p.422-422 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | 422 |
container_issue | 3 |
container_start_page | 422 |
container_title | Journal of Theoretical and Applied Information Technology |
container_volume | 87 |
creator | Sheshikala, M Rao, D Rajeswara Prakash, R Vijaya |
description | With the increase in spatial data analysis, the co-location patterns and its dependencies are used to discover the complex patterns on spatial databases. Most of the traditional spatial data mining techniques have been implemented based on the assumption that the data is meaningful and clean. It is essential to study the data integration issues along with spatial co-locating patterns. Generally, spatial co-location mining algorithms are used to discover the spatial objects and its dependencies among them. As the data size increases, the co-location objects and its patterns are difficult to process on complex spatial objects. In this paper, an optimized spatial co-locating pattern mining framework was developed to discover the highly ranked correlated patterns using the hadoop framework. This MapReduce model was used to minimize computational time and space on complex spatial databases. Finally, the experimental results on the complex spatial data are evaluated using the proposed framework and the traditional hadoop based pattern mining models. |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_miscellaneous_1855373846</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1855373846</sourcerecordid><originalsourceid>FETCH-LOGICAL-p131t-4fca5041f8cec8d103ce45799cd7c7c3a5664b577f70566b61caaf92e7a503c63</originalsourceid><addsrcrecordid>eNpdjkFvwiAAhTlsic7tP5DssksTKFDokSGrzSptauvVINJkprNO7P9fzTzt9N5LvvfyHsAcC8wjglM2A08hHBFKYpqyOcgkNOVWF7CW5hO-y41eQlVGRalkk5cGVrJpdG3gOje5yaCsqrqUagXbzS2uZRXVetkq_QweO9sH_3LXBWg_dKNW01KWK1lEZ0zwNaKdswxR3AnnnThgRJynjKepO3DHHbEsSeiecd5xNNl9gp21XRp7PtWIS8gCvP3tni_Dz-jDdff9FZzve3vywxh2WDBGOBH0hr7-Q4_DeDlN7yYqJoKhmCLyCzxYTVU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1823850240</pqid></control><display><type>article</type><title>A NOVEL RANK BASED CO-LOCATION PATTERN MINING APPROACH USING MAP-REDUCE</title><source>EZB Electronic Journals Library</source><creator>Sheshikala, M ; Rao, D Rajeswara ; Prakash, R Vijaya</creator><creatorcontrib>Sheshikala, M ; Rao, D Rajeswara ; Prakash, R Vijaya</creatorcontrib><description>With the increase in spatial data analysis, the co-location patterns and its dependencies are used to discover the complex patterns on spatial databases. Most of the traditional spatial data mining techniques have been implemented based on the assumption that the data is meaningful and clean. It is essential to study the data integration issues along with spatial co-locating patterns. Generally, spatial co-location mining algorithms are used to discover the spatial objects and its dependencies among them. As the data size increases, the co-location objects and its patterns are difficult to process on complex spatial objects. In this paper, an optimized spatial co-locating pattern mining framework was developed to discover the highly ranked correlated patterns using the hadoop framework. This MapReduce model was used to minimize computational time and space on complex spatial databases. Finally, the experimental results on the complex spatial data are evaluated using the proposed framework and the traditional hadoop based pattern mining models.</description><identifier>ISSN: 1817-3195</identifier><language>eng</language><publisher>Islamabad: Journal of Theoretical and Applied Information</publisher><subject>Algorithms ; Cleaning ; Data integration ; Data mining ; Data processing ; Information technology ; Pattern analysis</subject><ispartof>Journal of Theoretical and Applied Information Technology, 2016-05, Vol.87 (3), p.422-422</ispartof><rights>Copyright Journal of Theoretical and Applied Information May 2016</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784</link.rule.ids></links><search><creatorcontrib>Sheshikala, M</creatorcontrib><creatorcontrib>Rao, D Rajeswara</creatorcontrib><creatorcontrib>Prakash, R Vijaya</creatorcontrib><title>A NOVEL RANK BASED CO-LOCATION PATTERN MINING APPROACH USING MAP-REDUCE</title><title>Journal of Theoretical and Applied Information Technology</title><description>With the increase in spatial data analysis, the co-location patterns and its dependencies are used to discover the complex patterns on spatial databases. Most of the traditional spatial data mining techniques have been implemented based on the assumption that the data is meaningful and clean. It is essential to study the data integration issues along with spatial co-locating patterns. Generally, spatial co-location mining algorithms are used to discover the spatial objects and its dependencies among them. As the data size increases, the co-location objects and its patterns are difficult to process on complex spatial objects. In this paper, an optimized spatial co-locating pattern mining framework was developed to discover the highly ranked correlated patterns using the hadoop framework. This MapReduce model was used to minimize computational time and space on complex spatial databases. Finally, the experimental results on the complex spatial data are evaluated using the proposed framework and the traditional hadoop based pattern mining models.</description><subject>Algorithms</subject><subject>Cleaning</subject><subject>Data integration</subject><subject>Data mining</subject><subject>Data processing</subject><subject>Information technology</subject><subject>Pattern analysis</subject><issn>1817-3195</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><recordid>eNpdjkFvwiAAhTlsic7tP5DssksTKFDokSGrzSptauvVINJkprNO7P9fzTzt9N5LvvfyHsAcC8wjglM2A08hHBFKYpqyOcgkNOVWF7CW5hO-y41eQlVGRalkk5cGVrJpdG3gOje5yaCsqrqUagXbzS2uZRXVetkq_QweO9sH_3LXBWg_dKNW01KWK1lEZ0zwNaKdswxR3AnnnThgRJynjKepO3DHHbEsSeiecd5xNNl9gp21XRp7PtWIS8gCvP3tni_Dz-jDdff9FZzve3vywxh2WDBGOBH0hr7-Q4_DeDlN7yYqJoKhmCLyCzxYTVU</recordid><startdate>20160501</startdate><enddate>20160501</enddate><creator>Sheshikala, M</creator><creator>Rao, D Rajeswara</creator><creator>Prakash, R Vijaya</creator><general>Journal of Theoretical and Applied Information</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20160501</creationdate><title>A NOVEL RANK BASED CO-LOCATION PATTERN MINING APPROACH USING MAP-REDUCE</title><author>Sheshikala, M ; Rao, D Rajeswara ; Prakash, R Vijaya</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p131t-4fca5041f8cec8d103ce45799cd7c7c3a5664b577f70566b61caaf92e7a503c63</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Algorithms</topic><topic>Cleaning</topic><topic>Data integration</topic><topic>Data mining</topic><topic>Data processing</topic><topic>Information technology</topic><topic>Pattern analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Sheshikala, M</creatorcontrib><creatorcontrib>Rao, D Rajeswara</creatorcontrib><creatorcontrib>Prakash, R Vijaya</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Journal of Theoretical and Applied Information Technology</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Sheshikala, M</au><au>Rao, D Rajeswara</au><au>Prakash, R Vijaya</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A NOVEL RANK BASED CO-LOCATION PATTERN MINING APPROACH USING MAP-REDUCE</atitle><jtitle>Journal of Theoretical and Applied Information Technology</jtitle><date>2016-05-01</date><risdate>2016</risdate><volume>87</volume><issue>3</issue><spage>422</spage><epage>422</epage><pages>422-422</pages><issn>1817-3195</issn><abstract>With the increase in spatial data analysis, the co-location patterns and its dependencies are used to discover the complex patterns on spatial databases. Most of the traditional spatial data mining techniques have been implemented based on the assumption that the data is meaningful and clean. It is essential to study the data integration issues along with spatial co-locating patterns. Generally, spatial co-location mining algorithms are used to discover the spatial objects and its dependencies among them. As the data size increases, the co-location objects and its patterns are difficult to process on complex spatial objects. In this paper, an optimized spatial co-locating pattern mining framework was developed to discover the highly ranked correlated patterns using the hadoop framework. This MapReduce model was used to minimize computational time and space on complex spatial databases. Finally, the experimental results on the complex spatial data are evaluated using the proposed framework and the traditional hadoop based pattern mining models.</abstract><cop>Islamabad</cop><pub>Journal of Theoretical and Applied Information</pub><tpages>1</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1817-3195 |
ispartof | Journal of Theoretical and Applied Information Technology, 2016-05, Vol.87 (3), p.422-422 |
issn | 1817-3195 |
language | eng |
recordid | cdi_proquest_miscellaneous_1855373846 |
source | EZB Electronic Journals Library |
subjects | Algorithms Cleaning Data integration Data mining Data processing Information technology Pattern analysis |
title | A NOVEL RANK BASED CO-LOCATION PATTERN MINING APPROACH USING MAP-REDUCE |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T19%3A22%3A07IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20NOVEL%20RANK%20BASED%20CO-LOCATION%20PATTERN%20MINING%20APPROACH%20USING%20MAP-REDUCE&rft.jtitle=Journal%20of%20Theoretical%20and%20Applied%20Information%20Technology&rft.au=Sheshikala,%20M&rft.date=2016-05-01&rft.volume=87&rft.issue=3&rft.spage=422&rft.epage=422&rft.pages=422-422&rft.issn=1817-3195&rft_id=info:doi/&rft_dat=%3Cproquest%3E1855373846%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-p131t-4fca5041f8cec8d103ce45799cd7c7c3a5664b577f70566b61caaf92e7a503c63%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1823850240&rft_id=info:pmid/&rfr_iscdi=true |