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

QR koda

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

67

Shranjeno v:

Bibliografske podrobnosti
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
Jezik:	English
Izdano:	Elsevier 2023
Online dostop:	http://scholar.dlu.edu.vn/handle/123456789/1713
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 Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns
od: Dương, Văn Hải, et al.
Izdano: (2024)

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

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

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)

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)

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)

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

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)

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

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

Nuclear: An efficient method for mining frequent itemsets based on kernels and extendable sets
od: Phạm, Quang Huy, 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)

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

Algorithms, sequential & parallel
od: Miller, Russ
Izdano: (2013)

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 high utility sequences with constraints
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)

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

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

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

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

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

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

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

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

An efficient algorithm for mining frequent item-sets containing a constraint subset
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: (2024)

Efficient algorithms for mining closed and maximal high utility itemsets
od: Hoàng, Minh Tiến, 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)

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)

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

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

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

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

"Shift-left" algorithms transforming sequential processes into concurrent ones /
od: 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
od: Trương, Chí Tín, et al.
Izdano: (2023)

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