Abstract. We apply a recent formalization of visualization as information retrieval to linear projections. We introduce a method that optimizes a linear projection for an informati...
Topographic maps are an appealing exploratory instrument for discovering new knowledge from databases. During the recent years, several variations on the Self Organizing Maps (SOM)...
Jonas Poelmans, Paul Elzinga, Stijn Viaene, Guido ...
Measuring the similarity between clusterings is a classic problem with several proposed solutions. In this work we focus on measures based on coassociation of data pairs and perfor...
Barycentric algebras have seen widespread application in the modeling of convex sets, semilattices, and quantum mechanics. Recently, they were developed further to encompass Boolea...
A number of generalizations of answer set programming have been proposed in the literature to deal with vagueness, uncertainty, and partial rule satisfaction. We introduce a unifyi...
Jeroen Janssen, Steven Schockaert, Dirk Vermeir, M...
In this work we recall the first steps towards the definition of an answer set semantics for residuated logic programs with negation, and concentrate on the development of relati...
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...