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

QR Kod

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

67

Kaydedildi:

Detaylı Bibliyografya
Asıl Yazarlar:	Dương, Văn Hải, Trương, Chí Tín, Lê, Hoài Bắc
Materyal Türü:	Journal article
Dil:	English
Baskı/Yayın Bilgisi:	Elsevier 2023
Online Erişim:	http://scholar.dlu.edu.vn/handle/123456789/1713
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!

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

Benzer Materyaller

Efficient Algorithms to Mine Concise Representations of Frequent High Utility Occupancy Patterns
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

An Explicit Relationship between Sequential Patterns and their Concise Representations
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Fast generation of sequential patterns with item constraints from concise representations
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2021)

Efficient mining of concise and informative representations of frequent high utility itemsets
Yazar:: Trần, Thống, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Efficient mining of concise and informative representations of frequent high utility itemsets
Yazar:: Trần, Thống, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

CG-FHAUI: An efficient algorithm for simultaneously mining succinct pattern sets of frequent high average utility itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

FCloSM, FGenSM: two efficient algorithms for mining frequent closed and generator sequences using the local pruning strategy
Yazar:: Lê, Hoài Bắc, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Data mining for association rules and sequential patterns :
Yazar:: Adamo, Jean-Marc
Baskı/Yayın Bilgisi: (2001)

Frequent high minimum average utility sequence mining with constraints in dynamic databases using efficient pruning strategies
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Mining Interesting Sequential Patterns using a Novel Balanced Utility Measure
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Research on the sequential pattern mining algorithms using prefix-tree structure : Doctoral thesis - Major: Computer Science
Yazar:: Phạm Thị Thiết
Baskı/Yayın Bilgisi: (2013)

Nuclear: An efficient method for mining frequent itemsets based on kernels and extendable sets
Yazar:: Phạm, Quang Huy, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient algorithms for mining frequent itemsets with constraint
Yazar:: Trần, Ngọc Anh, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

An efficient algorithm for mining frequent itemsets with single constraint
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

EHAUSM: An efficient algorithm for high average utility sequence mining
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Algorithms, sequential & parallel
Yazar:: Miller, Russ
Baskı/Yayın Bilgisi: (2013)

Efficient algorithms for mining closed and maximal high utility itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient algorithms for mining frequent high utility sequences with constraints
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Fundamentals of sequential and parallel algorithms /
Yazar:: Berman, Kenneth A.
Baskı/Yayın Bilgisi: (1997)

Fundamentals of sequential and parallel algorithms /
Yazar:: Berman, Kenneth A.
Baskı/Yayın Bilgisi: (1997)

An efficient algorithm for mining frequent itemsets containing a constraint subset
Yazar:: Duong, Van Hai, ve diğerleri
Baskı/Yayın Bilgisi: (2014)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Pattern recognition algorithms for data mining : scalability, knowledge discovery and soft granular computing /
Yazar:: Pal, Sankar K.
Baskı/Yayın Bilgisi: (2004)

Universal artificial intelligence : Sequential decisions based on algorithmic probability
Yazar:: Hutter, Marcus
Baskı/Yayın Bilgisi: (2010)

Graph-Based Representations in Pattern Recognition
Yazar:: Escolano, Francisco, ve diğerleri
Baskı/Yayın Bilgisi: (2020)

The logic of adaptive behavior Knowledge Representation and Algorithms for Adaptive Sequential Decision Making under Uncertainty in First-Order and Relational Domains
Yazar:: Otterlo, Martijn Van
Baskı/Yayın Bilgisi: (2013)

An efficient algorithm for mining frequent item-sets containing a constraint subset
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

Efficient Algorithms for Mining Closed and Maximal High Utility Itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

Efficient algorithms for mining closed and maximal high utility itemsets
Yazar:: Hoàng, Minh Tiến, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

MFG-HUI: An Efficient Algorithm for Mining Frequent Generators of High Utility Itemsets
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

An efficient parallel algorithm for mining both frequent closed and generator sequences on multi-core processors
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

An efficient lattice-based approach for generator mining
Yazar:: Phạm, Quang Huy, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

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

MFS-SubSC: An Efficient Algorithm for Mining Frequent Sequences with Sub-Sequence Constraint
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2024)

"Shift-left" algorithms transforming sequential processes into concurrent ones /
Yazar:: 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
Yazar:: Trương, Chí Tín, ve diğerleri
Baskı/Yayın Bilgisi: (2023)

An efficient method for mining association rules based on minimum single constraints
Yazar:: Dương, Văn Hải, ve diğerleri
Baskı/Yayın Bilgisi: (2023)