"On the computational complexity of two frequent set generation algorithms."

Alan P. Sprague (2004)

> Home

Details and statistics

DOI: 10.1109/ICMLA.2004.1383533

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/icmla/Sprague04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icmla/Sprague04
Alan P. Sprague:
On the computational complexity of two frequent set generation algorithms. ICMLA 2004: 344-350

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.