Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns

QR kód

Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns

Uloženo v:

Podrobná bibliografie
Hlavní autoři:	Dương, Văn Hải, Phạm, Quang Huy, Trương, Chí Tín, Philippe, Fournier-Viger
Médium:	Journal article
Jazyk:	English
Vydáno:	Springer 2024
On-line přístup:	https://scholar.dlu.edu.vn/handle/123456789/3441
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo otaguje tento záznam!

Thư viện lưu trữ:	Thư viện Trường Đại học Đà Lạt

Podobné jednotky

Efficient mining of concise and informative representations of frequent high utility itemsets
Autor: Trần, Thống, a další
Vydáno: (2024)

Efficient mining of concise and informative representations of frequent high utility itemsets
Autor: Trần, Thống, a další
Vydáno: (2024)

Efficient algorithms for mining frequent high utility sequences with constraints
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

CG-FHAUI: An efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

EHAUSM: An efficient algorithm for high average utility sequence mining
Autor: Trương, Chí Tín, a další
Vydáno: (2024)

Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

Efficient algorithms for mining closed and maximal high utility itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

Efficient algorithms for mining frequent itemsets with constraint
Autor: Trần, Ngọc Anh, a další
Vydáno: (2023)

An efficient algorithm for mining frequent itemsets with single constraint
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
Autor: Phạm, Quang Huy, a další
Vydáno: (2023)

An Explicit Relationship between Sequential Patterns and their Concise Representations
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

An efficient algorithm for mining frequent itemsets containing a constraint subset
Autor: Duong, Van Hai, a další
Vydáno: (2014)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

Efficient algorithms for mining closed and maximal high utility itemsets
Autor: Hoàng, Minh Tiến, a další
Vydáno: (2024)

FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy
Autor: Lê, Hoài Bắc, a další
Vydáno: (2023)

H-FHAUI: Hiding Frequent High Average Utility Itemsets
Autor: Lê, Hoài Bắc, a další
Vydáno: (2023)

Efficient vertical mining of high average-utility itemsets based on novel upper-bounds
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

An efficient algorithm for mining frequent item-sets containing a constraint subset
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

HUPSMT: An efficient algorithm for mining high utility-probability sequences in uncertain databases with multiple minimum utility thresholds
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

An efficient algorithm for mining frequent itemsets containing a constraint subset /
Autor: Van Hai Duong.

Efficient high average-utility itemset mining using novel vertical weak upper-bounds
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

Nuclear: An efficient method for mining frequent itemsets based on kernels and extendable sets
Autor: Phạm, Quang Huy, a další
Vydáno: (2023)

Mining High Utility Sequences with a Novel Utility Function
Autor: Huỳnh, Hanh Thông, a další
Vydáno: (2023)

An efficient parallel algorithm for mining both frequent closed and generator sequences on multi-core processors
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

EHUSM: Mining High Utility Sequences with a Pessimistic Utility Model
Autor: Philippe Fournier-Viger, a další
Vydáno: (2023)

An efficient method for mining frequent itemsets with double constraints
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

MFS-SubSC: An Efficient Algorithm for Mining Frequent Sequences with Sub-Sequence Constraint
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

Mining interesting sequences with low average cost and high average utility
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

Spatiotemporal Frequent Pattern Mining from Evolving Region Trajectories
Autor: Aydin, Berkay, a další
Vydáno: (2020)

Fast generation of sequential patterns with item constraints from concise representations
Autor: Dương, Văn Hải, a další
Vydáno: (2021)

Mining frequent itemsets with dualistic constraints
Autor: Trần, Ngọc Anh, a další
Vydáno: (2023)

Approximate high utility itemset mining in noisy environments
Autor: Yoonji Baek, a další
Vydáno: (2021)

Pattern mining: Current challenges and opportunities
Autor: Philippe Fournier-Viger, a další
Vydáno: (2023)

Mining association rules from high utility itemsets
Autor: Nguyễn, Thị Thúy Loan, a další
Vydáno: (2024)