Efficient high average-utility itemset mining using novel vertical weak upper-bounds

Código QR

Efficient high average-utility itemset mining using novel vertical weak upper-bounds

183

Guardado en:

Detalles Bibliográficos
Autores principales:	Trương, Chí Tín, Dương, Văn Hải, Lê, Hoài Bắc, Philippe Fournier-Viger, Unil Yun
Formato:	Journal article
Lenguaje:	Vietnamese
Publicado:	Elsevier 2023
Acceso en línea:	http://scholar.dlu.edu.vn/handle/123456789/1698
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

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

Ejemplares similares

Efficient vertical mining of high average-utility itemsets based on novel upper-bounds
por: Trương, Chí Tín, et al.
Publicado: (2023)

High Average-Utility Itemset Mining with A Novel Vertical Weak Upper Bound
por: Trần, Thống, et al.
Publicado: (2024)

High Average-Utility Itemset Mining with A Novel Vertical Weak Upper Bound
por: Trần, Thống, et al.
Publicado: (2024)

CG-FHAUI: An efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets
por: Dương, Văn Hải, et al.
Publicado: (2024)

Mining interesting sequences with low average cost and high average utility
por: Trương, Chí Tín, et al.
Publicado: (2023)

EHAUSM: An efficient algorithm for high average utility sequence mining
por: Trương, Chí Tín, et al.
Publicado: (2024)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
por: Dương, Văn Hải, et al.
Publicado: (2023)

H-FHAUI: Hiding Frequent High Average Utility Itemsets
por: Lê, Hoài Bắc, et al.
Publicado: (2023)

Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies
por: Trương, Chí Tín, et al.
Publicado: (2023)

Efficient algorithms for mining closed and maximal high utility itemsets
por: Dương, Văn Hải, et al.
Publicado: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
por: Dương, Văn Hải, et al.
Publicado: (2024)

Efficient algorithms for mining closed and maximal high utility itemsets
por: Hoàng, Minh Tiến, et al.
Publicado: (2024)

NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
por: Phạm, Quang Huy, et al.
Publicado: (2023)

Approximate high utility itemset mining in noisy environments
por: Yoonji Baek, et al.
Publicado: (2021)

Efficient mining of concise and informative representations of frequent high utility itemsets
por: Trần, Thống, et al.
Publicado: (2024)

Efficient mining of concise and informative representations of frequent high utility itemsets
por: Trần, Thống, et al.
Publicado: (2024)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
por: Dương, Văn Hải, et al.
Publicado: (2024)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
por: Dương, Văn Hải, et al.
Publicado: (2024)

Efficient algorithms for mining frequent high utility sequences with constraints
por: Trương, Chí Tín, et al.
Publicado: (2023)

Nuclear: An efficient method for mining frequent itemsets based on kernels and extendable sets
por: Phạm, Quang Huy, et al.
Publicado: (2023)

Mining High Utility Sequences with a Novel Utility Function
por: Huỳnh, Hanh Thông, et al.
Publicado: (2023)

Mining association rules from high utility itemsets
por: Nguyễn, Thị Thúy Loan, et al.
Publicado: (2024)

Efficient algorithms for mining frequent itemsets with constraint
por: Trần, Ngọc Anh, et al.
Publicado: (2023)

An efficient method for mining frequent itemsets with double constraints
por: Dương, Văn Hải, et al.
Publicado: (2023)

An efficient algorithm for mining frequent itemsets with single constraint
por: Dương, Văn Hải, et al.
Publicado: (2023)

Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns
por: Dương, Văn Hải, et al.
Publicado: (2024)

Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure
por: Dương, Văn Hải, et al.
Publicado: (2024)

FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences
por: Trương, Chí Tín, et al.
Publicado: (2023)

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

An efficient algorithm for mining frequent itemsets containing a constraint subset
por: Duong, Van Hai, et al.
Publicado: (2014)

EHUSM: Mining High Utility Sequences with a Pessimistic Utility Model
por: Philippe Fournier-Viger, et al.
Publicado: (2023)

Mining frequent itemsets with dualistic constraints
por: Trần, Ngọc Anh, et al.
Publicado: (2023)

Average Treatment Effect Bounds with an Instrumental Variable: Theory and Practice
por: Flores, Carlos A., et al.
Publicado: (2020)

Photofragment spectroscopy and predissociation dynamics of weakly bound molecules /
por: Reisler, Hanna.

HUPSMT: An efficient algorithm for mining high utility-probability sequences in uncertain databases with multiple minimum utility thresholds
por: Trương, Chí Tín, et al.
Publicado: (2023)

Weak type (1, 1) bounds for a class of the Littlewood-Paley operators /
por: Ding, Yong.

Error bounds for generalized mixed weak vector quasiequilibrium problems via regularized gap functions
por: Vo, Minh Tam, et al.
Publicado: (2023)

Minimal Lagrangian submanifolds in adjoint orbits and upper bounds on the first eigenvalue of the Laplacian /
por: Ono, Hajime.

FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy
por: Lê, Hoài Bắc, et al.
Publicado: (2023)

Utilization of soil properties to understand the vertical distribution of dioxins in the soil of Bien Hoa airbase, Vietnam
por: Dang, Thuong Huyen