Orbit Weighting Scheme in the Context of Vector Space Information Retrieval

This study introduces the Orbit Weighting Scheme(OWS),a novel approach aimed at enhancing the precision and efficiency of Vector Space information retrieval(IR)models,which have traditionally relied on weighting schemes like tf-idf and BM25.These conventional methods often struggle with accurately capturing document relevance,leading to inefficiencies in both retrieval performance and index size management.OWS proposes a dynamic weighting mechanism that evaluates the significance of terms based on their orbital position within the vector space,emphasizing term relationships and distribution patterns overlooked by existing models.Our research focuses on evaluating OWS’s impact on model accuracy using Information Retrieval metrics like Recall,Precision,InterpolatedAverage Precision(IAP),andMeanAverage Precision(MAP).Additionally,we assessOWS’s effectiveness in reducing the inverted index size,crucial for model efficiency.We compare OWS-based retrieval models against others using different schemes,including tf-idf variations and BM25Delta.Results reveal OWS’s superiority,achieving a 54%Recall and 81%MAP,and a notable 38%reduction in the inverted index size.This highlights OWS’s potential in optimizing retrieval processes and underscores the need for further research in this underrepresented area to fully leverage OWS’s capabilities in information retrieval methodologies.

Database Search Behaviors: Insight from a Survey of Information Retrieval Practices

This study examines the database search behaviors of individuals, focusing on gender differences and the impact of planning habits on information retrieval. Data were collected from a survey of 198 respondents, categorized by their discipline, schooling background, internet usage, and information retrieval preferences. Key findings indicate that females are more likely to plan their searches in advance and prefer structured methods of information retrieval, such as using library portals and leading university websites. Males, however, tend to use web search engines and self-archiving methods more frequently. This analysis provides valuable insights for educational institutions and libraries to optimize their resources and services based on user behavior patterns.

Similarity matching method of power distribution system operating data based on neural information retrieval

Operation control of power systems has become challenging with an increase in the scale and complexity of power distribution systems and extensive access to renewable energy.Therefore,improvement of the ability of data-driven operation management,intelligent analysis,and mining is urgently required.To investigate and explore similar regularities of the historical operating section of the power distribution system and assist the power grid in obtaining high-value historical operation,maintenance experience,and knowledge by rule and line,a neural information retrieval model with an attention mechanism is proposed based on graph data computing technology.Based on the processing flow of the operating data of the power distribution system,a technical framework of neural information retrieval is established.Combined with the natural graph characteristics of the power distribution system,a unified graph data structure and a data fusion method of data access,data complement,and multi-source data are constructed.Further,a graph node feature-embedding representation learning algorithm and a neural information retrieval algorithm model are constructed.The neural information retrieval algorithm model is trained and tested using the generated graph node feature representation vector set.The model is verified on the operating section of the power distribution system of a provincial grid area.The results show that the proposed method demonstrates high accuracy in the similarity matching of historical operation characteristics and effectively supports intelligent fault diagnosis and elimination in power distribution systems.

The Preliminary Design and Implement of Plant Digital Information Retrieval System

[Objective] The aim was to set up a plant digital information retrieval system.[Method] Plant digital information retrieval system was designed by combining with Microsoft Visual Basic 6.0 Enterprise Edition database management system and Structure Query Language.[Result] The system realized electronic management and retrieval of local plant information.The key words of retrieval included family,genus,formal name,Chinese name,Latin,morphological characteristics,habitat,collection people,collection places,and protect class and so on.[Conclusion] It provided reference for these problems of species identification and digital management of herbarium.

Query Expansion for Chinese Information Retrieval by Using a Decaying Co-occurrence Model

Query expansion with thesaurus is one of the useful techniques in modern information retrieval (IR). In this paper, a method of query expansion for Chinese IR by using a decaying co-occurrence model is proposed and realized. The model is an extension of the traditional co-occurrence model by adding a decaying factor that decreases the mutual information when the distance between the terms increases. Experimental results on TREC-9 collections show this query expansion method results in significant improvements over the IR without query expansion.

Concept-based approach for information retrieval

A concept-based approach is expected to resolve the word sense ambiguities in information retrieval and apply the semantic importance of the concepts, instead of the term frequency, to representing the contents of a document. Consequently, a formalized document framework is proposed. The document framework is used to express the meaning of a document with the concepts which are expressed by high semantic importance. The framework consists of two parts： the ＂domain＂ information and the ＂situation ＆ background＂ information of a document. A document-extracting algorithm and a two-stage smoothing method are also proposed. The quantification of the similarity between the query and the document framework depends on the smoothing method. The experiments on the TREC6 collection demonstrate the feasibility and effectiveness of the proposed approach in information retrieval tasks. The average recall level precision of the model using the proposed approach is about 10% higher than that of traditional ones.

Agriculture Information Retrieval System Based on Comprehensive Information Theory

Through analyzing syntactic,semantic,pragmatic information,the retrieval system ACIS based on comprehensive information was established,which could achieve personalized information exaction to guide user s information retrieval.

A Multi-Tuple Rough Set Approach for Information Retrieval

How to deal with the imprecise information retrieval has become more and more important in the present information society. An efficient and effective method of information retrieval based on multi tuple rough set is discussed in this paper. The new approach is considered as a generalization of the original rough set model for flexible information retrieval. The imprecise query results can be obtained by multi tuple approximations.

Web Information Retrieval的分析与展望

网络的飞速发展使得网络信息检索成为人们迫切的需求。本文对网络信息检索技术进行了介绍、分析和比较,在此基础上,对未来的应用前景进行了展望。

An Ontology-Based Information Retrieval Model for Vegetables E-Commerce

With the rapid increment of the information on the web, traditional information retrieval based on the keywords is far from user＇s satisfaction in recall and precision. In order to improve the recall ratio and the precision radio of IR engine in the vegetables e-commerce, an information retrieval model based on the vegetables e-commerce ontology is presented in this paper, vegetables e-commerce ontology was constructed by gathering and the analyzing vegetables e-commerce domain information on the web. The vegetables e-commerce ontology is composed of some kinds of vegetable classes and hierarchy relationship of vegetables classes. In the process of information retrieval, domain ontology helps to index information and information inference. An ontology-based information retrieval model is implemented, and which has more functions than the keyword-based web information retrieval engines. The experiment results show that the recall ratio and the precision ratio of ontology-based information retrieval model are higher than that of the information retrieval engine based on keyword at a certain extent.

Research and Application on Web Information Retrieval Based on Improved FP-Growth Algorithm

A kind of single linked lists named aggregative chain is introduced to the algorithm, thus improving the architecture of FP tree. The new FP tree is a one-way tree and only the pointers that point its parent at each node are kept. Route information of different nodes in a same item are compressed into aggregative chains so that the frequent patterns will be produced in aggregative chains without generating node links and conditional pattern bases. An example of Web key words retrieval is given to analyze and verify the frequent pattern algorithm in this paper.

Hybrid Chinese Information Retrieval Model Based on the Combination of Keyword and Concept

A hybrid model that is based on the Combination of keywords and concept was put forward. The hybrid model is built on vector space model and probabilistic reasoning network. It not only can exert the advantages of keywords retrieval and concept retrieval but also can compensate for their shortcomings. Their parameters can be adjusted according to different usage in order to accept the best information retrieval result, and it has been proved by our experiments.

Intelligent Agent-Based System for Digital Library Information Retrieval

A new information search model is reported and the design and implementation of a system based on intelligent agent is presented. The system is an assistant information retrieval system which helps users to search what they need. The system consists of four main components: interface agent, information retrieval agent, broker agent and learning agent. They collaborate to implement system functions. The agents apply learning mechanisms based on an improved ID3 algorithm.

A new method for information retrieval in two-dimensional grating-based X-ray phase contrast imaging

Grating-based X-ray phase contrast imaging has been demonstrated to he an extremely powerful phase-sensitive imaging technique. By using two-dimensional （2D） gratings, the observable contrast is extended to two refraction directions. Recently, we have developed a novel reverse-projection （RP） method, which is capable of retrieving the object information efficiently with one-dimensional （1D） grating-based phase contrast imaging. In this contribution, we present its extension to the 2D grating-based X-ray phase contrast imaging, named the two-dimensional reverse- projection （2D-RP） method, for information retrieval. The method takes into account the nonlinear contributions of two refraction directions and allows the retrieval of the absorption, the horizontal and the vertical refraction images. The obtained information can be used for the reconstruction of the three-dimensionak phase gradient field, and for an improved phase map retrieval and reconstruction. Numerical experiments are carried out, and the results confirm the validity of the 2D-RP method.

Optimization in the Migration Problem of Mobile Agents in Distributed Information Retrieval Systems

In this paper, we employ genetic algorithms to solve the migration problem (MP). We propose a new encoding scheme to represent trees, which is composed of two parts: the pre-ordered traversal sequence of tree vertices and the children number sequence of corresponding tree vertices. The proposed encoding scheme has the advantages of simplicity for encoding and decoding, ease for GA operations, and better equilibrium between exploration and exploitation. It is also adaptive in that, with few restrictions on the length of code, it can be freely lengthened or shortened according to the characteristics of the problem space. Furthermore, the encoding scheme is highly applicable to the degree-constrained minimum spanning tree problem because it also contains the degree information of each node. The simulation results demonstrate the higher performance of our algorithm, with fast convergence to the optima or sub-optima on various problem sizes. Comparing with the binary string encoding of vertices, when the problem size is large, our algorithm runs remarkably faster with comparable search capability. Key words distributed information retrieval - mobile agents - migration problem - genetic algorithms CLC number TP 301. 6 Foundation item: Supported by the National Natural Science Foundation of China (90104005), the Natural Science Foundation of Hubei Province and the Hong Kong Polytechnic University under the grant G-YD63Biography: He Yan-xiang (1952-), male, Professor, research direction: distributed and parallel processing, multi-agent systems, data mining and e-business.

ORDINAL REGRESSION FOR INFORMATION RETRIEVAL

This letter presents a new discriminative model for Information Retrieval (IR), referred to as Ordinal Regression Model (ORM). ORM is different from most existing models in that it views IR as ordinal regression problem (i.e. ranking problem) instead of binary classification. It is noted that the task of IR is to rank documents according to the user information needed, so IR can be viewed as ordinal regression problem. Two parameter learning algorithms for ORM are presented. One is a perceptron-based algorithm. The other is the ranking Support Vector Machine (SVM). The effec- tiveness of the proposed approach has been evaluated on the task of ad hoc retrieval using three English Text REtrieval Conference (TREC) sets and two Chinese TREC sets. Results show that ORM sig- nificantly outperforms the state-of-the-art language model approaches and OKAPI system in all test sets; and it is more appropriate to view IR as ordinal regression other than binary classification.

INFORMATION RETRIEVAL FOR SHORT DOCUMENTS

The major problem of the most current approaches of information models lies in that individual words provide unreliable evidence about the content of the texts. When the document is short, e.g. only the abstract is available, the word-use variability problem will have substantial impact on the Information Retrieval （IR） performance. To solve the problem, a new technology to short document retrieval named Reference Document Model （RDM） is put forward in this letter. RDM gets the statistical semantic of the query/document by pseudo feedback both for the query and document from reference documents. The contributions of this model are three-fold： （1） Pseudo feedback both for the query and the document; （2） Building the query model and the document model from reference documents; （3） Flexible indexing units, which can be ally linguistic elements such as documents, paragraphs, sentences, n-grams, term or character. For short document retrieval, RDM achieves significant improvements over the classical probabilistic models on the task of ad hoc retrieval on Text REtrieval Conference （TREC） test sets. Results also show that the shorter the document, the better the RDM performance.

A new approach to query expansion in information retrieval

To eliminate the mismatch between words of relevant documents and user's query and more seriousnegative effects it has on the performance of information retrieval,a method of query expansion on the ba-sis of new terms co-occurrence representation was put forward by analyzing the process of producingquery.The expansion terms were selected according to their correlation to the whole query.At the sametime,the position information between terms were considered.The experimental result on test retrievalconference(TREC)data collection shows that the method proposed in the paper has made an improve-ment of 5%～19% all the time than the language modeling method without expansion.Compared to thepopular approach of query expansion,pseudo feedback,the precision of the proposed method is competi-tive.

Ontology Based Ocean Knowledge Representation for Semantic Information Retrieval

The drastic growth of coastal observation sensors results in copious data that provide weather information.The intricacies in sensor-generated big data are heterogeneity and interpretation,driving high-end Information Retrieval(IR)systems.The Semantic Web(SW)can solve this issue by integrating data into a single platform for information exchange and knowledge retrieval.This paper focuses on exploiting the SWbase systemto provide interoperability through ontologies by combining the data concepts with ontology classes.This paper presents a 4-phase weather data model:data processing,ontology creation,SW processing,and query engine.The developed Oceanographic Weather Ontology helps to enhance data analysis,discovery,IR,and decision making.In addition to that,it also evaluates the developed ontology with other state-of-the-art ontologies.The proposed ontology’s quality has improved by 39.28%in terms of completeness,and structural complexity has decreased by 45.29%,11%and 37.7%in Precision and Accuracy.Indian Meteorological Satellite INSAT-3D’s ocean data is a typical example of testing the proposed model.The experimental result shows the effectiveness of the proposed data model and its advantages in machine understanding and IR.

Measurement of Incompatible Probability in Information Retrieval:A Case Study with User Clicks

The incompatible probability represents an important non-classical phenomenon, and it describes conflicting observed marginal probabilities, which cannot be satisfied with a joint probability. First, the incompatibility of random variables was defined and discussed via the non-positive semi-definiteness of their covariance matrixes. Then, a method was proposed to verify the existence of incompatible probability for variables. A hypothesis testing was also applied to reexamine the likelihood of the observed marginal probabilities being integrated into a joint probability space, thus showing the statistical significance of incompatible probability cases. A case study with user click-through data provided the initial evidence of the incompatible probability in information retrieval (IR), particularly in user interaction. The experiments indicate that both incompatible and compatible cases can be found in IR data, and informational queries are more likely to be compatible than navigational queries. The results inspire new theoretical perspectives of modeling the complex interactions and phenomena in IR.