A fast method for discovering critical edge sequences in e-commerce catalogs (Q877071): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: An architecture to support scalable online personalization on the Web / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding the k Shortest Paths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3365926 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SPADE: An efficient algorithm for mining frequent sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3046577 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On algorithms for finding the k shortest paths in a network / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Data mining for measuring and improving the success of web sites / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PlanMine: Prediction plan failures using sequence mining / rank | |||
Normal rank |
Latest revision as of 17:47, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A fast method for discovering critical edge sequences in e-commerce catalogs |
scientific article |
Statements
A fast method for discovering critical edge sequences in e-commerce catalogs (English)
0 references
19 April 2007
0 references
data mining
0 references
e-commerce
0 references
graph theory
0 references
applied probability
0 references