An Improved "Fish-search" Algorithm for Information Retrieval

2006 ◽  
Author(s):  
Fang-fang Luo ◽  
Guo-long Chen ◽  
Wen-zhong Guo
Keyword(s):  
Information Retrieval ◽  
Search Algorithm

Practical k-agents search algorithm towards information retrieval in complex networks

2018 ◽  
Vol 22 (2) ◽  
pp. 885-905
Author(s):  
Pengfei Liu ◽  
Minyu Feng ◽  
Ming Liu
Keyword(s):  
Information Retrieval ◽  
Complex Networks ◽  
Search Algorithm

Research on Multivariate Stream Line Inter-Relevant Successive Trees

2013 ◽  
Vol 846-847 ◽  
pp. 1011-1018
Author(s):  
Lin Huo ◽  
Liang Qing Hu ◽  
Yi Lin Jiang
Keyword(s):  
Information Retrieval ◽  
Search Algorithm ◽  
Sliding Window ◽  
Experimental Results ◽  
Stream Line ◽  
Retrieval Algorithm ◽  
Text Search

The effect of the Stream line Inter-relevant Successive Trees (SIRST) is great in the field of text search. In this paper, the binary SIRST will be extended to a ternary one. Whats more, we propose the method of calculating the K of K-ary SIRST. Finally, a sliding window retrieval algorithm is proposed. Experimental results show that the K-ary SIRST is more efficient than the binary one in the mass of information retrieval, and sliding window search algorithm is more efficient than the normal one.

scholarly journals Sense-Based Arabic Information Retrieval Using Harmony Search Algorithm

2017 ◽  
Vol 43 (2) ◽  
pp. 13-22
Author(s):  
Alia Abdul Hassan ◽  
Mustafa Hadi
Keyword(s):  
Information Retrieval ◽  
Search Algorithm ◽  
Word Sense Disambiguation ◽  
Harmony Search ◽  
Arabic Language ◽  
Harmony Search Algorithm ◽  
Word Sense ◽  
System Efficiency ◽  
Traditional System ◽  
The One

Information Retrieval (IR) is a field of computer science that deals with storing, searching, and retrievingdocuments that satisfy the user need. The modern standard Arabic language is rich in multiple meanings (senses) for manywords and this is substantially due to lack of diacritical marks. The task for finding appropriate meanings is a key demand inmost of the Arabic IR applications. Actually, the successful system should not be interested only in the retrieval quality andoblivious to the system efficiency. Thus, this paper contributes to improve the system effectiveness by finding appropriatestemming methodology, word sense disambiguation, and query expansion for addressing the retrieval quality of AIR. Also, itcontributes to improve the system efficiency through using a powerful metaheuristic search called Harmony Search (HS)algorithm inspired from the musical improvisation processes. The performance of the proposed system outperforms the one inthe traditional system in a rate of 19.5% while reduces the latency in an approximate rate of 0.077 second for each query.

Paths in a random digital tree: limiting distributions

1986 ◽  
Vol 18 (01) ◽  
pp. 139-155 ◽  
Author(s):  
Boris Pittel
Keyword(s):  
Information Retrieval ◽  
Retrieval System ◽  
Search Algorithm ◽  
Information Retrieval System ◽  
Typical Case ◽  
Asymptotically Normal ◽  
Type Process ◽  
Longest Path ◽  
Pass Through ◽  
Type Information

We study a rule of growing a sequence {tn } of finite subtrees of an infinite m-ary tree T. Independent copies {ω (n)} of a Bernoulli-type process ω on m letters are used to trace out a sequence of paths in T. The tree tn is obtained by cutting each , at the first node such that at most σ paths out of , pass through it. Denote by Hn the length of the longest path, hn the length of the shortest path, and Ln the length of the randomly chosen path in tn. It is shown that, in probability, Hn – loga n = O(1), hn – log b (n/log n) = 0(1), (or hn – log b (n/log log n) = O(1)), and that is asymptotically normal. The parameters a, b, c depend on the distribution of ω and, in case of a, also on σ. These estimates describe respectively the worst, the best and the typical case behavior of a ‘trie’ search algorithm for a dictionary-type information retrieval system, with σ being the capacity of a page.

Paths in a random digital tree: limiting distributions

1986 ◽  
Vol 18 (1) ◽  
pp. 139-155 ◽  
Author(s):  
Boris Pittel
Keyword(s):  
Information Retrieval ◽  
Retrieval System ◽  
Search Algorithm ◽  
Information Retrieval System ◽  
Typical Case ◽  
Asymptotically Normal ◽  
Type Process ◽  
Longest Path ◽  
Pass Through ◽  
Type Information

We study a rule of growing a sequence {tn} of finite subtrees of an infinite m-ary tree T. Independent copies {ω (n)} of a Bernoulli-type process ω on m letters are used to trace out a sequence of paths in T. The tree tn is obtained by cutting each , at the first node such that at most σ paths out of , pass through it. Denote by Hn the length of the longest path, hn the length of the shortest path, and Ln the length of the randomly chosen path in tn. It is shown that, in probability, Hn – logan = O(1), hn – logb (n/log n) = 0(1), (or hn – logb (n/log log n) = O(1)), and that is asymptotically normal. The parameters a, b, c depend on the distribution of ω and, in case of a, also on σ. These estimates describe respectively the worst, the best and the typical case behavior of a ‘trie’ search algorithm for a dictionary-type information retrieval system, with σ being the capacity of a page.

Development of a Keyword Search Algorithm for Bioinspired Design of Foldable Engineering Applications

2017 ◽  
Author(s):  
Elissa Morris ◽  
Daniel A. McAdams
Keyword(s):  
Information Retrieval ◽  
Literature Review ◽  
Keyword Search ◽  
Search Algorithm ◽  
Research Effort ◽  
Engineering Applications ◽  
Biological Design ◽  
Engineering Problems ◽  
Future Work ◽  
Design Inspiration

The abstraction of biological folding mechanisms can lead to the development of novel foldable solutions for engineering problems. Examples of biological structures that are analogous to foldable engineering solutions are discussed and serve as inspiration for this research effort. Numerous folding mechanisms exist in nature and have not been considered for engineering solutions simply because they are not well-known or studied by designers. These folding mechanisms may provide useful design inspiration for novel engineering applications. To retrieve meaningful biological design analogies, information retrieval techniques are employed and a text-based search algorithm is developed to return useful passages where folding mechanisms in nature are observed. The search algorithm integrates tailored keywords and filtering methods to retrieve passages from an extensive biological corpus. Keywords are established using literature review and WordNet. The search algorithm is validated using an inter-rater reliability analysis and statistical methods for information retrieval. Passages describing biological systems are evaluated and potential engineering applications are discussed to demonstrate the functionality of the search algorithm. Methods for improvement and areas for future work are discussed.

Demonstration of the Use of Tape-Recorded Information from a High Vacuum Electron Microscope

1969 ◽  
Vol 27 ◽  
pp. 218-219
Author(s):  
Richard E. Hartman ◽  
Roberta S. Hartman ◽  
Peter L. Ramos
Keyword(s):  
Information Retrieval ◽  
Electron Microscope ◽  
Magnetic Tape ◽  
High Vacuum ◽  
Data Retrieval ◽  
Electronic Information ◽  
Electronic Data ◽  
Subsequent Processing ◽  
Continuous Record

We have long felt that some form of electronic information retrieval would be more desirable than conventional photographic methods in a high vacuum electron microscope for various reasons. The most obvious of these is the fact that with electronic data retrieval the major source of gas load is removed from the instrument. An equally important reason is that if any subsequent analysis of the data is to be made, a continuous record on magnetic tape gives a much larger quantity of data and gives it in a form far more satisfactory for subsequent processing.

Sign in / Sign up

Export Citation Format

Share Document