Zobrazeno 1 - 10
of 387
pro vyhledávání: '"high utility itemset"'
Publikováno v:
IEEE Access, Vol 12, Pp 84763-84773 (2024)
Traditional pattern mining algorithms are based on tree and linked list structures. However, they often only consider a single factor of frequency or utility and have to deal with exponential search spaces as well as generate numerous candidates. Thu
Externí odkaz:
https://doaj.org/article/a9a99fac0576479f8a9dc6859013e3c9
Autor:
Pushp Sra, Satish Chand
Publikováno v:
Data Science and Engineering, Vol 9, Iss 1, Pp 73-87 (2023)
Abstract High utility itemset mining is a crucial research area that focuses on identifying combinations of itemsets from databases that possess a utility value higher than a user-specified threshold. However, most existing algorithms assume that the
Externí odkaz:
https://doaj.org/article/311f5866752845f78a2fcbbc5151eeb8
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Complex System Modeling and Simulation, Vol 3, Iss 1, Pp 47-58 (2023)
High-utility itemset mining (HUIM) can consider not only the profit factor but also the profitable factor, which is an essential task in data mining. However, most HUIM algorithms are mainly developed on a single machine, which is inefficient for big
Externí odkaz:
https://doaj.org/article/84ca665cffd040a18c8753972d8f18a5
Autor:
Vinh V. Vu, Mi T. H. Lam, Thuy T. M. Duong, Ly T. Manh, Thuy T. T. Nguyen, Le V. Nguyen, Unil Yun, Vaclav Snasel, Bay Vo
Publikováno v:
IEEE Access, Vol 11, Pp 104789-104805 (2023)
High-utility itemset mining (HUIM) is an important task in the field of knowledge data discovery. The large search space and huge number of HUIs are the consequences of applying HUIM algorithms with an inappropriate user-defined minimum utility thres
Externí odkaz:
https://doaj.org/article/f347f1ea7fa945cfa3f63c337ded437c
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Journal of Intelligent Systems, Vol 31, Iss 1, Pp 568-588 (2022)
Distributed programming paradigms such as MapReduce and Spark have alleviated sequential bottleneck while mining of massive transaction databases. Of significant importance is mining High Utility Itemset (HUI) that incorporates the revenue of the ite
Externí odkaz:
https://doaj.org/article/dbeb8532ac5f413ba6c880224792ae6a
Publikováno v:
IEEE Access, Vol 10, Pp 1419-1431 (2022)
Utility mining is one of the most thriving research topics with a wide range of real-world applications. High utility pattern mining uses a utility function to extract all desired patterns that exceed a minimum utility threshold. However, a significa
Externí odkaz:
https://doaj.org/article/8c95f3682239437ab573e61ac1c736ec
Publikováno v:
Journal of Information and Telecommunication, Vol 5, Iss 4, Pp 536-549 (2021)
Discovering high-utility itemsets from a transaction database is one of the important tasks in High-Utility Itemset Mining (HUIM). The discovered high-utility itemsets (HUIs) must meet a user-defined given minimum utility threshold. Several methods h
Externí odkaz:
https://doaj.org/article/bbd2b7e3441f4169bc9cfa4e4cbb2215
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.