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:

Sonraí Bibleagrafaíochta
Những tác giả chính:	Dương, Văn Hải, Trương, Chí Tín, Lê, Hoài Bắc
Formáid:	Journal article
Teanga:	English
Foilsithe:	Elsevier 2023
Rochtain Ar Líne:	http://scholar.dlu.edu.vn/handle/123456789/1713
Clibeanna:	Cuir Clib Leis Gan Chlibeanna, Bí ar an gcéad duine leis an taifead seo a chlibeáil!

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

Míreanna Comhchosúla

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Algorithms, sequential & parallel
le: Miller, Russ
Foilsithe: (2013)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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