{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T01:34:02Z","timestamp":1777685642614,"version":"3.51.4"},"reference-count":54,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Hybrid Intelligent Systems"],"published-print":{"date-parts":[[2019,5]]},"abstract":"<jats:p>This paper describes an empirical research work based on the use of a suitable data structure, named Flow Graph (FG), that can be induced from a supervised training data set. A FG can be approached as a weighted and labeled digraph that summarizes a given supervised training set, aiming at its analysis. FGs can also be used as a repository of the information embedded in training sets, that supports the extraction of classification rules, aiming at the definition of classifiers. The work described in this paper reviews FGs and related concepts, as originally proposed i.e., a suitable structure for modeling discrete data, and proposes its customization for dealing with continuous data. The customization consists of a pre-processing step where a discretization process is carried out in a two-step hybrid approach named HFG (Hybrid Flow Graph). Several experiments with focus on the classifiers extracted from HFGs were conducted and their results were analyzed with focus on both, the value of some metrics associated with the induced digraph-based structure as well as the performance of the classifier extracted from the structure. For the experiments 19 diversified datasets were used and the classification results were comparatively analyzed with those obtained by classifiers induced using four other algorithms namely, J48, Na\u00efve Bayes, k-Nearest-Neighbor and Support Vector Machine.<\/jats:p>","DOI":"10.3233\/his-190262","type":"journal-article","created":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:04:45Z","timestamp":1556625885000},"page":"77-90","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Flow graphs as data structures for inducing classifiers"],"prefix":"10.1177","volume":"15","author":[{"given":"Maria do Carmo","family":"Nicoletti","sequence":"first","affiliation":[{"name":"Centro Universit\u00e1rio C. Limpo Paulista","place":["Brazil"]},{"name":"Universidade Federal de S. Carlos","place":["Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emilio Carlos","family":"Rodrigues","sequence":"additional","affiliation":[{"name":"Centro Universit\u00e1rio C. Limpo Paulista","place":["Brazil"]},{"name":"Instituto Federal de S\u00e3o Paulo","place":["Brazil"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,5]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/NAFIPS.2007.383918"},{"key":"e_1_3_2_3_2","first-page":"102","article-title":"An efficient algorithm for inference in rough set flow graphs","author":"Butz C.J.","year":"2006","unstructured":"ButzC.J. YanW. and YangB., An efficient algorithm for inference in rough set flow graphs, Transactions on Rough Sets PetersJ.F. and SkowronA., eds, LCCS 4100, (2006), 102\u2013122.","journal-title":"Transactions on Rough Sets"},{"key":"e_1_3_2_4_2","unstructured":"BishopC.M. Neural Networks for Pattern Recognition Oxford University Press UK 2005."},{"key":"e_1_3_2_5_2","unstructured":"BishopC.M. Pattern Recognition and Machine Learning Springer-Verlag Publishing Berlin 2006."},{"key":"e_1_3_2_6_2","unstructured":"DuaD. and GraffC. UCI Machine Learning Repository http:\/\/archive.ics.edu\/ml. University of California School of Information and Computer Science Irvine CA 2019."},{"key":"e_1_3_2_7_2","unstructured":"KnuthD.E. The Art of Computer Programming v. III Addison-Wesley USA 1973."},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/ITCC.2005.180"},{"key":"e_1_3_2_9_2","article-title":"Extending flow graphs for handling continuous-valued attributes","author":"Rodrigues E.C.","unstructured":"RodriguesE.C. and NicolettiM.C., Extending flow graphs for handling continuous-valued attributes, in: Hybrid Intelligent Systems (HIS 2018), Advances in Intelligent Systems and Computing, v. 923 MadureiraA. AbrahamA. GandhiN. and VarelaM., eds , Springer, Cham.","journal-title":"Hybrid Intelligent Systems (HIS 2018), Advances in Intelligent Systems and Computing, v. 923"},{"key":"e_1_3_2_10_2","unstructured":"RodriguesE.C. Flow graphs as data structures for representing and extracting information M. Sc. dissertation UNIFACCAMP 2018 (in Portuguese)."},{"key":"e_1_3_2_11_2","unstructured":"FrankE. HallM.A. and WittenI.A. The WEKA Workbench. Online Appendix for Data Mining: Practical Machine Learning Tools and Techniques Morgan Kaufmann Publishers USA 2016."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(70)80056-1"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-2008-5204"},{"key":"e_1_3_2_14_2","first-page":"239","article-title":"Program optimization","volume":"5","author":"Allen F.E.","year":"1969","unstructured":"AllenF.E., Program optimization, Annual Review in Automatic Programming 5 (1969), 239\u2013307.","journal-title":"Annual Review in Automatic Programming"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/390013.808479"},{"key":"e_1_3_2_16_2","first-page":"385","article-title":"A basis for program optimization","author":"Allen F.E.","year":"1972","unstructured":"AllenF.E., A basis for program optimization, in: Proc IFIP Congress, North Holland Publ Co., Amsterdam, 1972, pp. 385\u2013390.","journal-title":"Proc IFIP Congress"},{"key":"e_1_3_2_17_2","first-page":"398","article-title":"Interprocedural data flow analysis","author":"Allen F.E.","year":"1974","unstructured":"AllenF.E., Interprocedural data flow analysis, in: Proc IFIP Congress, North Holland Publ Co., Amsterdam, 1974, pp. 398\u2013402.","journal-title":"Proc IFIP Congress"},{"key":"e_1_3_2_18_2","unstructured":"ChernoffH. The use of faces to represent points in n-dimensional space graphically Tech Report no. 71 Department of Statistics Stanford University Stanford CA USA 1971."},{"key":"e_1_3_2_19_2","unstructured":"WittenI.H. FrankE. and HallM.A. Data Mining: Practical Machine Learning Tools and Techniques Morgan Kaufmann Publishers USA 2011."},{"key":"e_1_3_2_20_2","first-page":"1","article-title":"Combining affective intelligence with learning to improve action selection in decision-making agents","author":"Williams J.B.","year":"2018","unstructured":"WilliamsJ.B. and ZhangX., Combining affective intelligence with learning to improve action selection in decision-making agents, International Journal of Hybrid Intelligent Systems, Pre-press, (2018), 1\u201327.","journal-title":"International Journal of Hybrid Intelligent Systems"},{"key":"e_1_3_2_21_2","unstructured":"ClarkJ. and HoltonD.A. A First Look at Graph Theory (2nd Ed) World Scientific USA 1998."},{"key":"e_1_3_2_22_2","unstructured":"HandlJ. and KnowlesJ. Multiobjective clustering with automatic determination of the number of clusters Tech Rep TR-COMPSYSBIO-2004-02 UMIST UK 2004."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022643204877"},{"key":"e_1_3_2_24_2","unstructured":"QuinlanJ.R. C4.5: Programs for Machine Learning Morgan Kaufmann Publishers USA 1993."},{"key":"e_1_3_2_25_2","first-page":"325","article-title":"Learning from examples based on rough multisets","author":"Grzymala-Busse J.W.","year":"1987","unstructured":"Grzymala-BusseJ.W., Learning from examples based on rough multisets, in: Proc of the Second International Symposium on Methodologies for Intelligent Systems, 1987, pp. 325\u2013332.","journal-title":"Proc of the Second International Symposium on Methodologies for Intelligent Systems"},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.15439\/2015F384"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-160234"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/356674.356676"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"issue":"4","key":"e_1_3_2_30_2","first-page":"175","article-title":"Fuzzy c-Means algorithm with a point symmetry distance","volume":"7","author":"Su M.C.","year":"2005","unstructured":"SuM.C. ChouC.H. HsiehC.C., Fuzzy c-Means algorithm with a point symmetry distance, International Journal of Fuzzy Systems 7(4) (2005), 175\u2013181.","journal-title":"International Journal of Fuzzy Systems"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDT-2008-2404"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-130179"},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-180254"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116835"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2005.08.004"},{"key":"e_1_3_2_36_2","unstructured":"DudaR.O. HartP.E. and StorkD.G. Pattern Classification (2nd Ed) John Wiley and Sons Inc. USA 2001."},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(01)00108-X"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.35"},{"key":"e_1_3_2_39_2","unstructured":"RussellS. and NorvigP. Artificial Intelligence: A Modern Approach (3rd Ed) USA: Pearson Publishing Ltd. 2009."},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.3233\/HIS-2011-0132"},{"key":"e_1_3_2_41_2","unstructured":"MitchellT.M. Machine Learning McGraw-Hill USA 1997."},{"key":"e_1_3_2_42_2","first-page":"1022","article-title":"Multi-interval discretization of continuous-valued attributes for classification learning","author":"Fayyad U.M.","year":"1993","unstructured":"FayyadU.M. and IraniK.B., Multi-interval discretization of continuous-valued attributes for classification learning, in: Proc of the International Joint Conference on Artificial Intelligence, 1993, pp. 1022\u20131029.","journal-title":"Proc of the International Joint Conference on Artificial Intelligence"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-009-0110-y"},{"key":"e_1_3_2_44_2","doi-asserted-by":"crossref","unstructured":"PawlakZ. Rough Sets: Theoretical Aspects of Reasoning About Data Kluwer London 1991.","DOI":"10.1007\/978-94-011-3534-4_7"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219791"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(01)00029-7"},{"key":"e_1_3_2_47_2","first-page":"1","article-title":"Flow graphs and decision algorithms","author":"Pawlak Z.","year":"2003","unstructured":"PawlakZ., Flow graphs and decision algorithms, in: Lecture Notes in Artificial Intelligence, v. 2639 WangG. et al., eds, Springer-Verlag Publishing, Berlin, 2003, pp. 1\u201310.","journal-title":"Lecture Notes in Artificial Intelligence, v. 2639"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80700-X"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.26636\/jtit.2003.3.185"},{"key":"e_1_3_2_50_2","first-page":"147","article-title":"Flow graphs \u2013 a new paradigm for data mining and knowledge discovery","author":"Pawlak Z.","year":"2004","unstructured":"PawlakZ., Flow graphs \u2013 a new paradigm for data mining and knowledge discovery, in: JAIST Forum 2004 \u2013 Technology Creation Based on Knowledge Science: Theory and Practice, jointly with The 5th International Symposium on Knowledge and Systems Science (Proc of the KSS2004), 2004, pp. 147\u2013153.","journal-title":"JAIST Forum 2004 \u2013 Technology Creation Based on Knowledge Science: Theory and Practice, jointly with The 5th International Symposium on Knowledge and Systems Science (Proc of the KSS2004)"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(03)00004-3"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.26636\/jtit.2004.3.255"},{"key":"e_1_3_2_53_2","first-page":"1","article-title":"Flow graphs and data mining","author":"Pawlak Z.","year":"2005","unstructured":"PawlakZ., Flow graphs and data mining, in: Transactions on Rough Sets III, Lecture Notes in Computer Science, v. 3400 PetersJ.F. and SkowronA., eds, Springer-Verlag Publishing, Berlin, 2005, pp. 1\u201336.","journal-title":"Transactions on Rough Sets III, Lecture Notes in Computer Science, v. 3400"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.06.003"},{"key":"e_1_3_2_55_2","unstructured":"PawlakZ. Flow Graphs \u2013 a new paradigm for intelligent data analysis Warsaw University of Technology Digital Library 2010 1\u201328."}],"container-title":["International Journal of Hybrid Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/HIS-190262","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/HIS-190262","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/HIS-190262","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:52:44Z","timestamp":1777452764000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/HIS-190262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":54,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["10.3233\/HIS-190262"],"URL":"https:\/\/doi.org\/10.3233\/his-190262","relation":{},"ISSN":["1448-5869","1875-8819"],"issn-type":[{"value":"1448-5869","type":"print"},{"value":"1875-8819","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,5]]}}}