To mine potential and helpful patterns, the majority of studies on pattern discovery from databases have been conducted in the last few decades. They have several obvious drawbacks: 1) Each thing stands out on its own and varies in significance based on factors including utility, risk, interest, and weight. 2) In specific application settings, an object has a favorable or unfavorable effect (e.g., products are often cross-sold and have positive or negative unit profits, which affect benefits). 3) The user could not have all the necessary information because frequent-based patterns typically only include a small percentage of the relevant patterns (for example, occupancy). To address this issue, we apply economic utility theory to the database and data mining fields. We provide a one-phase approach called pnHUO for discovering High Utility Occupancy patterns with positive and negative utility values that beyond frequency and usefulness. According to user interests, frequency, and utility occupancy, there are various utility occupancy patterns with positive and negative utility values. To hold the necessary data, a new frequency-utility tree and an indexed data structure called a positive-and-negative utility-occupancy list are created during the mining process. A number of pruning strategies are further developed using the determined upper bound of utility occupancy to reduce the search space. To evaluate the usefulness and efficiency of the suggested algorithm, five real datasets were tested in experiments, and the results were positive.

Traditional high-utility itemset mining (HUIM) aims to determine all high-utility itemsets (HUIs) that satisfy the minimum utility threshold in transaction databases. However, in most applications, not all HUIs are interesting because only specific parts are required. Thus, targeted mining based on user preferences is more important than traditional mining tasks. This paper is the first to propose a targeted HUIM problem and to provide a clear formulation of the targeted utility mining task in a quantitative transaction database. A tree-based algorithm known as Target-based high-Utility iteMset querying using (TargetUM) is proposed. The algorithm uses a lexicographic querying tree and three effective pruning strategies to improve the mining efficiency. We implemented experimental validation on several real and synthetic databases, and the results demonstrate that the performance of TargetUM is satisfactory, complete, and correct. Finally, owing to the lexicographic querying tree, the database no longer needs to be scanned repeatedly for multiple queries.