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 integration of the classical Web (of documents) with the emerging Web of Data is a challenging vision. In this paper we focus on an integration approach during searching which aims at enriching the responses of non-semantic search systems (e.g. professional search systems, web search engines) with semantic information, i.e. Linked Open Data (LOD), and exploiting the outcome for providing an overview...
effective in terms of better precision. Proposed method makes use of keyword clusters for query expansion. Visual features are used for detecting duplicate images in proposed method. Removing duplicates leads to further improve in precision and recall in retrieval result
paper, algorithm is defined to improve relevancy of result based on webpage keyword ratio. In result analysis, result of proposed method is compared with deferent algorithms such as PageRank and Topic Distillation with Query Dependent Link Connections and Page Characteristics result.
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...
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects user-defined bounds on the number of returned hits. We assume a real-world setting where the user is not given direct access to a Web search engine's index, i.e., querying is possible only through an interface
Textual web pages dominate web search engines nowadays. However, there is also a striking increase of structured data on the web. Efficient keyword query processing on structured data has attracted enough attention, but effective query understanding has yet to be investigated. In this paper, we focus on the problem of
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
In this paper, we address the issue of how to overview the knowledge of a given query keyword. We especially focus on concerns of those who search for Web pages with a given query keyword, and study how to efficiently overview the whole list of Web search information needs of a given query keyword. First, we collect
Query-recommendation systems based on inputted queries have become widespread. These services are effective if users cannot input relevant queries. However, the conventional systems do not take into consideration the relevance between recommended queries. This paper proposes a method of obtaining related queries and clustering them by using the history of query frequencies in query logs. We define...
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
Portable personalization service has been proved very useful in the sharing and reusing of user personalized profiles among different platforms. We present an approach of a Web requesting framework for portable personalization service based on iterative profiling algorithm with time unit of weighted keywords and give
database, cannot be applied to Web search. We propose a new method to support Web query refinement. Our methods is based on local analysis which clustering the search result. Unlike other clustering-base approaches, we take into consideration the distance between keywords, and guarantee no information loss. A Web search
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
In this paper, we address the issue of how to overview the knowledge ofa given query keyword. We especially focus on concerns of those whosearch for Web pages with a given query keyword, and study how toefficiently overview the whole list of Web search information needs of agiven query keyword. First, we collect Web
-processing of Web search results have been extensively studied to help user effectively obtain useful information. This paper has basically three parts. First part is the review study on how the keyword is expanded through truncation or wildcards (which is a little known feature but one of the most powerful one) by using
Traditional Web search engines mostly adopt a keyword-based approach. When the keyword submitted by the user is ambiguous, search result usually consists of documents related to various meanings of the keyword, while the user is probably interested in only one of them. In this paper we attempt to provide a solution to
This paper proposes a novel method to generate labels for grouping and organizing the search results returned by auxiliary search engines. It has applied statistical techniques to measure the quantities of co-occurrence keywords for forming the label matrix of them, and then agglomerated them into higher-level
stylistically from that of keyword search queries. In this paper, we propose a machine translation approach to learn a mapping from natural language utterances to search queries. We train statistical translation models, using task and domain independent semantically equivalent natural language and keyword search query pairs mined
solution helps in reducing the time to write documents by 42% as compared to the traditional methods of writing documents. Sophisticated statistical algorithms along with natural language processing technology are used to continuously determine the keywords and concepts from the content in the document. A web search is
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
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.