"Mining N-most interesting itemsets without support threshold by the COFI-tree."

Sze-Chung Ngan et al. (2005)

> Home

Details and statistics

DOI: 10.1504/IJBIDM.2005.007320

access: closed

type: Journal Article

metadata version: 2020-07-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijbidm/NganLWF05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijbidm/NganLWF05
Sze-Chung Ngan, Tsang Lam, Raymond Chi-Wing Wong, Ada Wai-Chee Fu:
Mining N-most interesting itemsets without support threshold by the COFI-tree. Int. J. Bus. Intell. Data Min. 1(1): 88-106 (2005)

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.