International Journal of applied mathematics and computer science

online read us now

Paper details

Number 3 - September 2020
Volume 30 - 2020

Ant-based clustering for flow graph mining

Arkadiusz Lewicki, Krzysztof Pancerz

The paper is devoted to the problem of mining graph data. The goal of this process is to discover possibly certain sequences appearing in data. Both rough set flow graphs and fuzzy flow graphs are used to represent sequences of items originally arranged in tables representing information systems. Information systems are considered in the Pawlak sense, as knowledge representation systems. In the paper, an approach involving ant based clustering is proposed. We show that ant based clustering can be used not only for building possible large groups of similar objects, but also to build larger structures (in our case, sequences) of objects to obtain or preserve the desired properties.

possibly certain sequences, flow graphs, rough sets, fuzzy sets, ant-based clustering