پیوندهای مفید
آمار
| تعداد نشریات | 15 |
| تعداد شماره‌ها | 245 |
| تعداد مقالات | 2,497 |
| تعداد مشاهده مقاله | 4,408,434 |
| تعداد دریافت فایل اصل مقاله | 3,251,335 |
High utility itemset mining in dynamic and incremental databases | ||
| Journal of Electrical and Computer Engineering Innovations (JECEI) | ||
| مقالات آماده انتشار، پذیرفته شده، انتشار آنلاین از تاریخ 21 مهر 1405 | ||
| نوع مقاله: Original Research Paper | ||
| شناسه دیجیتال (DOI): 10.22061/jecei.2026.113299.944 | ||
| نویسندگان | ||
| Mahnaz Naderi Vlashejerdi1؛ Negin Daneshpour* 2 | ||
| 1Faculty of Computer Engineering, Shahid Rajaee Teacher Training University, Tehran, Iran | ||
| 2Computer Engineering Department, Shahid Rajaee Teacher Training University, Tehran, Iran | ||
| تاریخ دریافت: 18 تیر 1405، تاریخ بازنگری: 30 شهریور 1405، تاریخ پذیرش: 19 مهر 1405 | ||
| چکیده | ||
| High utility itemset mining is a significant task within the data mining domain. Since real-world databases are dynamic and incremental, efficient methods are needed for mining high utility itemsets without repeatedly rescanning that database. This study proposes a new method for high utility itemset mining in dynamic and incremental databases. The proposed method, referred to as HUIM-IncDa, employs a vertical list structure for mining high utility itemsets, which is constructed through a single scan of the database. Unlike approaches that require repeated database processing after updates, the proposed method incrementally maintains the vertical representation and associated utility information when new transactions arrive. Therefore, repeated database scans are not required when updates occur. The algorithm applies transaction-weighted utilization (twu) and subtree utility (su) for pruning the search space. The combination of incremental vertical-list maintenance and twu- and su-based pruning distinguishes the proposed approach by reducing both database access and the search space during high-utility itemset mining. In addition, discovered high utility itemsets are stored within a dedicated table to avoid redundant data storage. The proposed algorithm was evaluated against five advanced high utility itemset mining algorithms on different benchmark datasets. The experimental results show substantial performance improvements in several settings. For example, in the scalability experiments, the proposed HUIM-IncDa algorithm reduced the average runtime by up to 78.2% compared with HUIMSU and by up to 47.0% compared with H-Miner across the evaluated datasets. It also reduced average memory consumption by up to 73.6% compared with HUIMSU and by up to 49.7% compared with H-Miner. The algorithm consistently outperformed or ranked among the best existing methods across different datasets and parameter settings. The proposed method provides an efficient framework for identifying high utility itemsets in databases with dynamic and incremental updates. By eliminating repeated database scans and employing effective pruning strategies, it significantly improves computational efficiency. The obtained results indicate that the algorithm is a competitive and scalable approach for high utility itemset mining applications. | ||
| کلیدواژه‌ها | ||
| high utility itemset mining؛ utility threshold؛ pruning strategy؛ dynamic database؛ incremental database | ||
|
آمار تعداد مشاهده مقاله: 8 |
||