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

Saïd Jabbour; Lakhdar Saïs; Yakoub Salhi

doi:10.1007/978-3-642-40994-3_26

ScienceGate Book Chapters

BOOK-CHAPTER

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

Saïd Jabbour Lakhdar Saïs Yakoub Salhi

Year: 2013 Lecture notes in computer science Pages: 403-418 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-642-40994-3_26

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science ENCODE Propositional formula Preference Relation (database) Satisfiability Conjunctive normal form Boolean satisfiability problem Propositional calculus Theoretical computer science Combinatorics Algorithm Mathematics Propositional variable Programming language Data mining Description logic

Metrics

Cited By

8.65

FWCI (Field Weighted Citation Impact)

Refs

0.98

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

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

Metrics

Citation History

Topics

Related Documents

Mining Top-K Frequent Closed Itemset in Data Streams

Mining Accurate Top-K Frequent Closed Itemset from Data Stream

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

Efficient Top-k Frequent Itemset Mining on Massive Data

Mining top-k frequent-regular closed patterns