Learn More
  • A. Gil, G. Dias
  • 2003
We describe an efficient implementation for mining textual associations from text corpora. In order to tackle real world applications, efficient algorithms and data structures are needed to manage, in reasonable time and space, the overgrowing volume of text data. For that purpose, we introduce a global architecture based on masks, suffix arrays and(More)
In a previous paper we introduced the so-called 'extended determination co-efficient' as a real-valued measure of the strength of association between two interval-valued random elements (assumed to be formalized as compact convex random sets). In the setting of least squares fitting of a 'linear' relation between interval-valued data based on a generalized(More)
  • 1