About: An efficient algorithm for incremental mining of temporal association rules

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: An efficient algorithm for incremental mining of temporal association rules Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
Title	An efficient algorithm for incremental mining of temporal association rules An efficient algorithm for incremental mining of temporal association rules (en)
skos:prefLabel	An efficient algorithm for incremental mining of temporal association rules An efficient algorithm for incremental mining of temporal association rules (en)
skos:notation	RIV/61989100:27240/10:86075424!RIV11-MSM-27240___
http://linked.open...avai/riv/aktivita	S
http://linked.open...avai/riv/aktivity	S
http://linked.open...iv/cisloPeriodika	8
http://linked.open...vai/riv/dodaniDat	2011
http://linked.open...aciTvurceVysledku	Abraham Padath, Ajith
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Vysoká škola báňská - Technická univerzita Ostrava / Fakulta elektrotechniky a informatiky
http://linked.open...dnocenehoVysledku	246188
http://linked.open...ai/riv/idVysledku	RIV/61989100:27240/10:86075424
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	rules; association; temporal; mining; incremental; for; algorithm; efficient (en)
http://linked.open.../riv/klicoveSlovo	temporal incremental association for mining rules algorithm efficient
http://linked.open...odStatuVydavatele	NL - Nizozemsko
http://linked.open...ontrolniKodProRIV	[31017B7083F8]
http://linked.open...i/riv/nazevZdroje	DATA & KNOWLEDGE ENGINEERING
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...UplatneniVysledku	2010
http://linked.open...v/svazekPeriodika	69
http://linked.open...iv/tvurceVysledku	Abraham Padath, Ajith Gharib, Tarek F. Nassar, Hamed Taha, Mohamed
http://linked.open...ain/vavai/riv/wos	000279596000004
issn	0169-023X
number of pages	16 (xsd:int)
http://localhost/t...ganizacniJednotka	27240
is http://linked.open...avai/riv/vysledek of	An efficient algorithm for incremental mining of temporal association rules An efficient algorithm for incremental mining of temporal association rules An efficient algorithm for incremental mining of temporal association rules

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software