The goal of any clustering algorithm is to find the optimal clustering solution with the optimal number of clusters. In order to evaluate a clustering solution, a number of validit...
In this paper we propose a probabilistic model for online document clustering. We use non-parametric Dirichlet process prior to model the growing number of clusters, and use a pri...
Word Sense Disambiguation (WSD), in the field of Natural Language Processing (NLP), consists in assigning the correct sense (semantics) to a word form (lexeme) by means of the cont...
Davide Buscaldi, Giovanna Guerrini, Marco Mesiti, ...
We address here two major challenges presented by dynamic data mining: 1) the stability challenge: we have implemented a rigorous incremental density-based clustering algorithm, i...
As the number of components in XML documents is much larger than that of ‘flat’ documents, we believe it is essential to provide users of XML information retrieval systems wi...