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

Learn More →

Comparison of approximated paths in search of similarities for the JSM method

Comparison of approximated paths in search of similarities for the JSM method This paper reports on possible solutions to problems arising in work with the JSM method of automated hypothesis generation with large arrays of data. To diminish the power of the set of JSM hypotheses, an algorithm that uses the evolutionary model is suggested. Comparison is made between various approaches to optimization tasks and conditions for their application. The results from testing the algorithms on real data are presented. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Automatic Documentation and Mathematical Linguistics Springer Journals

Comparison of approximated paths in search of similarities for the JSM method

Loading next page...
 
/lp/springer-journals/comparison-of-approximated-paths-in-search-of-similarities-for-the-jsm-QCA0wpqW1J
Publisher
Springer Journals
Copyright
Copyright © 2010 by Allerton Press, Inc.
Subject
Computer Science; Information Storage and Retrieval
ISSN
0005-1055
eISSN
1934-8371
DOI
10.3103/S000510551006004X
Publisher site
See Article on Publisher Site

Abstract

This paper reports on possible solutions to problems arising in work with the JSM method of automated hypothesis generation with large arrays of data. To diminish the power of the set of JSM hypotheses, an algorithm that uses the evolutionary model is suggested. Comparison is made between various approaches to optimization tasks and conditions for their application. The results from testing the algorithms on real data are presented.

Journal

Automatic Documentation and Mathematical LinguisticsSpringer Journals

Published: Feb 6, 2011

References