Advanced SearchSearch Tips
Finding high utility old itemsets in web-click streams
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Finding high utility old itemsets in web-click streams
Chang, Joong-Hyuk;
  PDF(new window)
Web-based services are used widely in many computer application fields due to the increasing use of PCs and mobile devices. Accordingly, topics on the analysis of access logs generated in the application fields have been researched actively to support personalized services in the field, and analyzing techniques based on the weight differentiation of information in access logs have been proposed. This paper outlines an analysis technique for web-click streams, which is useful for finding high utility old item sets in web-click streams, whose data elements are generated at a rapid rate. Using the technique, interesting information can be found, which is difficult to find in conventional techniques for analyzing web-click streams and is used effectively in target marketing. The proposed technique can be adapted widely to analyzing the data generated in a range of computing application fields, such as IoT environments, bio-informatics, etc., which generated data as a form of data streams.
Data streams;Data stream mining;High utility old itemsets;Highly attention itemsets;Web-click streams;
 Cited by
L. Chen and Q. Mei, "Mining frequent items in data stream using time fading model," Information Sciences, 257(1), pp. 54-69, 2014. DOI: crossref(new window)

B.-E. Shie, P.S. Yu, and V. S. Tseng, "Efficient algorithms for mining maximal high utility itemsets from data streams with different models," Expert Systems with Applications, 39(17), pp. 12947-12960, 2012. DOI: crossref(new window)

C. Zhang, F. Masseglia, and Y. Lechevallier, "The anti-bouncing data stream model for web usage streams," Information Sciences, 278(1), pp. 757-772, 2014. DOI: crossref(new window)

T. Yoon and J.-H. Lee, "Adaptive web search based on user web log," Journal of the Korea Academia-Industrial cooperation Society, 15(11), pp. 6856-6862, 2014. DOI: crossref(new window)

J.-H. Chang, "Mining interesting sequential pattern with a time-interval constraint for efficient analyzing a web-click stream," Journal of the Korea Industrial Information Systems Research, 16(2), pp. 19-29, 2011. DOI: crossref(new window)

H.-K. Lee, "A study on web-user clustering algorithm for web personalization," Journal of the Korea Academia-Industrial cooperation Society, 12(5), pp. 2375-2382, 2011. DOI: crossref(new window)

C.-W. Li and K.-F. Jea, "An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams," Expert Systems with Applications, 38(10), pp. 13386-13404, 2011. DOI: crossref(new window)

H.-F. Li and S.-Y. Lee, "Mining frequent itemsets over data streams using efficient window sliding techniques," Expert Systems with Applications, 36(2), pp. 1466-1477, 2009. DOI: crossref(new window)

H. Chen, L.C. Shu, J. Xia, and Q. Deng, "Mining frequent patterns in a varying-size sliding window of online transactional data streams," Information Sciences, 215(1), pp. 15-36, 2012. DOI: crossref(new window)

C.C. Aggarwal and P.S. Yu, "A framework for clustering uncertain data streams," in Proc. of the Int'l Conf. on Data Engineering, pp. 150-159, 2008. DOI: crossref(new window)

J.H. Chang and W.S. Lee, "Finding Recently Frequent Itemsets Adaptively over Online Transactional Data Streams," Information Systems, 31(8), pp. 849-869, 2006. DOI: crossref(new window)

R. Agrawal and R. Srikant, "Fast Algorithms for Mining Association Rules," in Proc. of the 20thInternational Conf. on Very Large Data Bases, pp. 487-499, 1994.