Structure of frequent itemsets with extended double constraints /

Mã QR

Structure of frequent itemsets with extended double constraints /

Đã lưu trong:

Sonraí Bibleagrafaíochta
Príomhúdar:	Trương Chí Tín.
Údair Eile:	Dương Văn Hải., Hoàng Nguyễn Thùy Ngân.
Formáid:	Bài viết
Teanga:	Vietnamese
Clibeanna:	Cuir Clib Leis Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!

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

Míreanna Comhchosúla

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Kinetic and thermodynamic constraints for the structural design of glycolysis /

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

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

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

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

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

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

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

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

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

A double image of the Double Helix :
le: Grobstein, Clifford
Foilsithe: (1979)

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

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

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

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

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

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