Towards Rare Itemset Mining

Conference object English OPEN
Szathmary , Laszlo ; Napoli , Amedeo ; Valtchev , Petko (2007)
  • Publisher: HAL CCSD
  • Subject: itemset extraction | [ INFO.INFO-IR ] Computer Science [cs]/Information Retrieval [cs.IR] | rare itemsets | rare item problem
    acm: ComputingMethodologies_PATTERNRECOGNITION | InformationSystems_DATABASEMANAGEMENT

site de la conférence :; International audience; We describe here a general approach for rare itemset mining. While mining literature has been almost exclusively focused on frequent itemsets, in many practical situations rare ones are of ... View more
  • References (21)
    21 references, page 1 of 3

    [1] R. C. Agarwal, C. C. Aggarwal, and V. V. V. Prasad. Depth first generation of long patterns. In Proc. of SIGKDD '00, pages 108-118. ACM Press, 2000.

    [2] R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. I. Verkamo. Fast discovery of association rules. In Advances in knowledge discovery and data mining, pages 307-328. AAAI, 1996.

    [3] Y. Bastide, R. Taouil, N. Pasquier, G. Stumme, and L. Lakhal. Mining frequent patterns with counting inference. SIGKDD Explor. Newsl., 2(2):66-75, 2000.

    [4] R. J. Bayardo. Efficiently mining long patterns from databases. In Proc. of SIGMOD '98, pages 85-93. ACM Press, 1998.

    [5] C. Berge. Hypergraphs: Combinatorics of Finite Sets. North Holland, Amsterdam, 1989.

    [6] E. Boros, V. Gurvich, L. Khachiyan, and K. Makino. On maximal frequent and minimal infrequent sets in binary matrices. Annals of Mathematics and Artificial Intelligence, 39:211-221, 2003.

    [7] B. A. Davey and H. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 2nd edition, 2002.

    [8] K. Gouda and M. J. Zaki. Efficiently Mining Maximal Frequent Itemsets. In Proc. of ICDM '01, pages 163-170, Washington, DC, USA, 2001. IEEE Computer Society.

    [9] Y. Koh and N. Rountree. Finding Sporadic Rules Using Apriori-Inverse. In Proc. of PAKDD '05, Hanoi, Vietnam, volume 3518 of LNCS, pages 97-106. Springer, May 2005.

    [10] M. Kryszkiewicz. Concise Representation of Frequent Patterns Based on Disjunction-Free Generators. In Proc. of ICDM '01, pages 305-312, Washington, DC, USA, 2001. IEEE Computer Society.

  • Metrics
    No metrics available
Share - Bookmark