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

QR kód

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

67

Uloženo v:

Podrobná bibliografie
Hlavní autoři:	Dương, Văn Hải, Trương, Chí Tín, Lê, Hoài Bắc
Médium:	Journal article
Jazyk:	English
Vydáno:	Elsevier 2023
On-line přístup:	http://scholar.dlu.edu.vn/handle/123456789/1713
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo otaguje tento záznam!

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

Podobné jednotky

Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

An Explicit Relationship between Sequential Patterns and their Concise Representations
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

Fast generation of sequential patterns with item constraints from concise representations
Autor: Dương, Văn Hải, a další
Vydáno: (2021)

Efficient mining of concise and informative representations of frequent high utility itemsets
Autor: Trần, Thống, a další
Vydáno: (2024)

Efficient mining of concise and informative representations of frequent high utility itemsets
Autor: Trần, Thống, a další
Vydáno: (2024)

CG-FHAUI: An efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy
Autor: Lê, Hoài Bắc, a další
Vydáno: (2023)

Data mining for association rules and sequential patterns :
Autor: Adamo, Jean-Marc
Vydáno: (2001)

Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

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

Nuclear: An efficient method for mining frequent itemsets based on kernels and extendable sets
Autor: Phạm, Quang Huy, a další
Vydáno: (2023)

Efficient algorithms for mining frequent itemsets with constraint
Autor: Trần, Ngọc Anh, a další
Vydáno: (2023)

An efficient algorithm for mining frequent itemsets with single constraint
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

EHAUSM: An efficient algorithm for high average utility sequence mining
Autor: Trương, Chí Tín, a další
Vydáno: (2024)

Algorithms, sequential & parallel
Autor: Miller, Russ
Vydáno: (2013)

Efficient algorithms for mining closed and maximal high utility itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

Efficient algorithms for mining frequent high utility sequences with constraints
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

Fundamentals of sequential and parallel algorithms /
Autor: Berman, Kenneth A.
Vydáno: (1997)

Fundamentals of sequential and parallel algorithms /
Autor: Berman, Kenneth A.
Vydáno: (1997)

An efficient algorithm for mining frequent itemsets containing a constraint subset
Autor: Duong, Van Hai, a další
Vydáno: (2014)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

Pattern recognition algorithms for data mining : scalability, knowledge discovery and soft granular computing /
Autor: Pal, Sankar K.
Vydáno: (2004)

Universal artificial intelligence : Sequential decisions based on algorithmic probability
Autor: Hutter, Marcus
Vydáno: (2010)

Graph-Based Representations in Pattern Recognition
Autor: Escolano, Francisco, a další
Vydáno: (2020)

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

An efficient algorithm for mining frequent item-sets containing a constraint subset
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

Efficient algorithms for mining closed and maximal high utility itemsets
Autor: Hoàng, Minh Tiến, a další
Vydáno: (2024)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

An efficient parallel algorithm for mining both frequent closed and generator sequences on multi-core processors
Autor: Dương, Văn Hải, a další
Vydáno: (2023)

FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

An efficient lattice-based approach for generator mining
Autor: Phạm, Quang Huy, a další
Vydáno: (2023)

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

MFS-SubSC: An Efficient Algorithm for Mining Frequent Sequences with Sub-Sequence Constraint
Autor: Dương, Văn Hải, a další
Vydáno: (2024)

"Shift-left" algorithms transforming sequential processes into concurrent ones /
Autor: 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
Autor: Trương, Chí Tín, a další
Vydáno: (2023)

An efficient method for mining association rules based on minimum single constraints
Autor: Dương, Văn Hải, a další
Vydáno: (2023)