The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The World Wide Web has immense resources for all kind of people for their specific needs. Searching on the Web using search engines such as Google, Bing, Ask have become an extremely common way of locating information. Searches are factorized by using either term or keyword sequentially or through short sentences. The
An individual's problem space has been identified as important in problem solving. A problem space is a person's inner representation of the task after extracting critical components in the external problem task. This paper proposes a study to probe whether there are different problem spaces for efficient and inefficient Web information searchers. The questions will be answered quantitatively using...
Processing short texts is becoming a trend in information retrieval. Since the text has rarely external information, it is more challenging than document. In this paper, keyword clustering is studied for automatic categorization. To obtain semantic similarity of the keywords, a broad-coverage lexical resource WordNet
The search engine, keyword extraction is an important technique. In this paper, aiming at the defects of the traditional keyword extraction algorithm, we proposed an improved weight computation strategy. The experimental results show that, the improved method's results are significantly better results than the
Keyword auctions were widely used by search engines to sell the advertisement on the result pages. To date, the most widely used auction mechanism is wGSP (weighted and generalized second-price). This paper presents an optimal pricing strategy under wGSP for advertiser to bid keywords for their websites. In brief, the
This paper investigates the semantic search performance of search engines. Initially, three keyword-based search engines (Google, Yahoo and Msn) and a semantic search engine (Hakia) were selected. Then, ten queries, from various topics, and four phrases, having different syntax but similar meanings, were determined
Semantic and keyword web based technique is becoming a generic issue in an application of Information Retrieval (IR). Most of the researchers used different web techniques for finding relevant information and find the keyword based search, which are not able to fetch the relevant search result because they do not know
quality of information retrieval. The contributions of our research are twofold. First, the existing ranking algorithms of search engine are classified. And we extend expression of queries by “keyword and ”, instead of keywords only. Second, a new ranking algorithm based on user feedback and semantic tags is
In most cases, users are unable to precisely translate their information needs into a query format for the search system to process. Users often submit queries containing terms or keywords that do not match with their intended information. That is why user normally reformulates queries several times to gain more
This paper presents an attempt to show the efficiency of some search engines in dealing with Arabic keywords. This can be achieved by comparing the number of retrieved pages, retrieving time, and stability (in both the number of retrieved pages and the order for each retrieved page) for each one of the selected 20
With the rapid rise in the number of weblogs, or blogs, on the World Wide Web (WWW), there is a growing need to be able to quickly search for discussion on specific topics. While keyword searches using tools such as Google or Technorati can yield useful results, we run into the problem of having to enter
Currently keyword search is a prominent data retrieval method for the Web because the simple and efficient nature of the keyword processing allows it to process a large amount of information with fast response. However, keyword search approaches do not formally capture the clear meaning of a keyword query and fail to
Sponsored Search allows companies to place text advertisements for selected keywords on Search Engine Results Pages (SERPs). The objective of the present research is to determine whether and under what circumstances it makes sense, in economic terms, for brand owners to pay for sponsored search ads for their brand
-specific keywords. An automated profiling algorithm is proposed for this purpose, which starts from generic/noisy reviewer profiles extracted using Google Scholar and derives custom conference-centric reviewer and paper profiles. Each reviewer is expert on few sub-topics, whereas the pool of reviewers and the conference may
With the increasing number of Web documents in the Internet, the most popular keyword-matching-based search engines, such as Google, often return a long list of search results ranked based on their relevance and importance to the query. To cluster the search engine results can help users find the results in several
focused web crawler under the EU FP7 Security Research Project CAPER (Collaborative information, Acquisition, Processing, Exploitation and Reporting for the prevention of organized crime). The crawler allows 1. to look for documents starting from a URL until a parametric depth of levels - also specifying a keyword that has
We have become able to get enough approvable images of a target object just by submitting its object-name to a conventional keyword-based Web image search engine. However, because the search results rarely include its uncommon images, we can often get only its common images and cannot easily get exhaustive knowledge
Keyword-based search engines often return an unexpected number of results. Zero hits are naturally undesirable, while too many hits are likely to be overwhelming and of low precision. We present an approach for predicting the number of hits for a given set of query terms. Using word frequencies derived from a large
from the top-ranked documents in initial retrieval results. The other is the relevance weight between each query term and its relevant terms extracted from the snapshot of Google search result when that query term is used as search keyword. The estimated relevance weights are used to select good expansion terms for second
The problem of information overload has become more pressing with the emergence of the increasingly more popular Internet services. The main information retrieval mechanisms provided by the prevailing Internet Web software are based on either keyword search (e.g., Google and Yahoo) or hypertext browsing (e.g.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.