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 条

[41] Parallel SAT Based Closed Frequent Itemsets Enumeration
Dlala, Imen Ouled
Jabbour, Said
Sais, Lakhdar
Salhi, Yakoub
Ben Yaghlane, Boutheina
2015 IEEE/ACS 12TH INTERNATIONAL CONFERENCE OF COMPUTER SYSTEMS AND APPLICATIONS (AICCSA), 2015,
[42] Mining frequent itemsets with category-based constraints
Do, TD
Hui, SC
Fong, A
DISCOVERY SCIENCE, PROCEEDINGS, 2003, 2843 : 76 - 86
[43] A Constraint-based Approach for Enumerating Gradual Itemsets
Hidouri, Amel
Jabbour, Said
Lonlac, Jerry
Raddaoui, Badran
2021 IEEE 33RD INTERNATIONAL CONFERENCE ON TOOLS WITH ARTIFICIAL INTELLIGENCE (ICTAI 2021), 2021, : 582 - 589
[44] DoS detections based on association rules and frequent itemsets
Dept. of Computer Science and Engineering, Harbin Institute of Technology, Harbin 150001, China
不详
J. Harbin Inst. Technol., 2008, 2 (283-289):
[45] Mining fuzzy frequent itemsets based on UBFFP trees
Lin, Chun-Wei
Hong, Tzung-Pei
JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2014, 27 (01) : 535 - 548
[46] Mining infrequent itemsets based on extended MMS model
Dong, Xiangjun
Li, Gang
Wang, Hongguo
Guo, Yuebin
Yang, Yueyue
ADVANCED INTELLIGENT COMPUTING THEORIES AND APPLICATIONS: WITH ASPECTS OF CONTEMPORARY INTELLIGENT COMPUTING TECHNIQUES, 2007, 2 : 190 - +
[47] Discovering interesting itemsets based on change in regularity of occurrence
Eisariyodom, Sumalee
Amphawan, Komate
2017 9TH INTERNATIONAL CONFERENCE ON KNOWLEDGE AND SMART TECHNOLOGY (KST), 2017, : 138 - 143
[48] Efficiently mining maximal frequent itemsets based on digraph
Ren, Zhibo
Zhang, Qiang
Ma, Xiujuan
FOURTH INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY, VOL 2, PROCEEDINGS, 2007, : 140 - +
[49] Cluster Based Partition Approach for Mining Frequent Itemsets
Tiwari, Akhilesh
Gupta, Rajendra K.
Agrawal, Dev Prakash
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY, 2009, 9 (06): : 191 - 199
[50] A regression-based algorithm for frequent itemsets mining
Jia, Zirui
Wang, Zengli
DATA TECHNOLOGIES AND APPLICATIONS, 2020, 54 (03) : 259 - 273

← 1 2 3 4 5 →