2723 search results - page 6 / 545 » Learning lexicographic orders |
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
We investigate new approaches for frequent graph-based pattern mining in graph datasets and propose a novel algorithm called gSpan (graph-based Substructure pattern mining), which...
ECML
2007
Springer
15 years 3 months ago
2007
Springer
Given a binary classification task, a ranker sorts a set of instances from highest to lowest expectation that the instance is positive. We propose a lexicographic ranker, LexRank,...
ECAI
2010
Springer
14 years 7 months ago
2010
Springer
We investigate the complexity of axiom pinpointing for different members of the DL-Lite family of Description Logics. More precisely, we consider the problem of enumerating all mi...
LREC
2008
14 years 11 months ago
2008
This paper focuses on different aspects of collaborative work used to create the electronic version of a dictionary in paper format, edited and printed by the Romanian Academy dur...
LPAR
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The Knuth-Bendix ordering is usually preferred over the lexicographic path ordering in successful implementations of resolution and superposition, but it is incompatible ...