Efficient Mining of Concise Patterns for Frequent High-Utility Occupancy Itemsets Using Extended Pruning Strategies

QR Kod

Efficient Mining of Concise Patterns for Frequent High-Utility Occupancy Itemsets Using Extended Pruning Strategies

2025

Kaydedildi:

Detaylı Bibliyografya
Asıl Yazarlar:	Hoàng, Minh Tiến, Huỳnh, Thị Châu Lan, Dương, Văn Hải, Trương, Chí Tín
Materyal Türü:	Journal article
Dil:	English
Baskı/Yayın Bilgisi:	2025
Online Erişim:	https://scholar.dlu.edu.vn/handle/123456789/4718
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!

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

Benzer Materyaller

Mining concise representations of frequent high utility occupancy itemsets using generator patterns
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2025)

Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Efficient mining of concise and informative representations of frequent high utility itemsets
Yazar:: Trần, Thống, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Efficient mining of concise and informative representations of frequent high utility itemsets
Yazar:: Trần, Thống, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

An Efficient Algorithm for Mining Frequent High Utility Occupancy Generators
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2025)

Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

CG-FHAUI: An efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Nuclear: An efficient method for mining frequent itemsets based on kernels and extendable sets
Yazar:: Phạm, Quang Huy, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient algorithms for mining frequent itemsets with constraint
Yazar:: Trần, Ngọc Anh, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

NUCLEAR: An Efficient Method for Mining Frequent Itemsets and Generators from Closed Frequent Itemsets
Yazar:: Phạm, Quang Huy, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

An efficient method for mining frequent itemsets with double constraints
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

An efficient algorithm for mining frequent itemsets with single constraint
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient algorithms for mining closed and maximal high utility itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2025)

Efficient algorithms for mining closed and maximal high utility itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient algorithms for mining frequent high utility sequences with constraints
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Efficient algorithms for mining closed and maximal high utility itemsets
Yazar:: Hoàng, Minh Tiến, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Structure of frequent itemsets with extended double constraints /
Yazar:: Trương Chí Tín.

H-FHAUI: Hiding Frequent High Average Utility Itemsets
Yazar:: Lê, Hoài Bắc, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

An efficient algorithm for mining frequent itemsets containing a constraint subset
Yazar:: Duong, Van Hai, ve diğerleri
Baskı/Yayın Bilgisi: (2014)

Structure of frequent itemsets with extended double constraints
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy
Yazar:: Lê, Hoài Bắc, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

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

Mining frequent itemsets with dualistic constraints
Yazar:: Trần, Ngọc Anh, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient vertical mining of high average-utility itemsets based on novel upper-bounds
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient high average-utility itemset mining using novel vertical weak upper-bounds
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Approximate high utility itemset mining in noisy environments
Yazar:: Yoonji Baek, ve diğerleri
Baskı/Yayın Bilgisi: (2021)

Mining association rules from high utility itemsets
Yazar:: Nguyễn, Thị Thúy Loan, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

High Average-Utility Itemset Mining with A Novel Vertical Weak Upper Bound
Yazar:: Trần, Thống, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

High Average-Utility Itemset Mining with A Novel Vertical Weak Upper Bound
Yazar:: Trần, Thống, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

EHAUSM: An efficient algorithm for high average utility sequence mining
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Spatiotemporal Frequent Pattern Mining from Evolving Region Trajectories
Yazar:: Aydin, Berkay, ve diğerleri
Baskı/Yayın Bilgisi: (2020)

HUPSMT: An efficient algorithm for mining high utility-probability sequences in uncertain databases with multiple minimum utility thresholds
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

An efficient algorithm for mining frequent item-sets containing a constraint subset
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

An efficient parallel algorithm for mining both frequent closed and generator sequences on multi-core processors
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)