Results 121 to 130 of about 2,277 (164)
Some of the next articles are maybe not open access.

Efficiently mining uncertain high-utility itemsets

Soft Computing, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lin, Jerry Chun-Wei   +4 more
openaire   +2 more sources

Up Approach: Mining High Utility Itemsets

International Journal of Computer & Orgnanization Trends, 2014
Now a days high utility item sets specially from large transaction databases is required task to process many day to day operations in quick time. In many relevant algorithms presented those are surface the problem of generating large number of candidate item set and thus degrades the mining performance in terms of execution time and space.
Arshia Sultana, Mrs E.Krishnaveni Reddy
openaire   +1 more source

Binary partition for itemsets expansion in mining high utility itemsets

Intelligent Data Analysis, 2016
High utility itemset mining has recently emerged to address the limitations of frequent itemset mining. It entails relevance measures to reflect both statistical significance and user expectations. Whether breadth-first or depth-first search algorithms are employed, most methods generate new candidates by 1-extension of existing itemsets (i.e., by ...
Song, Wei, Wang, Chunhua, Li, Jinhong
openaire   +1 more source

Efficient Algorithms for Mining High Utility Itemset

2017 International Conference on Recent Trends in Electrical, Electronics and Computing Technologies (ICRTEECT), 2017
Data mining uses various algorithms for searching interesting information and hidden patterns from the large database. Traditional frequent itemset mining (FIM) generate large amount of frequent itemset without considering the quantity and profit of item purchased.
Snehal D. Ambulkar, Prashant N. Chatur
openaire   +1 more source

Mining high utility itemsets without candidate generation

Proceedings of the 21st ACM international conference on Information and knowledge management, 2012
High utility itemsets refer to the sets of items with high utility like profit in a database, and efficient mining of high utility itemsets plays a crucial role in many real-life applications and is an important research issue in data mining area.
Mengchi Liu, Junfeng Qu
openaire   +1 more source

PHM: Mining Periodic High-Utility Itemsets

2016
High-utility itemset mining is the task of discovering high-utility itemsets, i.e. sets of items that yield a high profit in a customer transaction database. High-utility itemsets are useful, as they provide information about profitable sets of items bought by customers to retail store managers, which can then use this information to take strategic ...
Philippe Fournier-Viger   +3 more
openaire   +1 more source

Mining local and peak high utility itemsets

Information Sciences, 2019
Abstract A major limitation of traditional High Utility Itemset Mining (HUIM) algorithms is that they do not consider that the utility of itemsets may vary over time. Thus, traditional HUIM algorithms cannot find itemsets that do not yield a high utility when considering the whole database, but still have a high utility during specific time periods ...
Philippe Fournier-Viger   +4 more
openaire   +1 more source

Targeted High-Utility Itemset Querying

IEEE Transactions on Artificial Intelligence, 2021
Jinbao Miao   +4 more
openaire   +1 more source

A Visualizer for High Utility Itemset Mining

2014 IEEE 17th International Conference on Computational Science and Engineering, 2014
Mining high utility item sets is one of the most important research issues in data mining owing to its ability to consider nonbinary frequency values of items in transactions and different profit values for each item. Although several studies have been carried out, current methods present the mined results in the form of textual lists for users, which ...
Wei Song, Mingyuan Liu
openaire   +1 more source

Stable High Utility Itemset Mining

The 23rd International Conference on Information Integration and Web Intelligence, 2021
Acquah Hackman   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy