BOOK-CHAPTER

Efficient Mining Top-k Regular-Frequent Itemset Using Compressed Tidsets

Komate AmphawanPhilippe LencaAthasit Surarerks

Year: 2012 Lecture notes in computer science Pages: 124-135   Publisher: Springer Science+Business Media
Keywords:
Association rule learning Computer science Data mining Database transaction Representation (politics) TRACE (psycholinguistics) Set (abstract data type) Transaction data Task (project management) Key (lock) Pattern recognition (psychology) Artificial intelligence Database Engineering

Metrics

13
Cited By
1.73
FWCI (Field Weighted Citation Impact)
14
Refs
0.85
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Data Mining Algorithms and Applications
Physical Sciences →  Computer Science →  Information Systems
Rough Sets and Fuzzy Logic
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Data Management and Algorithms
Physical Sciences →  Computer Science →  Signal Processing

Related Documents

JOURNAL ARTICLE

Efficient Top-k Frequent Itemset Mining on Massive Data

Xiaolong WanXixian Han

Journal:   Data Science and Engineering Year: 2024 Vol: 9 (2)Pages: 177-203
BOOK-CHAPTER

The Top-k Frequent Closed Itemset Mining Using Top-k SAT Problem

Saïd JabbourLakhdar SaïsYakoub Salhi

Lecture notes in computer science Year: 2013 Pages: 403-418
JOURNAL ARTICLE

Frequent regular itemset mining

Salvatore Ruggieri

Year: 2010 Pages: 263-272
JOURNAL ARTICLE

Mining Top-K Frequent Closed Itemset in Data Streams

Jun LiHou Xiu-hongSen Gong

Journal:   Energy Procedia Year: 2011 Vol: 11 Pages: 594-601
JOURNAL ARTICLE

Mining top-k frequent-regular closed patterns

Komate AmphawanPhilippe Lenca

Journal:   Expert Systems with Applications Year: 2015 Vol: 42 (21)Pages: 7882-7894
© 2026 ScienceGate Book Chapters — All rights reserved.