Paper Title:
Fast Algorithms for Temporal Association Rules in a Large Database
  Abstract

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, 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
$32.00
Share

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

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

Authors: Yi Yong Ye
Chapter 4: Mathematical Analysis, Computer Science, Communication and Information Technologies
Abstract:For large amounts of data generated by the e-commerceplatform, combining with the actual needs of e-commerce recommendation system,make...
737
Authors: Dong Juan Gu, Lei Xia
Chapter 5: System Test, Diagnosis, Detection and Monitoring, Instrumentation and Measurement, Optimization and Algorithms, Numerical Methods and Simulation
Abstract:Apriori algorithm is the classical algorithm in data mining association rules. Because the Apriori algorithm needs scan database for many...
543