"An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free ..."

Ping Guo et al. (2005)

> Home

Details and statistics

DOI: 10.1007/11527503_13

access: closed

type: Conference or Workshop Paper

metadata version: 2020-08-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/adma/GuoZZCK05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/adma/GuoZZCK05
Ping Guo, Yang Zhou, Jun Zhuang, Ting Chen, Yan-Rong Kang:
An Efficient Algorithm for Mining Both Closed and Maximal Frequent Free Subtrees Using Canonical Forms. ADMA 2005: 96-107

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.