• Documents
  • Authors
  • Tables
  • Other Seers ▼
    RefSeer AckSeer CollabSeer SeerSeer
  • Log in
  • Sign up
  • MetaCart

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Online Association Rule Mining (1999)

Cached

  • Download as a PDF

Download Links

  • [www.cse.msu.edu]
  • [www.cs.duke.edu]
  • [www.cs.duke.edu]
  • [www.icsi.berkeley.edu]
  • [www.icsi.berkeley.edu]
  • [wuarchive.wustl.edu]
  • [db.cs.berkeley.edu]
  • [s2k-ftp.cs.berkeley.edu:8000]

  • Other Repositories/Bibliography

  • DBLP
  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Christian Hidber
Citations:82 - 0 self
  • Summary
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@INPROCEEDINGS{Hidber99onlineassociation,
    author = {Christian Hidber},
    title = {Online Association Rule Mining},
    booktitle = {},
    year = {1999},
    pages = {145--156}
}

Years of Citing Articles

Bookmark

citeulike Connotea Bibsonomy Del.icio.us Digg Reddit

OpenURL

 

Abstract

We present anovel algorithm to compute large itemsets online. The user is free to change the support threshold any time during the rst scan of the transaction sequence. The algorithm maintains a superset of all large itemsets and for each itemset a shrinking, deterministic interval on its support. After at most 2 scans the algorithm terminates with the precise support for each large itemset. Typically our algorithm is by an order of magnitude more memory e cient than Apriori or DIC. 1

Citations

No citations identified.

The National Science Foundation
  • About CiteSeerX
  • Submit Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2010 The Pennsylvania State University