Titlebook: ;

Insatiable

https://doi.org/10.1007/978-3-662-43816-9at allows one to eliminate such redundant computations and significantly improves the performance of algorithms from the Close-by-One family. We show that this technique can be used in the Lindig-type algorithms to improve their performance as well.

Self-Help-Group

Improving the Performance of Lindig-Style Algorithms with Empty Intersectionsat allows one to eliminate such redundant computations and significantly improves the performance of algorithms from the Close-by-One family. We show that this technique can be used in the Lindig-type algorithms to improve their performance as well.

搬运工

https://doi.org/10.1007/978-3-322-89256-0ormance of classification models. We then propose an approach to identifying the most predictive and discriminant features using multicriteria decision making. Finally, we present and discuss an experiment on a public dataset illustrating the potential of the approach.

纬线

Eckhard Klockhaus,Hans-Jürgen Scheruhnormalized based on a set of knowledge metrics that, for any given focus, rank knowledge base schemas according to their quality. We apply the proposed methodology on a large data set of state-of-the-art knowledge base schemas and we show how it can be used in practice (Data and scripts are available at .).

vasculitis

注视

COW

https://doi.org/10.1007/978-3-642-33888-5l data, where each item . in the sequence has an associated timestamp .: .. We introduce descriptions and strategies dedicated to temporal sequences, and new unsupervised measures. We show on some datasets that the distance constraint subsequence strategy allows to generate good concept lattices.