registrieren | anmelden | FAQ      [?] 

Tag itemsets [22 articles]

Recent papers classified by the tag itemsets.
  • A Tight Upper Bound on the Number of Candidate Patterns
    (2001), pp. 155-162.
    by Floris Geerts, Bart Goethals, Jan Van den Bussche
  • Dynamic itemset counting and implication rules for market basket data
    (1997), pp. 255-264.
    by Sergey Brin, Rajeev Motwani, Jeffrey D Ullman, Shalom Tsur
  • Discovering Frequent Closed Itemsets for Association Rules
    : Database Theory - ICDT'99: 7th International Conference, Jerusalem, Israel, January 1999. Proceedings (1998), 398.
    by Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal
  • Dense itemsets
    (2004), pp. 683-688.
    by Jouni K Sepp&\#228;nen, Heikki Mannila
  • Fast Algorithms for Mining Association Rules
    (December--JanuaryMay~ 1994), pp. 487-499.
    by Rakesh Agrawal, Ramakrishnan Srikant
    edited by Jorge B Bocca, Matthias Jarke, Carlo Zaniolo
  • Generalizing the Notion of Support
    by Michael Steinbach, Pang N Tan, Hui Xiong, Vipin Kumar
    posted to datamining itemsets support by michaelmampaey on 2007-03-23 16:02:09 as read along with 1 group ADMiRes
  • Association Rules in Incomplete Databases
    (1999), pp. 84-93.
    by Marzena Kryszkiewicz
  • CHARM: An Efficient Algorithm for Closed Itemset Mining
    by Mohammed J Zaki, Ching J Hsiao
    posted to closed datamining itemsets by michaelmampaey on 2007-07-17 15:26:44 as ** along with 1 group ADMiRes
  • Computational aspects of mining maximal frequent patterns
    Theor. Comput. Sci., Vol. 362, No. 1. (October 2006), pp. 63-85.
    by Guizhen Yang
  • Summarization - Compressing Data into an Informative Representation
    (2005), pp. 98-105.
    by Varun Chandola, Vipin Kumar
    posted to clustering compression itemsets summarization by michaelmampaey on 2008-02-07 10:59:10 as read
  • Mining Topk frequent closed patterns without minimum support
    (2002)
    by J Han, J Wang, Y Lu, P Tzvetkov
  • Feasible itemset distributions in data mining: theory and application
    (June September-December 2003), pp. 284-295.
    by G Ramesh, WA Maniatty, MJ Zaki
  • LPMiner: An Algorithm for Finding Frequent Itemsets Using Length-Decreasing Support Constraint
    (2001)
    by Masakazu Seno, George Karypis
    posted to datamining itemsets support by michaelmampaey on 2007-05-10 09:19:13 as ** along with 1 group ADMiRes
  • BAMBOO: Accelerating Closed Itemset Mining by Deeply Pushing the Length-Decreasing Support Constraint
    by J Wang, G Karypis
    posted to closed datamining itemsets support by michaelmampaey on 2007-05-10 09:17:43 as ** along with 1 group ADMiRes
  • Reasoning about sets using redescription mining
    (2005), pp. 364-373.
    by Mohammed J Zaki, Naren Ramakrishnan
  • Mining frequent patterns without candidate generation
    SIGMOD Rec., Vol. 29, No. 2. (June 2000), pp. 1-12.
    by Jiawei Han, Jian Pei, Yiwen Yin
  • Item Sets that Compress
    (2006)
    by Arno Siebes, Jilles Vreeken, Matthijs van Leeuwen
    edited by Joydeep Ghosh, Diane Lambert, David B Skillicorn, Jaideep Srivastava, Joydeep Ghosh, Diane Lambert, David B Skillicorn, Jaideep Srivastava
    posted to compression itemsets by michaelmampaey on 2008-03-11 14:05:50 as read
  • Geometrically Inspired Itemset Mining
    (2006), pp. 655-666.
    by Florian Verhein, Sanjay Chawla
    posted to datamining itemsets by michaelmampaey on 2007-03-23 16:11:25 as read along with 1 group ADMiRes
  • Efficient discovery of error-tolerant frequent itemsets in high dimensions
    (2001), pp. 194-203.
    by Cheng Yang, Usama Fayyad, Paul S Bradley
    posted to datamining error itemsets by michaelmampaey on 2007-04-02 12:41:52 as read along with 1 group ADMiRes
  • Compressing Large Boolean Matrices Using Reordering Techniques
    (2004)
    posted to compression datamining itemsets by michaelmampaey on 2008-03-21 19:39:19 as read
  • TFP: an efficient algorithm for mining top-k frequent closed itemsets
    Knowledge and Data Engineering, IEEE Transactions on, Vol. 17, No. 5. (2005), pp. 652-663.
    by Jianyong Wang, J Han, Y Lu, P Tzvetkov
    posted to closed data itemsets mining by clucches to the group InformationRetrieval on 2005-07-29 10:55:32 as **
  • Finding frequent itemsets over online data streams
    Information and Software Technology, Vol. 48, No. 7. (July 2006), pp. 606-618.
    by Joong H Chang, Won S Lee
    posted to data frequent itemsets mining streams by fernand0 on 2006-08-31 16:10:23 as read along with 1 person Marvin
  • Bemerkung: Sie können diese Seite wie folgt zitieren: http://www.citeulike.org/tag/itemsets

    RIS BibTeX RSS
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.