A Shapley Value Index for Market Basket Analysis: Efficient Computation Using an Harsanyi Dividend Representation (Q6173044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Study of Proxies for Shapley Allocations of Transport Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear approximation method for the Shapley value / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cooperative Game Theory of Networks and Hierarchies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Bargaining Model for the n-Person Cooperative Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing market baskets by restricted Boltzmann machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5817870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient single-pass frequent pattern mining using a prefix-tree / rank
 
Normal rank

Revision as of 18:51, 1 August 2024

scientific article; zbMATH DE number 7714934
Language Label Description Also known as
English
A Shapley Value Index for Market Basket Analysis: Efficient Computation Using an Harsanyi Dividend Representation
scientific article; zbMATH DE number 7714934

    Statements

    A Shapley Value Index for Market Basket Analysis: Efficient Computation Using an Harsanyi Dividend Representation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 July 2023
    0 references
    market basket analysis
    0 references
    cooperative game theory
    0 references
    Shapley value
    0 references
    operations management
    0 references
    cost benefit analysis
    0 references
    deterministic demand
    0 references

    Identifiers