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

Komate Amphawan; Philippe Lenca; Athasit Surarerks

doi:10.1007/978-3-642-28320-8_11

ScienceGate Book Chapters

BOOK-CHAPTER

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

Komate Amphawan Philippe Lenca Athasit Surarerks

Year: 2012 Lecture notes in computer science Pages: 124-135 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-28320-8_11

Get Full-Text PDF Get Analytical Report

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

Cited By

1.73

FWCI (Field Weighted Citation Impact)

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

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

Metrics

Citation History

Topics

Related Documents

Efficient Top-k Frequent Itemset Mining on Massive Data

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

Frequent regular itemset mining

Mining Top-K Frequent Closed Itemset in Data Streams

Mining top-k frequent-regular closed patterns