The construction complexity of orgraphs: Some mathematical models and their applications

Authors:
Yu. V. Starichkova
Affiliations:
Department of the Analysis of Data and Artificial Intelligence, Higher School of Economics, National Research University, Moscow, Russia
Venue:
Automatic Documentation and Mathematical Linguistics
Year:
2013

Citing 3
Cited 0

Conceptual Graphs: Draft Proposed American National Standard

ICCS '99 Proceedings of the 7th International Conference on Conceptual Structures: Standards and Practices
Clustering and classification of document structure-a machine learning approach

ICDAR '95 Proceedings of the Third International Conference on Document Analysis and Recognition (Volume 2) - Volume 2
Authorship classification: a discriminative syntactic tree mining approach

Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.