Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns

QR koda

Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns

Shranjeno v:

Bibliografske podrobnosti
Những tác giả chính:	Dương, Văn Hải, Phạm, Quang Huy, Trương, Chí Tín, Philippe, Fournier-Viger
Format:	Journal article
Jezik:	English
Izdano:	Springer 2024
Online dostop:	https://scholar.dlu.edu.vn/handle/123456789/3441
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

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)

Efficient algorithms for mining frequent high utility sequences with constraints
od: Trương, Chí Tín, 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)

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

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)

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

Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions
od: Dương, Văn Hải, et al.
Izdano: (2023)

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

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)

Efficient algorithms for mining closed and maximal high utility itemsets
od: Dương, Văn Hải, 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)

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

An Explicit Relationship between Sequential Patterns and their Concise Representations
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)

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

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

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

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

Efficient vertical mining of high average-utility itemsets based on novel upper-bounds
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)

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

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

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

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

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

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

EHUSM: Mining High Utility Sequences with a Pessimistic Utility Model
od: Philippe Fournier-Viger, 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)

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

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

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

Spatiotemporal Frequent Pattern Mining from Evolving Region Trajectories
od: Aydin, Berkay, et al.
Izdano: (2020)

Fast generation of sequential patterns with item constraints from concise representations
od: Dương, Văn Hải, et al.
Izdano: (2021)

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

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

Pattern mining: Current challenges and opportunities
od: Philippe Fournier-Viger, et al.
Izdano: (2023)

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