#### Filter Results:

- Full text PDF available (72)

#### Publication Year

1964

2017

- This year (6)
- Last 5 years (52)
- Last 10 years (82)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Cell Type

#### Data Set Used

#### Organism

Learn More

- Henrik Boström, Lars Asker
- ILP
- 1999

- Henrik Boström
- IJCAI
- 1995

Covering and divide-and-conquer are two wellestablished search techniques for top-down in duction of propositional theories However, for top-down induction of logic programs, only covering has been formalized and used extensively In this work, the divide-and-conquer technique is formalized as well and compared to the covering technique in a logic program… (More)

- Henrik Boström, Peter Idestam-Almquist
- J. Log. Program.
- 1999

Resolution has been used as a specialisation operator in several approaches to top-down induction of logic programs. This operator allows the overly general hypothesis to be used as a declarative bias that restricts not only what predicate symbols can be used in produced hypotheses, but also how the predicates can be invoked. The two main strategies for… (More)

- Sampath Deegalla, Henrik Boström
- 2006 5th International Conference on Machine…
- 2006

The computational cost of using nearest neighbor classification often prevents the method from being applied in practice when dealing with high-dimensional data, such as images and micro arrays. One possible solution to this problem is to reduce the dimensionality of the data, ideally without loosing predictive performance. Two different dimensionality… (More)

- Zoltán Alexin, Tibor Gyimóthy, Henrik Boström
- ECAI
- 1996

The algorithm SPECTRE specializes logic programs with respect to positive and negative examples by applying the transformation rule unfolding together with clause removal. The method IMPUT presented in this paper gives a modified version of this algorithm by integrating the algorithmic debugging system IDTS with SPECTRE. The main idea of the IMPUT method is… (More)

- Anette Hulth, Jussi Karlgren, Anna Jonsson, Henrik Boström, Lars Asker
- CICLing
- 2001

Documents can be assigned keywords by frequency analysis of the terms found in the document text, which arguably is the primary source of knowledge about the document itself. By including a hierarchically organised domain speciic thesaurus as a second knowledge source the quality of such keywords was improved considerably, as measured by match to previously… (More)

- Juan José Rodríguez Diez, Carlos Alonso González, Henrik Boström
- Intell. Data Anal.
- 2001

A supervised classification method for time series, even multivariate, is presented. It is based on boosting very simple classifiers: clauses with one literal in the body. The background predicates are based on temporal intervals. Two types of predicates are used: i) relative predicates, such as “increases” and “stays”, and ii) region predicates, such as… (More)

- Henrik Boström
- 2005

The use of incremental reduced error pruning for maximizing the area under the ROC curve (AUC) instead of accuracy is investigated. A commonly used accuracy-based exclusion criterion is shown to include rules that result in concave ROC curves as well as to exclude rules that result in convex ROC curves. A previously proposed exclusion criterion for… (More)

- Micael Jacobsson, Per Lidén, Eva Stjernschantz, Henrik Boström, Ulf Norinder
- Journal of medicinal chemistry
- 2003

Three different multivariate statistical methods, PLS discriminant analysis, rule-based methods, and Bayesian classification, have been applied to multidimensional scoring data from four different target proteins: estrogen receptor alpha (ERalpha), matrix metalloprotease 3 (MMP3), factor Xa (fXa), and acetylcholine esterase (AChE). The purpose was to build… (More)