Pith. sign in

REVIEW

FUIM: Fuzzy Utility Itemset Mining

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2111.00307 v1 pith:GGUBFWUT submitted 2021-10-30 cs.DB

FUIM: Fuzzy Utility Itemset Mining

classification cs.DB
keywords fuimfuzzyminingutilityhfuisitemsettransactionalgorithm
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Because of usefulness and comprehensibility, fuzzy data mining has been extensively studied and is an emerging topic in recent years. Compared with utility-driven itemset mining technologies, fuzzy utility mining not only takes utilities (e.g., profits) into account, but also considers quantities of items in each transaction for discovering high fuzzy utility itemsets (HFUIs). Thus, fuzziness can be regard as a key criterion to select high-utility itemsets, while the exiting algorithms are not efficient enough. In this paper, an efficient one-phase algorithm named Fuzzy-driven Utility Itemset Miner (FUIM) is proposed to find out a complete set of HFUIs effectively. In addition, a novel compact data structure named fuzzy-list keeps the key information from quantitative transaction databases. Using fuzzy-list, FUIM can discover HFUIs from transaction databases efficiently and effectively. Both completeness and correctness of the FUIM algorithm are proved by five theorems. At last, substantial experiments test three terms (runtime cost, memory consumption, and scalability) to confirm that FUIM considerably outperforms the state-of-the-art algorithms.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.