⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 arules.bib

📁 本程序是基于linux系统下c++代码
💻 BIB
📖 第 1 页 / 共 2 页
字号:
@Book{arules:Hastie+Tibshirani+Friedman:2001,  author       = {Trevor Hastie and Robert Tibshirani and Jerome                  Friedman},  title	       = {The Elements of Statistical Learning (Data Mining,                  Inference and Prediction)},  publisher    = {Springer Verlag},  year	       = 2001,}@InProceedings{arules:Borgelt:2003,  author       = {Christian Borgelt},  title	       = {Efficient Implementations of {Apriori} and {Eclat}},  BOOKTITLE    = {FIMI'03: Proceedings of the IEEE ICDM Workshop on                  Frequent Itemset Mining Implementations},  MONTH	       = {November},  YEAR	       = 2003,}@InProceedings{arules:Borgelt+Kruse:2002,  author       = {Christian Borgelt and Rudolf Kruse},  title	       = {Induction of Association Rules: {Apriori}                  Implementation},  booktitle    = {Proc.\ 15th Conf.\ on Computational Statistics                  (Compstat 2002, Berlin, Germany)},  publisher    = {Physika Verlag},  address      = {Heidelberg, Germany},  year	       = 2002,}@InProceedings{arules:Agrawal+Srikant:1994,  author       = {Rakesh Agrawal and Ramakrishnan Srikant},  title	       = {Fast Algorithms for Mining Association Rules},  booktitle    = {Proc. 20th Int. Conf. Very Large Data Bases, {VLDB}},  month	       = {12--15 September},  publisher    = {Morgan Kaufmann},  editor       = {Jorge B. Bocca and Matthias Jarke and Carlo Zaniolo},  pages	       = {487--499},  year	       = 1994,}@InProceedings{arules:Srikant+Agrawal:1996,  author       = {Ramakrishnan Srikant and Rakesh Agrawal},  title	       = {Mining Quantitative Association Rules in Large                  Relational Tables},  booktitle    = {Int. Conf. on Management of Data, {SIGMOD}},  publisher    = {{ACM} Press},  location     = {Montreal, Quebec, Canada},  editor       = {H. V. Jagadish and Inderpal Singh Mumick},  pages	       = {1--12},  year	       = 1996,}@InProceedings{arules:Agrawal+Imielinski+Swami:1993,  author       = {Rakesh Agrawal and Tomasz Imielinski and Arun Swami},  title	       = {Mining Association Rules between Sets of Items in                  Large Databases},  booktitle    = {Proceedings of the 1993 ACM SIGMOD International                  Conference on Management of Data},  year	       = 1993,  pages	       = {207--216},  location     = {Washington, D.C., United States},  url	       = {http://doi.acm.org/10.1145/170035.170072},  publisher    = {ACM Press},}@Manual{arules:Blake+Merz:1998,  author       = {A. Asuncion and D. J. Newman},  year	       = {2007},  title	       = {{UCI} Repository of Machine Learning Databases},  url	       = {http://www.ics.uci.edu/~mlearn/MLRepository.html},  organization  = {University of California, Irvine, Deptartment of Information                  and Computer Sciences},}@Manual{arules:Borgelt:1996,  title	       = {Finding Association Rules/Hyperedges with                  the {Apriori} Algorithm},  author       = {Christian Borgelt},  organization = {Working Group Neural Networks and Fuzzy Systems, Otto-von-Guericke-University of Magdeburg},  address      = {Universit\"atsplatz 2, D-39106 Magdeburg, Germany},  year	       = 2004,  url	       = {http://fuzzy.cs.uni-magdeburg.de/~borgelt/apriori.html},}@TECHREPORT{arules:Zaki+Parthasarathy+Ogihara+Li:1997,  AUTHOR       = {Mohammed J. Zaki and Srinivasan Parthasarathy and                  Mitsunori Ogihara and Wei Li},  TITLE	       = {New Algorithms for Fast Discovery of Association                  Rules},  ADDRESS      = {Rochester, NY 14627},  MONTH	       = {July},  YEAR	       = 1997,  NUMBER       = 651,  INSTITUTION  = {Computer Science Department, University of Rochester},}@INPROCEEDINGS{arules:Pasquier+Bastide+Taouil+Lakhal:1999,  AUTHOR       = { Nicolas Pasquier and Yves Bastide and Rafik Taouil                  and Lotfi Lakhal},  TITLE	       = {Discovering Frequent Closed Itemsets for Association                  Rules},  BOOKTITLE    = {Proceeding of the 7th International Conference on                  Database Theory, Lecture Notes In Computer Science                  (LNCS 1540)},  PUBLISHER    = {Springer},  pages	       = {398--416},  YEAR	       = 1999,}@ARTICLE{arules:Goethals+Zaki:2004,  AUTHOR       = {Bart Goethals and Mohammed J. Zaki},  TITLE	       = {Advances in Frequent Itemset Mining Implementations:                  Report on {FIMI}'03},  JOURNAL      = {SIGKDD Explorations},  VOLUME       = 6,  NUMBER       = 1,  PAGES	       = {109--117},  YEAR	       = 2004,}@ARTICLE{arules:Omiecinski:2003,  AUTHOR       = {Edward R. Omiecinski},  TITLE	       = {Alternative Interest Measures for Mining Associations                  in Databases},  JOURNAL      = {IEEE Transactions on Knowledge and Data Engineering},  VOLUME       = 15,  NUMBER       = 1,  MONTH	       = {Jan/Feb},  PAGES	       = {57--69},  YEAR	       = 2003,}@INPROCEEDINGS{arules:Brin+Motwani+Ullman+Tsur:1997,  AUTHOR       = {Sergey Brin and Rajeev Motwani and Jeffrey D. Ullman                  and Shalom Tsur},  TITLE	       = {Dynamic Itemset Counting and Implication Rules for                  Market Basket Data},  BOOKTITLE    = {SIGMOD 1997, Proceedings ACM SIGMOD International                  Conference on Management of Data},  PAGES	       = {255--264},  ADDRESS      = {Tucson, Arizona, USA},  MONTH	       = {May},  YEAR	       = 1997,}@INCOLLECTION{arules:Piatetsky-Shapiro:1991,  AUTHOR       = {Gregory Piatetsky-Shapiro},  TITLE	       = {Discovery, Analysis, and Presentation of Strong Rules},  BOOKTITLE    = {Knowledge Discovery in Databases},  YEAR	       = 1991,  EDITOR       = {Gregory Piatetsky-Shapiro and William J. Frawley},  PUBLISHER    = {AAAI/MIT Press},  ADDRESS      = {Cambridge, MA},}@Manual{arules:Bates+Maechler:2005,  title	       = {Matrix: A Matrix Package for R},  author       = {Douglas Bates and Martin Maechler},  year	       = 2005,  note	       = {R package version 0.95-5},}@Manual{arules:Williams:2008,  title	       = {pmml: Generate PMML for various models},  author       = {Graham Williams},  year	       = 2008,  note	       = {R package version 1.1.7},}@ARTICLE{arules:Hipp+Guentzer+Nakhaeizadeh:2000,  AUTHOR       = {Jochen Hipp and Ulrich G\"untzer and Gholamreza                  Nakhaeizadeh},  TITLE	       = {Algorithms for Association Rule Mining -- {A} General                  Survey and Comparison},  JOURNAL      = {SIGKDD Explorations},  VOLUME       = 2,  NUMBER       = 2,  PAGES	       = {1--58},  YEAR	       = 2000,}@ARTICLE{arules:Zaki:2004,  AUTHOR       = {Mohammed J. Zaki},  TITLE	       = {Mining Non-Redundant Association Rules},  JOURNAL      = {Data Mining and Knowledge Discovery},  VOLUME       = 9,  PAGES	       = {223--248},  YEAR	       = 2004,}@ARTICLE{arules:Zaki:2000,  AUTHOR       = {Mohammed J. Zaki},  TITLE	       = {Scalable Algorithms for Association Mining},  JOURNAL      = {IEEE Transactions on Knowledge and Data Engineering},  VOLUME       = 12,  NUMBER       = 3,  MONTH	       = {May/June},  PAGES	       = {372--390},  YEAR	       = 2000,}@BOOK{arules:Berry+Linoff:1997,  author       = {Michael J. A. Berry and Gordon S. Linoff},  title	       = {Data Mining Techniques for Marketing, Sales and                  Customer Support},  publisher    = {Wiley Computer Publishing},  year	       = 1997,}@INPROCEEDINGS{arules:Orlando+Lucchese+Palmerini+Perego+Silvestri:2003,  AUTHOR       = {Salvatore Orlando and Claudio Lucchese and Paolo                  Palmerini and Raffaele Perego and Fabrizio Silvestri},  TITLE	       = {kDCI: a Multi-Strategy Algorithm for Mining Frequent                  Sets},  BOOKTITLE    = {FIMI'03: Proceedings of the IEEE ICDM Workshop on                  Frequent Itemset Mining Implementations},  MONTH	       = {November},  YEAR	       = 2003,  editor       = {Bart Goethals and Mohammed J. Zaki},}@INPROCEEDINGS{arules:Uno+Asai+Uchida+Arimura:2003,  AUTHOR       = {Takeaki Uno and Tatsuya Asai and Yuzo Uchida and                  Hiroki Arimura},  TITLE	       = {LCM: An Efficient Algorithm for Enumerating Frequent                  Closed Item Sets},  BOOKTITLE    = {FIMI'03: Proceedings of the IEEE ICDM Workshop on                  Frequent Itemset Mining Implementations},  MONTH	       = {November},  YEAR	       = 2003,  editor       = {Bart Goethals and Mohammed J. Zaki},}@PROCEEDINGS{arules:Goethals+Zaki:2003,  TITLE	       = {FIMI'03: Proceedings of the IEEE ICDM Workshop on                  Frequent Itemset Mining Implementations},  MONTH	       = {November},  YEAR	       = 2003,  editor       = {Bart Goethals and Mohammed J. Zaki},  publisher    = {Sun SITE Central Europe (CEUR)},}@ARTICLE{arules:Silverstein+Brin+Motwani:1998,  AUTHOR       = {Craig Silverstein and Sergey Brin and Rajeev Motwani},  TITLE	       = {Beyond Market Baskets: Generalizing Association Rules                  to Dependence Rules},  JOURNAL      = {Data Mining and Knowledge Discovery},  VOLUME       = 2,  PAGES	       = {39--68},  YEAR	       = 1998,}@INPROCEEDINGS{arules:DuMouchel+Pregibon2001,  AUTHOR       = {William DuMouchel and Daryl Pregibon},  TITLE	       = {Empirical {B}ayes Screening for Multi-Item Associations},  BOOKTITLE    = {Proceedings of the ACM SIGKDD Intentional Conference                  on Knowledge Discovery in Databases \& Data Mining

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -