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 条
  • [21] Maximum entropy based significance of itemsets
    Nikolaj Tatti
    Knowledge and Information Systems, 2008, 17 : 57 - 77
  • [22] Computational complexity of queries based on itemsets
    Tatti, N
    INFORMATION PROCESSING LETTERS, 2006, 98 (05) : 183 - 187
  • [23] Clustering Frequent Itemsets Based on Generators
    Li, Jinhong
    Yang, Bingru
    Song, Wei
    Hou, Wei
    2008 INTERNATIONAL SYMPOSIUM ON INTELLIGENT INFORMATION TECHNOLOGY APPLICATION, VOL II, PROCEEDINGS, 2008, : 1083 - +
  • [24] Maximum entropy based significance of itemsets
    Tatti, Nikolaj
    ICDM 2007: PROCEEDINGS OF THE SEVENTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, 2007, : 312 - 321
  • [25] Does Accounting Treatment of Share-based Payments Impact Performance Measures for Banks?
    Ismail, Alaa Alhaj
    Adwan, Sami
    Stittle, John
    AUSTRALIAN ACCOUNTING REVIEW, 2019, 29 (04) : 631 - 648
  • [26] Efficiently algorithm based on itemsets-lattice and bitmap index for finding frequent itemsets
    Chen, Fu-Zan
    Li, Min-Qiang
    Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice, 2008, 28 (02): : 26 - 34
  • [27] Maximum entropy based significance of itemsets
    Tatti, Nikolaj
    KNOWLEDGE AND INFORMATION SYSTEMS, 2008, 17 (01) : 57 - 77
  • [28] An efficiently algorithm based on itemsets-lattice and bitmap index for finding frequent itemsets
    Chen, FA
    Li, MQ
    FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, PT 2, PROCEEDINGS, 2005, 3614 : 420 - 429
  • [29] Reference itemsets: useful itemsets to approximate the representation of frequent itemsets
    Jheng-Nan Huang
    Tzung-Pei Hong
    Ming-Chao Chiang
    Soft Computing, 2017, 21 : 6143 - 6157
  • [30] Reference itemsets: useful itemsets to approximate the representation of frequent itemsets
    Huang, Jheng-Nan
    Hong, Tzung-Pei
    Chiang, Ming-Chao
    SOFT COMPUTING, 2017, 21 (20) : 6143 - 6157
12345