Abstract: In this demonstration we introduce a technology to support knowledge structuring processes already at the time of their creation by building up concept structures in real...
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
In this paper, we report on two user-centric evaluation studies of COPLINK, a suite of criminal data mining and knowledge management applications developed at the University of Ari...
Chienting Lin, Paul J. Hu, Hsinchun Chen, Jennifer...
We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logi...
Abstract-- The aim of this paper is to present an axiomatization of a generalization of Shannon's entropy starting from partitions of finite sets. The proposed axiomatization ...