The paper presents an FP-growth-based algorithm that mines non-redundant discriminative patterns from hybrid symbolic-numeric data using interval items, exhaustive covering, and branch-and-bound pruning.
IEEE Trans
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Towards Efficient Discriminative Pattern Mining in Hybrid Domains
The paper presents an FP-growth-based algorithm that mines non-redundant discriminative patterns from hybrid symbolic-numeric data using interval items, exhaustive covering, and branch-and-bound pruning.