Novel matrix forms of rough set flow graphs with applications to data integration

Pawlak's flow graphs have attracted both practical and theoretical researchers because of their ability to visualize information flow. In this paper, we invent a new schema to represent throughflow of a flow graph and three coefficients of both normalized and combined normalized flow graphs in matrix form. Alternatively, starting from a flow graph with its throughflow matrix, we reform Pawlak's formulas to calculate these three coefficients in flow graphs by using matrix properties. While traditional algorithms for computing these three coefficients of the connection are exponential in l, an algorithm using our matrix representation is polynomial in l, where l is the number of layers of a flow graph. The matrix form can simplify computation, improve time complexity, alleviate problems due to missing coefficients and hence help to widen the applications of flow graphs. Practically, data sets often reside at different sources (heterogeneous data sources). Their individual analysis at each source is inadequate and requires special treatment. Hence, we introduce a composition method for flow graphs and corresponding formulas for calculating their coefficients which can omit some data sharing. We provide a real-world experiment on the Promotion of Academic Olympiads and Development of Science Education Foundation (POSN) data set which illustrates a desirable outcome and the advantages of the proposed matrix forms and the composition method.

[1]  Roman Słowiński,et al.  Generalized Decision Algorithms, Rough Inference Rules, and Flow Graphs , 2002, Rough Sets and Current Trends in Computing.

[2]  Krzysztof Pancerz,et al.  Rough Set Flow Graphs and Max - * Fuzzy Relation Equations in State Prediction Problems , 2008, RSCTC.

[3]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[4]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[5]  Jigui Sun,et al.  Interpretation of Extended Pawlak Flow Graphs Using Granular Computing , 2008, Trans. Rough Sets.

[6]  Puntip Pattaraintakorn,et al.  Knowledge discovery by rough sets mathematical flow graphs and its extension , 2008 .

[7]  Zdzislaw Pawlak,et al.  Rough sets, decision algorithms and Bayes' theorem , 2002, Eur. J. Oper. Res..

[8]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[9]  Alicja Mieszkowicz-Rolka,et al.  Flow Graphs and Decision Tables with Fuzzy Attributes , 2006, ICAISC.

[10]  Zdzislaw Pawlak,et al.  Decision Trees and Flow Graphs , 2006, RSCTC.

[11]  Zdzislaw Pawlak,et al.  Rough Sets and Flow Graphs , 2005, RSFDGrC.

[12]  Zdzislaw Pawlak,et al.  Probability, Truth and Flow Graph , 2003, RSKD.

[13]  Krzysztof Pancerz,et al.  Flow Graphs as a Tool for Mining Prediction Rules of Changes of Components in Temporal Information Systems , 2007, RSKT.

[14]  Nick Cercone,et al.  Rule learning: Ordinal prediction based on rough sets and soft-computing , 2006, Appl. Math. Lett..

[15]  Puntip Pattaraintakorn,et al.  Towards theories of fuzzy set and rough set to flow graphs , 2008, 2008 IEEE International Conference on Fuzzy Systems (IEEE World Congress on Computational Intelligence).

[16]  Andrzej Czyzewski,et al.  Musical Metadata Retrieval with Flow Graphs , 2004, Rough Sets and Current Trends in Computing.

[17]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[18]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[19]  Wen Yan,et al.  An Efficient Algorithm for Inference in Rough Set Flow Graphs , 2006, Trans. Rough Sets.

[20]  Zdzisław Pawlak,et al.  Decision algorithms and flow graphs: A rough set approach , 2003 .

[21]  Jigui Sun,et al.  An Extension of Pawlak's Flow Graphs , 2006, RSKT.

[22]  Zdzislaw Pawlak,et al.  Flow Graphs and Data Mining , 2005, Trans. Rough Sets.

[23]  S. Tsumoto,et al.  On Learning Decision Rules From Flow Graphs , 2007, NAFIPS 2007 - 2007 Annual Meeting of the North American Fuzzy Information Processing Society.