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

Codi QR

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

67

Guardat en:

Dades bibliogràfiques
Autors principals:	Dương, Văn Hải, Trương, Chí Tín, Lê, Hoài Bắc
Format:	Journal article
Idioma:	English
Publicat:	Elsevier 2023
Accés en línia:	http://scholar.dlu.edu.vn/handle/123456789/1713
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!

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

Ítems similars

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Algorithms, sequential & parallel
per: Miller, Russ
Publicat: (2013)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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