"Rough Sets and Association Rules - Which is Efficient?"

Daniel Delic, Hans-Joachim Lenz, Mattis Neiling (2002)

> Home

Details and statistics

DOI: 10.1007/978-3-642-57489-4_81

access: closed

type: Conference or Workshop Paper

metadata version: 2020-04-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/compstat/DelicLN02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/compstat/DelicLN02
Daniel Delic, Hans-Joachim Lenz, Mattis Neiling:
Rough Sets and Association Rules - Which is Efficient? COMPSTAT 2002: 527-532

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.