Subscribe Now Subscribe Today
Science Alert
Curve Top
Information Technology Journal
  Year: 2010 | Volume: 9 | Issue: 6 | Page No.: 1246-1250
DOI: 10.3923/itj.2010.1246.1250
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

Frequent Browsing Patterns Mining Based on Dependency for Online Shopping

Qing Yang, Ping Zhou and Jingwei Zhang

Internet sellers hope to let the consumers find their commodities easily, but there is a divergence between commodities presentation requirements and the limitation of a web page. In order to pursuit the profit-maximizing, a web page must contain the most welcome commodities. In this study, we proposed a multiple candidate set method to discover those most welcome commodities from users' browsing data. Our approach utilizes frequent dependent relationships among the commodities to partition the unique candidate set, composed of all single frequent item, into multiple sub-candidate sets for computing the frequent browsing patterns, which avoids the problem of searching through a large space of candidate set. Our experiments illustrate the benefits of the proposed method against the single frequent item candidate set.
PDF Fulltext XML References Citation Report Citation
  •    Clique Discovery Based on User Similarity for Online Shopping Recommendation
  •    Design of Algorithm for Frequent Pattern Discovery Using Lattice Approach
How to cite this article:

Qing Yang, Ping Zhou and Jingwei Zhang, 2010. Frequent Browsing Patterns Mining Based on Dependency for Online Shopping. Information Technology Journal, 9: 1246-1250.

DOI: 10.3923/itj.2010.1246.1250






Curve Bottom