This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n5http://localhost/temp/predkladatel/
n11http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F61989100%3A27240%2F10%3A86075424%21RIV11-MSM-27240___/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F61989100%3A27240%2F10%3A86075424%21RIV11-MSM-27240___
rdf:type
n11:Vysledek skos:Concept
dcterms:description
This paper presents the concept of temporal association rules in order to solve the problem of handling time series by including time expressions into association rules. Actually, temporal databases are continually appended or updated so that the discovered rules need to be updated. Re-running the temporal mining algorithm every time is ineffective since it neglects the previously discovered rules, and repeats the work done previously. Furthermore, existing incremental mining techniques cannot deal with temporal association rules. In this paper, an incremental algorithm to maintain the temporal association rules in a transaction database is proposed. The algorithm benefits from the results of earlier mining to derive the final mining output. The experimental results on both the synthetic and the real dataset illustrate a significant improvement over the conventional approach of mining the entire updated database. (C) 2010 Elsevier B.V. All rights reserved. This paper presents the concept of temporal association rules in order to solve the problem of handling time series by including time expressions into association rules. Actually, temporal databases are continually appended or updated so that the discovered rules need to be updated. Re-running the temporal mining algorithm every time is ineffective since it neglects the previously discovered rules, and repeats the work done previously. Furthermore, existing incremental mining techniques cannot deal with temporal association rules. In this paper, an incremental algorithm to maintain the temporal association rules in a transaction database is proposed. The algorithm benefits from the results of earlier mining to derive the final mining output. The experimental results on both the synthetic and the real dataset illustrate a significant improvement over the conventional approach of mining the entire updated database. (C) 2010 Elsevier B.V. All rights reserved.
dcterms:title
An efficient algorithm for incremental mining of temporal association rules An efficient algorithm for incremental mining of temporal association rules
skos:prefLabel
An efficient algorithm for incremental mining of temporal association rules An efficient algorithm for incremental mining of temporal association rules
skos:notation
RIV/61989100:27240/10:86075424!RIV11-MSM-27240___
n4:aktivita
n6:S
n4:aktivity
S
n4:cisloPeriodika
8
n4:dodaniDat
n12:2011
n4:domaciTvurceVysledku
Abraham Padath, Ajith
n4:druhVysledku
n15:J
n4:duvernostUdaju
n14:S
n4:entitaPredkladatele
n9:predkladatel
n4:idSjednocenehoVysledku
246188
n4:idVysledku
RIV/61989100:27240/10:86075424
n4:jazykVysledku
n8:eng
n4:klicovaSlova
rules; association; temporal; mining; incremental; for; algorithm; efficient
n4:klicoveSlovo
n7:efficient n7:for n7:mining n7:incremental n7:association n7:algorithm n7:temporal n7:rules
n4:kodStatuVydavatele
NL - Nizozemsko
n4:kontrolniKodProRIV
[31017B7083F8]
n4:nazevZdroje
DATA & KNOWLEDGE ENGINEERING
n4:obor
n16:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
4
n4:rokUplatneniVysledku
n12:2010
n4:svazekPeriodika
69
n4:tvurceVysledku
Gharib, Tarek F. Abraham Padath, Ajith Nassar, Hamed Taha, Mohamed
n4:wos
000279596000004
s:issn
0169-023X
s:numberOfPages
16
n5:organizacniJednotka
27240