The SCEAS System
Navigation Menu

Search the dblp DataBase


Henrik Boström: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Tony Lindgren, Henrik Boström
    Classification with Intersecting Rules. [Citation Graph (0, 0)][DBLP]
    ALT, 2002, pp:395-402 [Conf]
  2. Anette Hulth, Jussi Karlgren, Anna Jonsson, Henrik Boström, Lars Asker
    Automatic Keyword Extraction Using Domain Knowledge. [Citation Graph (0, 0)][DBLP]
    CICLing, 2001, pp:472-482 [Conf]
  3. Zoltán Alexin, Tibor Gyimóthy, Henrik Boström
    Integrating Algorithmic Debugging and Unfolding Transformation in an Interactive Learner. [Citation Graph (0, 0)][DBLP]
    ECAI, 1996, pp:403-407 [Conf]
  4. Hilde Adé, Henrik Boström
    JIGSAW: Puzzling together RUTH and SPECTRE (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ECML, 1995, pp:263-266 [Conf]
  5. Henrik Boström
    Improving Example-Guided Unfolding. [Citation Graph (0, 0)][DBLP]
    ECML, 1993, pp:124-135 [Conf]
  6. Henrik Boström
    Specialization of Recursive Predicates. [Citation Graph (0, 0)][DBLP]
    ECML, 1995, pp:92-106 [Conf]
  7. Henrik Boström
    Predicate Invention and Learning from Positive Examples Only. [Citation Graph (0, 0)][DBLP]
    ECML, 1998, pp:226-237 [Conf]
  8. Henrik Boström
    Generalizing the Order of Goals as an Approach to Generalizing Number. [Citation Graph (0, 0)][DBLP]
    ML, 1990, pp:260-267 [Conf]
  9. Henrik Boström
    Theory-Guideed Induction of Logic Programs by Inference of Regular Languages. [Citation Graph (0, 0)][DBLP]
    ICML, 1996, pp:46-53 [Conf]
  10. Tony Lindgren, Henrik Boström
    Resolving Rule Conflicts with Double Induction. [Citation Graph (0, 0)][DBLP]
    IDA, 2003, pp:60-67 [Conf]
  11. Henrik Boström
    Covering vs. Divide-and-Conquer for Top-Down Induction of Logic Programs. [Citation Graph (0, 0)][DBLP]
    IJCAI, 1995, pp:1194-1200 [Conf]
  12. Henrik Boström, Lars Asker
    Combining Divide-and-Conquer and Separate-and-Conquer for Efficient and Effective Rule Induction. [Citation Graph (0, 0)][DBLP]
    ILP, 1999, pp:33-43 [Conf]
  13. Martin Eineborg, Henrik Boström
    Classifying Uncovered Examples by Rule Stretching. [Citation Graph (0, 0)][DBLP]
    ILP, 2001, pp:41-50 [Conf]
  14. Juan José Rodríguez, Carlos J. Alonso, Henrik Boström
    Learning First Order Logic Time Series Classifiers. [Citation Graph (0, 0)][DBLP]
    ILP Work-in-progress reports, 2000, pp:- [Conf]
  15. Mikael Huss, Henrik Boström, Lars Asker, Joakim Cöster
    Learning to recognize brain specific proteins based on low-level features from on-line prediction servers. [Citation Graph (0, 0)][DBLP]
    BIOKDD, 2001, pp:45-49 [Conf]
  16. Henrik Boström
    Induction of Recursive Transfer Rules. [Citation Graph (0, 0)][DBLP]
    Learning Language in Logic, 1999, pp:237-246 [Conf]
  17. Per Lidén, Lars Asker, Henrik Boström
    Rule Induction for Classification of Gene Expression Array Data. [Citation Graph (0, 0)][DBLP]
    PKDD, 2002, pp:338-347 [Conf]
  18. Juan J. Rodríguez Diez, Carlos Alonso González, Henrik Boström
    Learning First Order Logic Time Series Classifiers: Rules and Boosting. [Citation Graph (0, 0)][DBLP]
    PKDD, 2000, pp:299-308 [Conf]
  19. Carl Gustaf Jansson, Henrik Boström, Peter Idestam-Almquist
    Optimizing Horn Clause Logic Programs for Particular Modes of Use: An Analysis of Explanation-Based Learning and Partial Evaluation. [Citation Graph (0, 0)][DBLP]
    SCAI, 1991, pp:252-257 [Conf]
  20. Zoltán Alexin, Tibor Gyimóthy, Henrik Boström
    IMPUT: An Interactive Learning Tool Based on Program Specialization. [Citation Graph (0, 0)][DBLP]
    Intell. Data Anal., 1997, v:1, n:1-4, pp:219-244 [Journal]
  21. Juan J. Rodríguez Diez, Carlos Alonso González, Henrik Boström
    Boosting interval based literals. [Citation Graph (0, 0)][DBLP]
    Intell. Data Anal., 2001, v:5, n:3, pp:245-262 [Journal]
  22. Tony Lindgren, Henrik Boström
    Resolving rule conflicts with double induction. [Citation Graph (0, 0)][DBLP]
    Intell. Data Anal., 2004, v:8, n:5, pp:457-468 [Journal]
  23. Henrik Boström, Peter Idestam-Almquist
    Induction of Logic Programs by Example-Guided Unfolding. [Citation Graph (0, 0)][DBLP]
    J. Log. Program., 1999, v:40, n:2-3, pp:159-183 [Journal]
  24. Thashmee Karunaratne, Henrik Boström
    Learning to classify structured data by graph propositionalization. [Citation Graph (0, 0)][DBLP]
    Computational Intelligence, 2006, pp:283-288 [Conf]
  25. Henrik Boström
    Maximizing the Area under the ROC Curve with Decision Lists and Rule Sets. [Citation Graph (0, 0)][DBLP]
    SDM, 2007, pp:- [Conf]

  26. Extending Nearest Neighbor Classification with Spheres of Confidence. [Citation Graph (, )][DBLP]

  27. Calibrating Random Forests. [Citation Graph (, )][DBLP]

  28. On the Use of Accuracy and Diversity Measures for Evaluating and Selecting Ensembles of Classifiers. [Citation Graph (, )][DBLP]

  29. Comprehensible Models for Predicting Molecular Interaction with Heart-Regulating Genes. [Citation Graph (, )][DBLP]

  30. Estimating class probabilities in random forests. [Citation Graph (, )][DBLP]

  31. Reducing High-Dimensional Data by Principal Component Analysis vs. Random Projection for Nearest Neighbor Classification. [Citation Graph (, )][DBLP]

  32. Improving Fusion of Dimensionality Reduction Methods for Nearest Neighbor Classification. [Citation Graph (, )][DBLP]

  33. Graph Propositionalization for Random Forests. [Citation Graph (, )][DBLP]

  34. Classification of Microarrays with kNN: Comparison of Dimensionality Reduction Methods. [Citation Graph (, )][DBLP]

  35. The problem with ranking ensembles based on training or validation performance. [Citation Graph (, )][DBLP]

  36. Using Background Knowledge for Graph Based Learning: A Case Study in Chemoinformatics. [Citation Graph (, )][DBLP]

  37. Using uncertain chemical and thermal data to predict product quality in a casting process. [Citation Graph (, )][DBLP]

  38. Chipper - A Novel Algorithm for Concept Description. [Citation Graph (, )][DBLP]

  39. Ensemble member selection using multi-objective optimization. [Citation Graph (, )][DBLP]

Search in 0.006secs, Finished in 0.009secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002