Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining.
Kouzou OharaMasahiro HaraKiyoto TakabayashiHiroshi MotodaTakashi WashioPublished in: PKAW (2008)
Keyphrases
- information gain
- upper bound
- pruning strategy
- feature selection
- lower bound
- text categorization
- decision trees
- mining algorithm
- itemsets
- naive bayes
- generalization error
- sequential pattern mining
- frequent itemsets
- unsupervised learning
- feature extraction
- knn
- feature subset
- machine learning
- semi supervised
- support vector
- pattern mining
- active learning
- pairwise
- frequent itemset mining