Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/29893
Title: A novel graph decomposition approach to the automatic processing of poorly formalized data : innovative ideas : a management case study
Authors: Patrikeeva, N. V.
Babeshko, V. N.
Kamenev, E. A.
Podolskiy, V. E.
Keywords: Data structures (Computer science)
Intellectual property
Graph theory
Electronic data processing
Data mining
Issue Date: 2015
Publisher: University of Piraeus. International Strategic Management Association
Citation: Patrikeeva, N. V., Babeshko, V. N., Kamenev, E. A., & Podolskiy, V. E. (2015). A novel graph decomposition approach to the automatic processing of poorly formalized data : innovative ideas : a management case study. European Research Studies Journal, 18(4), 5-34.
Abstract: In the following paper we present a novel approach to unstructured data processing by imposing a hierarchical graph-based structure on the data and decomposing it into separate subgraphs according to optimization criteria. In the scope of the paper we also consider the problem of automatic classification of textual data for the synthesizing the hierarchical data structure. The proposed approach uses textual information on the first stage to classify ideas, innovations, and objects of intellectual property (OIPs) to construct a multilayered graph. Numerical criteria are used to decompose constructed graph into separate subgraphs. In the scope of the research we apply the developed approach to the innovative ideas in a management case study. The research has been conducted in the scope of a joint research project with financial aid of Ministry of Education and Science of Russian Federation RFMEFI57314X0007.
URI: https://www.um.edu.mt/library/oar//handle/123456789/29893
Appears in Collections:European Research Studies Journal, Volume 18, Issue 4

Files in This Item:
File Description SizeFormat 
ERSJ,_18(4)_-_A1.pdf844.05 kBAdobe PDFView/Open


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.