Structure of frequent itemsets with extended double constraints /

QR koda

Structure of frequent itemsets with extended double constraints /

Shranjeno v:

Bibliografske podrobnosti
Glavni avtor:	Trương Chí Tín.
Drugi avtorji:	Dương Văn Hải., Hoàng Nguyễn Thùy Ngân.
Format:	Bài viết
Jezik:	Vietnamese
Oznake:	Označite Brez oznak, prvi označite!

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

Podobne knjige/članki

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

MINING CONCISE REPRESENTATIONS OF FREQUENT HIGH-UTILITY OCCUPANCY ITEMSETS USING GENERATOR PATTERNS
od: Duong, Van Hai, et al.
Izdano: (2026)

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

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

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

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

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

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

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

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

Kinetic and thermodynamic constraints for the structural design of glycolysis /

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

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

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

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

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

Efficient Mining of Frequent High Average-Utility Occupancy Sequences
od: Hoàng, Minh Tiến, et al.
Izdano: (2026)

Efficient Mining of Frequent High Average-Utility Occupancy Sequences
od: Hoàng, Minh Tiến, et al.
Izdano: (2026)

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

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

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

A double image of the Double Helix :
od: Grobstein, Clifford
Izdano: (1979)

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

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

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

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