Share based measures for itemsets

被引：0
|
作者：
Carter, CL [1 ]
Hamilton, HJ [1 ]
Cercone, N [1 ]
机构：
[1] Univ Regina, Dept Comp Sci, Regina, SK S4S 0A2, Canada
来源：
PRINCIPLES OF DATA MINING AND KNOWLEDGE DISCOVERY | 1997年 / 1263卷
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We introduce the measures share, coincidence and dominance as alternatives to the standard itemset methodology measure of support. An itemset is a group of items bought together in a transaction. The support of an itemset is the ratio of transactions containing the itemset to the total number of transactions. The share of an itemset is the ratio of the count of items purchased together to the total count of items in all transactions. The coincidence of an itemset is the ratio of the count of items in that itemset to the total of those same items in the database. The dominance of an item in an itemset specifies the extent to which that item dominates the total of all items in the itemset. Share based measures have the advantage over support of reflecting accurately how many units are being moved by a business. The share measure can be extended to quantify the financial impact of an itemset on the business.
引用
收藏
页码：14 / 24
页数：11
相关论文
共 50 条
  • [1] Mining market basket data using share measures and characterized itemsets
    Hilderman, RJ
    Carter, CL
    Hamilton, HJ
    Cercone, N
    RESEARCH AND DEVELOPMENT IN KNOWLEDGE DISCOVERY AND DATA MINING, 1998, 1394 : 159 - 173
  • [2] Evaluation measures for frequent itemsets based on distributed representations
    Ozaki, Tomonobu
    2018 SIXTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR 2018), 2018, : 153 - 159
  • [3] Extracting Share Frequent Itemsets with Infrequent Subsets
    Brock Barber
    Howard J. Hamilton
    Data Mining and Knowledge Discovery, 2003, 7 : 153 - 185
  • [4] Parametric Algorithms for Mining Share Frequent Itemsets
    Brock Barber
    HOWARD J. HAMILTON
    Journal of Intelligent Information Systems, 2001, 16 : 277 - 293
  • [5] Extracting share frequent itemsets with infrequent subsets
    Barber, B
    Hamilton, HJ
    DATA MINING AND KNOWLEDGE DISCOVERY, 2003, 7 (02) : 153 - 185
  • [6] Parametric algorithms for mining share frequent itemsets
    Barber, B
    Hamilton, HJ
    JOURNAL OF INTELLIGENT INFORMATION SYSTEMS, 2001, 16 (03) : 277 - 293
  • [7] An Incremental Approach to Share-Frequent Itemsets Mining
    Nawapornanan, Chayanan
    Intakosum, Sarun
    Boonjing, Veera
    THAI JOURNAL OF MATHEMATICS, 2018, 16 (01): : 1 - 23
  • [8] On Evaluating Interestingness Measures for Closed Itemsets
    Buzmakov, Aleksey
    Kuznetsov, Sergei
    Napoli, Amedeo
    STAIRS 2014, 2014, 264 : 71 - 80
  • [9] Algorithms for Mining Share Frequent Itemsets Containing Infrequent Subsets
    Barber, Brock
    Hamilton, Howard J.
    LECTURE NOTES IN COMPUTER SCIENCE <D>, 2000, 1910 : 316 - 324
  • [10] A New Share Frequent Itemsets Mining using Incremental BitTable Knowledge
    Nawapornanan, Chayanan
    Boonjing, Veera
    2011 6TH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND CONVERGENCE INFORMATION TECHNOLOGY (ICCIT), 2012, : 358 - 362
12345