Zobrazeno 1 - 10
of 2 851
pro vyhledávání: '"ITEMSET"'
Publikováno v:
In Heliyon 30 September 2024 10(18)
Publikováno v:
PeerJ Computer Science, Vol 10, p e2334 (2024)
Frequent itemset mining (FIM) is a major component in association rule mining, significantly influencing its performance. FIM is a computationally intensive nondeterministic polynomial time (NP)-hard problem. At the core of FIM is the task of computi
Externí odkaz:
https://doaj.org/article/3403357dd728444da8571827e94809f8
Publikováno v:
Heliyon, Vol 10, Iss 18, Pp e37761- (2024)
Periodic high-utility itemset (PHUI) mining can extend beyond the conventional approach of high-utility itemset mining by uncovering recurring customer purchase behaviors common in real-life scenarios (e.g., buying apples and oranges every three days
Externí odkaz:
https://doaj.org/article/52ab9668be2043aa9ca49330744e099a
Publikováno v:
Tehnički Vjesnik, Vol 31, Iss 2, Pp 618-627 (2024)
Mining the erasable itemset is an interesting research domain, which has been applied to solve the problem of how to efficiently use limited funds to optimise production in economic crisis. After the problem of mining the erasable itemset was posed,
Externí odkaz:
https://doaj.org/article/1548ff094b8b45858383c84676e846e6
Autor:
Xiaolong Wan, Xixian Han
Publikováno v:
Data Science and Engineering, Vol 9, Iss 2, Pp 177-203 (2024)
Abstract Top-k frequent itemset mining (top-k FIM) plays an important role in many practical applications. It reports the k itemsets with the highest supports. Rather than the subtle minimum support threshold specified in FIM, top-k FIM only needs th
Externí odkaz:
https://doaj.org/article/5727c5585d6148b08acd92448903c086
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
Autor:
Hong N. Dao, Penugonda Ravikumar, Palla Likhitha, Uday Kiran Rage, Yutaka Watanobe, Incheon Paik
Publikováno v:
IEEE Access, Vol 11, Pp 12504-12524 (2023)
Stable periodic-frequent itemset mining is essential in big data analytics with many real-world applications. It involves extracting all itemsets exhibiting stable periodic behaviors in a temporal database. Most previous studies focused on finding th
Externí odkaz:
https://doaj.org/article/503677ea9ef34b48a0738b0b8f6940ac
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
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.