Demand-driven concept formation
Knowledge representation and organization in machine learning
Shift of bias without operators
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Machine Learning
Theories for mutagenicity: a study in first-order and feature-based induction
Artificial Intelligence - Special volume on empirical methods
A decision-theoretic generalization of on-line learning and an application to boosting
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Molecular feature mining in HIV data
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Propositionalization approaches to relational data mining
Relational Data Mining
Levelwise Search and Borders of Theories in KnowledgeDiscovery
Data Mining and Knowledge Discovery
Discovery of frequent DATALOG patterns
Data Mining and Knowledge Discovery
Data Mining and Knowledge Discovery
Feature Construction with Version Spaces for Biochemical Applications
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
Generating Accurate Rule Sets Without Global Optimization
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Abstractions for Knowledge Organization of Relational Descriptions
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
PKDD '00 Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery
Experiments in Predicting Biodegradability
ILP '99 Proceedings of the 9th International Workshop on Inductive Logic Programming
A Logical Database Mining Query Language
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
An assessment of submissions made to the predictive toxicology evaluation challenge
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
The levelwise version space algorithm and its application to molecular fragment finding
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Scaling Boosting by Margin-Based Inclusionof Features and Relations
ECML '02 Proceedings of the 13th European Conference on Machine Learning
Boosting Descriptive ILP for Predictive Learning in Bioinformatics
Inductive Logic Programming
Feature discovery in classification problems
IDA'05 Proceedings of the 6th international conference on Advances in Intelligent Data Analysis
Evolutionary search of optimal features
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
| Hi-index | 0.02 |
This paper tackles the problem that methods for proposition-alization and feature construction in first-order logic to date construct features in a rather unspecific way. That is, they do not construct features "on demand", but rather in advance and without detecting the need for a representation change. Even if structural features are required, current methods do not construct these features in a goal-directed fashion. In previous work, we presented a method that creates structural features in a class-sensitive manner: We queried the molecular feature miner (MOLFEA) for features (linear molecular fragments) with a minimum frequency in the positive examples and a maximum frequency in the negative examples, such that they are, statistically significant, overrepresented in the positives and under-represented in the negatives. In the present paper, we go one step further. We construct structural features in order to discriminate between those examples from different classes that are particularly problematic to classify. In order to avoid overfitting, this is done in a boosting framework. We are alternating AdaBoost re-weighting episodes and feature construction episodes in order to construct structural features "on demand". In a feature construction episode, we are querying for features with a minimum cumulative weight in the positives and a maximum cumulative weight in the negatives, where the weights stem from the previous AdaBoost iteration. In summary, we propose to construct structural features "on demand" by a combination of AdaBoost and an extension of MOLFEA to handle weighted learning instances.