A fast method for discovering critical edge sequences in e-commerce catalogs

DOI10.1016/J.EJOR.2006.06.055zbMATH Open1131.90424OpenAlexW2022257338MaRDI QIDQ877071FDOQ877071

Krithi Ramamritham, Anindya Datta, Debra VanderMeer, Kaushik Dutta, Pinar Keskinocak

Publication date: 19 April 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.06.055

Recommendations

• Data mining for measuring and improving the success of web sites
• Efficient mining of traversal patterns
• scientific article; zbMATH DE number 2090715
• Mining patterns from graph traversals
• scientific article; zbMATH DE number 1945790

zbMATH Keywords

data miningapplied probabilitygraph theorye-commerce

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Operations research and management science (90B99)

Cites Work

• SPADE: An efficient algorithm for mining frequent sequences
• PlanMine: Prediction plan failures using sequence mining
• Finding the k Shortest Paths
• On algorithms for finding the k shortest paths in a network
• Data mining for measuring and improving the success of web sites
• Title not available (Why is that?)
• Title not available (Why is that?)
• An architecture to support scalable online personalization on the Web

Cited In (4)

• Title not available (Why is that?)
• Subsessions: A granular approach to click path analysis
• Data mining for measuring and improving the success of web sites
• A framework for configuring collaborative filtering-based recommendations derived from purchase data

Uses Software

• PlanMine
• SPADE

This page was built for publication: A fast method for discovering critical edge sequences in e-commerce catalogs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877071)