Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions

Mã QR

Efficient algorithms for simultaneously mining concise representations of sequential patterns based on extended pruning conditions

67

Đã lưu trong:

Bibliografiske detaljer
Những tác giả chính:	Dương, Văn Hải, Trương, Chí Tín, Lê, Hoài Bắc
Format:	Journal article
Sprog:	English
Udgivet:	Elsevier 2023
Online adgang:	http://scholar.dlu.edu.vn/handle/123456789/1713
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!

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

Lignende værker

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

An Explicit Relationship between Sequential Patterns and their Concise Representations
af: Dương, Văn Hải, et al.
Udgivet: (2023)

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

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

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

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

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

Data mining for association rules and sequential patterns :
af: Adamo, Jean-Marc
Udgivet: (2001)

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

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

Research on the sequential pattern mining algorithms using prefix-tree structure : Doctoral thesis - Major: Computer Science
af: Phạm Thị Thiết
Udgivet: (2013)

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

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

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

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

Algorithms, sequential & parallel
af: Miller, Russ
Udgivet: (2013)

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

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

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

Fundamentals of sequential and parallel algorithms /
af: Berman, Kenneth A.
Udgivet: (1997)

Fundamentals of sequential and parallel algorithms /
af: Berman, Kenneth A.
Udgivet: (1997)

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

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

Pattern recognition algorithms for data mining : scalability, knowledge discovery and soft granular computing /
af: Pal, Sankar K.
Udgivet: (2004)

Universal artificial intelligence : Sequential decisions based on algorithmic probability
af: Hutter, Marcus
Udgivet: (2010)

Graph-Based Representations in Pattern Recognition
af: Escolano, Francisco, et al.
Udgivet: (2020)

The logic of adaptive behavior Knowledge Representation and Algorithms for Adaptive Sequential Decision Making under Uncertainty in First-Order and Relational Domains
af: Otterlo, Martijn Van
Udgivet: (2013)

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

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

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

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

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

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

An efficient lattice-based approach for generator mining
af: Phạm, Quang Huy, et al.
Udgivet: (2023)

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

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

"Shift-left" algorithms transforming sequential processes into concurrent ones /
af: Hoang Chi Thanh.

A methodological construction of an efficient sequentially consistent distributed shared memory /

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

An efficient method for mining association rules based on minimum single constraints
af: Dương, Văn Hải, et al.
Udgivet: (2023)