"Upper bounds on the number of candidate itemsets in Apriori like algorithms."

Savo Tomovic, Predrag Stanisic (2014)

> Home

Details and statistics

DOI: 10.1109/MECO.2014.6862711

access: closed

type: Conference or Workshop Paper

metadata version: 2024-10-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/meco/TomovicS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/meco/TomovicS14
Savo Tomovic, Predrag Stanisic:
Upper bounds on the number of candidate itemsets in Apriori like algorithms. MECO 2014: 260-263

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.