Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
technique called WebPagePrev through context and content keywords. Underlying techniques for context and content memories’ acquisition, storage, decay, and utilization for page re-finding are discussed. A relevance feedback mechanism is also involved to tailor to individual's memory strength and
Search engines are one of the most powerful tools in the Web world today for data retrieval and exploration. Most search engines identify the key word in the sentence or phrase or list of words given by the user and starts mining the Web for the occurrence of keyword in the Web pages. Quite often searching for the key
The existing search engines are always lack of the consideration of personalization and display the same search results for different users despite their differences in interesting and purpose. So through analyzing the dynamic search behavior of users, the paper introduces a new method of using a keyword query graph
This paper proposes a system for finding a userpsilas interests on the Internet. It is based on his browsing behaviors and the contents of his visited pages. The system has two features. One is building userpsilas browsing interests implicitly, multiple keyword vectors, one per interest. The other is that it can
Keyword based search scheme imposes the problem of representing a lot of web pages in the search engines. Query expansion with relevant words increases the performance of search engines, but finding and using the relevant words is an open problem. In this research we describe a new model for query expansion which
keywords that are usually used to describe that topic or category. Additional keywords that the user frequently associates with a topic, such as names of important people, organizations, or a specialized terminology, etc. Are also incorporated into the relevant topic. We use the Apriori Algorithm to extract these associated
-independent approach of extracting news stories from web pages is proposed which is based on anchor text and is applicable to most websites. Experiments show our approach performs good and is better than another approach we have found. Second, a domain-based method of representing events is proposed in which hundreds of keywords
Previous studies reveal that half of the queries submitted to search engines have no follow-up click-through data. This may indicate that users are either dissatisfied with the performance of current search engines or have difficulty formulating correct query keywords related to their search intents. To address this
of keywords and the extended vector. Experiments show that the method can model hierarchical user interests with a promising result. When a new interest emerges, it does not need any adjustment like collecting new training data or rebuilding the classifier. It can capture the diversified user interests and map to an
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.