Paper Title:
A Web Data Mining Algorithm Based on Weighted Association Rules
  Abstract

Association rules mining is attracting much attention in research community due to its broad applications. Existing web data mining methods suffer the problems that 1) the large number of candidate itemsets, which are hard to be pruned, should be pruned in advance. 2) the time of scanning the database, which are needed to scan transactional database repeatedly, should be reduced. In this paper, a new association rules mining model is introduced for overcoming above two problems. We develop an efficient algorithm-WARDM(Weighted Association Rules Data Mining) for mining the candidate itemsets. The algorithm discusses the generation of candidate-1 itemset, candidate-2 itemset and candidate-k itemset(k>2),which can avoid missing weighted frequent itemsets. And the transactional database are scanned only once and candidate itemsets are pruned twice, which can reduce the amount of candidate itemsets. Theoretical analysis and experimental results show the space and time complexity is relatively good, Meanwhile the algorithm decreases the number of candidate itemsets, enhances the execution efficiency.

  Info
Periodical
Key Engineering Materials (Volumes 467-469)
Edited by
Dehuai Zeng
Pages
1386-1391
DOI
10.4028/www.scientific.net/KEM.467-469.1386
Citation
X. Lv, Y. J. Li, X. Lu, "A Web Data Mining Algorithm Based on Weighted Association Rules", Key Engineering Materials, Vols. 467-469, pp. 1386-1391, 2011
Online since
February 2011
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: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Zhong Ping Zhang, Yong Xin Liang
Abstract:This paper proposes a new data stream outlier detection algorithm SODRNN based on reverse nearest neighbors. We deal with the sliding window...
1032
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21
Authors: Shu Hua Ma, Jin Kuan Wang, Zhi Gang Liu, Hou Yan Jiang
Chapter 1: Applied Mechanics and Measurement Technology of Detection and Monitoring
Abstract:Data measured and collected by WSNs is often unreliable and a big amount of anomaly data exist. Detecting these anomaly in energy-constrained...
226
Authors: Jun Tan
Chapter 12: Computer-Aided Design and Applications in Industry and Civil Engineering
Abstract:Online mining of frequent closed itemsets over streaming data is one of the most important issues in mining data streams. In this paper, we...
2910