Search

In this paper a model for polyrepresenting weighted boolean queries based on reformulation is presented. This model tries to generate a set of boolean queries for completing the meaning of the original query instead of modifying the query adding, changing or removing terms as techniques such as query expansion propose. This model is specially designed for those systems which do not support very large queries such as the Web search engines. The input of the model are boolean queries which have been weighted by the user in order to express some semantics that the set of polyrepresented queries have to satisfy. The user is able to fix a threshold for limiting the minimum resemblance of the polyrepresented queries and the original one. From the original query, using a reformulation strategy which guarantees that length of the new queries is not enlarged excessively, the proposed model generates a set of candidate queries/concepts for representing the original one. That set is reduced by a bottom-up process based on the semantics established by the user in order to choose the best queries for representing the original one. [ABSTRACT FROM AUTHOR]

In this work, T-DiCoR is presented (Three Dimensional Conceptual Representation) as a tool for representing the fuzzy relations among the most representative concepts of a domain. Using this tool in a Metasearcher, the user may observe what other concepts are related to the searched concept, and what the connection forces are (fuzzy relations between concepts). This knowledge can be useful for making new queries with words conceptually related in a specific domain with the original ones. [ABSTRACT FROM AUTHOR]

Due to the exponential growth of Internet it is very important to have good knowledge structures that let to obtain good results in Web search. The aim of this work is to discover the user tendencies when they use the search engines and to know the limitations of the knowledge structures that GUMSeGUMSe: Gum Search, meta search engine Developer in the framework of SMILe-ORETO-UCLM (Soft Management of Internet e-Laboratory) research group. uses. With this information is possible to design a more efficient system. For this reason, it is analyzed the set of keywords and queries more frequently used in the search engines and how WordNet manage it. This information is very useful to avoid bad situations in our meta-search engine. [ABSTRACT FROM AUTHOR]