Pages that link to "Item:Q650527"

The following pages link to Itemset mining: a constraint programming perspective (Q650527):

Displaying 19 items.

• Using finite transducers for describing and synthesising structural time-series constraints (Q265697) (← links)
• Finding relational redescriptions (Q479473) (← links)
• RQL: a query language for rule discovery in databases (Q507529) (← links)
• MiningZinc: a declarative framework for constraint-based mining (Q511753) (← links)
• Mining top-\(k\) motifs with a SAT-based framework (Q511756) (← links)
• Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems (Q511763) (← links)
• Constrained clustering by constraint programming (Q511767) (← links)
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
• Relational linear programming (Q511779) (← links)
• Itemset mining: a constraint programming perspective (Q650527) (← links)
• \textsc{Para}\textsc{Miner}: a generic pattern mining algorithm for multi-core architectures (Q740594) (← links)
• SAT-based models for overlapping community detection in networks (Q783048) (← links)
• Relational data factorization (Q1699908) (← links)
• Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining (Q1706775) (← links)
• Flexible constrained sampling with guarantees for pattern mining (Q1741334) (← links)
• The minimum description length principle for pattern mining: a survey (Q2097441) (← links)
• Towards a compact SAT-based encoding of itemset mining tasks (Q2117214) (← links)
• Knowledge representation analysis of graph mining (Q2317967) (← links)
• Local and global symmetry breaking in itemset mining (Q2398272) (← links)