A fast method for discovering critical edge sequences in e-commerce catalogs (Q877071): Difference between revisions

@@ Property / DOI @@
-.1016/j.ejor.2006.06.055
@@ Property / DOI: 10.1016/j.ejor.2006.06.055 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2006.06.055
+Normal rank
@@ Property / OpenAlex ID @@
+W2022257338
@@ Property / OpenAlex ID: W2022257338 / rank @@
+Normal rank
@@ Property / cites work @@
+An architecture to support scalable online personalization on the Web
+Normal rank
@@ Property / cites work @@
+Finding the k Shortest Paths
@@ Property / cites work: Finding the k Shortest Paths / rank @@
+Normal rank
@@ Property / cites work @@
+Q3365926
@@ Property / cites work: Q3365926 / rank @@
+Normal rank
@@ Property / cites work @@
+SPADE: An efficient algorithm for mining frequent sequences
+Normal rank
@@ Property / cites work @@
+Q3046577
@@ Property / cites work: Q3046577 / rank @@
+Normal rank
@@ Property / cites work @@
+On algorithms for finding the k shortest paths in a network
+Normal rank
@@ Property / cites work @@
+Data mining for measuring and improving the success of web sites
+Normal rank
@@ Property / cites work @@
+PlanMine: Prediction plan failures using sequence mining
+Normal rank
@@ Property / DOI @@
+.1016/J.EJOR.2006.06.055
@@ Property / DOI: 10.1016/J.EJOR.2006.06.055 / rank @@
+Normal rank