Mining top-\(k\) motifs with a SAT-based framework (Q511756): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.artint.2015.11.003 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4952632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3184605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining (Soft-) Skypatterns Using Dynamic CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability problems with preferences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Itemset mining: a constraint programming perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving the Partial MAX-SAT Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Optimal CNF Encoding of Boolean Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cardinality networks: a theoretical and empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: On measuring similarity for sequences of itemsets / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ARTINT.2015.11.003 / rank
 
Normal rank

Latest revision as of 19:59, 9 December 2024

scientific article
Language Label Description Also known as
English
Mining top-\(k\) motifs with a SAT-based framework
scientific article

    Statements

    Mining top-\(k\) motifs with a SAT-based framework (English)
    0 references
    0 references
    0 references
    0 references
    22 February 2017
    0 references
    Boolean satisfiability
    0 references
    data mining
    0 references
    modeling
    0 references
    top-\(k\) motifs
    0 references
    0 references
    0 references

    Identifiers