Iterative Search using Query Aspects

Author(s):  
Manmeet Singh ◽  
W. Bruce Croft
Keyword(s):  
Author(s):  
Maria A. Milkova

Nowadays the process of information accumulation is so rapid that the concept of the usual iterative search requires revision. Being in the world of oversaturated information in order to comprehensively cover and analyze the problem under study, it is necessary to make high demands on the search methods. An innovative approach to search should flexibly take into account the large amount of already accumulated knowledge and a priori requirements for results. The results, in turn, should immediately provide a roadmap of the direction being studied with the possibility of as much detail as possible. The approach to search based on topic modeling, the so-called topic search, allows you to take into account all these requirements and thereby streamline the nature of working with information, increase the efficiency of knowledge production, avoid cognitive biases in the perception of information, which is important both on micro and macro level. In order to demonstrate an example of applying topic search, the article considers the task of analyzing an import substitution program based on patent data. The program includes plans for 22 industries and contains more than 1,500 products and technologies for the proposed import substitution. The use of patent search based on topic modeling allows to search immediately by the blocks of a priori information – terms of industrial plans for import substitution and at the output get a selection of relevant documents for each of the industries. This approach allows not only to provide a comprehensive picture of the effectiveness of the program as a whole, but also to visually obtain more detailed information about which groups of products and technologies have been patented.


Engevista ◽  
2014 ◽  
Vol 17 (2) ◽  
pp. 152
Author(s):  
Radael De Souza Parolin ◽  
Pedro Paulo Gomes Watts Rodrigues ◽  
Antônio J. Silva Neto

The quality of a given water body can be assessed through the analysis of a number of indicators. Mathematical and computational models can be built to simulate the behavior of these indicators (observable variables), in such a way that different scenarios can be generated, supporting decisions regarding water resources management. In this study, the transport of a conservative contaminant in an estuarine environment is simulated in order to identify the position and intensity of the contaminant source. For this, it was formulated an inverse problem, which was solved through computational intelligence methods. This approach required adaptations to these methods, which had to be modified to relate the source position to the discrete mesh points of the domain. In this context, two adaptive techniques were developed. In one, the estimated points are projected to the grid points, and in the other, points are randomly selected in the iterative search spaces of the methods. The results showed that the methodology here developed has a strong potential in water bodies’ management and simulation.


Author(s):  
Mark R. Stevens ◽  
J. Ross Beveridge
Keyword(s):  

2021 ◽  
Vol 19 (1) ◽  
pp. 174-193
Author(s):  
D. I. Kochneva ◽  
S. V. Siziy ◽  
Hao Chang

A new approach to organisation of container block trains is considered based on the principles of passenger traffic. The technology assumes container train’s traffic subject to the timetable with sale of cargo space in the train. The train is made up at the departure station and follows the established route with stops at intermediate container terminals or stations, where a container for which this station is designated as destination is removed and a new container is placed on the vacated place to be delivered to subsequent points of the route.The objective of this study is to develop a methodology for optimal placement of containers in a block train intended for en route cargo handling operations. The technique involves an iterative search for such an order of placement of packages so that containers assigned to each intermediate point are as close to each other as possible. The technique is an authors’ algorithm based on combinatorial optimisation methods.The implementation of the proposed algorithm makes it possible to reduce the excessive mileage of handlers and loaders at intermediate points and, consequently, to increase speed of cargo operations when rearranging containers, as well as to reduce operating costs of using the loading facilities of the container terminal.The proposed mathematical algorithm as compared to exhaustive search allows significantly reducing the number of iterations in search for a solution and can be implemented as software.


2010 ◽  
Vol 5 (10) ◽  
pp. 159-166
Author(s):  
Song Cunli ◽  
Liu Xiaobing ◽  
Wang Wei ◽  
Huang Ming

1969 ◽  
Vol 6 (3) ◽  
pp. 355-356 ◽  
Author(s):  
Donald G. Morrison

One parameter of the negative binomial distribution (NBD) model of repeat purchase loyalty is obtained by an iterative search procedure on an implicit equation. This note presents an extremely accurate explicit series approximation for this parameter. When solving for the parameters by hand, one can use some very efficient table to look up procedures. However, when a researcher is solving for many sets of parameter values, our procedure is much easier to program.


1995 ◽  
Vol 118 (1-2) ◽  
pp. 90-101 ◽  
Author(s):  
Jianping Ding ◽  
Masahide Itoh ◽  
Toyohiko Yatagai
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document