Structure of frequent itemsets with extended double constraints /

QR-kod

Structure of frequent itemsets with extended double constraints /

Sparad:

Bibliografiska uppgifter
Huvudupphovsman:	Trương Chí Tín.
Övriga upphovsmän:	Dương Văn Hải., Hoàng Nguyễn Thùy Ngân.
Materialtyp:	Artikel
Språk:	Vietnamese
Taggar:	Lägg till en tagg Inga taggar, Lägg till första taggen!

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

Liknande verk

Structure of frequent itemsets with extended double constraints
av: Trương, Chí Tín, et al.
Publicerad: (2023)

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

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

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

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

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

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

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

Efficient Mining of Concise Patterns for Frequent High-Utility Occupancy Itemsets Using Extended Pruning Strategies
av: Hoàng, Minh Tiến, et al.
Publicerad: (2025)

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

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

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

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

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

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

Mining concise representations of frequent high utility occupancy itemsets using generator patterns
av: Dương, Văn Hải, et al.
Publicerad: (2025)

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

An efficient algorithm for mining frequent item-sets containing a constraint subset
av: Dương, Văn Hải, et al.
Publicerad: (2023)

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

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

MFS-SubSC: An Efficient Algorithm for Mining Frequent Sequences with Sub-Sequence Constraint
av: Dương, Văn Hải, et al.
Publicerad: (2024)

The Double Constraint Inversion Methodology. 1st ed. 2018
av: Zijl, Wouter, et al.
Publicerad: (2020)

Constraint algorithm in double-base number system for high speed A/D converters /
av: Nguyen, Minh Son.

Kinetic and thermodynamic constraints for the structural design of glycolysis /

An Efficient Algorithm for Mining Frequent High Utility Occupancy Generators
av: Dương, Văn Hải, et al.
Publicerad: (2025)

Kinetics and structural constraints of chromate reduction by green rusts /
av: Bond, Deborah L.

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

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

Influence of structural properties and kinetic constraints on bacillus cereus growth /

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

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

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

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

A double image of the Double Helix :
av: Grobstein, Clifford
Publicerad: (1979)

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

Frequent and widespread parallel evolution of protein sequences /
av: Rokas, Antonis.

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

An efficient parallel algorithm for mining both frequent closed and generator sequences on multi-core processors
av: Dương, Văn Hải, et al.
Publicerad: (2023)

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

Extendible and stably extendible vector bundles over real projective spaces /
av: Kobayashi, Teiichi.