English
Related papers

Related papers: Mining high on-shelf utility itemsets with negativ…

200 papers

Knowledge discovery in databases aims at finding useful information, which can be deployed for decision making. The problem of high utility itemset mining has specifically garnered huge research focus in the past decade, as it aims to find…

Databases · Computer Science 2023-08-30 Pushp , Satish Chand

High-utility itemset mining finds itemsets from a transaction database with utility no less than a fixed user-defined threshold. The utility of an itemset is defined as the sum of the utilities of its item. Several algorithms were proposed…

Data Structures and Algorithms · Computer Science 2019-11-19 Siddharth Dawar , Vikram Goyal , Debajyoti Bera

High-utility Itemset Mining (HUIM) finds itemsets from a transaction database with utility no less than a user-defined threshold where the utility of an itemset is defined as the sum of the item-wise utilities. In this paper, we generalize…

Databases · Computer Science 2020-05-12 Siddharth Dawar , Debajyoti Bera , Vikram Goyal

Efficient discovery of frequent itemsets in large datasets is a crucial task of data mining. In recent years, several approaches have been proposed for generating high utility patterns, they arise the problems of producing a large number of…

Databases · Computer Science 2012-12-04 B. Adinarayana Reddy , O. Srinivasa Rao , M. H. M. Krishna Prasad

Utility mining has emerged as an important and interesting topic owing to its wide application and considerable popularity. However, conventional utility mining methods have a bias toward items that have longer on-shelf time as they have a…

Databases · Computer Science 2020-11-30 Chunkai Zhang , Zilin Du , Yuting Yang , Wensheng Gan , Philip S. Yu

The High Average Utility Itemset Mining (HAUIM) technique, a variation of High Utility Itemset Mining (HUIM), uses the average utility of the itemsets. Historically, most HAUIM algorithms were designed for static databases. However,…

Databases · Computer Science 2024-07-17 Jing Chen , Shengyi Yang , Weiping Ding , Peng Li , Aijun Liu , Hongjun Zhang , Tian Li

Utility-driven itemset mining is widely applied in many real-world scenarios. However, most algorithms do not work for itemsets with negative utilities. Several efficient algorithms for high-utility itemset (HUI) mining with negative…

Databases · Computer Science 2021-06-29 Jiahui Chen , Shicheng Wan , Wensheng Gan , Guoting Chen , Hamido Fujita

Traditional high-utility itemset mining (HUIM) aims to determine all high-utility itemsets (HUIs) that satisfy the minimum utility threshold (\textit{minUtil}) in transaction databases. However, in most applications, not all HUIs are…

Databases · Computer Science 2021-11-02 Jinbao Miao , Shicheng Wan , Wensheng Gan , Jiayi Sun , Jiahui Chen

On-shelf utility mining (OSUM) is an emerging research direction in data mining. It aims to discover itemsets that have high relative utility in their selling time period. Compared with traditional utility mining, OSUM can find more…

Databases · Computer Science 2022-08-31 Jiahui Chen , Xu Guo , Wensheng Gan , Shichen Wan , Philip S. Yu

Useful knowledge, embedded in a database, is likely to change over time. Identifying recent changes in temporal databases can provide valuable up-to-date information to decision-makers. Nevertheless, techniques for mining high-utility…

With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The aim of auto-administrative systems is to administrate and…

Databases · Computer Science 2008-09-17 Kamel Aouiche , Jérôme Darmont , Le Gruenwald

Mining frequent itemsets is at the core of mining association rules, and is by now quite well understood algorithmically. However, most algorithms for mining frequent itemsets assume that the main memory is large enough for the data…

Databases · Computer Science 2016-08-16 Gösta Grahne , Jianfei Zhu

This paper proposes a frequent itemset mining algorithm based on the Boolean matrix method, aiming to solve the storage and computational bottlenecks of traditional frequent pattern mining algorithms in high-dimensional and large-scale…

Databases · Computer Science 2024-12-30 Xuan Li , Tingyi Ruan , Yankaiqi Li , Quanchao Lu , Xiaoxuan Sun

Utility is an important concept in economics. A variety of applications consider utility in real-life situations, which has lead to the emergence of utility-oriented mining (also called utility mining) in the recent decade. Utility mining…

Databases · Computer Science 2021-04-01 Wensheng Gan , Jerry Chun-Wei Lin , Jiexiong Zhang , Han-Chieh Chao , Hamido Fujita , Philip S. Yu

Utility-oriented pattern mining has become an emerging topic since it can reveal high-utility patterns (e.g., itemsets, rules, sequences) from different types of data, which provides more information than the traditional…

Databases · Computer Science 2021-04-01 Wensheng Gan , Jerry Chun-Wei Lin , Jiexiong Zhang , Philip S. Yu

For applied intelligence, utility-driven pattern discovery algorithms can identify insightful and useful patterns in databases. However, in these techniques for pattern discovery, the number of patterns can be huge, and the user is often…

Databases · Computer Science 2022-06-14 Jinbao Miao , Wensheng Gan , Shicheng Wan , Yongdong Wu , Philippe Fournier-Viger

Analytical queries defined on data warehouses are complex and use several join operations that are very costly, especially when run on very large data volumes. To improve response times, data warehouse administrators casually use indexing…

Databases · Computer Science 2008-09-12 Stéphane Azefack , Kamel Aouiche , Jérôme Darmont

Finding high-importance patterns in data is an emerging data mining task known as High-utility itemset mining (HUIM). Given a minimum utility threshold, a HUIM algorithm extracts all the high-utility itemsets (HUIs) whose utility values are…

Databases · Computer Science 2023-03-28 Shan Huang , Wensheng Gan , Jinbao Miao , Xuming Han , Philippe Fournier-Viger

In this paper, we propose a novel data structure called PUN-list, which maintains both the utility information about an itemset and utility upper bound for facilitating the processing of mining high utility itemsets. Based on PUN-lists, we…

Databases · Computer Science 2015-10-09 Zhi-Hong Deng , Shulei Ma , He Liu

In the recent decade companies started collecting of large amount of data. Without a proper analyse, the data are usually useless. The field of analysing the data is called data mining. Unfortunately, the amount of data is quite large: the…

Databases · Computer Science 2021-08-12 Robert Kessl
‹ Prev 1 2 3 10 Next ›