An interpretation of flow graphs by granular computing

  • Authors:
  • Jigui Sun;Huawen Liu;Changsong Qi;Huijie Zhang

  • Affiliations:
  • College of Computer Science, Jilin University, Changchun, China;College of Computer Science, Jilin University, Changchun, China;College of Computer Science, Jilin University, Changchun, China;College of Computer Science, Jilin University, Changchun, China

  • Venue:
  • RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

Flow graph (FG) is a unique approach in data mining and data analysis mainly in virtue of its well-structural characteristics of network, which is naturally consistent with granular computing (GrC). Meanwhile, GrC provides us with both structured thinking at the philosophical level and structured problem solving at the practical level. The main objective of the present paper is to develop a simple and more concrete model for flow graph using GrC. At first, FG will be mainly discussed in three aspects under GrC, namely, granulation of FG, some relationships and operations of granules. Moreover, as one of advantages of this interpretation, an efficient approximation reduction algorithm of flow graph is given under the framework of GrC.