A clustering-based data reduction for very large spatio-temporal datasets

Today, huge amounts of data are being collected with spatial and temporal components from sources such as meteorological, satellite imagery etc. Efficient visualisation as well as discovery of useful knowledge from these datasets is therefore very challenging and becoming a massive economic need. Da...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Le-Khac, Nhien-An, Bue, Martin, Whelan, Michael, Kechadi, Tahar
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Le-Khac, Nhien-An
Bue, Martin
Whelan, Michael
Kechadi, Tahar
description Today, huge amounts of data are being collected with spatial and temporal components from sources such as meteorological, satellite imagery etc. Efficient visualisation as well as discovery of useful knowledge from these datasets is therefore very challenging and becoming a massive economic need. Data Mining has emerged as the technology to discover hidden knowledge in very large amounts of data. Furthermore, data mining techniques could be applied to decrease the large size of raw data by retrieving its useful knowledge as representatives. As a consequence, instead of dealing with a large size of raw data, we can use these representatives to visualise or to analyse without losing important information. This paper presents a new approach based on different clustering techniques for data reduction to help analyse very large spatio-temporal data. We also present and discuss preliminary results of this approach.
doi_str_mv 10.48550/arxiv.1609.00988
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1609_00988</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1609_00988</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-7a830abdb3a162aba95cb54786916ca5b4aa7e745f13a876363b199ed8f42d3</originalsourceid><addsrcrecordid>eNotz81KAzEUBeBsXEj1AVyZF8iYNP_LUvwpFARxP9xM7pSBaWe4SYt9e3V0deBwOPAx9qBkY4K18gnoa7g0ysnYSBlDuGW7De_Gc6lIw-kgEhTMPEMFTpjPXR2mE-8n4hekKx-BDsjLDD-1qHicJ4JxWRes5Y7d9DAWvP_PFft4ef7cvon9--tuu9kLcD4ID0FLSDlpUG4NCaLtkjU-uKhcBzYZAI_e2F5pCN5pp5OKEXPozTrrFXv8O10k7UzDEeja_oraRaS_Ab_RRyU</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A clustering-based data reduction for very large spatio-temporal datasets</title><source>arXiv.org</source><creator>Le-Khac, Nhien-An ; Bue, Martin ; Whelan, Michael ; Kechadi, Tahar</creator><creatorcontrib>Le-Khac, Nhien-An ; Bue, Martin ; Whelan, Michael ; Kechadi, Tahar</creatorcontrib><description>Today, huge amounts of data are being collected with spatial and temporal components from sources such as meteorological, satellite imagery etc. Efficient visualisation as well as discovery of useful knowledge from these datasets is therefore very challenging and becoming a massive economic need. Data Mining has emerged as the technology to discover hidden knowledge in very large amounts of data. Furthermore, data mining techniques could be applied to decrease the large size of raw data by retrieving its useful knowledge as representatives. As a consequence, instead of dealing with a large size of raw data, we can use these representatives to visualise or to analyse without losing important information. This paper presents a new approach based on different clustering techniques for data reduction to help analyse very large spatio-temporal data. We also present and discuss preliminary results of this approach.</description><identifier>DOI: 10.48550/arxiv.1609.00988</identifier><language>eng</language><subject>Computer Science - Databases</subject><creationdate>2016-09</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1609.00988$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1609.00988$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Le-Khac, Nhien-An</creatorcontrib><creatorcontrib>Bue, Martin</creatorcontrib><creatorcontrib>Whelan, Michael</creatorcontrib><creatorcontrib>Kechadi, Tahar</creatorcontrib><title>A clustering-based data reduction for very large spatio-temporal datasets</title><description>Today, huge amounts of data are being collected with spatial and temporal components from sources such as meteorological, satellite imagery etc. Efficient visualisation as well as discovery of useful knowledge from these datasets is therefore very challenging and becoming a massive economic need. Data Mining has emerged as the technology to discover hidden knowledge in very large amounts of data. Furthermore, data mining techniques could be applied to decrease the large size of raw data by retrieving its useful knowledge as representatives. As a consequence, instead of dealing with a large size of raw data, we can use these representatives to visualise or to analyse without losing important information. This paper presents a new approach based on different clustering techniques for data reduction to help analyse very large spatio-temporal data. We also present and discuss preliminary results of this approach.</description><subject>Computer Science - Databases</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81KAzEUBeBsXEj1AVyZF8iYNP_LUvwpFARxP9xM7pSBaWe4SYt9e3V0deBwOPAx9qBkY4K18gnoa7g0ysnYSBlDuGW7De_Gc6lIw-kgEhTMPEMFTpjPXR2mE-8n4hekKx-BDsjLDD-1qHicJ4JxWRes5Y7d9DAWvP_PFft4ef7cvon9--tuu9kLcD4ID0FLSDlpUG4NCaLtkjU-uKhcBzYZAI_e2F5pCN5pp5OKEXPozTrrFXv8O10k7UzDEeja_oraRaS_Ab_RRyU</recordid><startdate>20160904</startdate><enddate>20160904</enddate><creator>Le-Khac, Nhien-An</creator><creator>Bue, Martin</creator><creator>Whelan, Michael</creator><creator>Kechadi, Tahar</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20160904</creationdate><title>A clustering-based data reduction for very large spatio-temporal datasets</title><author>Le-Khac, Nhien-An ; Bue, Martin ; Whelan, Michael ; Kechadi, Tahar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-7a830abdb3a162aba95cb54786916ca5b4aa7e745f13a876363b199ed8f42d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>Computer Science - Databases</topic><toplevel>online_resources</toplevel><creatorcontrib>Le-Khac, Nhien-An</creatorcontrib><creatorcontrib>Bue, Martin</creatorcontrib><creatorcontrib>Whelan, Michael</creatorcontrib><creatorcontrib>Kechadi, Tahar</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Le-Khac, Nhien-An</au><au>Bue, Martin</au><au>Whelan, Michael</au><au>Kechadi, Tahar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A clustering-based data reduction for very large spatio-temporal datasets</atitle><date>2016-09-04</date><risdate>2016</risdate><abstract>Today, huge amounts of data are being collected with spatial and temporal components from sources such as meteorological, satellite imagery etc. Efficient visualisation as well as discovery of useful knowledge from these datasets is therefore very challenging and becoming a massive economic need. Data Mining has emerged as the technology to discover hidden knowledge in very large amounts of data. Furthermore, data mining techniques could be applied to decrease the large size of raw data by retrieving its useful knowledge as representatives. As a consequence, instead of dealing with a large size of raw data, we can use these representatives to visualise or to analyse without losing important information. This paper presents a new approach based on different clustering techniques for data reduction to help analyse very large spatio-temporal data. We also present and discuss preliminary results of this approach.</abstract><doi>10.48550/arxiv.1609.00988</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1609.00988
ispartof
issn
language eng
recordid cdi_arxiv_primary_1609_00988
source arXiv.org
subjects Computer Science - Databases
title A clustering-based data reduction for very large spatio-temporal datasets
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T14%3A09%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20clustering-based%20data%20reduction%20for%20very%20large%20spatio-temporal%20datasets&rft.au=Le-Khac,%20Nhien-An&rft.date=2016-09-04&rft_id=info:doi/10.48550/arxiv.1609.00988&rft_dat=%3Carxiv_GOX%3E1609_00988%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true