The Construction Complexity of Orgraphs: Some Mathematical Models and their Applications

被引:0
|
作者
Starichkova, Yu. V. [1 ]
机构
[1] Natl Res Univ, Higher Sch Econ, Dept Anal Data & Artificial Intelligence, Moscow, Russia
关键词
orgraph; construction complexity; software tools; similarity; text processing;
D O I
10.3103/S000510551301007X
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper is devoted to some mathematical models of the complexity of orgraph construction in effectively processed databases. It shows the significance of the algorithms and software tools that have been developed by the author for the effective analysis of the complexity of orgraphs using information on the location of directed linked fragments. These tools are used for knowledge discovery from text collections.
引用
收藏
页码:19 / 26
页数:8
相关论文
共 50 条