OpenAlex
PricingAboutJobs
Log inGet started
Work

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

HTML PDF

Year: 2013
Type: conference-paper
Source: Lecture notes in computer science
DOI: 10.1007/978-3-642-40994-3_26
Authors: Said Jabbour, Lakhdar Sais, Yakoub Salhi
Institutions: Centre National de la Recherche Scientifique, Centre de Recherche en Informatique de Lens, Université d'Artois
Language: English

Topic: Data Mining Algorithms and Applications
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Keywords: closed itemset mining, Boolean formulas, minimal models, preference relations, propositional logic encoding

Open Access status: bronze

Funder: Agence Nationale de la Recherche
OpenAlex ID: W407409333
FWCI: 3.349
Cites: 26
Cited by: 44
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms
Security