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 Web 2.0 era is characterized by the emergence of a very large amount of live content. A real time and fine grained content filtering approach can precisely keep users up-to-date the information that they are interested. The key of the approach is to offer a scalable match algorithm. One might treat the content match as a special kind of content search, and resort to the classic algorithm [5]....
) preferences of the user with respect to a set of keywords. These preferences may then be used to rank the daily news, so that the user is recommended those items that match better with his/her interests. The cyclic preference learning methodology described in this paper is illustrated with a case example based on real news from
In this paper we propose a novel and efficient technique for finding keywords typed by the user in digitised machine-printed historical documents using the dynamic time warping (DTW) algorithm. The method uses word portions located at the beginning and end of each segmented word of the processed documents and try to
direction-aware spatial keyword search method which inherently supports direction-aware search. We devise novel direction-aware indexing structures to prune unnecessary directions. We develop effective pruning techniques and search algorithms to efficiently answer a direction-aware query. As users may dynamically change their
A document surrogate is usually represented in a list of words. Because not all words in a document reflect its content, it is necessary to select important words from the document that relate to its content. Such important words are called keywords and are selected with a particular equation based on Term Frequency
Consider an information repository whose content is categorized. A data item (in the repository) can belong to multiple categories and new data is continuously added to the system. In this paper, we describe a system, CS*, which takes a keyword query and returns the relevant top-K categories. In contrast, traditional
Result integrating is a key component for keyword querying across heterogeneous databases. Once the results from various search engines are collected, the search engine merges them into a single ranked list. In this paper, firstly, we present a novel model of searching, which the database is an undirected graph and
To reduce the human effort in labeling the training set for document classification, some learning algorithms ask users to give the representative keywords for each class rather than any labeled documents. The key challenge in such \emph {keyword-labeled classification} is how to learn the high quality classifier with
Web users and content are increasingly being geo-positioned. This development gives prominence to spatial keyword queries, which involve both the locations and textual descriptions of content. We study the efficient processing of continuously moving top-k spatial keyword (MkSK) queries over spatial keyword data. State
The purpose of this paper is to provide a solution of extracting appropriate keywords to identify meaningful learning-contents on the Web. There are some issues in identifying documents that have learning content. Firstly, the documents need to be identified according to the learning area of a student's school year
Internet is becoming an increasingly important platform for ordinary life and work. It is expected that keyword extraction can help people quickly find hot spots on the web, since keywords in a document provide important information about the content of the document. In this paper, we propose to use text clustering
Keywords can be considered as condensed versions of documents, which can play important role in some text processing tasks such as text indexing, summarization and categorization. However, there are many digital documents especially on the Internet that do not have a list of assigned keywords. Assigning keywords to
The boom of the spatial web has enabled spatial keyword queries that take a user location and multiple search keywords as arguments and return the objects that are spatially and textually relevant to these arguments. Recently, utilizing social data to improve search results, normally by giving a higher rank to the
Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far more expensive to answer a keyword query over probabilistic XML data due to the consideration of possible world semantics. In this paper, we
The relevance feedback techniques have been studied in the field of document retrieval, aiming to generate appropriate queries for userspsila information needs. Conventional relevance feedback techniques are performed on document space, while the resultant queries should be represented in keyword space. In this paper
The relevance feedback techniques have been studied in the field of document retrieval, aiming to generate appropriate queries for userspsila information needs.Conventional relevance feedback techniques are performed on document space, while the resultant queries should be represented in keyword space. In this paper
Numerous geographic information system applications need to retrieve spatial objects which bear user specified keywords close to a given location. In this research, we present efficient approaches to answer spatial keyword queries on spatial networks. In particular, we formally introduce definitions of Spatial Keyword
structure of keywords. First, this paper proposes the extraction method of important keywords in their opinions based on the modification relationships. Next, it clusters the respondents interactively on visible space using MDS. Finally, it shows their opinions using HK Graph which can visualize the relationship among words
This paper presents a method for generating indexable and browsable keyword metadata from ASR transcripts by leveraging theWeb. Search engine queries are built from an ASR transcript and used to retrieve similar text from the Web. The keyword meta information embedded in those pages for search engines is then ranked
Peer-to-peer approaches bring one perfect alternative for the Web content search. However, how to search and retrieve the data based on the content query is still an open problem for peer-to-peer systems. In this paper we propose History-based Multi-keywords Search(HMS) in unstructured peer-to-peer systems, which only
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.