A parametric network approach for concepts hierarchy generation text corpus

DOI10.1515/AUOM-2016-0022zbMATH Open1389.90063OpenAlexW2759528121WikidataQ114253856 ScholiaQ114253856MaRDI QIDQ5367151FDOQ5367151

Authors: Livia Sângeorzan, Mihaela Marinela Parpalea, Mircea Parpalea 

Publication date: 12 October 2017

Published in: Analele Universitatii "Ovidius" Constanta - Seria Matematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/auom-2016-0022

Recommendations

• scientific article; zbMATH DE number 2243401
• Generation of a hierarchical network of concepts based on an incomplete syntax analysis of a text
• scientific article; zbMATH DE number 1931762
• Parametric flows in static networks
• Maximum flows in parametric dynamic networks with lower bounds

zbMATH Keywords

taxonomybipartite networkparametric maximum flowtext corpusconcepts hierarchypreflow bipush-relabel algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

This page was built for publication: A parametric network approach for concepts hierarchy generation text corpus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5367151)