Title :
Flow Decomposition in Complex Systems
Author :
Luper, David ; Kazanci, Caner ; Schramski, John ; Arabnia, Hamid R.
Author_Institution :
Dept. of Comput. Sci., Univ. of Georgia, Athens, GA, USA
Abstract :
Complex systems can be represented as weighted digraphs. Cycles play an important role in complex systems because they define relationships consisting of unique groupings of nodes. A grouping of connected nodes contains rich contextual meaning because of the relationships defined by its connecting edges. Cycle bases are a description of the set of all independent cycles within a graph. The work herein outlines a computational methodology to decompose the total through flow of a complex system into a set of coefficients over its cycle bases. A coefficient is computed for each cycle representing the cycle´scontribution to the total system through flow. This vector of coefficients provides information for data mining and information clustering applications to analyze the system. The proposed methodology provides a powerful framework for analyzing symbolic data by assigning magnitude values to the contextual meaning within groupings of symbols.
Keywords :
data mining; directed graphs; pattern clustering; complex systems; connected nodes grouping; cycle base; data mining; flow decomposition; information clustering application; symbolic data; weighted digraph; Biological system modeling; Computational modeling; Context; Grammar; Histograms; Random access memory; Runtime; Data Mining; Graph Mining; Information Clustering; Network Analysis; Sequence Mining; Systems Analysis;
Conference_Titel :
Information Technology: New Generations (ITNG), 2011 Eighth International Conference on
Conference_Location :
Las Vegas, NV
Print_ISBN :
978-1-61284-427-5
Electronic_ISBN :
978-0-7695-4367-3
DOI :
10.1109/ITNG.2011.105