Flow Graphs and Intelligent Data Analysis
Fundamenta InformaticaePublished 1 July 2004
Zdzisław Pawlak
Citations18
SJR quartileQ3
SJR score0.29
SNIP0.62
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper proposes to model decision processes as flow graphs and analyze decisions in terms of flow spreading in a graph to improve intelligent data analysis.
Abstract
This paper concerns a new approach to intelligent data analysis based on information flow distribution study in a flow graph. Branches of a flow graph are interpreted as decision rules, whereas a flow graph is supposed to describe a decision algorithm. We propose to model decision processes as flow graphs and analyze decisions in terms of flow spreading in a graph.
Keywords
Decision SciencesEngineering
Flows in networks
4,080 Citations1962D. R. Ford, D. R. Fulkerson
TechnometricsIntelligent Data Analysis: An Introduction
336 Citations2005Michael Berthold, David J. Hand
Lecture notes in computer scienceFlow Graphs and Decision Algorithms
41 Citations2007Zdzisław Pawlak
A new kind of flow networks, called flow graphs, different to that proposed by Ford and Fulkerson are introduced, where branches of the flow graph are interpreted as decision rules, while the whole flow graph can be understood as a representation of decision algorithm.
