Fast Algorithms for Temporal Association Rules in a Large Database

Abstract:

Article Preview

As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests. In this article, we propose a temporal association rule and its discovering algorithm with exponential smoothing filter in a large transaction database. Through experimental results, we confirmed that this is more precise and consumes a shorter running time than existing temporal association rules.

Info:

Periodical:

Key Engineering Materials (Volumes 277-279)

Edited by:

Kwang Hwa Chung, Yong Hyeon Shin, Sue-Nie Park, Hyun Sook Cho, Soon-Ae Yoo, Byung Joo Min, Hyo-Suk Lim and Kyung Hwa Yoo

Pages:

287-292

DOI:

10.4028/www.scientific.net/KEM.277-279.287

Citation:

L. N. Byon and J. H. Han, "Fast Algorithms for Temporal Association Rules in a Large Database", Key Engineering Materials, Vols. 277-279, pp. 287-292, 2005

Online since:

January 2005

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.