Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

The construction complexity of orgraphs: Some mathematical models and their applications 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automatic Documentation and Mathematical Linguistics Springer Journals

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

Loading next page...
 
/lp/springer-journals/the-construction-complexity-of-orgraphs-some-mathematical-models-and-hlWXPn8N3o

References (6)

Publisher
Springer Journals
Copyright
Copyright © 2013 by Allerton Press, Inc.
Subject
Computer Science; Information Storage and Retrieval
ISSN
0005-1055
eISSN
1934-8371
DOI
10.3103/S000510551301007X
Publisher site
See Article on Publisher Site

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.

Journal

Automatic Documentation and Mathematical LinguisticsSpringer Journals

Published: Mar 21, 2013

There are no references for this article.