Design issues for agent-based resource locator systems

While knowledge is viewed by many as an asset, it is often difficult to locate particularitems within a large electronic corpus. This paper presents an agent based framework for the location of resources to resolve a specific query, and considers the associated design issue. Aspects of the work presented complements current research into both expertise finders and recommender systems. The essential issues for the proposed design are scalability, together ith the ability to learn and adapt to changing resources. As knowledge is often implicit within electronic resources, and therefore difficult to locate, we have proposed the use of ontologies, to extract the semantics and infer meaning to obtain the results required. We explore the use of communities of practice, applying ontology-based networks, and e-mail message exchanges to aid the resource discovery process

CROEQS: Contemporaneous Role Ontology-based Expanded Query Search: implementation and evaluation

Searching annotated items in multimedia databases becomes increasingly important. The traditional approach is to build a search engine based on textual metadata. However, in manually annotated multimedia databases, the conceptual level of what is searched for might differ from the high-levelness of the annotations of the items. To address this problem, we present CROEQS, a semantically enhanced search engine. It allows the user to query the annotated persons not only on their name, but also on their roles at the time the multimedia item was broadcast. We also present the ontology used to expand such queries: it allows us to semantically represent the domain knowledge on people fulfilling a role during a temporal interval in general, and politicians holding a political office specifically. The evaluation results show that query expansion using data retrieved from an ontology considerably filters the result set, although there is a performance penalty

Searching and ranking ontologies on the Semantic Web

The number of ontologies available online is increasing constantly. Tools that are capable of searching, retrieving, and ranking ontologies are becoming crucial to facilitate ontology search and reuse. In this document, we describe OntoSearch, which is a tool for capturing and searching ontologies on the Semantic web. We also briefly describe AKTiveRank which is used to rank OWL ontologies based on certain ontology-structure analysis.

Graph Theoretic Lattice Mining Based on Formal Concept Analysis (FCA) Theory for Text Mining

The growth of the semantic web has fueled the need to search for information based on the understanding of the intent of the searcher, coupled with the contextual meaning of the keywords supplied by the searcher. The common solution to enhance the searching process includes the deployment of formal concept analysis (FCA) theory to extract concepts from a set of text with the use of corresponding domain ontology. However, creating a domain ontology or cross-platform ontology is a tedious and time consuming process that requires validation from domain experts. Therefore, this study proposed an alternative solution called Lattice Mining (LM) that utilizes FCA theory and graph theory. This is because the process of matching a query to related documents is similar to the process of graph matching if both the query and the documents are represented using graphs. This study adopted the idea of FCA in the determination of the concepts based on texts and deployed the lattice diagrams obtained from an FCA tool for further analysis using graph theory. The LM technique employed in this study utilized the adjacency matrices obtained from the lattice outputs and performed a distance measure technique to calculate the similarity between two graphs. The process was realized successively via the implementation of three algorithms called the Relatedness Algorithm (RA), the Adjacency Matrix Algorithm (AMA) and the Concept-Based Lattice Mining (CBLM) Algorithm. A similarity measure between FCA output lattices yielded promising results based on the ranking of the trace values from the matrices. Recognizing the potential of this method, future work includes refinement in the steps of the CBLM algorithm for a more efficient implementation of the process

PRESY: A Context Based Query Reformulation Tool for Information Retrieval on the Web

Problem Statement: The huge number of information on the web as well as the growth of new inexperienced users creates new challenges for information retrieval. It has become increasingly difficult for these users to find relevant documents that satisfy their individual needs. Certainly the current search engines (such as Google, Bing and Yahoo) offer an efficient way to browse the web content. However, the result quality is highly based on uses queries which need to be more precise to find relevant documents. This task still complicated for the majority of inept users who cannot express their needs with significant words in the query. For that reason, we believe that a reformulation of the initial user's query can be a good alternative to improve the information selectivity. This study proposes a novel approach and presents a prototype system called PRESY (Profile-based REformulation SYstem) for information retrieval on the web. Approach: It uses an incremental approach to categorize users by constructing a contextual base. The latter is composed of two types of context (static and dynamic) obtained using the users' profiles. The architecture proposed was implemented using .Net environment to perform queries reformulating tests. Results: The experiments gives at the end of this article show that the precision of the returned content is effectively improved. The tests were performed with the most popular searching engine (i.e. Google, Bind and Yahoo) selected in particular for their high selectivity. Among the given results, we found that query reformulation improve the first three results by 10.7% and 11.7% of the next seven returned elements. So as we can see the reformulation of users' initial queries improves the pertinence of returned content.Comment: 8 page