Abstract. We present an algorithm for mining frequent queries in arbitrary relational databases, over which functional dependencies are assumed. Building upon previous results, we ...
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
— Constrained clustering (semi-supervised learning) techniques have attracted more attention in recent years. However, the commonly used constraints are restricted to the instanc...
In some real world situations, linear models are not sufficient to represent accurately complex relations between input variables and output variables of a studied system. Multila...
In this paper, we specify the indirect utility function as a partially linear model, where utility is nonparametric in expenditure and parametric (with fixed- or varying-coefficie...