Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters
We bring two rough-set-based clustering algorithms into the framework of partially supervised clustering. A mechanism of partial supervision relying on either qualitative or quanti...
—We apply a simple clustering algorithm to a large dataset of cellular telecommunication records, reducing the complexity of mobile phone users’ full trajectories and allowing ...
In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn t...
In this paper, a new fuzzy clustering algorithm that uses cellular learning automata based evolutionary computing (CLA-EC) is proposed. The CLA-EC is a model obtained by combining...
Reza Rastegar, A. R. Arasteh, Arash Hariri, Mohamm...