Discovering significant patterns

DOI10.1007/s10994-007-5006-xzbMath1470.68195OpenAlexW4235234743WikidataQ61311905 ScholiaQ61311905MaRDI QIDQ2384152

Geoffrey I. Webb

Publication date: 20 September 2007

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-007-5006-x

zbMATH Keywords

association rulespattern discoverystatistical evaluation

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (23)

Generalized theme dictionary models for association pattern discovery ⋮ On the unsupervised analysis of domain-specific Chinese texts ⋮ A statistical significance testing approach to mining the most informative set of patterns ⋮ Cluster-grouping: from subgroup discovery to clustering ⋮ Mining probabilistic automata: a statistical view of sequential pattern mining ⋮ Ranking episodes using a partition model ⋮ A tutorial on statistically sound pattern discovery ⋮ Discovering episodes with compact minimal windows ⋮ Mining significant association rules from uncertain data ⋮ Skopus: mining top-\(k\) sequential patterns under leverage ⋮ Bsig: evaluating the statistical significance of biclustering solutions ⋮ Interest measures for fuzzy association rules based on expectations of independence ⋮ Computing exact permutation \(p\)-values for association rules ⋮ Modelling pattern interestingness in comparative music corpus analysis ⋮ The blind men and the elephant: on meeting the problem of multiple truths in data from clustering and pattern mining perspectives ⋮ Lift Measure for Fuzzy Association Rules ⋮ Layered critical values: a powerful direct-adjustment approach to discovering significant patterns ⋮ Evaluation and optimization of frequent, closed and maximal association rule based classification ⋮ Significant motifs in time series ⋮ On cognitive preferences and the plausibility of rule-based models ⋮ Quantitative Redundancy in Partial Implications ⋮ The minimum description length principle for pattern mining: a survey ⋮ Robust subgroup discovery. Discovering subgroup lists using MDL

Uses Software

• UCI-ml
• C4.5

Cites Work

• Multiple comparisons in induction algorithms
• A survey of exact inference for contingency tables. With comments and a rejoinder by the author
• The control of the false discovery rate in multiple testing under dependency.
• 10.1162/jmlr.2003.3.4-5.833
• Detecting group differences: Mining contrast sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discovering significant patterns